/external/skia/src/gpu/gl/ |
H A D | GrGLIRect.h | 21 GrGLint fLeft; member in struct:GrGLIRect 27 GR_GL_CALL(gl, Viewport(fLeft, fBottom, fWidth, fHeight)); 31 GR_GL_CALL(gl, Scissor(fLeft, fBottom, fWidth, fHeight)); 48 fLeft = glRect.fLeft + leftOffset; 57 SkASSERT(fLeft >= 0); 64 return fLeft <= glRect.fLeft && 66 fLeft + fWidth >= glRect.fLeft [all...] |
H A D | GrGLNameAllocator.cpp | 129 : fLeft(left), 131 SkASSERT(fLeft.get()); 137 // Try allocating the range inside fLeft's internal gaps. 138 fLeft.reset(fLeft->internalAllocate(outName)); 144 if (fLeft->end() + 1 == fRight->first()) { 145 // It closed the gap between fLeft and fRight; merge. 148 *outName = fLeft->appendNames(1 + removedCount); 150 return fLeft.detach(); 156 // There is guaranteed to be a gap between fLeft an 266 SkAutoTUnref<SparseNameRange> fLeft; member in class:GrGLNameAllocator::SparseNameTree [all...] |
/external/skia/src/pathops/ |
H A D | SkPathOpsRect.h | 13 double fLeft, fTop, fRight, fBottom; member in struct:SkDRect 16 fLeft = SkTMin(fLeft, pt.fX); 23 return approximately_between(fLeft, pt.fX, fRight) 28 if (fLeft > fRight) { 31 SkASSERT(fLeft <= fRight); 33 SkASSERT(r.fLeft <= r.fRight); 35 return r.fLeft <= fRight && fLeft <= r.fRight && r.fTop <= fBottom && fTop <= r.fBottom; 39 fLeft [all...] |
H A D | SkPathOpsBounds.h | 16 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 = SkDoubleToScalar(pt.fX); 44 return AlmostLessOrEqualUlps(fLeft, pt.fX)
|
H A D | SkPathOpsCurve.cpp | 17 bounds->set(SkDoubleToScalar(dRect.fLeft), SkDoubleToScalar(dRect.fTop), 27 bounds->set(SkDoubleToScalar(dRect.fLeft), SkDoubleToScalar(dRect.fTop), 37 bounds->set(SkDoubleToScalar(dRect.fLeft), SkDoubleToScalar(dRect.fTop),
|
/external/skia/src/animator/ |
H A D | SkBoundable.cpp | 22 fBounds.fLeft = 0x7fff; 27 if (fBounds.fLeft == (int16_t)0x8000U) { 31 rect->fLeft = SkIntToScalar(fBounds.fLeft); 38 fBounds.fLeft = 0;
|
H A D | SkBoundable.h | 22 bool hasBounds() { return fBounds.fLeft != (int16_t)0x8000U; } 25 void clearBounds() { fBounds.fLeft = (int16_t) SkToU16(0x8000); }; // mark bounds as unset
|
H A D | SkDrawPoint.cpp | 42 rect->fLeft = rect->fRight = fPoint.fX;
|
H A D | SkDrawRectangle.cpp | 28 SK_MEMBER_ALIAS(left, fRect.fLeft, Float), 58 SkScalarToFloat(fRect.fLeft), SkScalarToFloat(fRect.fTop), SkScalarToFloat(fRect.fRight), 106 fRect.fRight = scalar + fRect.fLeft; 139 SkScalarToFloat(fRect.fLeft), SkScalarToFloat(fRect.fTop), SkScalarToFloat(fRect.fRight),
|
/external/skia/include/core/ |
H A D | SkRect.h | 21 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 [all...] |
H A D | SkMask.h | 61 return fImage + ((x - fBounds.fLeft) >> 3) + (y - fBounds.fTop) * fRowBytes; 72 return fImage + x - fBounds.fLeft + (y - fBounds.fTop) * fRowBytes; 85 return row + (x - fBounds.fLeft); 98 return row + (x - fBounds.fLeft);
|
/external/skia/include/gpu/ |
H A D | GrRect.h | 15 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);
|
/external/skia/include/views/animated/ |
H A D | SkBorderView.h | 22 SkScalar getLeft() const { return fLeft; } 34 SkScalar fLeft, fRight, fTop, fBottom; //margin on each side member in class:SkBorderView
|
/external/skia/src/core/ |
H A D | SkRect.cpp | 18 if (fLeft >= fRight || fTop >= fBottom) { 21 if (left < fLeft) fLeft = left; 29 if (fLeft > fRight) { 30 SkTSwap<int32_t>(fLeft, fRight); 42 quad[0].set(fLeft, fTop); 45 quad[3].set(fLeft, fBottom); 114 CHECK_INTERSECT(left, top, right, bottom, fLeft, fTop, fRight, fBottom); 120 return this->intersect(r.fLeft, r.fTop, r.fRight, r.fBottom); 124 CHECK_INTERSECT(a.fLeft, [all...] |
H A D | SkScan.h | 85 xr->fLeft = SkIntToFixed(src.fLeft); 96 xr->fLeft = SkScalarToFixed(src.fLeft); 105 dst->fLeft = SkFixedRoundToInt(xr.fLeft); 115 dst->fLeft = SkFixedFloorToInt(xr.fLeft);
|
H A D | SkLineClipper.cpp | 73 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)); 240 if (tmp[index1].fX <= clip.fLeft) { // wholly to the left 241 tmp[0].fX = tmp[1].fX = clip.fLeft; [all...] |
H A D | SkEdgeClipper.cpp | 146 if (pts[2].fX <= clip.fLeft) { // wholly to the left 147 this->appendVLine(clip.fLeft, pts[0].fY, pts[2].fY, reverse); 161 if (pts[0].fX < clip.fLeft) { 162 if (chopMonoQuadAtX(pts, clip.fLeft, &t)) { 164 this->appendVLine(clip.fLeft, tmp[0].fY, tmp[2].fY, reverse); 166 tmp[2].fX = clip.fLeft; 167 clamp_ge(tmp[3].fX, clip.fLeft); 174 this->appendVLine(clip.fLeft, pts[0].fY, pts[2].fY, reverse); 294 if (pts[3].fX <= clip.fLeft) { // wholly to the left 295 this->appendVLine(clip.fLeft, pt [all...] |
H A D | SkValidationUtils.h | 35 return (rect.fLeft <= rect.fRight) &&
|
H A D | SkBlitter.cpp | 125 int cx = clip.fLeft; 127 int maskLeft = mask.fBounds.fLeft; 182 const uint8_t* aa = mask.getAddr8(clip.fLeft, clip.fTop); 190 this->blitAntiH(clip.fLeft, y, aa, runs); 218 this->blitRect(cr.fLeft, cr.fTop, cr.width(), cr.height()); 228 this->blitRect(cr.fLeft, cr.fTop, cr.width(), cr.height()); 275 return (unsigned)(x - rect.fLeft) < (unsigned)rect.width(); 287 if (left < fClipRect.fLeft) { 288 left = fClipRect.fLeft; 309 if (x1 <= fClipRect.fLeft) { [all...] |
/external/skia/src/gpu/ |
H A D | GrReorderCommandBuilder.cpp | 11 SkASSERT(a.fLeft <= a.fRight && a.fTop <= a.fBottom && 12 b.fLeft <= b.fRight && b.fTop <= b.fBottom); 13 return a.fLeft < b.fRight && b.fLeft < a.fRight &&
|
H A D | GrSoftwarePathRenderer.cpp | 95 rect.iset(devClipBounds.fLeft, devClipBounds.fTop, 99 if (devClipBounds.fLeft < devPathBounds.fLeft) { 100 rect.iset(devClipBounds.fLeft, devPathBounds.fTop, 101 devPathBounds.fLeft, devPathBounds.fBottom); 110 rect.iset(devClipBounds.fLeft, devPathBounds.fBottom,
|
/external/skia/bench/ |
H A D | RTreeBench.cpp | 84 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/svg/parser/ |
H A D | SkSVGSVG.cpp | 48 if (box.fLeft == 0 && box.fTop == 0 && 52 if (box.fLeft != 0) { 54 x.appendScalar(box.fLeft);
|
/external/skia/src/views/animated/ |
H A D | SkBorderView.cpp | 15 SkBorderView::SkBorderView() : fLeft(SkIntToScalar(0)), 73 evt.findScalar("leftMargin", &fLeft); 81 fMargin.set(fLeft, fTop, fRight, fBottom);
|
/external/skia/samplecode/ |
H A D | SampleLayerMask.cpp | 43 bounds.offset(-bounds.fLeft, -bounds.fTop); 47 canvas->drawBitmap(mask, r.fLeft, r.fTop, &paint);
|