Searched refs:fLeft (Results 1 - 25 of 304) sorted by relevance

1234567891011>>

/external/skia/src/gpu/gl/
H A DGrGLIRect.h21 GrGLint fLeft; member in struct:GrGLIRect
30 return &fLeft;
32 GR_STATIC_ASSERT(0 == offsetof(GrGLIRect, fLeft));
38 int* asInts() { return &fLeft; }
41 GR_GL_CALL(gl, Viewport(fLeft, fBottom, fWidth, fHeight));
45 GR_GL_CALL(gl, Scissor(fLeft, fBottom, fWidth, fHeight));
67 fLeft = glRect.fLeft + leftOffset;
81 return fLeft <= glRect.fLeft
[all...]
/external/skia/src/pathops/
H A DSkPathOpsBounds.h16 return AlmostLessOrEqualUlps(a.fLeft, b.fRight)
17 && AlmostLessOrEqualUlps(b.fLeft, a.fRight)
26 if (left < fLeft) fLeft = left;
33 add(toAdd.fLeft, toAdd.fTop, toAdd.fRight, toAdd.fBottom);
37 if (pt.fX < fLeft) fLeft = pt.fX;
44 if (pt.fX < fLeft) fLeft = SkDoubleToScalar(pt.fX);
51 return AlmostLessOrEqualUlps(fLeft, p
[all...]
H A DSkPathOpsRect.h13 double fLeft, fTop, fRight, fBottom; member in struct:SkDRect
16 fLeft = SkTMin(fLeft, pt.fX);
23 return approximately_between(fLeft, pt.fX, fRight)
30 SkASSERT(fLeft <= fRight);
32 SkASSERT(r.fLeft <= r.fRight);
34 return r.fLeft <= fRight && fLeft <= r.fRight && r.fTop <= fBottom && fTop <= r.fBottom;
38 fLeft = fRight = pt.fX;
43 return fRight - fLeft;
[all...]
/external/pdfium/core/fpdfdoc/
H A Dcpdf_iconfit.cpp31 void CPDF_IconFit::GetIconPosition(FX_FLOAT& fLeft, FX_FLOAT& fBottom) { argument
32 fLeft = fBottom = 0.5;
40 fLeft = pA->GetNumberAt(0);
H A Dcpdf_iconfit.h22 void GetIconPosition(FX_FLOAT& fLeft, FX_FLOAT& fBottom);
/external/skia/src/sksl/ast/
H A DSkSLASTBinaryExpression.h23 , fLeft(std::move(left))
28 return "(" + fLeft->description() + " " + Token::OperatorName(fOperator) + " " +
32 const std::unique_ptr<ASTExpression> fLeft; member in struct:SkSL::ASTBinaryExpression
/external/skia/src/sksl/ir/
H A DSkSLBinaryExpression.h25 , fLeft(std::move(left))
32 return irGenerator.constantFold(*fLeft,
38 return "(" + fLeft->description() + " " + Token::OperatorName(fOperator) + " " +
42 std::unique_ptr<Expression> fLeft; member in struct:SkSL::BinaryExpression
/external/skia/include/core/
H A DSkRect.h21 int32_t fLeft, fTop, fRight, fBottom; member in struct:SkIRect
59 int left() const { return fLeft; }
65 int x() const { return fLeft; }
72 int width() const { return fRight - fLeft; }
89 int centerX() const { return (fRight + fLeft) >> 1; }
103 bool isEmpty() const { return fLeft >= fRight || fTop >= fBottom; }
105 bool isLargest() const { return SK_MinS32 == fLeft &&
119 return SkIsS16(fLeft) && SkIsS16(fTop) &&
128 fLeft = left;
139 fLeft
268 SkASSERT(fLeft < fRight && fTop < fBottom); SkASSERT(left < right && top < bottom); return fLeft <= left && fTop <= top && fRight >= right && fBottom >= bottom; } bool containsNoEmptyCheck(const SkIRect& r) const { return containsNoEmptyCheck(r.fLeft, r.fTop, r.fRight, r.fBottom); } bool intersect(const SkIRect& r) { return this->intersect(r.fLeft, r.fTop, r.fRight, r.fBottom); } bool SK_WARN_UNUSED_RESULT intersect(const SkIRect& a, const SkIRect& b) { if (!a.isEmpty() && !b.isEmpty() && a.fLeft < b.fRight && b.fLeft < a.fRight && a.fTop < b.fBottom && b.fTop < a.fBottom) { fLeft = SkMax32(a.fLeft, b.fLeft); fTop = SkMax32(a.fTop, b.fTop); fRight = SkMin32(a.fRight, b.fRight); fBottom = SkMin32(a.fBottom, b.fBottom); return true; } return false; } bool SK_WARN_UNUSED_RESULT intersectNoEmptyCheck(const SkIRect& a, const SkIRect& b) { SkASSERT(!a.isEmpty() && !b.isEmpty()); if (a.fLeft < b.fRight && b.fLeft < a.fRight && a.fTop < b.fBottom && b.fTop < a.fBottom) { fLeft = SkMax32(a.fLeft, b.fLeft); fTop = SkMax32(a.fTop, b.fTop); fRight = SkMin32(a.fRight, b.fRight); fBottom = SkMin32(a.fBottom, b.fBottom); return true; } return false; } bool intersect(int32_t left, int32_t top, int32_t right, int32_t bottom) { if (left < right && top < bottom && !this->isEmpty() && fLeft < right && left < fRight && fTop < bottom && top < fBottom) { if (fLeft < left) fLeft = left; if (fTop < top) fTop = top; if (fRight > right) fRight = right; if (fBottom > bottom) fBottom = bottom; return true; } return false; } static bool Intersects(const SkIRect& a, const SkIRect& b) { return !a.isEmpty() && !b.isEmpty() && a.fLeft < b.fRight && b.fLeft < a.fRight && a.fTop < b.fBottom && b.fTop < a.fBottom; } static bool IntersectsNoEmptyCheck(const SkIRect& a, const SkIRect& b) { SkASSERT(!a.isEmpty()); SkASSERT(!b.isEmpty()); return a.fLeft < b.fRight && b.fLeft < a.fRight && a.fTop < b.fBottom && b.fTop < a.fBottom; } void join(int32_t left, int32_t top, int32_t right, int32_t bottom); void join(const SkIRect& r) { this->join(r.fLeft, r.fTop, r.fRight, r.fBottom); } void sort(); static const SkIRect& SK_WARN_UNUSED_RESULT EmptyIRect() { static const SkIRect gEmpty = { 0, 0, 0, 0 }; return gEmpty; } }; struct SK_API SkRect { SkScalar fLeft, fTop, fRight, fBottom; static constexpr SkRect SK_WARN_UNUSED_RESULT MakeEmpty() { return SkRect{0, 0, 0, 0}; } static SkRect SK_WARN_UNUSED_RESULT MakeLargest() { SkRect r; r.setLargest(); return r; } static SkRect SK_WARN_UNUSED_RESULT MakeWH(SkScalar w, SkScalar h) { SkRect r; r.set(0, 0, w, h); return r; } static SkRect SK_WARN_UNUSED_RESULT MakeIWH(int w, int h) { SkRect r; r.set(0, 0, SkIntToScalar(w), SkIntToScalar(h)); return r; } static SkRect SK_WARN_UNUSED_RESULT MakeSize(const SkSize& size) { SkRect r; r.set(0, 0, size.width(), size.height()); return r; } static constexpr SkRect SK_WARN_UNUSED_RESULT MakeLTRB(SkScalar l, SkScalar t, SkScalar r, SkScalar b) { return SkRect {l, t, r, b}; } static SkRect SK_WARN_UNUSED_RESULT MakeXYWH(SkScalar x, SkScalar y, SkScalar w, SkScalar h) { SkRect r; r.set(x, y, x + w, y + h); return r; } SK_ATTR_DEPRECATED(�) static SkRect SK_WARN_UNUSED_RESULT MakeFromIRect(const SkIRect& irect) { SkRect r; r.set(SkIntToScalar(irect.fLeft), SkIntToScalar(irect.fTop), SkIntToScalar(irect.fRight), SkIntToScalar(irect.fBottom)); return r; } static SkRect Make(const SkISize& size) { return MakeIWH(size.width(), size.height()); } static SkRect SK_WARN_UNUSED_RESULT Make(const SkIRect& irect) { SkRect r; r.set(SkIntToScalar(irect.fLeft), SkIntToScalar(irect.fTop), SkIntToScalar(irect.fRight), SkIntToScalar(irect.fBottom)); return r; } bool isEmpty() const { return fLeft >= fRight || fTop >= fBottom; } bool isLargest() const { return SK_ScalarMin == fLeft && SK_ScalarMin == fTop && SK_ScalarMax == fRight && SK_ScalarMax == fBottom; } bool isFinite() const { float accum = 0; accum *= fLeft; accum *= fTop; accum *= fRight; accum *= fBottom; SkASSERT(0 == accum || SkScalarIsNaN(accum)); return !SkScalarIsNaN(accum); } SkScalar x() const { return fLeft; } SkScalar y() const { return fTop; } SkScalar left() const { return fLeft; } SkScalar top() const { return fTop; } SkScalar right() const { return fRight; } SkScalar bottom() const { return fBottom; } SkScalar width() const { return fRight - fLeft; } SkScalar height() const { return fBottom - fTop; } SkScalar centerX() const { return SkScalarHalf(fLeft + fRight); } SkScalar centerY() const { return SkScalarHalf(fTop + fBottom); } friend bool operator==(const SkRect& a, const SkRect& b) { return SkScalarsEqual((SkScalar*)&a, (SkScalar*)&b, 4); } friend bool operator!=(const SkRect& a, const SkRect& b) { return !SkScalarsEqual((SkScalar*)&a, (SkScalar*)&b, 4); } void toQuad(SkPoint quad[4]) const; void setEmpty() { *this = MakeEmpty(); } void set(const SkIRect& src) { fLeft = SkIntToScalar(src.fLeft); fTop = SkIntToScalar(src.fTop); fRight = SkIntToScalar(src.fRight); fBottom = SkIntToScalar(src.fBottom); } void set(SkScalar left, SkScalar top, SkScalar right, SkScalar bottom) { fLeft = left; fTop = top; fRight = right; fBottom = bottom; } void setLTRB(SkScalar left, SkScalar top, SkScalar right, SkScalar bottom) { this->set(left, top, right, bottom); } void iset(int left, int top, int right, int bottom) { fLeft = SkIntToScalar(left); fTop = SkIntToScalar(top); fRight = SkIntToScalar(right); fBottom = SkIntToScalar(bottom); } void isetWH(int width, int height) { fLeft = fTop = 0; fRight = SkIntToScalar(width); fBottom = SkIntToScalar(height); } void set(const SkPoint pts[], int count) { (void)this->setBoundsCheck(pts, count); } void setBounds(const SkPoint pts[], int count) { (void)this->setBoundsCheck(pts, count); } bool setBoundsCheck(const SkPoint pts[], int count); void set(const SkPoint& p0, const SkPoint& p1) { fLeft = SkMinScalar(p0.fX, p1.fX); fRight = SkMaxScalar(p0.fX, p1.fX); fTop = SkMinScalar(p0.fY, p1.fY); fBottom = SkMaxScalar(p0.fY, p1.fY); } void setXYWH(SkScalar x, SkScalar y, SkScalar width, SkScalar height) { fLeft = x; fTop = y; fRight = x + width; fBottom = y + height; } void setWH(SkScalar width, SkScalar height) { fLeft = 0; fTop = 0; fRight = width; fBottom = height; } void setLargest() { fLeft = fTop = SK_ScalarMin; fRight = fBottom = SK_ScalarMax; } void setLargestInverted() { fLeft = fTop = SK_ScalarMax; fRight = fBottom = SK_ScalarMin; } SkRect makeOffset(SkScalar dx, SkScalar dy) const { return MakeLTRB(fLeft + dx, fTop + dy, fRight + dx, fBottom + dy); } SkRect makeInset(SkScalar dx, SkScalar dy) const { return MakeLTRB(fLeft + dx, fTop + dy, fRight - dx, fBottom - dy); } SkRect makeOutset(SkScalar dx, SkScalar dy) const { return MakeLTRB(fLeft - dx, fTop - dy, fRight + dx, fBottom + dy); } void offset(SkScalar dx, SkScalar dy) { fLeft += dx; fTop += dy; fRight += dx; fBottom += dy; } void offset(const SkPoint& delta) { this->offset(delta.fX, delta.fY); } void offsetTo(SkScalar newX, SkScalar newY) { fRight += newX - fLeft; fBottom += newY - fTop; fLeft = newX; fTop = newY; } void inset(SkScalar dx, SkScalar dy) { fLeft += dx; fTop += dy; fRight -= dx; fBottom -= dy; } void outset(SkScalar dx, SkScalar dy) { this->inset(-dx, -dy); } bool intersect(const SkRect& r); bool intersect(SkScalar left, SkScalar top, SkScalar right, SkScalar bottom); bool SK_WARN_UNUSED_RESULT intersect(const SkRect& a, const SkRect& b); private: static bool Intersects(SkScalar al, SkScalar at, SkScalar ar, SkScalar ab, SkScalar bl, SkScalar bt, SkScalar br, SkScalar bb) { SkScalar L = SkMaxScalar(al, bl); SkScalar R = SkMinScalar(ar, br); SkScalar T = SkMaxScalar(at, bt); SkScalar B = SkMinScalar(ab, bb); return L < R && T < B; } public: bool intersects(SkScalar left, SkScalar top, SkScalar right, SkScalar bottom) const { return Intersects(fLeft, fTop, fRight, fBottom, left, top, right, bottom); } bool intersects(const SkRect& r) const { return Intersects(fLeft, fTop, fRight, fBottom, r.fLeft, r.fTop, r.fRight, r.fBottom); } static bool Intersects(const SkRect& a, const SkRect& b) { return Intersects(a.fLeft, a.fTop, a.fRight, a.fBottom, b.fLeft, b.fTop, b.fRight, b.fBottom); } void join(SkScalar left, SkScalar top, SkScalar right, SkScalar bottom); void join(const SkRect& r) { this->join(r.fLeft, r.fTop, r.fRight, r.fBottom); } void joinNonEmptyArg(const SkRect& r) { SkASSERT(!r.isEmpty()); if (fLeft >= fRight || fTop >= fBottom) { *this = r; } else { this->joinPossiblyEmptyRect(r); } } void joinPossiblyEmptyRect(const SkRect& r) { fLeft = SkMinScalar(fLeft, r.left()); fTop = SkMinScalar(fTop, r.top()); fRight = SkMaxScalar(fRight, r.right()); fBottom = SkMaxScalar(fBottom, r.bottom()); } void growToInclude(SkScalar x, SkScalar y) { fLeft = SkMinScalar(x, fLeft); fRight = SkMaxScalar(x, fRight); fTop = SkMinScalar(y, fTop); fBottom = SkMaxScalar(y, fBottom); } void growToInclude(const SkPoint pts[], int count) { this->growToInclude(pts, sizeof(SkPoint), count); } void growToInclude(const SkPoint pts[], size_t stride, int count) { SkASSERT(count >= 0); SkASSERT(stride >= sizeof(SkPoint)); const SkPoint* end = (const SkPoint*)((intptr_t)pts + count * stride); for (; pts < end; pts = (const SkPoint*)((intptr_t)pts + stride)) { this->growToInclude(pts->fX, pts->fY); } } bool contains(const SkRect& r) const { return !r.isEmpty() && !this->isEmpty() && fLeft <= r.fLeft && fTop <= r.fTop && fRight >= r.fRight && fBottom >= r.fBottom; } bool contains(const SkIRect& r) const { return !r.isEmpty() && !this->isEmpty() && fLeft <= SkIntToScalar(r.fLeft) && fTop <= SkIntToScalar(r.fTop) && fRight >= SkIntToScalar(r.fRight) && fBottom >= SkIntToScalar(r.fBottom); } void round(SkIRect* dst) const { SkASSERT(dst); dst->set(SkScalarRoundToInt(fLeft), SkScalarRoundToInt(fTop), SkScalarRoundToInt(fRight), SkScalarRoundToInt(fBottom)); } void roundOut(SkIRect* dst) const { SkASSERT(dst); dst->set(SkScalarFloorToInt(fLeft), SkScalarFloorToInt(fTop), SkScalarCeilToInt(fRight), SkScalarCeilToInt(fBottom)); } void roundOut(SkRect* dst) const { dst->set(SkScalarFloorToScalar(fLeft), SkScalarFloorToScalar(fTop), SkScalarCeilToScalar(fRight), SkScalarCeilToScalar(fBottom)); } void roundIn(SkIRect* dst) const { SkASSERT(dst); dst->set(SkScalarCeilToInt(fLeft), SkScalarCeilToInt(fTop), SkScalarFloorToInt(fRight), SkScalarFloorToInt(fBottom)); } SkIRect round() const { SkIRect ir; this->round(&ir); return ir; } SkIRect roundOut() const { SkIRect ir; this->roundOut(&ir); return ir; } void sort() { if (fLeft > fRight) argument
[all...]
H A DSkMask.h63 return fImage + ((x - fBounds.fLeft) >> 3) + (y - fBounds.fTop) * fRowBytes;
74 return fImage + x - fBounds.fLeft + (y - fBounds.fTop) * fRowBytes;
87 return row + (x - fBounds.fLeft);
100 return row + (x - fBounds.fLeft);
/external/skia/src/gpu/
H A DGrRect.h15 int16_t fLeft, fTop, fRight, fBottom; member in struct:GrIRect16
35 int width() const { return fRight - fLeft; }
38 bool isEmpty() const { return fLeft >= fRight || fTop >= fBottom; }
43 fLeft = left;
50 fLeft = SkToS16(r.fLeft);
H A DGrClip.h77 return innerClipBounds.fRight - innerClipBounds.fLeft > kBoundsTolerance &&
79 innerClipBounds.fLeft < queryBounds.fLeft + kBoundsTolerance &&
93 return outerClipBounds.fRight - outerClipBounds.fLeft <= kBoundsTolerance ||
95 outerClipBounds.fLeft >= queryBounds.fRight - kBoundsTolerance ||
97 outerClipBounds.fRight <= queryBounds.fLeft + kBoundsTolerance ||
105 return SkIRect::MakeLTRB(SkScalarFloorToInt(bounds.fLeft + kBoundsTolerance),
115 return SkRect::MakeLTRB(SkScalarFloorToScalar(bounds.fLeft + kBoundsTolerance),
125 return SkScalarAbs(SkScalarRoundToScalar(rect.fLeft) - rect.fLeft) <
[all...]
H A DGrTextureProducer.cpp174 if (contentRect->fLeft > 0 &&
175 contentRect->fLeft + filterHalfWidth > constraintRect.fLeft) {
176 domainRect->fLeft = contentRect->fLeft + kDomainInset;
200 if (contentRect->fLeft > 0) {
201 domainRect->fLeft = contentRect->fLeft + kDomainInset;
217 if (domainRect->fLeft > domainRect->fRight) {
218 domainRect->fLeft
[all...]
/external/skia/src/core/
H A DSkRect.cpp19 if (fLeft >= fRight || fTop >= fBottom) {
22 if (left < fLeft) fLeft = left;
30 if (fLeft > fRight) {
31 SkTSwap<int32_t>(fLeft, fRight);
43 quad[0].set(fLeft, fTop);
46 quad[3].set(fLeft, fBottom);
115 CHECK_INTERSECT(left, top, right, bottom, fLeft, fTop, fRight, fBottom);
121 return this->intersect(r.fLeft, r.fTop, r.fRight, r.fBottom);
125 CHECK_INTERSECT(a.fLeft,
[all...]
H A DSkScan.h98 xr->fLeft = SkIntToFixed(src.fLeft);
109 xr->fLeft = SkScalarToFixed(src.fLeft);
118 dst->fLeft = SkFixedRoundToInt(xr.fLeft);
128 dst->fLeft = SkFixedFloorToInt(xr.fLeft);
H A DSkValidationUtils.h36 return (rect.fLeft <= rect.fRight) &&
H A DSkLineClipper.cpp73 return outer.fLeft <= inner.fLeft && outer.fTop <= inner.fTop &&
90 if (nestedLT(bounds.fRight, clip.fLeft, bounds.width()) ||
91 nestedLT(clip.fRight, bounds.fLeft, bounds.width()) ||
127 if ((tmp[index1].fX <= clip.fLeft || tmp[index0].fX >= clip.fRight) &&
133 if (tmp[index0].fX < clip.fLeft) {
134 tmp[index0].set(clip.fLeft, sect_with_vertical(src, clip.fLeft));
214 if (tmp[index1].fX <= clip.fLeft) { // wholly to the left
215 tmp[0].fX = tmp[1].fX = clip.fLeft;
[all...]
H A DSkLatticeIter.cpp34 latticeBounds.fLeft == lattice.fXDivs[0]);
41 return valid_divs(lattice.fXDivs, lattice.fXCount, latticeBounds.fLeft, latticeBounds.fRight)
133 bool xIsScalable = (xCount > 0 && src.fLeft == xDivs[0]);
149 int xCountScalable = count_scalable_pixels(xDivs, xCount, xIsScalable, src.fLeft, src.fRight);
157 src.fLeft, src.fRight, dst.fLeft, dst.fRight, xIsScalable);
216 fSrcX[1] = SkIntToScalar(c.fLeft);
225 fDstX[0] = dst.fLeft;
226 fDstX[1] = dst.fLeft + SkIntToScalar(c.fLeft);
[all...]
/external/skia/src/gpu/ops/
H A DGrCopySurfaceOp.cpp21 if (clippedSrcRect->fLeft < 0) {
22 clippedDstPoint->fX -= clippedSrcRect->fLeft;
23 clippedSrcRect->fLeft = 0;
26 clippedSrcRect->fLeft -= clippedDstPoint->fX;
45 clippedSrcRect->fRight = clippedSrcRect->fLeft + dst->width() - clippedDstPoint->fX;
H A DGrNonAAStrokeRectOp.cpp29 verts[0].set(rect.fLeft + rad, rect.fTop + rad);
30 verts[1].set(rect.fLeft - rad, rect.fTop - rad);
35 verts[6].set(rect.fLeft + rad, rect.fBottom - rad);
36 verts[7].set(rect.fLeft - rad, rect.fBottom + rad);
60 fColor, fRect.fLeft, fRect.fTop, fRect.fRight, fRect.fBottom, fStrokeWidth);
90 bounds.set(SkScalarFloorToScalar(bounds.fLeft),
152 vertex[0].set(fRect.fLeft, fRect.fTop);
155 vertex[3].set(fRect.fLeft, fRect.fBottom);
156 vertex[4].set(fRect.fLeft, fRect.fTop);
/external/pdfium/xfa/fwl/theme/
H A Dcfwl_widgettp.cpp188 FX_FLOAT fLeft = local
195 path.MoveTo(CFX_PointF(fLeft, fTop + 1));
196 path.LineTo(CFX_PointF(fLeft + 4, fTop + 5));
197 path.LineTo(CFX_PointF(fLeft + 8, fTop + 1));
198 path.LineTo(CFX_PointF(fLeft + 7, fTop));
199 path.LineTo(CFX_PointF(fLeft + 4, fTop + 3));
200 path.LineTo(CFX_PointF(fLeft + 1, fTop));
204 path.MoveTo(CFX_PointF(fLeft, fTop + 4));
205 path.LineTo(CFX_PointF(fLeft + 4, fTop));
206 path.LineTo(CFX_PointF(fLeft
[all...]
/external/skia/bench/
H A DRTreeBench.cpp84 query.fLeft = rand.nextRangeF(0, GENERATE_EXTENTS);
86 query.fRight = query.fLeft + 1 + rand.nextRangeF(0, GENERATE_EXTENTS/2);
100 out.fLeft = SkIntToScalar(index % GRID_WIDTH);
102 out.fRight = out.fLeft + 1 + rand.nextRangeF(0, GENERATE_EXTENTS/3);
108 out.fLeft = SkIntToScalar(index / GRID_WIDTH);
110 out.fRight = out.fLeft + 1 + rand.nextRangeF(0, GENERATE_EXTENTS/3);
117 out.fLeft = rand.nextRangeF(0, GENERATE_EXTENTS);
119 out.fRight = out.fLeft + 1 + rand.nextRangeF(0, GENERATE_EXTENTS/5);
/external/skia/src/android/
H A DSkBitmapRegionDecoderPriv.h38 int left = SkTMax(0, subset->fLeft);
42 *outX = left - subset->fLeft;
/external/skia/src/effects/
H A DSkImageSource.cpp87 int iLeft = dstRect.fLeft;
92 iLeft == dstRect.fLeft && iTop == dstRect.fTop) {
119 dstRect.offset(-SkIntToScalar(dstIRect.fLeft), -SkIntToScalar(dstIRect.fTop));
129 offset->fX = dstIRect.fLeft;
142 fSrcRect.fLeft, fSrcRect.fTop, fSrcRect.fRight, fSrcRect.fBottom,
143 fDstRect.fLeft, fDstRect.fTop, fDstRect.fRight, fDstRect.fBottom);
/external/skia/tests/
H A DBlitMaskClip.cpp21 REPORTER_ASSERT(fReporter, x >= fBounds.fLeft && x < fBounds.fRight);
24 REPORTER_ASSERT(fReporter, right > fBounds.fLeft && right <= fBounds.fRight);
59 for (int left = b.fLeft; left < b.fRight; left++) {
/external/skia/samplecode/
H A DSampleLayerMask.cpp44 bounds.offset(-bounds.fLeft, -bounds.fTop);
48 canvas->drawBitmap(mask, r.fLeft, r.fTop, &paint);

Completed in 370 milliseconds

1234567891011>>