| /external/skia/src/pathops/ |
| SkPathOpsBounds.h | 16 return AlmostLessOrEqualUlps(a.fLeft, b.fRight)
17 && AlmostLessOrEqualUlps(b.fLeft, a.fRight)
28 if (right > fRight) fRight = right;
33 add(toAdd.fLeft, toAdd.fTop, toAdd.fRight, toAdd.fBottom);
39 if (pt.fX > fRight) fRight = pt.fX;
46 if (pt.fX > fRight) fRight = SkDoubleToScalar(pt.fX);
52 && AlmostLessOrEqualUlps(pt.fX, fRight)
[all...] |
| SkPathOpsRect.h | 15 double fLeft, fTop, fRight, fBottom;
20 fRight = SkTMax(fRight, pt.fX);
25 return approximately_between(fLeft, pt.fX, fRight)
32 SkASSERT(fLeft <= fRight);
34 SkASSERT(r.fLeft <= r.fRight);
36 return r.fLeft <= fRight && fLeft <= r.fRight && r.fTop <= fBottom && fTop <= r.fBottom;
40 fLeft = fRight = pt.fX;
45 return fRight - fLeft
[all...] |
| /external/skqp/src/pathops/ |
| SkPathOpsBounds.h | 16 return AlmostLessOrEqualUlps(a.fLeft, b.fRight)
17 && AlmostLessOrEqualUlps(b.fLeft, a.fRight)
28 if (right > fRight) fRight = right;
33 add(toAdd.fLeft, toAdd.fTop, toAdd.fRight, toAdd.fBottom);
39 if (pt.fX > fRight) fRight = pt.fX;
46 if (pt.fX > fRight) fRight = SkDoubleToScalar(pt.fX);
52 && AlmostLessOrEqualUlps(pt.fX, fRight)
[all...] |
| SkPathOpsRect.h | 15 double fLeft, fTop, fRight, fBottom;
20 fRight = SkTMax(fRight, pt.fX);
25 return approximately_between(fLeft, pt.fX, fRight)
32 SkASSERT(fLeft <= fRight);
34 SkASSERT(r.fLeft <= r.fRight);
36 return r.fLeft <= fRight && fLeft <= r.fRight && r.fTop <= fBottom && fTop <= r.fBottom;
40 fLeft = fRight = pt.fX;
45 return fRight - fLeft
[all...] |
| /external/skia/src/gpu/ |
| GrRect.h | 16 int16_t fLeft, fTop, fRight, fBottom;
36 int width() const { return fRight - fLeft; }
39 bool isEmpty() const { return fLeft >= fRight || fTop >= fBottom; }
46 fRight = right;
53 fRight = SkToS16(r.fRight);
62 SkASSERT(!a.isFinite() || (a.fLeft <= a.fRight && a.fTop <= a.fBottom));
63 SkASSERT(!b.isFinite() || (b.fLeft <= b.fRight && b.fTop <= b.fBottom));
64 return a.fRight > b.fLeft && a.fBottom > b.fTop && b.fRight > a.fLeft && b.fBottom > a.fTop
[all...] |
| GrClip.h | 75 return innerClipBounds.fRight > innerClipBounds.fLeft + kBoundsTolerance &&
79 innerClipBounds.fRight > queryBounds.fRight - kBoundsTolerance &&
93 outerClipBounds.fRight - outerClipBounds.fLeft <= kBoundsTolerance ||
97 outerClipBounds.fLeft >= queryBounds.fRight - kBoundsTolerance ||
99 outerClipBounds.fRight <= queryBounds.fLeft + kBoundsTolerance ||
109 SkScalarCeilToInt(bounds.fRight - kBoundsTolerance),
119 SkScalarCeilToScalar(bounds.fRight - kBoundsTolerance),
129 SkScalarAbs(SkScalarRoundToScalar(rect.fRight) - rect.fRight) <= kBoundsTolerance &
[all...] |
| /external/skqp/src/gpu/ |
| GrRect.h | 16 int16_t fLeft, fTop, fRight, fBottom;
36 int width() const { return fRight - fLeft; }
39 bool isEmpty() const { return fLeft >= fRight || fTop >= fBottom; }
46 fRight = right;
53 fRight = SkToS16(r.fRight);
62 SkASSERT(!a.isFinite() || (a.fLeft <= a.fRight && a.fTop <= a.fBottom));
63 SkASSERT(!b.isFinite() || (b.fLeft <= b.fRight && b.fTop <= b.fBottom));
64 return a.fRight > b.fLeft && a.fBottom > b.fTop && b.fRight > a.fLeft && b.fBottom > a.fTop
[all...] |
| GrClip.h | 75 return innerClipBounds.fRight > innerClipBounds.fLeft + kBoundsTolerance &&
79 innerClipBounds.fRight > queryBounds.fRight - kBoundsTolerance &&
93 outerClipBounds.fRight - outerClipBounds.fLeft <= kBoundsTolerance ||
97 outerClipBounds.fLeft >= queryBounds.fRight - kBoundsTolerance ||
99 outerClipBounds.fRight <= queryBounds.fLeft + kBoundsTolerance ||
109 SkScalarCeilToInt(bounds.fRight - kBoundsTolerance),
119 SkScalarCeilToScalar(bounds.fRight - kBoundsTolerance),
129 SkScalarAbs(SkScalarRoundToScalar(rect.fRight) - rect.fRight) <= kBoundsTolerance &
[all...] |
| /external/skia/src/sksl/ast/ |
| SkSLASTBinaryExpression.h | 26 , fRight(std::move(right)) {}
30 fRight->description() + ")";
35 const std::unique_ptr<ASTExpression> fRight;
|
| /external/skqp/src/sksl/ast/ |
| SkSLASTBinaryExpression.h | 26 , fRight(std::move(right)) {}
30 fRight->description() + ")";
35 const std::unique_ptr<ASTExpression> fRight;
|
| /external/skia/src/sksl/ir/ |
| SkSLBinaryExpression.h | 27 , fRight(std::move(right)) {}
33 *fRight);
38 fRight->hasSideEffects();
43 fRight->clone(), fType));
48 fRight->description() + ")";
53 std::unique_ptr<Expression> fRight;
|
| /external/skqp/src/sksl/ir/ |
| SkSLBinaryExpression.h | 27 , fRight(std::move(right)) {}
33 *fRight);
38 fRight->hasSideEffects();
43 fRight->clone(), fType));
48 fRight->description() + ")";
53 std::unique_ptr<Expression> fRight;
|
| /external/skia/include/core/ |
| SkRect.h | 40 int32_t fRight; //!< larger x-axis bounds
76 result in fLeft greater than fRight, or fTop greater than fBottom.
80 @param r integer stored in fRight
94 @param w added to x and stored in fRight
104 Call sort() to reverse fLeft and fRight if needed.
118 Call sort() to reverse fLeft and fRight if needed.
120 @return fRight
122 int32_t right() const { return fRight; }
132 and sort() to reverse fLeft and fRight if needed.
151 @return fRight minus fLef
[all...] |
| /external/skqp/include/core/ |
| SkRect.h | 40 int32_t fRight; //!< larger x-axis bounds
76 result in fLeft greater than fRight, or fTop greater than fBottom.
80 @param r integer stored in fRight
94 @param w added to x and stored in fRight
104 Call sort() to reverse fLeft and fRight if needed.
118 Call sort() to reverse fLeft and fRight if needed.
120 @return fRight
122 int32_t right() const { return fRight; }
132 and sort() to reverse fLeft and fRight if needed.
151 @return fRight minus fLef
[all...] |
| /external/skia/src/core/ |
| SkRectPriv.h | 45 r->fRight = SkMaxScalar(pt.fX, r->fRight);
54 SkFitsInFixed(r.fRight) && SkFitsInFixed(r.fBottom);
59 SkTFitsIn<int16_t>(r.fRight) && SkTFitsIn<int16_t>(r.fBottom);
|
| SkValidationUtils.h | 30 return (rect.fLeft <= rect.fRight) &&
|
| SkRect.cpp | 19 if (fLeft >= fRight || fTop >= fBottom) {
24 if (right > fRight) fRight = right;
35 quad[1].set(fRight, fTop);
36 quad[2].set(fRight, fBottom);
97 CHECK_INTERSECT(left, top, right, bottom, fLeft, fTop, fRight, fBottom);
103 return this->intersect(r.fLeft, r.fTop, r.fRight, r.fBottom);
107 CHECK_INTERSECT(a.fLeft, a.fTop, a.fRight, a.fBottom, b.fLeft, b.fTop, b.fRight, b.fBottom);
119 if (fLeft >= fRight || fTop >= fBottom)
[all...] |
| SkLineClipper.cpp | 87 outer.fRight >= inner.fRight && outer.fBottom >= inner.fBottom;
103 if (nestedLT(bounds.fRight, clip.fLeft, bounds.width()) ||
104 nestedLT(clip.fRight, bounds.fLeft, bounds.width()) ||
140 if ((tmp[index1].fX <= clip.fLeft || tmp[index0].fX >= clip.fRight)) {
143 if (tmp[0].fX != tmp[1].fX || tmp[0].fX < clip.fLeft || tmp[0].fX > clip.fRight) {
151 if (tmp[index1].fX > clip.fRight) {
152 tmp[index1].set(clip.fRight, sect_with_vertical(src, clip.fRight));
233 } else if (tmp[index0].fX >= clip.fRight) { // wholly to the righ
[all...] |
| SkBlitBWMaskTemplate.h | 27 SkASSERT(clip.fRight <= srcMask.fBounds.fRight);
43 if (cx == maskLeft && clip.fRight == srcMask.fBounds.fRight)
60 int rite_edge = clip.fRight - maskLeft;
|
| /external/skqp/src/core/ |
| SkRectPriv.h | 45 r->fRight = SkMaxScalar(pt.fX, r->fRight);
54 SkFitsInFixed(r.fRight) && SkFitsInFixed(r.fBottom);
59 SkTFitsIn<int16_t>(r.fRight) && SkTFitsIn<int16_t>(r.fBottom);
|
| SkValidationUtils.h | 30 return (rect.fLeft <= rect.fRight) &&
|
| SkRect.cpp | 19 if (fLeft >= fRight || fTop >= fBottom) {
24 if (right > fRight) fRight = right;
35 quad[1].set(fRight, fTop);
36 quad[2].set(fRight, fBottom);
97 CHECK_INTERSECT(left, top, right, bottom, fLeft, fTop, fRight, fBottom);
103 return this->intersect(r.fLeft, r.fTop, r.fRight, r.fBottom);
107 CHECK_INTERSECT(a.fLeft, a.fTop, a.fRight, a.fBottom, b.fLeft, b.fTop, b.fRight, b.fBottom);
119 if (fLeft >= fRight || fTop >= fBottom)
[all...] |
| SkLineClipper.cpp | 87 outer.fRight >= inner.fRight && outer.fBottom >= inner.fBottom;
103 if (nestedLT(bounds.fRight, clip.fLeft, bounds.width()) ||
104 nestedLT(clip.fRight, bounds.fLeft, bounds.width()) ||
140 if ((tmp[index1].fX <= clip.fLeft || tmp[index0].fX >= clip.fRight)) {
143 if (tmp[0].fX != tmp[1].fX || tmp[0].fX < clip.fLeft || tmp[0].fX > clip.fRight) {
151 if (tmp[index1].fX > clip.fRight) {
152 tmp[index1].set(clip.fRight, sect_with_vertical(src, clip.fRight));
233 } else if (tmp[index0].fX >= clip.fRight) { // wholly to the righ
[all...] |
| /external/skia/tests/ |
| BlitMaskClip.cpp | 25 REPORTER_ASSERT(fReporter, x >= fBounds.fLeft && x < fBounds.fRight);
28 REPORTER_ASSERT(fReporter, right > fBounds.fLeft && right <= fBounds.fRight);
63 for (int left = b.fLeft; left < b.fRight; left++) {
64 for (int right = left + 1; right <= b.fRight; right++) {
|
| /external/skqp/tests/ |
| BlitMaskClip.cpp | 25 REPORTER_ASSERT(fReporter, x >= fBounds.fLeft && x < fBounds.fRight);
28 REPORTER_ASSERT(fReporter, right > fBounds.fLeft && right <= fBounds.fRight);
63 for (int left = b.fLeft; left < b.fRight; left++) {
64 for (int right = left + 1; right <= b.fRight; right++) {
|
