Home
last modified time | relevance | path

Searched refs:fTop (Results 1 – 25 of 413) sorted by relevance

12345678910>>...17

/external/skia/include/core/
DSkRect.h33 int32_t fTop; //!< smaller y-axis bounds member
121 constexpr int32_t top() const { return fTop; } in top()
149 constexpr int32_t y() const { return fTop; } in y()
152 constexpr SkIPoint topLeft() const { return {fLeft, fTop}; } in topLeft()
166 constexpr int32_t height() const { return Sk32_can_overflow_sub(fBottom, fTop); } in height()
189 constexpr int64_t height64() const { return (int64_t)fBottom - (int64_t)fTop; } in height64()
197 bool isEmpty64() const { return fRight <= fLeft || fBottom <= fTop; } in isEmpty64()
221 return a.fLeft == b.fLeft && a.fTop == b.fTop &&
233 return a.fLeft != b.fLeft || a.fTop != b.fTop ||
256 fTop = top; in setLTRB()
[all …]
/external/pdfium/xfa/fwl/theme/
Dcfwl_widgettp.cpp142 float fTop = ((rect.height - (bVert ? 6 : 9)) / 2 + rect.top) + 0.5f; in DrawArrow() local
146 path.MoveTo(CFX_PointF(fLeft, fTop + 1)); in DrawArrow()
147 path.LineTo(CFX_PointF(fLeft + 4, fTop + 5)); in DrawArrow()
148 path.LineTo(CFX_PointF(fLeft + 8, fTop + 1)); in DrawArrow()
149 path.LineTo(CFX_PointF(fLeft + 7, fTop)); in DrawArrow()
150 path.LineTo(CFX_PointF(fLeft + 4, fTop + 3)); in DrawArrow()
151 path.LineTo(CFX_PointF(fLeft + 1, fTop)); in DrawArrow()
154 path.MoveTo(CFX_PointF(fLeft, fTop + 4)); in DrawArrow()
155 path.LineTo(CFX_PointF(fLeft + 4, fTop)); in DrawArrow()
156 path.LineTo(CFX_PointF(fLeft + 8, fTop + 4)); in DrawArrow()
[all …]
/external/skia/src/core/
DSkRect.cpp16 std::max(a.fTop, b.fTop), in intersect()
29 if (r.fLeft >= r.fRight || r.fTop >= r.fBottom) { in join()
34 if (fLeft >= fRight || fTop >= fBottom) { in join()
38 if (r.fTop < fTop) fTop = r.fTop; in join()
49 quad[0].set(fLeft, fTop); in toQuad()
50 quad[1].set(fRight, fTop); in toQuad()
111 CHECK_INTERSECT(r.fLeft, r.fTop, r.fRight, r.fBottom, fLeft, fTop, fRight, fBottom); in intersect()
117 CHECK_INTERSECT(a.fLeft, a.fTop, a.fRight, a.fBottom, b.fLeft, b.fTop, b.fRight, b.fBottom); in intersect()
131 fTop = std::min(fTop, r.fTop); in join()
155 line.appendf(" %s, /* %f */\n", set_scalar(&tmp, fTop, asType), fTop); in dump()
[all …]
DSkScan.h106 xr->fTop = SkIntToFixed(src.fTop); in XRect_set()
117 xr->fTop = SkScalarToFixed(src.fTop); in XRect_set()
126 dst->fTop = SkFixedRoundToInt(xr.fTop); in XRect_round()
136 dst->fTop = SkFixedFloorToInt(xr.fTop); in XRect_roundOut()
DSkEdgeClipper.cpp21 return bounds.fTop >= clip.fBottom || bounds.fBottom <= clip.fTop; in quick_reject()
105 if (pts[0].fY < clip.fTop) { in chop_quad_in_Y()
106 if (chopMonoQuadAtY(pts, clip.fTop, &t)) { in chop_quad_in_Y()
110 tmp[2].fY = clip.fTop; in chop_quad_in_Y()
111 clamp_ge(tmp[3].fY, clip.fTop); in chop_quad_in_Y()
119 if (pts[i].fY < clip.fTop) { in chop_quad_in_Y()
120 pts[i].fY = clip.fTop; in chop_quad_in_Y()
154 if (pts[2].fY <= clip.fTop || pts[0].fY >= clip.fBottom) { in clipMonoQuad()
291 if (pts[0].fY < clip.fTop) { in chop_cubic_in_Y()
293 chop_mono_cubic_at_y(pts, clip.fTop, tmp); in chop_cubic_in_Y()
[all …]
DSkLineClipper.cpp92 return outer.fLeft <= inner.fLeft && outer.fTop <= inner.fTop && in containsNoEmptyCheck()
111 nestedLT(bounds.fBottom, clip.fTop, bounds.height()) || in IntersectLine()
112 nestedLT(clip.fBottom, bounds.fTop, bounds.height())) { in IntersectLine()
130 if (tmp[index0].fY < clip.fTop) { in IntersectLine()
131 tmp[index0].set(sect_with_horizontal(src, clip.fTop), clip.fTop); in IntersectLine()
195 if (pts[index1].fY <= clip.fTop) { // we're above the clip in ClipLine()
208 if (pts[index0].fY < clip.fTop) { in ClipLine()
209 tmp[index0].set(sect_with_horizontal(pts, clip.fTop), clip.fTop); in ClipLine()
DSkLatticeIter.cpp37 latticeBounds.fTop == lattice.fYDivs[0]); in Valid()
43 && valid_divs(lattice.fYDivs, lattice.fYCount, latticeBounds.fTop, latticeBounds.fBottom); in Valid()
140 bool yIsScalable = (yCount > 0 && src.fTop == yDivs[0]); in SkLatticeIter()
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()
227 fSrcY[1] = SkIntToScalar(c.fTop); in SkLatticeIter()
236 fDstY[0] = dst.fTop; in SkLatticeIter()
237 fDstY[1] = dst.fTop + SkIntToScalar(c.fTop); in SkLatticeIter()
247 fDstY[1] = fDstY[0] + (fDstY[3] - fDstY[0]) * c.fTop / (h - c.height()); in SkLatticeIter()
DSkBlitter.cpp88 SkScalar partialT = bounds.fTop + 1 - rect.fTop; in blitFatAntiRect()
92 partialT = rect.fBottom - rect.fTop; in blitFatAntiRect()
98 this->blitAntiH(bounds.fLeft, bounds.fTop, alphas, runs); in blitFatAntiRect()
101 this->blitAntiRect(bounds.fLeft, bounds.fTop + 1, bounds.width() - 2, bounds.height() - 2, in blitFatAntiRect()
204 int cy = clip.fTop; in blitMask()
261 const uint8_t* aa = mask.getAddr8(clip.fLeft, clip.fTop); in blitMask()
267 int y = clip.fTop; in blitMask()
299 this->blitRect(cr.fLeft, cr.fTop, cr.width(), cr.height()); in blitRectRegion()
348 return (unsigned)(y - rect.fTop) < (unsigned)rect.height(); in y_in_rect()
422 if (y0 < fClipRect.fTop) { in blitV()
[all …]
DSkRectPriv.h46 r->fTop = std::min(pt.fY, r->fTop); 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()
68 return SkScalarHalf(r.fBottom) - SkScalarHalf(r.fTop); in HalfHeight()
DSkScan_Path.cpp402 shiftedClip.fTop = SkLeftShift(shiftedClip.fTop, shiftEdgesUp); in sk_fill_path()
418 if (rect.fTop < start_y) { in sk_fill_path()
419 rect.fTop = start_y; in sk_fill_path()
426 rect.fTop << shiftEdgesUp, in sk_fill_path()
453 if (!pathContainedInClip && start_y < shiftedClip.fTop) { in sk_fill_path()
454 start_y = shiftedClip.fTop; in sk_fill_path()
484 tmp.fTop = cr.fTop; in sk_blit_above()
485 tmp.fBottom = ir.fTop; in sk_blit_above()
497 tmp.fTop = ir.fBottom; in sk_blit_below()
610 round_down_to_int(src.fTop), in conservative_round_to_int()
[all …]
DSkScan_AntiPath.cpp70 int fTop; member in BaseSuperBlitter
96 fTop = sectBounds.top(); in BaseSuperBlitter()
97 fCurrIY = fTop - 1; in BaseSuperBlitter()
98 fCurrY = SkLeftShift(fTop, SHIFT) - 1; in BaseSuperBlitter()
166 if (fCurrIY >= fTop) { in flush()
176 fCurrIY = fTop - 1; in flush()
531 SkASSERT(iy >= fMask.fBounds.fTop && iy < fMask.fBounds.fBottom); in blitH()
532 iy -= fMask.fBounds.fTop; // make it relative to 0 in blitH()
636 SkASSERT(SkIntToScalar(ir.fTop) <= path.getBounds().fTop); in SAAFillPath()
637 sk_fill_path(path, clipBounds, &superBlit, ir.fTop, ir.fBottom, SHIFT, containedInClip); in SAAFillPath()
[all …]
/external/skia/src/gpu/ganesh/geometry/
DGrRect.h19 SkASSERT(!a.isFinite() || (a.fLeft <= a.fRight && a.fTop <= a.fBottom)); in GrRectsOverlap()
20 SkASSERT(!b.isFinite() || (b.fLeft <= b.fRight && b.fTop <= b.fBottom)); in GrRectsOverlap()
21 return a.fRight > b.fLeft && a.fBottom > b.fTop && b.fRight > a.fLeft && b.fBottom > a.fTop; in GrRectsOverlap()
28 SkASSERT(!a.isFinite() || (a.fLeft <= a.fRight && a.fTop <= a.fBottom)); in GrRectsTouchOrOverlap()
29 SkASSERT(!b.isFinite() || (b.fLeft <= b.fRight && b.fTop <= b.fBottom)); in GrRectsTouchOrOverlap()
30 return a.fRight >= b.fLeft && a.fBottom >= b.fTop && b.fRight >= a.fLeft && b.fBottom >= a.fTop; in GrRectsTouchOrOverlap()
63 if (srcRect->fTop < 0) { in GrClipSrcRectAndDstPoint()
64 dstPoint->fY -= srcRect->fTop; in GrClipSrcRectAndDstPoint()
65 srcRect->fTop = 0; in GrClipSrcRectAndDstPoint()
68 srcRect->fTop -= dstPoint->fY; in GrClipSrcRectAndDstPoint()
[all …]
DGrTriangulator.cpp255 fTop->fID, fBottom->fID, other.fTop->fID, other.fBottom->fID); in intersect()
256 if (fTop == other.fTop || fBottom == other.fBottom || in intersect()
257 fTop == other.fBottom || fBottom == other.fTop) { in intersect()
265 fLine, fTop->fPoint, fBottom->fPoint, in intersect()
266 other.fLine, other.fTop->fPoint, other.fBottom->fPoint, in intersect()
285 *alpha = std::max((1.0 - s) * fTop->fAlpha + s * fBottom->fAlpha, in intersect()
286 (1.0 - t) * other.fTop->fAlpha + t * other.fBottom->fAlpha); in intersect()
297 TESS_LOG("removing edge %g -> %g\n", edge->fTop->fID, edge->fBottom->fID); in remove()
321 vertices.append(e->fTop); in emitMonotonePoly()
398 e->fTop->fID, e->fBottom->fID, fID, side == kLeft_Side ? "left" : "right"); in addEdge()
[all …]
/external/skia/src/pathops/
DSkPathOpsRect.h22 double fLeft, fTop, fRight, fBottom; member
26 fTop = std::min(fTop, pt.fY); in add()
33 && approximately_between(fTop, pt.fY, fBottom); in contains()
40 SkASSERT(fTop <= fBottom); in intersects()
42 SkASSERT(r.fTop <= r.fBottom); in intersects()
43 return r.fLeft <= fRight && fLeft <= r.fRight && r.fTop <= fBottom && fTop <= r.fBottom; in intersects()
48 fTop = fBottom = pt.fY; in set()
56 return fBottom - fTop; in height()
80 return fLeft <= fRight && fTop <= fBottom; in valid()
DSkPathOpsBounds.h18 && AlmostLessOrEqualUlps(a.fTop, b.fBottom) in Intersects()
19 && AlmostLessOrEqualUlps(b.fTop, a.fBottom); in Intersects()
27 if (top < fTop) fTop = top; in add()
33 add(toAdd.fLeft, toAdd.fTop, toAdd.fRight, toAdd.fBottom); in add()
38 if (pt.fY < fTop) fTop = pt.fY; in add()
45 if (pt.fY < fTop) fTop = SkDoubleToScalar(pt.fY); in add()
53 && AlmostLessOrEqualUlps(fTop, pt.fY) in almostContains()
58 return fLeft <= pt.fX && fTop <= pt.fY && in contains()
/external/skia/docs/examples/
DCanvas_drawRRect.cpp12 rRect.setNinePatch(outer, radii.fLeft, radii.fTop, radii.fRight, radii.fBottom); in draw()
15 canvas->drawLine(outer.fLeft + radii.fLeft, outer.fTop, in draw()
17 canvas->drawLine(outer.fRight - radii.fRight, outer.fTop, in draw()
19 canvas->drawLine(outer.fLeft, outer.fTop + radii.fTop, in draw()
20 outer.fRight, outer.fTop + radii.fTop, paint); in draw()
DRect_equal_operator.cpp10 test.fLeft, test.fTop, test.fRight, test.fBottom, in draw()
12 negZero.fLeft, negZero.fTop, negZero.fRight, negZero.fBottom, in draw()
13 (test.fLeft == negZero.fLeft && test.fTop == negZero.fTop && in draw()
DRRect_Corner.cpp15 canvas->drawLine(r.fLeft, r.fTop + rrect.radii(SkRRect::kUpperLeft_Corner).fY, in draw()
16 r.fRight, r.fTop + rrect.radii(SkRRect::kUpperRight_Corner).fY, paint); in draw()
19 canvas->drawLine(r.fLeft + rrect.radii(SkRRect::kUpperLeft_Corner).fX, r.fTop, in draw()
21 canvas->drawLine(r.fRight - rrect.radii(SkRRect::kUpperRight_Corner).fX, r.fTop, in draw()
DRRect_setNinePatch.cpp14 canvas->drawLine(r.fLeft, r.fTop + rrect.radii(SkRRect::kUpperLeft_Corner).fY, in draw()
15 r.fRight, r.fTop + rrect.radii(SkRRect::kUpperRight_Corner).fY, paint); in draw()
18 canvas->drawLine(r.fLeft + rrect.radii(SkRRect::kUpperLeft_Corner).fX, r.fTop, in draw()
20 canvas->drawLine(r.fRight - rrect.radii(SkRRect::kUpperRight_Corner).fX, r.fTop, in draw()
DCanvas_getLocalClipBounds.cpp11 bounds.fLeft, bounds.fTop, bounds.fRight, bounds.fBottom); in draw()
18 bounds.fLeft, bounds.fTop, bounds.fRight, bounds.fBottom); in draw()
22 bounds.fLeft, bounds.fTop, bounds.fRight, bounds.fBottom); in draw()
DBitmap_extractSubset.cpp9 SkDebugf("bounds: %d, %d, %d, %d\n", bounds.fLeft, bounds.fTop, bounds.fRight, bounds.fBottom); in draw()
15 SkDebugf("subset: %4d, %4d, %4d, %4d ", b.fLeft, b.fTop, b.fRight, b.fBottom); in draw()
19 SkDebugf(" subset: %d, %d, %d, %d", s.fLeft, s.fTop, s.fRight, s.fBottom); in draw()
/external/skia/bench/
DRTreeBench.cpp88 query.fTop = rand.nextRangeF(0, GENERATE_EXTENTS); in onDraw()
90 query.fBottom = query.fTop + 1 + rand.nextRangeF(0, GENERATE_EXTENTS/2); in onDraw()
104 out.fTop = SkIntToScalar(index / GRID_WIDTH); in make_XYordered_rects()
106 out.fBottom = out.fTop + 1 + rand.nextRangeF(0, GENERATE_EXTENTS/3); in make_XYordered_rects()
112 out.fTop = SkIntToScalar(index % GRID_WIDTH); in make_YXordered_rects()
114 out.fBottom = out.fTop + 1 + rand.nextRangeF(0, GENERATE_EXTENTS/3); in make_YXordered_rects()
121 out.fTop = rand.nextRangeF(0, GENERATE_EXTENTS); in make_random_rects()
123 out.fBottom = out.fTop + 1 + rand.nextRangeF(0, GENERATE_EXTENTS/5); in make_random_rects()
/external/skia/tests/
DM44Test.cpp247 SkV2 tl = map2d(m, {src.fLeft, src.fTop}); in DEF_TEST()
248 SkV2 tr = map2d(m, {src.fRight, src.fTop}); in DEF_TEST()
254 assertEdges(tl.y, bl.y, dst.fTop, dst.fBottom); in DEF_TEST()
255 assertEdges(tr.y, br.y, dst.fTop, dst.fBottom); in DEF_TEST()
264 REPORTER_ASSERT(reporter, SkScalarNearlyEqual(actual.fTop, expected.fTop, e.fTop), in DEF_TEST()
265 "Expected %g == %g", actual.fTop, expected.fTop); in DEF_TEST()
281 SkV4 corners[4] = {{src.fLeft, src.fTop, 0.f, 1.f}, in DEF_TEST()
282 {src.fRight, src.fTop, 0.f, 1.f}, in DEF_TEST()
301 REPORTER_ASSERT(reporter, actual.fTop <= y && y <= actual.fBottom, in DEF_TEST()
303 y, actual.fTop, actual.fBottom); in DEF_TEST()
[all …]
/external/skia/src/gpu/tessellate/
DMiddleOutPolygonTriangulator.h93 fMiddleOut->fTop = fNewTopVertex; in ~PoppedTriangleStack()
108 Iter begin() const { return {fMiddleOut ? fMiddleOut->fTop : fEnd, fLastPoint}; } in begin()
132 fTop = fVertexStack;
147 StackVertex* endVertex = fTop; in pushVertex()
170 StackVertex* endVertex = std::min(fTop, fVertexStack + 1); in closeAndMove()
189 StackVertex* fTop;
/external/skia/experimental/sktext/tests/
DSelectableText.cpp166 REPORTER_ASSERT(reporter, SkScalarNearlyEqual(firstPosition.fBoundaries.fTop, 0.0f)); in UNIX_ONLY_TEST()
178 …EPORTER_ASSERT(reporter, SkScalarNearlyEqual(lastPosition.fBoundaries.fTop, lastLine.bounds.fTop)); in UNIX_ONLY_TEST()
211 … REPORTER_ASSERT(reporter, SkScalarNearlyEqual(next.fBoundaries.fTop, line.fBounds.fTop)); in UNIX_ONLY_TEST()
217 … REPORTER_ASSERT(reporter, SkScalarNearlyEqual(position.fBoundaries.fTop, next.fBoundaries.fTop)); in UNIX_ONLY_TEST()
252 … REPORTER_ASSERT(reporter, SkScalarNearlyEqual(prev.fBoundaries.fTop, line.fBounds.fTop)); in UNIX_ONLY_TEST()
258 … REPORTER_ASSERT(reporter, SkScalarNearlyEqual(position.fBoundaries.fTop, prev.fBoundaries.fTop)); in UNIX_ONLY_TEST()

12345678910>>...17