| /external/skia/include/core/ |
| D | SkRect.h | 35 int32_t fTop; member
127 int32_t top() const { return fTop; } in top()
155 int32_t y() const { return fTop; } in y()
169 int32_t height() const { return Sk32_can_overflow_sub(fBottom, fTop); } in height()
194 int32_t centerY() const { return SkToS32(((int64_t)fBottom + fTop) >> 1); } in centerY()
210 int64_t height64() const { return (int64_t)fBottom - (int64_t)fTop; } in height64()
218 bool isEmpty64() const { return fRight <= fLeft || fBottom <= fTop; } in isEmpty64()
262 return SkTFitsIn<int16_t>(fLeft) && SkTFitsIn<int16_t>(fTop) && in is16Bit()
285 fTop = top; in set()
313 fTop = y; in setXYWH()
[all …]
|
| /external/skqp/include/core/ |
| D | SkRect.h | 35 int32_t fTop; member
130 int32_t top() const { return fTop; } in top()
158 int32_t y() const { return fTop; } in y()
172 int32_t height() const { return Sk32_can_overflow_sub(fBottom, fTop); } in height()
197 int32_t centerY() const { return SkToS32(((int64_t)fBottom + fTop) >> 1); } in centerY()
200 int64_t height64() const { return (int64_t)fBottom - (int64_t)fTop; } in height64()
206 bool isEmpty64() const { return fRight <= fLeft || fBottom <= fTop; } in isEmpty64()
249 return SkTFitsIn<int16_t>(fLeft) && SkTFitsIn<int16_t>(fTop) && in is16Bit()
272 fTop = top; in set()
300 fTop = y; in setXYWH()
[all …]
|
| /external/skia/src/gpu/ |
| D | GrRect.h | 15 int16_t fLeft, fTop, fRight, fBottom; member
36 int height() const { return fBottom - fTop; } in height()
38 bool isEmpty() const { return fLeft >= fRight || fTop >= fBottom; } in isEmpty()
44 fTop = top; in set()
51 fTop = SkToS16(r.fTop); in set()
61 SkASSERT(!a.isFinite() || (a.fLeft <= a.fRight && a.fTop <= a.fBottom)); in GrRectsOverlap()
62 SkASSERT(!b.isFinite() || (b.fLeft <= b.fRight && b.fTop <= b.fBottom)); in GrRectsOverlap()
63 return a.fRight > b.fLeft && a.fBottom > b.fTop && b.fRight > a.fLeft && b.fBottom > a.fTop; in GrRectsOverlap()
70 SkASSERT(!a.isFinite() || (a.fLeft <= a.fRight && a.fTop <= a.fBottom)); in GrRectsTouchOrOverlap()
71 SkASSERT(!b.isFinite() || (b.fLeft <= b.fRight && b.fTop <= b.fBottom)); in GrRectsTouchOrOverlap()
[all …]
|
| D | GrClip.h | 76 innerClipBounds.fBottom > innerClipBounds.fTop + kBoundsTolerance && in IsInsideClip()
78 innerClipBounds.fTop < queryBounds.fTop + kBoundsTolerance && in IsInsideClip()
94 outerClipBounds.fBottom - outerClipBounds.fTop <= kBoundsTolerance || in IsOutsideClip()
98 outerClipBounds.fTop >= queryBounds.fBottom - kBoundsTolerance || in IsOutsideClip()
100 outerClipBounds.fBottom <= queryBounds.fTop + kBoundsTolerance; in IsOutsideClip()
108 SkScalarFloorToInt(bounds.fTop + kBoundsTolerance), in GetPixelIBounds()
118 SkScalarFloorToScalar(bounds.fTop + kBoundsTolerance), in GetPixelBounds()
128 SkScalarAbs(SkScalarRoundToScalar(rect.fTop) - rect.fTop) <= kBoundsTolerance && in IsPixelAligned()
|
| D | GrTessellator.cpp | 359 , fTop(top) in Edge()
381 Vertex* fTop; // The top vertex in vertex-sort-order (sweep_lt). member
411 fLine = Line(fTop, fBottom); in recompute()
415 fTop->fID, fBottom->fID, in intersect()
416 other.fTop->fID, other.fBottom->fID); in intersect()
417 if (fTop == other.fTop || fBottom == other.fBottom) { in intersect()
424 double dx = static_cast<double>(other.fTop->fPoint.fX) - fTop->fPoint.fX; in intersect()
425 double dy = static_cast<double>(other.fTop->fPoint.fY) - fTop->fPoint.fY; in intersect()
436 p->fX = SkDoubleToScalar(fTop->fPoint.fX - s * fLine.fB); in intersect()
437 p->fY = SkDoubleToScalar(fTop->fPoint.fY + s * fLine.fA); in intersect()
[all …]
|
| /external/skqp/src/gpu/ |
| D | GrRect.h | 15 int16_t fLeft, fTop, fRight, fBottom; member
36 int height() const { return fBottom - fTop; } in height()
38 bool isEmpty() const { return fLeft >= fRight || fTop >= fBottom; } in isEmpty()
44 fTop = top; in set()
51 fTop = SkToS16(r.fTop); in set()
61 SkASSERT(!a.isFinite() || (a.fLeft <= a.fRight && a.fTop <= a.fBottom)); in GrRectsOverlap()
62 SkASSERT(!b.isFinite() || (b.fLeft <= b.fRight && b.fTop <= b.fBottom)); in GrRectsOverlap()
63 return a.fRight > b.fLeft && a.fBottom > b.fTop && b.fRight > a.fLeft && b.fBottom > a.fTop; in GrRectsOverlap()
70 SkASSERT(!a.isFinite() || (a.fLeft <= a.fRight && a.fTop <= a.fBottom)); in GrRectsTouchOrOverlap()
71 SkASSERT(!b.isFinite() || (b.fLeft <= b.fRight && b.fTop <= b.fBottom)); in GrRectsTouchOrOverlap()
[all …]
|
| D | GrClip.h | 76 innerClipBounds.fBottom > innerClipBounds.fTop + kBoundsTolerance && in IsInsideClip()
78 innerClipBounds.fTop < queryBounds.fTop + kBoundsTolerance && in IsInsideClip()
94 outerClipBounds.fBottom - outerClipBounds.fTop <= kBoundsTolerance || in IsOutsideClip()
98 outerClipBounds.fTop >= queryBounds.fBottom - kBoundsTolerance || in IsOutsideClip()
100 outerClipBounds.fBottom <= queryBounds.fTop + kBoundsTolerance; in IsOutsideClip()
108 SkScalarFloorToInt(bounds.fTop + kBoundsTolerance), in GetPixelIBounds()
118 SkScalarFloorToScalar(bounds.fTop + kBoundsTolerance), in GetPixelBounds()
128 SkScalarAbs(SkScalarRoundToScalar(rect.fTop) - rect.fTop) <= kBoundsTolerance && in IsPixelAligned()
|
| D | GrTessellator.cpp | 359 , fTop(top) in Edge()
381 Vertex* fTop; // The top vertex in vertex-sort-order (sweep_lt). member
411 fLine = Line(fTop, fBottom); in recompute()
415 fTop->fID, fBottom->fID, in intersect()
416 other.fTop->fID, other.fBottom->fID); in intersect()
417 if (fTop == other.fTop || fBottom == other.fBottom) { in intersect()
424 double dx = static_cast<double>(other.fTop->fPoint.fX) - fTop->fPoint.fX; in intersect()
425 double dy = static_cast<double>(other.fTop->fPoint.fY) - fTop->fPoint.fY; in intersect()
436 p->fX = SkDoubleToScalar(fTop->fPoint.fX - s * fLine.fB); in intersect()
437 p->fY = SkDoubleToScalar(fTop->fPoint.fY + s * fLine.fA); in intersect()
[all …]
|
| /external/pdfium/xfa/fwl/theme/ |
| D | cfwl_widgettp.cpp | 188 float fTop = in DrawArrow() local
193 path.MoveTo(CFX_PointF(fLeft, fTop + 1)); in DrawArrow()
194 path.LineTo(CFX_PointF(fLeft + 4, fTop + 5)); in DrawArrow()
195 path.LineTo(CFX_PointF(fLeft + 8, fTop + 1)); in DrawArrow()
196 path.LineTo(CFX_PointF(fLeft + 7, fTop)); in DrawArrow()
197 path.LineTo(CFX_PointF(fLeft + 4, fTop + 3)); in DrawArrow()
198 path.LineTo(CFX_PointF(fLeft + 1, fTop)); in DrawArrow()
202 path.MoveTo(CFX_PointF(fLeft, fTop + 4)); in DrawArrow()
203 path.LineTo(CFX_PointF(fLeft + 4, fTop)); in DrawArrow()
204 path.LineTo(CFX_PointF(fLeft + 8, fTop + 4)); in DrawArrow()
[all …]
|
| /external/skia/src/pathops/ |
| D | SkPathOpsRect.h | 13 double fLeft, fTop, fRight, fBottom; member
17 fTop = SkTMin(fTop, pt.fY); in add()
24 && approximately_between(fTop, pt.fY, fBottom); in contains()
31 SkASSERT(fTop <= fBottom); in intersects()
33 SkASSERT(r.fTop <= r.fBottom); in intersects()
34 return r.fLeft <= fRight && fLeft <= r.fRight && r.fTop <= fBottom && fTop <= r.fBottom; in intersects()
39 fTop = fBottom = pt.fY; in set()
47 return fBottom - fTop; in height()
69 return fLeft <= fRight && fTop <= fBottom; in valid()
|
| D | SkPathOpsBounds.h | 18 && AlmostLessOrEqualUlps(a.fTop, b.fBottom) in Intersects()
19 && AlmostLessOrEqualUlps(b.fTop, a.fBottom); in Intersects()
27 if (top < fTop) fTop = top; in add()
33 add(toAdd.fLeft, toAdd.fTop, toAdd.fRight, toAdd.fBottom); in add()
38 if (pt.fY < fTop) fTop = pt.fY; in add()
45 if (pt.fY < fTop) fTop = SkDoubleToScalar(pt.fY); in add()
53 && AlmostLessOrEqualUlps(fTop, pt.fY) in almostContains()
58 return fLeft <= pt.fX && fTop <= pt.fY && in contains()
|
| /external/skqp/src/pathops/ |
| D | SkPathOpsRect.h | 13 double fLeft, fTop, fRight, fBottom; member
17 fTop = SkTMin(fTop, pt.fY); in add()
24 && approximately_between(fTop, pt.fY, fBottom); in contains()
31 SkASSERT(fTop <= fBottom); in intersects()
33 SkASSERT(r.fTop <= r.fBottom); in intersects()
34 return r.fLeft <= fRight && fLeft <= r.fRight && r.fTop <= fBottom && fTop <= r.fBottom; in intersects()
39 fTop = fBottom = pt.fY; in set()
47 return fBottom - fTop; in height()
69 return fLeft <= fRight && fTop <= fBottom; in valid()
|
| D | SkPathOpsBounds.h | 18 && AlmostLessOrEqualUlps(a.fTop, b.fBottom) in Intersects()
19 && AlmostLessOrEqualUlps(b.fTop, a.fBottom); in Intersects()
27 if (top < fTop) fTop = top; in add()
33 add(toAdd.fLeft, toAdd.fTop, toAdd.fRight, toAdd.fBottom); in add()
38 if (pt.fY < fTop) fTop = pt.fY; in add()
45 if (pt.fY < fTop) fTop = SkDoubleToScalar(pt.fY); in add()
53 && AlmostLessOrEqualUlps(fTop, pt.fY) in almostContains()
58 return fLeft <= pt.fX && fTop <= pt.fY && in contains()
|
| /external/skqp/src/core/ |
| D | SkRasterClipStack.h | 17 SkTStack(void* storage, size_t size) : fDeque(sizeof(T), storage, size), fTop(nullptr) {} in SkTStack()
30 SkASSERT(fTop); in top()
31 return *fTop; in top()
35 SkASSERT(fTop); in top()
36 return *fTop; in top()
41 fTop = this->push_raw(); in push()
42 new (fTop) T(); in push()
43 return *fTop; in push()
46 fTop = this->push_raw(); in push()
47 new (fTop) T(src); in push()
[all …]
|
| D | SkRect.cpp | 19 if (fLeft >= fRight || fTop >= fBottom) { in join()
23 if (top < fTop) fTop = top; in join()
34 quad[0].set(fLeft, fTop); in toQuad()
35 quad[1].set(fRight, fTop); in toQuad()
106 CHECK_INTERSECT(left, top, right, bottom, fLeft, fTop, fRight, fBottom); in intersect()
112 return this->intersect(r.fLeft, r.fTop, r.fRight, r.fBottom); in intersect()
116 CHECK_INTERSECT(a.fLeft, a.fTop, a.fRight, a.fBottom, b.fLeft, b.fTop, b.fRight, b.fBottom); in intersect()
128 if (fLeft >= fRight || fTop >= fBottom) { in join()
132 fTop = SkMinScalar(fTop, top); in join()
156 line.appendf(" %s, /* %f */\n", set_scalar(&tmp, fTop, asType), fTop); in dump()
[all …]
|
| D | SkEdgeClipper.cpp | 14 return bounds.fTop >= clip.fBottom || bounds.fBottom <= clip.fTop; in quick_reject()
98 if (pts[0].fY < clip.fTop) { in chop_quad_in_Y()
99 if (chopMonoQuadAtY(pts, clip.fTop, &t)) { in chop_quad_in_Y()
103 tmp[2].fY = clip.fTop; in chop_quad_in_Y()
104 clamp_ge(tmp[3].fY, clip.fTop); in chop_quad_in_Y()
112 if (pts[i].fY < clip.fTop) { in chop_quad_in_Y()
113 pts[i].fY = clip.fTop; in chop_quad_in_Y()
147 if (pts[2].fY <= clip.fTop || pts[0].fY >= clip.fBottom) { in clipMonoQuad()
281 if (pts[0].fY < clip.fTop) { in chop_cubic_in_Y()
283 chop_mono_cubic_at_y(pts, clip.fTop, tmp); in chop_cubic_in_Y()
[all …]
|
| D | SkLineClipper.cpp | 73 return outer.fLeft <= inner.fLeft && outer.fTop <= inner.fTop && in containsNoEmptyCheck()
92 nestedLT(bounds.fBottom, clip.fTop, bounds.height()) || in IntersectLine()
93 nestedLT(clip.fBottom, bounds.fTop, bounds.height())) { in IntersectLine()
111 if (tmp[index0].fY < clip.fTop) { in IntersectLine()
112 tmp[index0].set(sect_with_horizontal(src, clip.fTop), clip.fTop); in IntersectLine()
174 if (pts[index1].fY <= clip.fTop) { // we're above the clip in ClipLine()
187 if (pts[index0].fY < clip.fTop) { in ClipLine()
188 tmp[index0].set(sect_with_horizontal(pts, clip.fTop), clip.fTop); in ClipLine()
|
| /external/skia/src/core/ |
| D | SkRasterClipStack.h | 17 SkTStack(void* storage, size_t size) : fDeque(sizeof(T), storage, size), fTop(nullptr) {} in SkTStack()
30 SkASSERT(fTop); in top()
31 return *fTop; in top()
35 SkASSERT(fTop); in top()
36 return *fTop; in top()
41 fTop = this->push_raw(); in push()
42 new (fTop) T(); in push()
43 return *fTop; in push()
46 fTop = this->push_raw(); in push()
47 new (fTop) T(src); in push()
[all …]
|
| D | SkRect.cpp | 19 if (fLeft >= fRight || fTop >= fBottom) { in join()
23 if (top < fTop) fTop = top; in join()
34 quad[0].set(fLeft, fTop); in toQuad()
35 quad[1].set(fRight, fTop); in toQuad()
106 CHECK_INTERSECT(left, top, right, bottom, fLeft, fTop, fRight, fBottom); in intersect()
112 return this->intersect(r.fLeft, r.fTop, r.fRight, r.fBottom); in intersect()
116 CHECK_INTERSECT(a.fLeft, a.fTop, a.fRight, a.fBottom, b.fLeft, b.fTop, b.fRight, b.fBottom); in intersect()
128 if (fLeft >= fRight || fTop >= fBottom) { in join()
132 fTop = SkMinScalar(fTop, top); in join()
156 line.appendf(" %s, /* %f */\n", set_scalar(&tmp, fTop, asType), fTop); in dump()
[all …]
|
| D | SkEdgeClipper.cpp | 14 return bounds.fTop >= clip.fBottom || bounds.fBottom <= clip.fTop; in quick_reject()
98 if (pts[0].fY < clip.fTop) { in chop_quad_in_Y()
99 if (chopMonoQuadAtY(pts, clip.fTop, &t)) { in chop_quad_in_Y()
103 tmp[2].fY = clip.fTop; in chop_quad_in_Y()
104 clamp_ge(tmp[3].fY, clip.fTop); in chop_quad_in_Y()
112 if (pts[i].fY < clip.fTop) { in chop_quad_in_Y()
113 pts[i].fY = clip.fTop; in chop_quad_in_Y()
147 if (pts[2].fY <= clip.fTop || pts[0].fY >= clip.fBottom) { in clipMonoQuad()
281 if (pts[0].fY < clip.fTop) { in chop_cubic_in_Y()
283 chop_mono_cubic_at_y(pts, clip.fTop, tmp); in chop_cubic_in_Y()
[all …]
|
| D | SkLineClipper.cpp | 73 return outer.fLeft <= inner.fLeft && outer.fTop <= inner.fTop && in containsNoEmptyCheck()
92 nestedLT(bounds.fBottom, clip.fTop, bounds.height()) || in IntersectLine()
93 nestedLT(clip.fBottom, bounds.fTop, bounds.height())) { in IntersectLine()
111 if (tmp[index0].fY < clip.fTop) { in IntersectLine()
112 tmp[index0].set(sect_with_horizontal(src, clip.fTop), clip.fTop); in IntersectLine()
174 if (pts[index1].fY <= clip.fTop) { // we're above the clip in ClipLine()
187 if (pts[index0].fY < clip.fTop) { in ClipLine()
188 tmp[index0].set(sect_with_horizontal(pts, clip.fTop), clip.fTop); in ClipLine()
|
| D | SkScan.h | 111 xr->fTop = SkIntToFixed(src.fTop); in XRect_set()
122 xr->fTop = SkScalarToFixed(src.fTop); in XRect_set()
131 dst->fTop = SkFixedRoundToInt(xr.fTop); in XRect_round()
141 dst->fTop = SkFixedFloorToInt(xr.fTop); in XRect_roundOut()
|
| /external/skia/docs/ |
| D | SkRect_Reference.bmh | 40 #Member SkScalar fTop
55 vertical values when sorted. When equal to or less than fTop, Rect is empty.
202 result in fLeft greater than fRight, or fTop greater than fBottom.
205 #Param t SkScalar stored in fTop ##
242 #Param y stored in fTop ##
303 Does not validate input; fLeft may be greater than fRight, fTop may be greater
335 Returns true if fLeft is equal to or greater than fRight, or if fTop is equal
368 Returns true if fLeft is equal to or less than fRight, or if fTop is equal
456 and sort() to reverse fTop and fBottom if needed.
458 #Return fTop ##
[all …]
|
| /external/skqp/bench/ |
| D | RTreeBench.cpp | 85 query.fTop = rand.nextRangeF(0, GENERATE_EXTENTS); in onDraw()
87 query.fBottom = query.fTop + 1 + rand.nextRangeF(0, GENERATE_EXTENTS/2); in onDraw()
101 out.fTop = SkIntToScalar(index / GRID_WIDTH); in make_XYordered_rects()
103 out.fBottom = out.fTop + 1 + rand.nextRangeF(0, GENERATE_EXTENTS/3); in make_XYordered_rects()
109 out.fTop = SkIntToScalar(index % GRID_WIDTH); in make_YXordered_rects()
111 out.fBottom = out.fTop + 1 + rand.nextRangeF(0, GENERATE_EXTENTS/3); in make_YXordered_rects()
118 out.fTop = rand.nextRangeF(0, GENERATE_EXTENTS); in make_random_rects()
120 out.fBottom = out.fTop + 1 + rand.nextRangeF(0, GENERATE_EXTENTS/5); in make_random_rects()
|
| /external/skia/bench/ |
| D | RTreeBench.cpp | 85 query.fTop = rand.nextRangeF(0, GENERATE_EXTENTS); in onDraw()
87 query.fBottom = query.fTop + 1 + rand.nextRangeF(0, GENERATE_EXTENTS/2); in onDraw()
101 out.fTop = SkIntToScalar(index / GRID_WIDTH); in make_XYordered_rects()
103 out.fBottom = out.fTop + 1 + rand.nextRangeF(0, GENERATE_EXTENTS/3); in make_XYordered_rects()
109 out.fTop = SkIntToScalar(index % GRID_WIDTH); in make_YXordered_rects()
111 out.fBottom = out.fTop + 1 + rand.nextRangeF(0, GENERATE_EXTENTS/3); in make_YXordered_rects()
118 out.fTop = rand.nextRangeF(0, GENERATE_EXTENTS); in make_random_rects()
120 out.fBottom = out.fTop + 1 + rand.nextRangeF(0, GENERATE_EXTENTS/5); in make_random_rects()
|