/external/skia/src/pathops/ |
H A D | SkPathOpsBounds.h | 18 && AlmostLessOrEqualUlps(a.fTop, b.fBottom) 19 && AlmostLessOrEqualUlps(b.fTop, a.fBottom); 27 if (top < fTop) fTop = top; 33 add(toAdd.fLeft, toAdd.fTop, toAdd.fRight, toAdd.fBottom); 38 if (pt.fY < fTop) fTop = pt.fY; 45 if (pt.fY < fTop) fTop = SkDoubleToScalar(pt.fY); 53 && AlmostLessOrEqualUlps(fTop, p [all...] |
H A D | SkPathOpsRect.h | 13 double fLeft, fTop, fRight, fBottom; member in struct:SkDRect 17 fTop = SkTMin(fTop, pt.fY); 24 && approximately_between(fTop, pt.fY, fBottom); 31 SkASSERT(fTop <= fBottom); 33 SkASSERT(r.fTop <= r.fBottom); 34 return r.fLeft <= fRight && fLeft <= r.fRight && r.fTop <= fBottom && fTop <= r.fBottom; 39 fTop = fBottom = pt.fY; 47 return fBottom - fTop; [all...] |
/external/skqp/src/pathops/ |
H A D | SkPathOpsBounds.h | 18 && AlmostLessOrEqualUlps(a.fTop, b.fBottom) 19 && AlmostLessOrEqualUlps(b.fTop, a.fBottom); 27 if (top < fTop) fTop = top; 33 add(toAdd.fLeft, toAdd.fTop, toAdd.fRight, toAdd.fBottom); 38 if (pt.fY < fTop) fTop = pt.fY; 45 if (pt.fY < fTop) fTop = SkDoubleToScalar(pt.fY); 53 && AlmostLessOrEqualUlps(fTop, p [all...] |
H A D | SkPathOpsRect.h | 13 double fLeft, fTop, fRight, fBottom; member in struct:SkDRect 17 fTop = SkTMin(fTop, pt.fY); 24 && approximately_between(fTop, pt.fY, fBottom); 31 SkASSERT(fTop <= fBottom); 33 SkASSERT(r.fTop <= r.fBottom); 34 return r.fLeft <= fRight && fLeft <= r.fRight && r.fTop <= fBottom && fTop <= r.fBottom; 39 fTop = fBottom = pt.fY; 47 return fBottom - fTop; [all...] |
/external/skia/src/gpu/ |
H A D | GrRect.h | 15 int16_t fLeft, fTop, fRight, fBottom; member in struct:GrIRect16 36 int height() const { return fBottom - fTop; } 38 bool isEmpty() const { return fLeft >= fRight || fTop >= fBottom; } 44 fTop = top; 51 fTop = SkToS16(r.fTop); 61 SkASSERT(!a.isFinite() || (a.fLeft <= a.fRight && a.fTop <= a.fBottom)); 62 SkASSERT(!b.isFinite() || (b.fLeft <= b.fRight && b.fTop <= b.fBottom)); 63 return a.fRight > b.fLeft && a.fBottom > b.fTop && b.fRight > a.fLeft && b.fBottom > a.fTop; [all...] |
H A D | GrClip.h | 76 innerClipBounds.fBottom > innerClipBounds.fTop + kBoundsTolerance && 78 innerClipBounds.fTop < queryBounds.fTop + kBoundsTolerance && 94 outerClipBounds.fBottom - outerClipBounds.fTop <= kBoundsTolerance || 98 outerClipBounds.fTop >= queryBounds.fBottom - kBoundsTolerance || 100 outerClipBounds.fBottom <= queryBounds.fTop + kBoundsTolerance; 108 SkScalarFloorToInt(bounds.fTop + kBoundsTolerance), 118 SkScalarFloorToScalar(bounds.fTop + kBoundsTolerance), 128 SkScalarAbs(SkScalarRoundToScalar(rect.fTop) - rect.fTop) < [all...] |
/external/skqp/src/gpu/ |
H A D | GrRect.h | 15 int16_t fLeft, fTop, fRight, fBottom; member in struct:GrIRect16 36 int height() const { return fBottom - fTop; } 38 bool isEmpty() const { return fLeft >= fRight || fTop >= fBottom; } 44 fTop = top; 51 fTop = SkToS16(r.fTop); 61 SkASSERT(!a.isFinite() || (a.fLeft <= a.fRight && a.fTop <= a.fBottom)); 62 SkASSERT(!b.isFinite() || (b.fLeft <= b.fRight && b.fTop <= b.fBottom)); 63 return a.fRight > b.fLeft && a.fBottom > b.fTop && b.fRight > a.fLeft && b.fBottom > a.fTop; [all...] |
H A D | GrClip.h | 76 innerClipBounds.fBottom > innerClipBounds.fTop + kBoundsTolerance && 78 innerClipBounds.fTop < queryBounds.fTop + kBoundsTolerance && 94 outerClipBounds.fBottom - outerClipBounds.fTop <= kBoundsTolerance || 98 outerClipBounds.fTop >= queryBounds.fBottom - kBoundsTolerance || 100 outerClipBounds.fBottom <= queryBounds.fTop + kBoundsTolerance; 108 SkScalarFloorToInt(bounds.fTop + kBoundsTolerance), 118 SkScalarFloorToScalar(bounds.fTop + kBoundsTolerance), 128 SkScalarAbs(SkScalarRoundToScalar(rect.fTop) - rect.fTop) < [all...] |
/external/skia/include/core/ |
H A D | SkRect.h | 35 int32_t fTop; member in struct:SkIRect 43 When equal to or less than fTop, SkIRect is empty. 88 result in fLeft greater than fRight, or fTop greater than fBottom. 91 @param t integer stored in fTop 105 @param y stored in fTop 123 and sort() to reverse fTop and fBottom if needed. 125 @return fTop 127 int32_t top() const { return fTop; } 137 and sort() to reverse fTop and fBottom if needed. 151 and sort() to reverse fTop an 722 SkScalar fTop; member in struct:SkRect [all...] |
/external/skqp/include/core/ |
H A D | SkRect.h | 35 int32_t fTop; member in struct:SkIRect 43 When equal to or less than fTop, SkIRect is empty. 91 result in fLeft greater than fRight, or fTop greater than fBottom. 94 @param t integer stored in fTop 108 @param y stored in fTop 126 and sort() to reverse fTop and fBottom if needed. 128 @return fTop 130 int32_t top() const { return fTop; } 140 and sort() to reverse fTop and fBottom if needed. 154 and sort() to reverse fTop an 710 SkScalar fTop; member in struct:SkRect [all...] |
/external/skia/src/core/ |
H A D | SkValidationUtils.h | 31 (rect.fTop <= rect.fBottom) &&
|
H A D | SkRect.cpp | 19 if (fLeft >= fRight || fTop >= fBottom) { 23 if (top < fTop) fTop = top; 34 quad[0].set(fLeft, fTop); 35 quad[1].set(fRight, fTop); 106 CHECK_INTERSECT(left, top, right, bottom, fLeft, fTop, fRight, fBottom); 112 return this->intersect(r.fLeft, r.fTop, r.fRight, r.fBottom); 116 CHECK_INTERSECT(a.fLeft, a.fTop, a.fRight, a.fBottom, b.fLeft, b.fTop, b.fRight, b.fBottom); 128 if (fLeft >= fRight || fTop > [all...] |
H A D | SkRasterClipStack.h | 17 SkTStack(void* storage, size_t size) : fDeque(sizeof(T), storage, size), fTop(nullptr) {} 30 SkASSERT(fTop); 31 return *fTop; 35 SkASSERT(fTop); 36 return *fTop; 41 fTop = this->push_raw(); 42 new (fTop) T(); 43 return *fTop; 46 fTop = this->push_raw(); 47 new (fTop) 59 T* fTop; member in class:SkTStack [all...] |
/external/skqp/src/core/ |
H A D | SkValidationUtils.h | 31 (rect.fTop <= rect.fBottom) &&
|
H A D | SkRect.cpp | 19 if (fLeft >= fRight || fTop >= fBottom) { 23 if (top < fTop) fTop = top; 34 quad[0].set(fLeft, fTop); 35 quad[1].set(fRight, fTop); 106 CHECK_INTERSECT(left, top, right, bottom, fLeft, fTop, fRight, fBottom); 112 return this->intersect(r.fLeft, r.fTop, r.fRight, r.fBottom); 116 CHECK_INTERSECT(a.fLeft, a.fTop, a.fRight, a.fBottom, b.fLeft, b.fTop, b.fRight, b.fBottom); 128 if (fLeft >= fRight || fTop > [all...] |
H A D | SkRasterClipStack.h | 17 SkTStack(void* storage, size_t size) : fDeque(sizeof(T), storage, size), fTop(nullptr) {} 30 SkASSERT(fTop); 31 return *fTop; 35 SkASSERT(fTop); 36 return *fTop; 41 fTop = this->push_raw(); 42 new (fTop) T(); 43 return *fTop; 46 fTop = this->push_raw(); 47 new (fTop) 59 T* fTop; member in class:SkTStack [all...] |
/external/skia/src/gpu/ops/ |
H A D | GrCopySurfaceOp.cpp | 32 if (clippedSrcRect->fTop < 0) { 33 clippedDstPoint->fY -= clippedSrcRect->fTop; 34 clippedSrcRect->fTop = 0; 37 clippedSrcRect->fTop -= clippedDstPoint->fY; 54 clippedSrcRect->fBottom = clippedSrcRect->fTop + dst->height() - clippedDstPoint->fY;
|
/external/skqp/src/gpu/ops/ |
H A D | GrCopySurfaceOp.cpp | 32 if (clippedSrcRect->fTop < 0) { 33 clippedDstPoint->fY -= clippedSrcRect->fTop; 34 clippedSrcRect->fTop = 0; 37 clippedSrcRect->fTop -= clippedDstPoint->fY; 54 clippedSrcRect->fBottom = clippedSrcRect->fTop + dst->height() - clippedDstPoint->fY;
|
/external/pdfium/xfa/fwl/theme/ |
H A D | cfwl_widgettp.cpp | 188 float fTop = local 193 path.MoveTo(CFX_PointF(fLeft, fTop + 1)); 194 path.LineTo(CFX_PointF(fLeft + 4, fTop + 5)); 195 path.LineTo(CFX_PointF(fLeft + 8, fTop + 1)); 196 path.LineTo(CFX_PointF(fLeft + 7, fTop)); 197 path.LineTo(CFX_PointF(fLeft + 4, fTop + 3)); 198 path.LineTo(CFX_PointF(fLeft + 1, fTop)); 202 path.MoveTo(CFX_PointF(fLeft, fTop + 4)); 203 path.LineTo(CFX_PointF(fLeft + 4, fTop)); 204 path.LineTo(CFX_PointF(fLeft + 8, fTop [all...] |
/external/skia/bench/ |
H A D | RTreeBench.cpp | 85 query.fTop = rand.nextRangeF(0, GENERATE_EXTENTS); 87 query.fBottom = query.fTop + 1 + rand.nextRangeF(0, GENERATE_EXTENTS/2); 101 out.fTop = SkIntToScalar(index / GRID_WIDTH); 103 out.fBottom = out.fTop + 1 + rand.nextRangeF(0, GENERATE_EXTENTS/3); 109 out.fTop = SkIntToScalar(index % GRID_WIDTH); 111 out.fBottom = out.fTop + 1 + rand.nextRangeF(0, GENERATE_EXTENTS/3); 118 out.fTop = rand.nextRangeF(0, GENERATE_EXTENTS); 120 out.fBottom = out.fTop + 1 + rand.nextRangeF(0, GENERATE_EXTENTS/5);
|
/external/skia/src/android/ |
H A D | SkBitmapRegionDecoderPriv.h | 39 int top = SkTMax(0, subset->fTop); 43 *outY = top - subset->fTop;
|
/external/skia/src/gpu/effects/ |
H A D | GrOvalEffect.cpp | 23 return GrCircleEffect::Make(edgeType, SkPoint::Make(oval.fLeft + w, oval.fTop + w), 28 return GrEllipseEffect::Make(edgeType, SkPoint::Make(oval.fLeft + w, oval.fTop + h),
|
/external/skqp/bench/ |
H A D | RTreeBench.cpp | 85 query.fTop = rand.nextRangeF(0, GENERATE_EXTENTS); 87 query.fBottom = query.fTop + 1 + rand.nextRangeF(0, GENERATE_EXTENTS/2); 101 out.fTop = SkIntToScalar(index / GRID_WIDTH); 103 out.fBottom = out.fTop + 1 + rand.nextRangeF(0, GENERATE_EXTENTS/3); 109 out.fTop = SkIntToScalar(index % GRID_WIDTH); 111 out.fBottom = out.fTop + 1 + rand.nextRangeF(0, GENERATE_EXTENTS/3); 118 out.fTop = rand.nextRangeF(0, GENERATE_EXTENTS); 120 out.fBottom = out.fTop + 1 + rand.nextRangeF(0, GENERATE_EXTENTS/5);
|
/external/skqp/src/android/ |
H A D | SkBitmapRegionDecoderPriv.h | 39 int top = SkTMax(0, subset->fTop); 43 *outY = top - subset->fTop;
|
/external/skqp/src/gpu/effects/ |
H A D | GrOvalEffect.cpp | 23 return GrCircleEffect::Make(edgeType, SkPoint::Make(oval.fLeft + w, oval.fTop + w), 28 return GrEllipseEffect::Make(edgeType, SkPoint::Make(oval.fLeft + w, oval.fTop + h),
|