| /external/skqp/include/core/ |
| D | SkRect.h | 38 int32_t fLeft; //!< smaller x-axis bounds member
108 int32_t left() const { return fLeft; } in left()
136 int32_t x() const { return fLeft; } in x()
146 SkIPoint topLeft() const { return {fLeft, fTop}; } in topLeft()
153 int32_t width() const { return Sk32_can_overflow_sub(fRight, fLeft); } in width()
175 int64_t width64() const { return (int64_t)fRight - (int64_t)fLeft; } in width64()
191 bool isEmpty64() const { return fRight <= fLeft || fBottom <= fTop; } in isEmpty64()
247 fLeft = left; in set()
275 fLeft = x; in setXYWH()
294 Sk32_sat_add(fLeft, dx), Sk32_sat_add(fTop, dy), in makeOffset()
[all …]
|
| /external/skia/include/core/ |
| D | SkRect.h | 38 int32_t fLeft; //!< smaller x-axis bounds member
108 int32_t left() const { return fLeft; } in left()
136 int32_t x() const { return fLeft; } in x()
146 SkIPoint topLeft() const { return {fLeft, fTop}; } in topLeft()
153 int32_t width() const { return Sk32_can_overflow_sub(fRight, fLeft); } in width()
175 int64_t width64() const { return (int64_t)fRight - (int64_t)fLeft; } in width64()
191 bool isEmpty64() const { return fRight <= fLeft || fBottom <= fTop; } in isEmpty64()
247 fLeft = left; in set()
275 fLeft = x; in setXYWH()
294 Sk32_sat_add(fLeft, dx), Sk32_sat_add(fTop, dy), in makeOffset()
[all …]
|
| /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()
[all …]
|
| /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()
[all …]
|
| /external/skqp/src/gpu/ |
| D | GrRect.h | 16 int16_t fLeft, fTop, fRight, fBottom; member
36 int width() const { return fRight - fLeft; } in width()
39 bool isEmpty() const { return fLeft >= fRight || fTop >= fBottom; } in isEmpty()
44 fLeft = left; in set()
51 fLeft = SkToS16(r.fLeft); in set()
62 SkASSERT(!a.isFinite() || (a.fLeft <= a.fRight && a.fTop <= a.fBottom)); in GrRectsOverlap()
63 SkASSERT(!b.isFinite() || (b.fLeft <= b.fRight && b.fTop <= b.fBottom)); in GrRectsOverlap()
64 return a.fRight > b.fLeft && a.fBottom > b.fTop && b.fRight > a.fLeft && b.fBottom > a.fTop; in GrRectsOverlap()
71 SkASSERT(!a.isFinite() || (a.fLeft <= a.fRight && a.fTop <= a.fBottom)); in GrRectsTouchOrOverlap()
72 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/ |
| D | GrRect.h | 16 int16_t fLeft, fTop, fRight, fBottom; member
36 int width() const { return fRight - fLeft; } in width()
39 bool isEmpty() const { return fLeft >= fRight || fTop >= fBottom; } in isEmpty()
44 fLeft = left; in set()
51 fLeft = SkToS16(r.fLeft); in set()
62 SkASSERT(!a.isFinite() || (a.fLeft <= a.fRight && a.fTop <= a.fBottom)); in GrRectsOverlap()
63 SkASSERT(!b.isFinite() || (b.fLeft <= b.fRight && b.fTop <= b.fBottom)); in GrRectsOverlap()
64 return a.fRight > b.fLeft && a.fBottom > b.fTop && b.fRight > a.fLeft && b.fBottom > a.fTop; in GrRectsOverlap()
71 SkASSERT(!a.isFinite() || (a.fLeft <= a.fRight && a.fTop <= a.fBottom)); in GrRectsTouchOrOverlap()
72 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/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/skqp/src/pathops/ |
| D | SkPathOpsRect.h | 15 double fLeft, fTop, fRight, fBottom; member
18 fLeft = SkTMin(fLeft, pt.fX); in add()
25 return approximately_between(fLeft, pt.fX, fRight) in contains()
32 SkASSERT(fLeft <= fRight); in intersects()
34 SkASSERT(r.fLeft <= r.fRight); in intersects()
36 return r.fLeft <= fRight && fLeft <= r.fRight && r.fTop <= fBottom && fTop <= r.fBottom; in intersects()
40 fLeft = fRight = pt.fX; in set()
45 return fRight - fLeft; in width()
73 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/pathops/ |
| D | SkPathOpsRect.h | 15 double fLeft, fTop, fRight, fBottom; member
18 fLeft = SkTMin(fLeft, pt.fX); in add()
25 return approximately_between(fLeft, pt.fX, fRight) in contains()
32 SkASSERT(fLeft <= fRight); in intersects()
34 SkASSERT(r.fLeft <= r.fRight); in intersects()
36 return r.fLeft <= fRight && fLeft <= r.fRight && r.fTop <= fBottom && fTop <= r.fBottom; in intersects()
40 fLeft = fRight = pt.fX; in set()
45 return fRight - fLeft; in width()
73 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()
97 CHECK_INTERSECT(left, top, right, bottom, fLeft, fTop, fRight, fBottom); in intersect()
103 return this->intersect(r.fLeft, r.fTop, r.fRight, r.fBottom); in intersect()
107 CHECK_INTERSECT(a.fLeft, a.fTop, a.fRight, a.fBottom, b.fLeft, b.fTop, b.fRight, b.fBottom); in intersect()
119 if (fLeft >= fRight || fTop >= fBottom) { in join()
122 fLeft = SkMinScalar(fLeft, left); in join()
146 line.printf( "SkRect::MakeLTRB(%s, /* %f */\n", set_scalar(&tmp, fLeft, asType), fLeft); in dump()
[all …]
|
| D | SkBlitter.cpp | 78 SkScalar partialL = bounds.fLeft + 1 - rect.fLeft; in blitFatAntiRect()
90 this->blitAntiH(bounds.fLeft, bounds.fTop, alphas, runs); in blitFatAntiRect()
93 this->blitAntiRect(bounds.fLeft, bounds.fTop + 1, bounds.width() - 2, bounds.height() - 2, in blitFatAntiRect()
101 this->blitAntiH(bounds.fLeft, bounds.fBottom - 1, alphas, runs); in blitFatAntiRect()
124 int leftOverClip = clip.fLeft - antiRect.fX; in blitCoverageDeltas()
137 rectX = clip.fLeft; in blitCoverageDeltas()
168 SkIRect rowIR = SkIRect::MakeLTRB(SkTMin(clip.fLeft, deltas->left()), y, in blitCoverageDeltas()
185 int lastX = clip.fLeft; // init x to clip.fLeft in blitCoverageDeltas()
192 for(; i < deltas->count(y) && deltas->getDelta(y, i).fX < clip.fLeft; ++i) { in blitCoverageDeltas()
201 alphas[lastX - clip.fLeft] = alpha; // set alpha at lastX in blitCoverageDeltas()
[all …]
|
| D | SkLineClipper.cpp | 86 return outer.fLeft <= inner.fLeft && outer.fTop <= inner.fTop && in containsNoEmptyCheck()
103 if (nestedLT(bounds.fRight, clip.fLeft, bounds.width()) || in IntersectLine()
104 nestedLT(clip.fRight, bounds.fLeft, bounds.width()) || in IntersectLine()
140 if ((tmp[index1].fX <= clip.fLeft || tmp[index0].fX >= clip.fRight)) { in IntersectLine()
143 if (tmp[0].fX != tmp[1].fX || tmp[0].fX < clip.fLeft || tmp[0].fX > clip.fRight) { in IntersectLine()
148 if (tmp[index0].fX < clip.fLeft) { in IntersectLine()
149 tmp[index0].set(clip.fLeft, sect_with_vertical(src, clip.fLeft)); in IntersectLine()
229 if (tmp[index1].fX <= clip.fLeft) { // wholly to the left in ClipLine()
230 tmp[0].fX = tmp[1].fX = clip.fLeft; in ClipLine()
244 if (tmp[index0].fX < clip.fLeft) { in ClipLine()
[all …]
|
| /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()
97 CHECK_INTERSECT(left, top, right, bottom, fLeft, fTop, fRight, fBottom); in intersect()
103 return this->intersect(r.fLeft, r.fTop, r.fRight, r.fBottom); in intersect()
107 CHECK_INTERSECT(a.fLeft, a.fTop, a.fRight, a.fBottom, b.fLeft, b.fTop, b.fRight, b.fBottom); in intersect()
119 if (fLeft >= fRight || fTop >= fBottom) { in join()
122 fLeft = SkMinScalar(fLeft, left); in join()
146 line.printf( "SkRect::MakeLTRB(%s, /* %f */\n", set_scalar(&tmp, fLeft, asType), fLeft); in dump()
[all …]
|
| D | SkBlitter.cpp | 77 SkScalar partialL = bounds.fLeft + 1 - rect.fLeft; in blitFatAntiRect()
89 this->blitAntiH(bounds.fLeft, bounds.fTop, alphas, runs); in blitFatAntiRect()
92 this->blitAntiRect(bounds.fLeft, bounds.fTop + 1, bounds.width() - 2, bounds.height() - 2, in blitFatAntiRect()
100 this->blitAntiH(bounds.fLeft, bounds.fBottom - 1, alphas, runs); in blitFatAntiRect()
123 int leftOverClip = clip.fLeft - antiRect.fX; in blitCoverageDeltas()
136 rectX = clip.fLeft; in blitCoverageDeltas()
167 SkIRect rowIR = SkIRect::MakeLTRB(SkTMin(clip.fLeft, deltas->left()), y, in blitCoverageDeltas()
184 int lastX = clip.fLeft; // init x to clip.fLeft in blitCoverageDeltas()
191 for(; i < deltas->count(y) && deltas->getDelta(y, i).fX < clip.fLeft; ++i) { in blitCoverageDeltas()
200 alphas[lastX - clip.fLeft] = alpha; // set alpha at lastX in blitCoverageDeltas()
[all …]
|
| D | SkLineClipper.cpp | 86 return outer.fLeft <= inner.fLeft && outer.fTop <= inner.fTop && in containsNoEmptyCheck()
103 if (nestedLT(bounds.fRight, clip.fLeft, bounds.width()) || in IntersectLine()
104 nestedLT(clip.fRight, bounds.fLeft, bounds.width()) || in IntersectLine()
140 if ((tmp[index1].fX <= clip.fLeft || tmp[index0].fX >= clip.fRight)) { in IntersectLine()
143 if (tmp[0].fX != tmp[1].fX || tmp[0].fX < clip.fLeft || tmp[0].fX > clip.fRight) { in IntersectLine()
148 if (tmp[index0].fX < clip.fLeft) { in IntersectLine()
149 tmp[index0].set(clip.fLeft, sect_with_vertical(src, clip.fLeft)); in IntersectLine()
229 if (tmp[index1].fX <= clip.fLeft) { // wholly to the left in ClipLine()
230 tmp[0].fX = tmp[1].fX = clip.fLeft; in ClipLine()
244 if (tmp[index0].fX < clip.fLeft) { in ClipLine()
[all …]
|
| /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 std::unique_ptr<Expression>(new BinaryExpression(fOffset, fLeft->clone(), fOperator, in clone()
47 return "(" + fLeft->description() + " " + Compiler::OperatorName(fOperator) + " " + in description()
51 std::unique_ptr<Expression> fLeft; member
|
| /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 std::unique_ptr<Expression>(new BinaryExpression(fOffset, fLeft->clone(), fOperator, in clone()
47 return "(" + fLeft->description() + " " + Compiler::OperatorName(fOperator) + " " + in description()
51 std::unique_ptr<Expression> fLeft; member
|
| /external/skia/docs/ |
| D | SkRect_Reference.bmh | 21 #Member SkScalar fLeft
36 horizontal values when sorted. When equal to or less than fLeft, Rect is empty.
182 #Param x stored in fLeft ##
343 SkDebugf("unsorted.fLeft: %g unsorted.x(): %g\n", unsorted.fLeft, unsorted.x());
345 SkDebugf("sorted.fLeft: %g sorted.x(): %g\n", sorted.fLeft, sorted.x());
347 unsorted.fLeft: 15 unsorted.x(): 15
348 sorted.fLeft: 10 sorted.x(): 10
352 #SeeAlso fLeft left() y() SkIRect::x()
389 SkDebugf("unsorted.fLeft: %g unsorted.left(): %g\n", unsorted.fLeft, unsorted.left());
391 SkDebugf("sorted.fLeft: %g sorted.left(): %g\n", sorted.fLeft, sorted.left());
[all …]
|
| /external/skqp/docs/ |
| D | SkRect_Reference.bmh | 21 #Member SkScalar fLeft
36 horizontal values when sorted. When equal to or less than fLeft, Rect is empty.
182 #Param x stored in fLeft ##
343 SkDebugf("unsorted.fLeft: %g unsorted.x(): %g\n", unsorted.fLeft, unsorted.x());
345 SkDebugf("sorted.fLeft: %g sorted.x(): %g\n", sorted.fLeft, sorted.x());
347 unsorted.fLeft: 15 unsorted.x(): 15
348 sorted.fLeft: 10 sorted.x(): 10
352 #SeeAlso fLeft left() y() SkIRect::x()
389 SkDebugf("unsorted.fLeft: %g unsorted.left(): %g\n", unsorted.fLeft, unsorted.left());
391 SkDebugf("sorted.fLeft: %g sorted.left(): %g\n", sorted.fLeft, sorted.left());
[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()
|