/third_party/skia/include/core/ |
H A D | SkRect.h | 32 int32_t fBottom; //!< larger y-axis bounds member 85 result in fLeft greater than fRight, or fTop greater than fBottom. 90 @param b integer stored in fBottom 104 @param h added to y and stored in fBottom 120 and sort() to reverse fTop and fBottom if needed. 134 and sort() to reverse fTop and fBottom if needed. 136 @return fBottom 138 int32_t bottom() const { return fBottom; } in bottom() 148 and sort() to reverse fTop and fBottom if needed. 167 @return fBottom minu [all...] |
/third_party/skia/src/core/ |
H A D | SkRect.cpp | 19 desc += split + "\t fBottom:" + std::to_string(fBottom) + "\n"; in dump() 28 std::min(a.fBottom, b.fBottom) in intersect() 39 if (r.fLeft >= r.fRight || r.fTop >= r.fBottom) { in join() 44 if (fLeft >= fRight || fTop >= fBottom) { in join() 50 if (r.fBottom > fBottom) fBottom = r.fBottom; in join() [all...] |
H A D | SkScan.h | 108 xr->fBottom = SkIntToFixed(src.fBottom); in XRect_set() 119 xr->fBottom = SkScalarToFixed(src.fBottom); in XRect_set() 128 dst->fBottom = SkFixedRoundToInt(xr.fBottom); in XRect_round() 138 dst->fBottom = SkFixedCeilToInt(xr.fBottom); in XRect_roundOut()
|
H A D | SkLineClipper.cpp | 87 outer.fRight >= inner.fRight && outer.fBottom >= inner.fBottom; in containsNoEmptyCheck() 105 nestedLT(bounds.fBottom, clip.fTop, bounds.height()) || in IntersectLine() 106 nestedLT(clip.fBottom, bounds.fTop, bounds.height())) { in IntersectLine() 127 if (tmp[index1].fY > clip.fBottom) { in IntersectLine() 128 tmp[index1].set(sect_with_horizontal(src, clip.fBottom), clip.fBottom); in IntersectLine() 192 if (pts[index0].fY >= clip.fBottom) { // we're below the clip in ClipLine() 206 if (tmp[index1].fY > clip.fBottom) { in ClipLine() 207 tmp[index1].set(sect_with_horizontal(pts, clip.fBottom), cli in ClipLine() [all...] |
H A D | SkEdgeClipper.cpp | 16 return bounds.fTop >= clip.fBottom || bounds.fBottom <= clip.fTop; in quick_reject() 122 if (pts[2].fY > clip.fBottom) { in chop_quad_in_Y() 123 if (chopMonoQuadAtY(pts, clip.fBottom, &t)) { in chop_quad_in_Y() 126 clamp_le(tmp[1].fY, clip.fBottom); in chop_quad_in_Y() 127 tmp[2].fY = clip.fBottom; in chop_quad_in_Y() 135 if (pts[i].fY > clip.fBottom) { in chop_quad_in_Y() 136 pts[i].fY = clip.fBottom; in chop_quad_in_Y() 149 if (pts[2].fY <= clip.fTop || pts[0].fY >= clip.fBottom) { in clipMonoQuad() 317 if (pts[3].fY > clip.fBottom) { in chop_cubic_in_Y() [all...] |
H A D | SkRectPriv.h | 47 r->fBottom = std::max(pt.fY, r->fBottom); in GrowToInclude() 54 SkFitsInFixed(r.fRight) && SkFitsInFixed(r.fBottom); in FitsInFixed() 59 SkTFitsIn<int16_t>(r.fRight) && SkTFitsIn<int16_t>(r.fBottom); in Is16Bit() 68 return SkScalarHalf(r.fBottom) - SkScalarHalf(r.fTop); in HalfHeight()
|
H A D | SkLatticeIter.cpp | 43 && valid_divs(lattice.fYDivs, lattice.fYCount, latticeBounds.fTop, latticeBounds.fBottom); in Valid() 151 int yCountScalable = count_scalable_pixels(yDivs, yCount, yIsScalable, src.fTop, src.fBottom); in SkLatticeIter() 162 src.fTop, src.fBottom, dst.fTop, dst.fBottom, yIsScalable); in SkLatticeIter() 228 fSrcY[2] = SkIntToScalar(c.fBottom); in SkLatticeIter() 238 fDstY[2] = dst.fBottom - SkIntToScalar(h - c.fBottom); in SkLatticeIter() 239 fDstY[3] = dst.fBottom; in SkLatticeIter()
|
H A D | SkScan_Path.cpp | 403 shiftedClip.fBottom = SkLeftShift(shiftedClip.fBottom, shiftEdgesUp); in sk_fill_path() 421 if (rect.fBottom > stop_y) { in sk_fill_path() 422 rect.fBottom = stop_y; in sk_fill_path() 456 if (!pathContainedInClip && stop_y > shiftedClip.fBottom) { in sk_fill_path() 457 stop_y = shiftedClip.fBottom; in sk_fill_path() 485 tmp.fBottom = ir.fTop; in sk_blit_above() 497 tmp.fTop = ir.fBottom; in sk_blit_below() 498 tmp.fBottom = cr.fBottom; in sk_blit_below() [all...] |
H A D | SkPathMakers.h | 46 fPts[2] = SkPoint::Make(rect.fRight, rect.fBottom); in SkPath_RectPointIterator() 47 fPts[3] = SkPoint::Make(rect.fLeft, rect.fBottom); in SkPath_RectPointIterator() 61 fPts[2] = SkPoint::Make(cx, oval.fBottom); in SkPath_OvalPointIterator() 75 const SkScalar B = bounds.fBottom; in SkPath_RRectPointIterator()
|
H A D | SkScan_Hairline.cpp | 93 SkIntToFDot6(bounds.fRight), SkIntToFDot6(bounds.fBottom)); 101 ptsR.fBottom += SK_FDot6One; 167 SkScalarFloorToInt(rect.fBottom + 1)); 209 blitter->blitH(r.fLeft, r.fBottom - 1, width); // bottom 281 return r.fLeft > r.fRight || r.fTop > r.fBottom; 289 a.fTop < b.fBottom && b.fTop < a.fBottom; 297 inner.fBottom <= outer.fBottom && inner.fTop >= outer.fTop; 686 outer.setLTRB(r.fLeft - rx, r.fTop - ry, r.fRight + rx, r.fBottom [all...] |
H A D | SkRegion.cpp | 243 "(%d,%d,%d,%d)", r.fLeft, r.fTop, r.fRight, r.fBottom); in toString() 263 *ibot = fBounds.fBottom; in count_runtype_values() 348 runs[1] = bounds.fBottom; in BuildRectRuns() 430 if (r.fBottom <= scanline_bottom(scanline)) { in contains() 515 if (sect.fBottom <= scanline_bottom(scanline)) { in intersects() 600 dy = pin_offset_s32(fBounds.fTop, fBounds.fBottom, dy); in translate() 1225 rect.fBottom = *runs++; in validate_run() 1226 if (rect.fBottom == SkRegion_kRunTypeSentinel) { in validate_run() 1229 if (rect.fBottom > givenBounds.fBottom) { in validate_run() [all...] |
/third_party/skia/src/gpu/geometry/ |
H A D | GrRect.h | 17 int16_t fLeft, fTop, fRight, fBottom; member 44 int height() const { return fBottom - fTop; } in height() 46 bool isEmpty() const { return fLeft >= fRight || fTop >= fBottom; } in isEmpty() 54 fBottom = bottom; in set() 61 fBottom = SkToS16(r.fBottom); in set() 68 fBottom += dy; in offset() 76 SkASSERT(!a.isFinite() || (a.fLeft <= a.fRight && a.fTop <= a.fBottom)); in GrRectsOverlap() 77 SkASSERT(!b.isFinite() || (b.fLeft <= b.fRight && b.fTop <= b.fBottom)); in GrRectsOverlap() 78 return a.fRight > b.fLeft && a.fBottom > in GrRectsOverlap() [all...] |
H A D | GrTriangulator.cpp | 252 fTop->fID, fBottom->fID, other.fTop->fID, other.fBottom->fID); in intersect() 253 if (fTop == other.fTop || fBottom == other.fBottom || in intersect() 254 fTop == other.fBottom || fBottom == other.fTop) { in intersect() 262 fLine, fTop->fPoint, fBottom->fPoint, in intersect() 263 other.fLine, other.fTop->fPoint, other.fBottom->fPoint, in intersect() 282 *alpha = std::max((1.0 - s) * fTop->fAlpha + s * fBottom->fAlpha, in intersect() 283 (1.0 - t) * other.fTop->fAlpha + t * other.fBottom in intersect() [all...] |
/third_party/skia/src/pathops/ |
H A D | SkPathOpsRect.h | 15 double fLeft, fTop, fRight, fBottom; member 21 fBottom = std::max(fBottom, pt.fY); in add() 26 && approximately_between(fTop, pt.fY, fBottom); in contains() 33 SkASSERT(fTop <= fBottom); in intersects() 35 SkASSERT(r.fTop <= r.fBottom); in intersects() 36 return r.fLeft <= fRight && fLeft <= r.fRight && r.fTop <= fBottom && fTop <= r.fBottom; in intersects() 41 fTop = fBottom = pt.fY; in set() 49 return fBottom in height() [all...] |
H A D | SkPathOpsBounds.h | 18 && AlmostLessOrEqualUlps(a.fTop, b.fBottom) in Intersects() 19 && AlmostLessOrEqualUlps(b.fTop, a.fBottom); in Intersects() 29 if (bottom > fBottom) fBottom = bottom; in add() 33 add(toAdd.fLeft, toAdd.fTop, toAdd.fRight, toAdd.fBottom); in add() 40 if (pt.fY > fBottom) fBottom = pt.fY; in add() 47 if (pt.fY > fBottom) fBottom = SkDoubleToScalar(pt.fY); in add() 54 && AlmostLessOrEqualUlps(pt.fY, fBottom); in almostContains() [all...] |
/third_party/skia/docs/examples/ |
H A D | Canvas_drawRRect.cpp | 12 rRect.setNinePatch(outer, radii.fLeft, radii.fTop, radii.fRight, radii.fBottom); in REG_FIDDLE() 16 outer.fLeft + radii.fLeft, outer.fBottom, paint); in REG_FIDDLE() 18 outer.fRight - radii.fRight, outer.fBottom, paint); in REG_FIDDLE() 21 canvas->drawLine(outer.fLeft, outer.fBottom - radii.fBottom, in REG_FIDDLE() 22 outer.fRight, outer.fBottom - radii.fBottom, paint); in REG_FIDDLE()
|
H A D | Rect_equal_operator.cpp | 10 test.fLeft, test.fTop, test.fRight, test.fBottom, in REG_FIDDLE() 12 negZero.fLeft, negZero.fTop, negZero.fRight, negZero.fBottom, in REG_FIDDLE() 14 test.fRight == negZero.fRight && test.fBottom == negZero.fBottom) ? in REG_FIDDLE()
|
H A D | RRect_Corner.cpp | 17 canvas->drawLine(r.fLeft, r.fBottom - rrect.radii(SkRRect::kLowerLeft_Corner).fY, in REG_FIDDLE() 18 r.fRight, r.fBottom - rrect.radii(SkRRect::kLowerRight_Corner).fY, paint); in REG_FIDDLE() 20 r.fLeft + rrect.radii(SkRRect::kLowerLeft_Corner).fX, r.fBottom, paint); in REG_FIDDLE() 22 r.fRight - rrect.radii(SkRRect::kLowerRight_Corner).fX, r.fBottom, paint); in REG_FIDDLE()
|
H A D | RRect_setNinePatch.cpp | 16 canvas->drawLine(r.fLeft, r.fBottom - rrect.radii(SkRRect::kLowerLeft_Corner).fY, in REG_FIDDLE() 17 r.fRight, r.fBottom - rrect.radii(SkRRect::kLowerRight_Corner).fY, paint); in REG_FIDDLE() 19 r.fLeft + rrect.radii(SkRRect::kLowerLeft_Corner).fX, r.fBottom, paint); in REG_FIDDLE() 21 r.fRight - rrect.radii(SkRRect::kLowerRight_Corner).fX, r.fBottom, paint); in REG_FIDDLE()
|
H A D | Canvas_getLocalClipBounds.cpp | 11 bounds.fLeft, bounds.fTop, bounds.fRight, bounds.fBottom); in REG_FIDDLE() 18 bounds.fLeft, bounds.fTop, bounds.fRight, bounds.fBottom); in REG_FIDDLE() 22 bounds.fLeft, bounds.fTop, bounds.fRight, bounds.fBottom); in REG_FIDDLE()
|
H A D | Bitmap_extractSubset.cpp | 9 SkDebugf("bounds: %d, %d, %d, %d\n", bounds.fLeft, bounds.fTop, bounds.fRight, bounds.fBottom); in REG_FIDDLE() 15 SkDebugf("subset: %4d, %4d, %4d, %4d ", b.fLeft, b.fTop, b.fRight, b.fBottom); in REG_FIDDLE() 19 SkDebugf(" subset: %d, %d, %d, %d", s.fLeft, s.fTop, s.fRight, s.fBottom); in REG_FIDDLE()
|
H A D | Canvas_getDeviceClipBounds.cpp | 11 bounds.fLeft, bounds.fTop, bounds.fRight, bounds.fBottom); in REG_FIDDLE() 19 bounds.fLeft, bounds.fTop, bounds.fRight, bounds.fBottom); in REG_FIDDLE() 25 bounds.fLeft, bounds.fTop, bounds.fRight, bounds.fBottom); in REG_FIDDLE()
|
/third_party/skia/tests/ |
H A D | M44Test.cpp | 244 SkV2 br = map2d(m, {src.fRight, src.fBottom}); in DEF_TEST() 245 SkV2 bl = map2d(m, {src.fLeft, src.fBottom}); in DEF_TEST() 249 assertEdges(tl.y, bl.y, dst.fTop, dst.fBottom); in DEF_TEST() 250 assertEdges(tr.y, br.y, dst.fTop, dst.fBottom); in DEF_TEST() 263 REPORTER_ASSERT(reporter, SkScalarNearlyEqual(actual.fBottom, expected.fBottom, e.fBottom), in DEF_TEST() 264 "Expected %g == %g", actual.fBottom, expected.fBottom); in DEF_TEST() 278 {src.fRight, src.fBottom, in DEF_TEST() [all...] |
H A D | PathOpsAsWindingTest.cpp | 23 path.quadTo(rect.fRight, rect.fBottom, rect.centerX(), rect.fBottom); in build_squircle() 24 path.quadTo(rect.fLeft, rect.fBottom, rect.fLeft, rect.centerY()); in build_squircle() 38 path.cubicTo(rect.fRight, aY34, aX34, rect.fBottom, rect.centerX(), rect.fBottom); in build_squircle() 39 path.cubicTo(aX14, rect.fBottom, rect.fLeft, aY34, rect.fLeft, rect.centerY()); in build_squircle() 175 for (SkScalar y = rectA.fTop - 1; y <= rectA.fBottom + 1; ++y) { in DEF_TEST()
|
/third_party/skia/gm/ |
H A D | crop_imagefilter.cpp | 241 2.f * (kExampleBounds.fBottom + 1.f)}; 250 canvas->translate(tx * (kExampleBounds.fRight + 1.f), ty * (kExampleBounds.fBottom + 1.f)); in draw_example_tile() 273 {kPaddedTileBounds.centerX() - 0.5f, kPaddedTileBounds.fBottom - 0.5f}, in draw_example_tile() 282 5.f * kPaddedTileBounds.fBottom - 1.f}; 298 canvas->translate(0.f, kPaddedTileBounds.fBottom); in draw_example_column() 328 canvas->drawLine({0.5f, y * kPaddedTileBounds.fBottom - 0.5f}, in draw_example_grid() 329 {kGridWidth - 0.5f, y * kPaddedTileBounds.fBottom - 0.5f}, dashedLine); in draw_example_grid() 333 {x * kPaddedTileBounds.fRight - 0.5f, kPaddedColumnBounds.fBottom - 0.5f}, in draw_example_grid() 348 return {SkScalarRoundToInt(kGridWidth), SkScalarRoundToInt(kPaddedColumnBounds.fBottom)};
|