| /external/skia/include/core/ |
| D | SkRect.h | 30 int32_t fLeft; member
120 int32_t left() const { return fLeft; } in left()
148 int32_t x() const { return fLeft; } in x()
162 int32_t width() const { return Sk32_can_overflow_sub(fRight, fLeft); } in width()
185 int32_t centerX() const { return SkToS32(((int64_t)fRight + fLeft) >> 1); } in centerX()
202 int64_t width64() const { return (int64_t)fRight - (int64_t)fLeft; } in width64()
218 bool isEmpty64() const { return fRight <= fLeft || fBottom <= fTop; } in isEmpty64()
262 return SkTFitsIn<int16_t>(fLeft) && SkTFitsIn<int16_t>(fTop) && in is16Bit()
284 fLeft = left; in set()
312 fLeft = x; in setXYWH()
[all …]
|
| /external/skqp/include/core/ |
| D | SkRect.h | 30 int32_t fLeft; member
123 int32_t left() const { return fLeft; } in left()
151 int32_t x() const { return fLeft; } in x()
165 int32_t width() const { return Sk32_can_overflow_sub(fRight, fLeft); } in width()
188 int32_t centerX() const { return SkToS32(((int64_t)fRight + fLeft) >> 1); } in centerX()
199 int64_t width64() const { return (int64_t)fRight - (int64_t)fLeft; } in width64()
206 bool isEmpty64() const { return fRight <= fLeft || fBottom <= fTop; } in isEmpty64()
249 return SkTFitsIn<int16_t>(fLeft) && SkTFitsIn<int16_t>(fTop) && in is16Bit()
271 fLeft = left; in set()
299 fLeft = x; in setXYWH()
[all …]
|
| /external/skia/src/gpu/ |
| D | GrRect.h | 15 int16_t fLeft, fTop, fRight, fBottom; member
35 int width() const { return fRight - fLeft; } in width()
38 bool isEmpty() const { return fLeft >= fRight || fTop >= fBottom; } in isEmpty()
43 fLeft = left; in set()
50 fLeft = SkToS16(r.fLeft); 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 | 75 return innerClipBounds.fRight > innerClipBounds.fLeft + kBoundsTolerance && in IsInsideClip()
77 innerClipBounds.fLeft < queryBounds.fLeft + kBoundsTolerance && in IsInsideClip()
93 outerClipBounds.fRight - outerClipBounds.fLeft <= kBoundsTolerance || in IsOutsideClip()
97 outerClipBounds.fLeft >= queryBounds.fRight - kBoundsTolerance || in IsOutsideClip()
99 outerClipBounds.fRight <= queryBounds.fLeft + kBoundsTolerance || in IsOutsideClip()
107 return SkIRect::MakeLTRB(SkScalarFloorToInt(bounds.fLeft + kBoundsTolerance), in GetPixelIBounds()
117 return SkRect::MakeLTRB(SkScalarFloorToScalar(bounds.fLeft + kBoundsTolerance), in GetPixelBounds()
127 return SkScalarAbs(SkScalarRoundToScalar(rect.fLeft) - rect.fLeft) <= kBoundsTolerance && in IsPixelAligned()
|
| /external/skqp/src/gpu/ |
| D | GrRect.h | 15 int16_t fLeft, fTop, fRight, fBottom; member
35 int width() const { return fRight - fLeft; } in width()
38 bool isEmpty() const { return fLeft >= fRight || fTop >= fBottom; } in isEmpty()
43 fLeft = left; in set()
50 fLeft = SkToS16(r.fLeft); 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 | 75 return innerClipBounds.fRight > innerClipBounds.fLeft + kBoundsTolerance && in IsInsideClip()
77 innerClipBounds.fLeft < queryBounds.fLeft + kBoundsTolerance && in IsInsideClip()
93 outerClipBounds.fRight - outerClipBounds.fLeft <= kBoundsTolerance || in IsOutsideClip()
97 outerClipBounds.fLeft >= queryBounds.fRight - kBoundsTolerance || in IsOutsideClip()
99 outerClipBounds.fRight <= queryBounds.fLeft + kBoundsTolerance || in IsOutsideClip()
107 return SkIRect::MakeLTRB(SkScalarFloorToInt(bounds.fLeft + kBoundsTolerance), in GetPixelIBounds()
117 return SkRect::MakeLTRB(SkScalarFloorToScalar(bounds.fLeft + kBoundsTolerance), in GetPixelBounds()
127 return SkScalarAbs(SkScalarRoundToScalar(rect.fLeft) - rect.fLeft) <= kBoundsTolerance && in IsPixelAligned()
|
| /external/skia/src/gpu/gl/ |
| D | GrGLIRect.h | 21 GrGLint fLeft; member
30 return &fLeft; in asInts()
32 GR_STATIC_ASSERT(0 == offsetof(GrGLIRect, fLeft)); in asInts()
38 int* asInts() { return &fLeft; } in asInts()
41 GR_GL_CALL(gl, Viewport(fLeft, fBottom, fWidth, fHeight)); in pushToGLViewport()
45 GR_GL_CALL(gl, Scissor(fLeft, fBottom, fWidth, fHeight)); in pushToGLScissor()
67 fLeft = glRect.fLeft + leftOffset; in setRelativeTo()
81 return fLeft <= glRect.fLeft && in contains()
83 fLeft + fWidth >= glRect.fLeft + glRect.fWidth && in contains()
87 void invalidate() {fLeft = fWidth = fBottom = fHeight = -1;} in invalidate()
|
| /external/skqp/src/gpu/gl/ |
| D | GrGLIRect.h | 21 GrGLint fLeft; member
30 return &fLeft; in asInts()
32 GR_STATIC_ASSERT(0 == offsetof(GrGLIRect, fLeft)); in asInts()
38 int* asInts() { return &fLeft; } in asInts()
41 GR_GL_CALL(gl, Viewport(fLeft, fBottom, fWidth, fHeight)); in pushToGLViewport()
45 GR_GL_CALL(gl, Scissor(fLeft, fBottom, fWidth, fHeight)); in pushToGLScissor()
67 fLeft = glRect.fLeft + leftOffset; in setRelativeTo()
81 return fLeft <= glRect.fLeft && in contains()
83 fLeft + fWidth >= glRect.fLeft + glRect.fWidth && in contains()
87 void invalidate() {fLeft = fWidth = fBottom = fHeight = -1;} in invalidate()
|
| /external/pdfium/xfa/fwl/theme/ |
| D | cfwl_widgettp.cpp | 186 float fLeft = 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
16 fLeft = SkTMin(fLeft, pt.fX); in add()
23 return approximately_between(fLeft, pt.fX, fRight) in contains()
30 SkASSERT(fLeft <= fRight); in intersects()
32 SkASSERT(r.fLeft <= r.fRight); in intersects()
34 return r.fLeft <= fRight && fLeft <= r.fRight && r.fTop <= fBottom && fTop <= r.fBottom; in intersects()
38 fLeft = fRight = pt.fX; in set()
43 return fRight - fLeft; in width()
69 return fLeft <= fRight && fTop <= fBottom; in valid()
|
| D | SkPathOpsBounds.h | 16 return AlmostLessOrEqualUlps(a.fLeft, b.fRight) in Intersects()
17 && AlmostLessOrEqualUlps(b.fLeft, a.fRight) in Intersects()
26 if (left < fLeft) fLeft = left; in add()
33 add(toAdd.fLeft, toAdd.fTop, toAdd.fRight, toAdd.fBottom); in add()
37 if (pt.fX < fLeft) fLeft = pt.fX; in add()
44 if (pt.fX < fLeft) fLeft = SkDoubleToScalar(pt.fX); in add()
51 return AlmostLessOrEqualUlps(fLeft, pt.fX) 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
16 fLeft = SkTMin(fLeft, pt.fX); in add()
23 return approximately_between(fLeft, pt.fX, fRight) in contains()
30 SkASSERT(fLeft <= fRight); in intersects()
32 SkASSERT(r.fLeft <= r.fRight); in intersects()
34 return r.fLeft <= fRight && fLeft <= r.fRight && r.fTop <= fBottom && fTop <= r.fBottom; in intersects()
38 fLeft = fRight = pt.fX; in set()
43 return fRight - fLeft; in width()
69 return fLeft <= fRight && fTop <= fBottom; in valid()
|
| D | SkPathOpsBounds.h | 16 return AlmostLessOrEqualUlps(a.fLeft, b.fRight) in Intersects()
17 && AlmostLessOrEqualUlps(b.fLeft, a.fRight) in Intersects()
26 if (left < fLeft) fLeft = left; in add()
33 add(toAdd.fLeft, toAdd.fTop, toAdd.fRight, toAdd.fBottom); in add()
37 if (pt.fX < fLeft) fLeft = pt.fX; in add()
44 if (pt.fX < fLeft) fLeft = SkDoubleToScalar(pt.fX); in add()
51 return AlmostLessOrEqualUlps(fLeft, pt.fX) in almostContains()
58 return fLeft <= pt.fX && fTop <= pt.fY && in contains()
|
| /external/skia/src/core/ |
| D | SkRect.cpp | 19 if (fLeft >= fRight || fTop >= fBottom) { in join()
22 if (left < fLeft) fLeft = left; in join()
34 quad[0].set(fLeft, fTop); in toQuad()
37 quad[3].set(fLeft, fBottom); 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()
131 fLeft = SkMinScalar(fLeft, left); in join()
155 line.printf( "SkRect::MakeLTRB(%s, /* %f */\n", set_scalar(&tmp, fLeft, asType), fLeft); in dump()
[all …]
|
| D | SkLineClipper.cpp | 73 return outer.fLeft <= inner.fLeft && outer.fTop <= inner.fTop && in containsNoEmptyCheck()
90 if (nestedLT(bounds.fRight, clip.fLeft, bounds.width()) || in IntersectLine()
91 nestedLT(clip.fRight, bounds.fLeft, bounds.width()) || in IntersectLine()
127 if ((tmp[index1].fX <= clip.fLeft || tmp[index0].fX >= clip.fRight) && in IntersectLine()
133 if (tmp[index0].fX < clip.fLeft) { in IntersectLine()
134 tmp[index0].set(clip.fLeft, sect_with_vertical(src, clip.fLeft)); in IntersectLine()
214 if (tmp[index1].fX <= clip.fLeft) { // wholly to the left in ClipLine()
215 tmp[0].fX = tmp[1].fX = clip.fLeft; in ClipLine()
229 if (tmp[index0].fX < clip.fLeft) { in ClipLine()
230 r->set(clip.fLeft, tmp[index0].fY); in ClipLine()
[all …]
|
| D | SkBlitter.cpp | 64 SkScalar partialL = bounds.fLeft + 1 - rect.fLeft; in blitFatAntiRect()
72 this->blitAntiH(bounds.fLeft, bounds.fTop, alphas, runs); in blitFatAntiRect()
74 this->blitAntiRect(bounds.fLeft, bounds.fTop + 1, bounds.width() - 2, bounds.height() - 2, in blitFatAntiRect()
80 this->blitAntiH(bounds.fLeft, bounds.fBottom - 1, alphas, runs); in blitFatAntiRect()
113 SkIRect rowIR = SkIRect::MakeLTRB(clip.fLeft, y, clip.fRight, y + 1); in blitCoverageDeltas()
129 int lastX = clip.fLeft; // init x to clip.fLeft in blitCoverageDeltas()
133 for(; i < deltas->count(y) && deltas->getDelta(y, i).fX < clip.fLeft; ++i); in blitCoverageDeltas()
140 alphas[lastX - clip.fLeft] = alpha; // set alpha at lastX in blitCoverageDeltas()
141 runs[lastX - clip.fLeft] = delta.fX - lastX; // set the run length in blitCoverageDeltas()
150 alphas[lastX - clip.fLeft] = alpha; in blitCoverageDeltas()
[all …]
|
| D | SkScan.h | 110 xr->fLeft = SkIntToFixed(src.fLeft); in XRect_set()
121 xr->fLeft = SkScalarToFixed(src.fLeft); in XRect_set()
130 dst->fLeft = SkFixedRoundToInt(xr.fLeft); in XRect_round()
140 dst->fLeft = SkFixedFloorToInt(xr.fLeft); in XRect_roundOut()
|
| /external/skqp/src/core/ |
| D | SkRect.cpp | 19 if (fLeft >= fRight || fTop >= fBottom) { in join()
22 if (left < fLeft) fLeft = left; in join()
34 quad[0].set(fLeft, fTop); in toQuad()
37 quad[3].set(fLeft, fBottom); 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()
131 fLeft = SkMinScalar(fLeft, left); in join()
155 line.printf( "SkRect::MakeLTRB(%s, /* %f */\n", set_scalar(&tmp, fLeft, asType), fLeft); in dump()
[all …]
|
| D | SkBlitter.cpp | 63 SkScalar partialL = bounds.fLeft + 1 - rect.fLeft; in blitFatAntiRect()
71 this->blitAntiH(bounds.fLeft, bounds.fTop, alphas, runs); in blitFatAntiRect()
73 this->blitAntiRect(bounds.fLeft, bounds.fTop + 1, bounds.width() - 2, bounds.height() - 2, in blitFatAntiRect()
79 this->blitAntiH(bounds.fLeft, bounds.fBottom - 1, alphas, runs); in blitFatAntiRect()
106 SkIRect rowIR = SkIRect::MakeLTRB(clip.fLeft, y, clip.fRight, y + 1); in blitCoverageDeltas()
122 int lastX = clip.fLeft; // init x to clip.fLeft in blitCoverageDeltas()
126 for(; i < deltas->count(y) && deltas->getDelta(y, i).fX < clip.fLeft; ++i); in blitCoverageDeltas()
133 alphas[lastX - clip.fLeft] = alpha; // set alpha at lastX in blitCoverageDeltas()
134 runs[lastX - clip.fLeft] = delta.fX - lastX; // set the run length in blitCoverageDeltas()
143 alphas[lastX - clip.fLeft] = alpha; in blitCoverageDeltas()
[all …]
|
| D | SkLineClipper.cpp | 73 return outer.fLeft <= inner.fLeft && outer.fTop <= inner.fTop && in containsNoEmptyCheck()
90 if (nestedLT(bounds.fRight, clip.fLeft, bounds.width()) || in IntersectLine()
91 nestedLT(clip.fRight, bounds.fLeft, bounds.width()) || in IntersectLine()
127 if ((tmp[index1].fX <= clip.fLeft || tmp[index0].fX >= clip.fRight) && in IntersectLine()
133 if (tmp[index0].fX < clip.fLeft) { in IntersectLine()
134 tmp[index0].set(clip.fLeft, sect_with_vertical(src, clip.fLeft)); in IntersectLine()
214 if (tmp[index1].fX <= clip.fLeft) { // wholly to the left in ClipLine()
215 tmp[0].fX = tmp[1].fX = clip.fLeft; in ClipLine()
229 if (tmp[index0].fX < clip.fLeft) { in ClipLine()
230 r->set(clip.fLeft, tmp[index0].fY); in ClipLine()
[all …]
|
| /external/skia/docs/ |
| D | SkRect_Reference.bmh | 34 #Member SkScalar fLeft
49 horizontal values when sorted. When equal to or less than fLeft, Rect is empty.
202 result in fLeft greater than fRight, or fTop greater than fBottom.
204 #Param l SkScalar stored in fLeft ##
241 #Param x stored in fLeft ##
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
430 Call sort() to reverse fLeft and fRight if needed.
432 #Return fLeft ##
[all …]
|
| /external/skqp/bench/ |
| D | RTreeBench.cpp | 84 query.fLeft = rand.nextRangeF(0, GENERATE_EXTENTS); in onDraw()
86 query.fRight = query.fLeft + 1 + rand.nextRangeF(0, GENERATE_EXTENTS/2); in onDraw()
100 out.fLeft = SkIntToScalar(index % GRID_WIDTH); in make_XYordered_rects()
102 out.fRight = out.fLeft + 1 + rand.nextRangeF(0, GENERATE_EXTENTS/3); in make_XYordered_rects()
108 out.fLeft = SkIntToScalar(index / GRID_WIDTH); in make_YXordered_rects()
110 out.fRight = out.fLeft + 1 + rand.nextRangeF(0, GENERATE_EXTENTS/3); in make_YXordered_rects()
117 out.fLeft = rand.nextRangeF(0, GENERATE_EXTENTS); in make_random_rects()
119 out.fRight = out.fLeft + 1 + rand.nextRangeF(0, GENERATE_EXTENTS/5); in make_random_rects()
|
| /external/skia/bench/ |
| D | RTreeBench.cpp | 84 query.fLeft = rand.nextRangeF(0, GENERATE_EXTENTS); in onDraw()
86 query.fRight = query.fLeft + 1 + rand.nextRangeF(0, GENERATE_EXTENTS/2); in onDraw()
100 out.fLeft = SkIntToScalar(index % GRID_WIDTH); in make_XYordered_rects()
102 out.fRight = out.fLeft + 1 + rand.nextRangeF(0, GENERATE_EXTENTS/3); in make_XYordered_rects()
108 out.fLeft = SkIntToScalar(index / GRID_WIDTH); in make_YXordered_rects()
110 out.fRight = out.fLeft + 1 + rand.nextRangeF(0, GENERATE_EXTENTS/3); in make_YXordered_rects()
117 out.fLeft = rand.nextRangeF(0, GENERATE_EXTENTS); in make_random_rects()
119 out.fRight = out.fLeft + 1 + rand.nextRangeF(0, GENERATE_EXTENTS/5); in make_random_rects()
|
| /external/skia/src/sksl/ir/ |
| D | SkSLBinaryExpression.h | 25 , fLeft(std::move(left)) in BinaryExpression()
31 return irGenerator.constantFold(*fLeft, in constantPropagate()
37 return Compiler::IsAssignment(fOperator) || fLeft->hasSideEffects() || in hasSideEffects()
42 return "(" + fLeft->description() + " " + Compiler::OperatorName(fOperator) + " " + in description()
46 std::unique_ptr<Expression> fLeft; member
|
| /external/skqp/src/sksl/ir/ |
| D | SkSLBinaryExpression.h | 25 , fLeft(std::move(left)) in BinaryExpression()
31 return irGenerator.constantFold(*fLeft, in constantPropagate()
37 return Compiler::IsAssignment(fOperator) || fLeft->hasSideEffects() || in hasSideEffects()
42 return "(" + fLeft->description() + " " + Compiler::OperatorName(fOperator) + " " + in description()
46 std::unique_ptr<Expression> fLeft; member
|