Home
last modified time | relevance | path

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

12345678910>>...16

/third_party/skia/include/core/
H A DSkRect.h29 int32_t fLeft; //!< smaller x-axis bounds member
76 @param pt values for SkIRect fLeft and fTop
85 result in fLeft greater than fRight, or fTop greater than fBottom.
87 @param l integer stored in fLeft
101 @param x stored in fLeft
113 Call sort() to reverse fLeft and fRight if needed.
115 @return fLeft
117 int32_t left() const { return fLeft; } in left()
127 Call sort() to reverse fLeft and fRight if needed.
141 and sort() to reverse fLeft an
[all...]
/third_party/skia/src/gpu/geometry/
H A DGrRect.h17 int16_t fLeft, fTop, fRight, fBottom; member
43 int width() const { return fRight - fLeft; } in width()
46 bool isEmpty() const { return fLeft >= fRight || fTop >= fBottom; } in isEmpty()
51 fLeft = left; in set()
58 fLeft = SkToS16(r.fLeft); in set()
65 fLeft += dx; 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 in GrRectsOverlap()
[all...]
/third_party/skia/src/core/
H A DSkRect.cpp16 desc += split + "\t fLeft:" + std::to_string(fLeft) + "\n"; in dump()
25 std::max(a.fLeft, b.fLeft), in intersect()
39 if (r.fLeft >= r.fRight || r.fTop >= r.fBottom) { in join()
44 if (fLeft >= fRight || fTop >= fBottom) { in join()
47 if (r.fLeft < fLeft) fLeft = r.fLeft; in join()
[all...]
H A DSkLineClipper.cpp86 return outer.fLeft <= inner.fLeft && outer.fTop <= inner.fTop && in containsNoEmptyCheck()
103 if (nestedLT(bounds.fRight, clip.fLeft, bounds.width()) || in IntersectLine()
104 nestedLT(clip.fRight, bounds.fLeft, bounds.width()) || in IntersectLine()
140 if ((tmp[index1].fX <= clip.fLeft || tmp[index0].fX >= clip.fRight)) { in IntersectLine()
143 if (tmp[0].fX != tmp[1].fX || tmp[0].fX < clip.fLeft || tmp[0].fX > clip.fRight) { in IntersectLine()
148 if (tmp[index0].fX < clip.fLeft) { in IntersectLine()
149 tmp[index0].set(clip.fLeft, sect_with_vertical(src, clip.fLeft)); in IntersectLine()
229 if (tmp[index1].fX <= clip.fLeft) { // wholl in ClipLine()
[all...]
H A DSkScan.h105 xr->fLeft = SkIntToFixed(src.fLeft); in XRect_set()
116 xr->fLeft = SkScalarToFixed(src.fLeft); in XRect_set()
125 dst->fLeft = SkFixedRoundToInt(xr.fLeft); in XRect_round()
135 dst->fLeft = SkFixedFloorToInt(xr.fLeft); in XRect_roundOut()
H A DSkBlitter.cpp84 SkScalar partialL = bounds.fLeft + 1 - rect.fLeft; in blitFatAntiRect()
96 this->blitAntiH(bounds.fLeft, bounds.fTop, alphas, runs); in blitFatAntiRect()
99 this->blitAntiRect(bounds.fLeft, bounds.fTop + 1, bounds.width() - 2, bounds.height() - 2, in blitFatAntiRect()
107 this->blitAntiH(bounds.fLeft, bounds.fBottom - 1, alphas, runs); in blitFatAntiRect()
201 int cx = clip.fLeft; in blitMask()
203 int maskLeft = mask.fBounds.fLeft; in blitMask()
259 const uint8_t* aa = mask.getAddr8(clip.fLeft, clip.fTop); in blitMask()
267 this->blitAntiH(clip.fLeft, y, aa, runs); in blitMask()
295 this->blitRect(cr.fLeft, c in blitRectRegion()
[all...]
H A DSkLatticeIter.cpp35 latticeBounds.fLeft == lattice.fXDivs[0]); in Valid()
42 return valid_divs(lattice.fXDivs, lattice.fXCount, latticeBounds.fLeft, latticeBounds.fRight) in Valid()
133 bool xIsScalable = (xCount > 0 && src.fLeft == xDivs[0]); in SkLatticeIter()
149 int xCountScalable = count_scalable_pixels(xDivs, xCount, xIsScalable, src.fLeft, src.fRight); in SkLatticeIter()
157 src.fLeft, src.fRight, dst.fLeft, dst.fRight, xIsScalable); in SkLatticeIter()
222 fSrcX[1] = SkIntToScalar(c.fLeft); in SkLatticeIter()
231 fDstX[0] = dst.fLeft; in SkLatticeIter()
232 fDstX[1] = dst.fLeft + SkIntToScalar(c.fLeft); in SkLatticeIter()
[all...]
H A DSkEdgeClipper.cpp166 if (pts[2].fX <= clip.fLeft) { // wholly to the left in clipMonoQuad()
167 this->appendVLine(clip.fLeft, pts[0].fY, pts[2].fY, reverse); in clipMonoQuad()
181 if (pts[0].fX < clip.fLeft) { in clipMonoQuad()
182 if (chopMonoQuadAtX(pts, clip.fLeft, &t)) { in clipMonoQuad()
184 this->appendVLine(clip.fLeft, tmp[0].fY, tmp[2].fY, reverse); in clipMonoQuad()
186 tmp[2].fX = clip.fLeft; in clipMonoQuad()
187 clamp_ge(tmp[3].fX, clip.fLeft); in clipMonoQuad()
194 this->appendVLine(clip.fLeft, pts[0].fY, pts[2].fY, reverse); in clipMonoQuad()
358 if (pts[3].fX <= clip.fLeft) { // wholly to the left in clipMonoCubic()
359 this->appendVLine(clip.fLeft, pt in clipMonoCubic()
[all...]
H A DSkRectPriv.h44 r->fLeft = std::min(pt.fX, r->fLeft); in GrowToInclude()
53 return SkFitsInFixed(r.fLeft) && SkFitsInFixed(r.fTop) && in FitsInFixed()
58 return SkTFitsIn<int16_t>(r.fLeft) && SkTFitsIn<int16_t>(r.fTop) && in Is16Bit()
64 return SkScalarHalf(r.fRight) - SkScalarHalf(r.fLeft); in HalfWidth()
H A DSkRegion.cpp243 "(%d,%d,%d,%d)", r.fLeft, r.fTop, r.fRight, r.fBottom); in toString()
350 runs[3] = bounds.fLeft; in BuildRectRuns()
427 if (!scanline_contains(scanline, r.fLeft, r.fRight)) { in contains()
512 if (scanline_intersects(scanline, sect.fLeft, sect.fRight)) { in intersects()
599 dx = pin_offset_s32(fBounds.fLeft, fBounds.fRight, dx); in translate()
681 int fLeft, fRite, fInside; member
762 fLeft = left; in next()
791 int left = rec.fLeft; in operate_on_span()
1245 rect.fLeft = *runs++; in validate_run()
1247 if (rect.fLeft in validate_run()
[all...]
H A DSkScan_Hairline.cpp92 clipR.setLTRB(SkIntToFDot6(bounds.fLeft), SkIntToFDot6(bounds.fTop),
164 SkIRect r = SkIRect::MakeLTRB(SkScalarFloorToInt(rect.fLeft),
171 // since r.fRight - r.fLeft might wrap around to negative even if fRight > fLeft.
202 blitter->blitRect(r.fLeft, r.fTop, width, height);
206 blitter->blitH(r.fLeft, r.fTop, width); // top
207 blitter->blitRect(r.fLeft, r.fTop + 1, 1, height - 2); // left
209 blitter->blitH(r.fLeft, r.fBottom - 1, width); // bottom
281 return r.fLeft > r.fRight || r.fTop > r.fBottom;
288 return a.fLeft <
[all...]
H A DSkScalerContext.cpp210 glyph.fLeft = ir.fLeft; in internalMakeGlyph()
225 glyph.fLeft -= 1; in internalMakeGlyph()
239 glyph.fLeft = 0; in internalMakeGlyph()
257 glyph.fLeft = dst.fBounds.fLeft; in internalMakeGlyph()
268 glyph.fLeft = 0; in internalMakeGlyph()
472 matrix.setTranslate(-SkIntToScalar(mask.fBounds.fLeft), in generateMask()
486 1, 0, -SkIntToScalar(mask.fBounds.fLeft), in generateMask()
490 matrix.setAll(4, 0, -SkIntToScalar(mask.fBounds.fLeft in generateMask()
[all...]
/third_party/skia/src/pathops/
H A DSkPathOpsRect.h15 double fLeft, fTop, fRight, fBottom; member
18 fLeft = std::min(fLeft, pt.fX); in add()
25 return approximately_between(fLeft, pt.fX, fRight) in contains()
32 SkASSERT(fLeft <= fRight); in intersects()
34 SkASSERT(r.fLeft <= r.fRight); in intersects()
36 return r.fLeft <= fRight && fLeft <= r.fRight && r.fTop <= fBottom && fTop <= r.fBottom; in intersects()
40 fLeft = fRight = pt.fX; in set()
45 return fRight - fLeft; in width()
[all...]
H A DSkPathOpsBounds.h16 return AlmostLessOrEqualUlps(a.fLeft, b.fRight) in Intersects()
17 && AlmostLessOrEqualUlps(b.fLeft, a.fRight) in Intersects()
26 if (left < fLeft) fLeft = left; in add()
33 add(toAdd.fLeft, toAdd.fTop, toAdd.fRight, toAdd.fBottom); in add()
37 if (pt.fX < fLeft) fLeft = pt.fX; in add()
44 if (pt.fX < fLeft) fLeft = SkDoubleToScalar(pt.fX); in add()
51 return AlmostLessOrEqualUlps(fLeft, p in almostContains()
[all...]
/third_party/skia/docs/examples/
H A DCanvas_drawRRect.cpp12 rRect.setNinePatch(outer, radii.fLeft, radii.fTop, radii.fRight, radii.fBottom); in REG_FIDDLE()
15 canvas->drawLine(outer.fLeft + radii.fLeft, outer.fTop, in REG_FIDDLE()
16 outer.fLeft + radii.fLeft, outer.fBottom, paint); in REG_FIDDLE()
19 canvas->drawLine(outer.fLeft, outer.fTop + radii.fTop, in REG_FIDDLE()
21 canvas->drawLine(outer.fLeft, outer.fBottom - radii.fBottom, in REG_FIDDLE()
H A DRect_equal_operator.cpp10 test.fLeft, test.fTop, test.fRight, test.fBottom, in REG_FIDDLE()
12 negZero.fLeft, negZero.fTop, negZero.fRight, negZero.fBottom, in REG_FIDDLE()
13 (test.fLeft == negZero.fLeft && test.fTop == negZero.fTop && in REG_FIDDLE()
H A DRRect_Corner.cpp15 canvas->drawLine(r.fLeft, r.fTop + rrect.radii(SkRRect::kUpperLeft_Corner).fY, in REG_FIDDLE()
17 canvas->drawLine(r.fLeft, r.fBottom - rrect.radii(SkRRect::kLowerLeft_Corner).fY, in REG_FIDDLE()
19 canvas->drawLine(r.fLeft + rrect.radii(SkRRect::kUpperLeft_Corner).fX, r.fTop, in REG_FIDDLE()
20 r.fLeft + rrect.radii(SkRRect::kLowerLeft_Corner).fX, r.fBottom, paint); in REG_FIDDLE()
H A DRRect_setNinePatch.cpp14 canvas->drawLine(r.fLeft, r.fTop + rrect.radii(SkRRect::kUpperLeft_Corner).fY, in REG_FIDDLE()
16 canvas->drawLine(r.fLeft, r.fBottom - rrect.radii(SkRRect::kLowerLeft_Corner).fY, in REG_FIDDLE()
18 canvas->drawLine(r.fLeft + rrect.radii(SkRRect::kUpperLeft_Corner).fX, r.fTop, in REG_FIDDLE()
19 r.fLeft + rrect.radii(SkRRect::kLowerLeft_Corner).fX, r.fBottom, paint); in REG_FIDDLE()
H A DCanvas_getLocalClipBounds.cpp11 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 DBitmap_extractSubset.cpp9 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 DCanvas_getDeviceClipBounds.cpp11 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/bench/
H A DRTreeBench.cpp85 query.fLeft = rand.nextRangeF(0, GENERATE_EXTENTS);
87 query.fRight = query.fLeft + 1 + rand.nextRangeF(0, GENERATE_EXTENTS/2);
101 out.fLeft = SkIntToScalar(index % GRID_WIDTH); in make_XYordered_rects()
103 out.fRight = out.fLeft + 1 + rand.nextRangeF(0, GENERATE_EXTENTS/3); in make_XYordered_rects()
109 out.fLeft = SkIntToScalar(index / GRID_WIDTH); in make_YXordered_rects()
111 out.fRight = out.fLeft + 1 + rand.nextRangeF(0, GENERATE_EXTENTS/3); in make_YXordered_rects()
118 out.fLeft = rand.nextRangeF(0, GENERATE_EXTENTS); in make_random_rects()
120 out.fRight = out.fLeft + 1 + rand.nextRangeF(0, GENERATE_EXTENTS/5); in make_random_rects()
/third_party/skia/tests/
H A DM44Test.cpp242 SkV2 tl = map2d(m, {src.fLeft, src.fTop}); in DEF_TEST()
245 SkV2 bl = map2d(m, {src.fLeft, src.fBottom}); in DEF_TEST()
247 assertEdges(tl.x, tr.x, dst.fLeft, dst.fRight); in DEF_TEST()
248 assertEdges(bl.x, br.x, dst.fLeft, dst.fRight); in DEF_TEST()
257 REPORTER_ASSERT(reporter, SkScalarNearlyEqual(actual.fLeft, expected.fLeft, e.fLeft), in DEF_TEST()
258 "Expected %g == %g", actual.fLeft, expected.fLeft); in DEF_TEST()
276 SkV4 corners[4] = {{src.fLeft, sr in DEF_TEST()
[all...]
H A DPathOpsAsWindingTest.cpp24 path.quadTo(rect.fLeft, rect.fBottom, rect.fLeft, rect.centerY()); in build_squircle()
25 path.quadTo(rect.fLeft, rect.fTop, rect.centerX(), rect.fTop); in build_squircle()
32 SkScalar aX14 = rect.fLeft + rect.width() * 1 / 4; in build_squircle()
33 SkScalar aX34 = rect.fLeft + rect.width() * 3 / 4; in build_squircle()
39 path.cubicTo(aX14, rect.fBottom, rect.fLeft, aY34, rect.fLeft, rect.centerY()); in build_squircle()
40 path.cubicTo(rect.fLeft, aY14, aX14, rect.fTop, rect.centerX(), rect.fTop); in build_squircle()
174 for (SkScalar x = rectA.fLeft - 1; x <= rectA.fRight + 1; ++x) { in DEF_TEST()
/third_party/skia/src/gpu/effects/
H A DGrOvalEffect.cpp20 SkPoint::Make(oval.fLeft + w, oval.fTop + w), w); in Make()
23 SkPoint::Make(oval.fLeft + w, oval.fTop + w), w); in Make()
29 SkPoint::Make(oval.fLeft + w, oval.fTop + h), in Make()

Completed in 11 milliseconds

12345678910>>...16