Searched defs:rect (Results 226 - 250 of 468) sorted by relevance

1234567891011>>

/external/skia/include/core/
H A DSkClipStack.h44 //!< This element combines a rect with the current clip using a set operation
46 //!< This element combines a round-rect with the current clip using a set operation
62 Element(const SkRect& rect, SkRegion::Op op, bool doAA) { argument
63 this->initRect(0, rect, op, doAA);
86 //!< Call if getType() is kRRect to get the round-rect.
89 //!< Call if getType() is kRect to get the rect.
119 * Gets the bounds of the clip element, either the rect or path bounds. (Whether the shape
139 * Conservatively checks whether the clip shape contains the rect param. (Whether the shape
142 bool contains(const SkRect& rect) const {
145 return this->getRect().contains(rect);
216 Element(int saveCount, const SkRect& rect, SkRegion::Op op, bool doAA) argument
236 initRect(int saveCount, const SkRect& rect, SkRegion::Op op, bool doAA) argument
[all...]
H A DSkRect.h48 SkIRect rect; local
49 rect.set(l, t, r, b);
50 return rect;
64 /** return the left edge of the rect */
66 /** return the top edge of the rect */
69 * Returns the rectangle's width. This does not check for a valid rect
75 * Returns the rectangle's height. This does not check for a valid rect
83 * Since the center of an integer rect may fall on a factional value, this
92 * Since the center of an integer rect may fall on a factional value, this
163 * Return a new IRect, built as an offset of this rect
268 SkASSERT(fLeft < fRight && fTop < fBottom); SkASSERT(left < right && top < bottom); return fLeft <= left && fTop <= top && fRight >= right && fBottom >= bottom; } bool containsNoEmptyCheck(const SkIRect& r) const { return containsNoEmptyCheck(r.fLeft, r.fTop, r.fRight, r.fBottom); } bool SK_WARN_UNUSED_RESULT intersect(const SkIRect& r) { return this->intersect(r.fLeft, r.fTop, r.fRight, r.fBottom); } bool SK_WARN_UNUSED_RESULT intersect(const SkIRect& a, const SkIRect& b) { if (!a.isEmpty() && !b.isEmpty() && a.fLeft < b.fRight && b.fLeft < a.fRight && a.fTop < b.fBottom && b.fTop < a.fBottom) { fLeft = SkMax32(a.fLeft, b.fLeft); fTop = SkMax32(a.fTop, b.fTop); fRight = SkMin32(a.fRight, b.fRight); fBottom = SkMin32(a.fBottom, b.fBottom); return true; } return false; } bool SK_WARN_UNUSED_RESULT intersectNoEmptyCheck(const SkIRect& a, const SkIRect& b) { SkASSERT(!a.isEmpty() && !b.isEmpty()); if (a.fLeft < b.fRight && b.fLeft < a.fRight && a.fTop < b.fBottom && b.fTop < a.fBottom) { fLeft = SkMax32(a.fLeft, b.fLeft); fTop = SkMax32(a.fTop, b.fTop); fRight = SkMin32(a.fRight, b.fRight); fBottom = SkMin32(a.fBottom, b.fBottom); return true; } return false; } bool SK_WARN_UNUSED_RESULT intersect(int32_t left, int32_t top, int32_t right, int32_t bottom) { if (left < right && top < bottom && !this->isEmpty() && fLeft < right && left < fRight && fTop < bottom && top < fBottom) { if (fLeft < left) fLeft = left; if (fTop < top) fTop = top; if (fRight > right) fRight = right; if (fBottom > bottom) fBottom = bottom; return true; } return false; } static bool Intersects(const SkIRect& a, const SkIRect& b) { return !a.isEmpty() && !b.isEmpty() && a.fLeft < b.fRight && b.fLeft < a.fRight && a.fTop < b.fBottom && b.fTop < a.fBottom; } static bool IntersectsNoEmptyCheck(const SkIRect& a, const SkIRect& b) { SkASSERT(!a.isEmpty()); SkASSERT(!b.isEmpty()); return a.fLeft < b.fRight && b.fLeft < a.fRight && a.fTop < b.fBottom && b.fTop < a.fBottom; } void join(int32_t left, int32_t top, int32_t right, int32_t bottom); void join(const SkIRect& r) { this->join(r.fLeft, r.fTop, r.fRight, r.fBottom); } void sort(); static const SkIRect& SK_WARN_UNUSED_RESULT EmptyIRect() { static const SkIRect gEmpty = { 0, 0, 0, 0 }; return gEmpty; } }; struct SK_API SkRect { SkScalar fLeft, fTop, fRight, fBottom; static SkRect SK_WARN_UNUSED_RESULT MakeEmpty() { SkRect r; r.setEmpty(); return r; } static SkRect SK_WARN_UNUSED_RESULT MakeLargest() { SkRect r; r.setLargest(); return r; } static SkRect SK_WARN_UNUSED_RESULT MakeWH(SkScalar w, SkScalar h) { SkRect r; r.set(0, 0, w, h); return r; } static SkRect SK_WARN_UNUSED_RESULT MakeIWH(int w, int h) { SkRect r; r.set(0, 0, SkIntToScalar(w), SkIntToScalar(h)); return r; } static SkRect SK_WARN_UNUSED_RESULT MakeSize(const SkSize& size) { SkRect r; r.set(0, 0, size.width(), size.height()); return r; } static SkRect SK_WARN_UNUSED_RESULT MakeLTRB(SkScalar l, SkScalar t, SkScalar r, SkScalar b) { SkRect rect; rect.set(l, t, r, b); return rect; } static SkRect SK_WARN_UNUSED_RESULT MakeXYWH(SkScalar x, SkScalar y, SkScalar w, SkScalar h) { SkRect r; r.set(x, y, x + w, y + h); return r; } SK_ATTR_DEPRECATED(�) static SkRect SK_WARN_UNUSED_RESULT MakeFromIRect(const SkIRect& irect) { SkRect r; r.set(SkIntToScalar(irect.fLeft), SkIntToScalar(irect.fTop), SkIntToScalar(irect.fRight), SkIntToScalar(irect.fBottom)); return r; } static SkRect SK_WARN_UNUSED_RESULT Make(const SkIRect& irect) { SkRect r; r.set(SkIntToScalar(irect.fLeft), SkIntToScalar(irect.fTop), SkIntToScalar(irect.fRight), SkIntToScalar(irect.fBottom)); return r; } bool isEmpty() const { return fLeft >= fRight || fTop >= fBottom; } bool isLargest() const { return SK_ScalarMin == fLeft && SK_ScalarMin == fTop && SK_ScalarMax == fRight && SK_ScalarMax == fBottom; } bool isFinite() const { float accum = 0; accum *= fLeft; accum *= fTop; accum *= fRight; accum *= fBottom; SkASSERT(0 == accum || SkScalarIsNaN(accum)); return !SkScalarIsNaN(accum); } SkScalar x() const { return fLeft; } SkScalar y() const { return fTop; } SkScalar left() const { return fLeft; } SkScalar top() const { return fTop; } SkScalar right() const { return fRight; } SkScalar bottom() const { return fBottom; } SkScalar width() const { return fRight - fLeft; } SkScalar height() const { return fBottom - fTop; } SkScalar centerX() const { return SkScalarHalf(fLeft + fRight); } SkScalar centerY() const { return SkScalarHalf(fTop + fBottom); } friend bool operator==(const SkRect& a, const SkRect& b) { return SkScalarsEqual((SkScalar*)&a, (SkScalar*)&b, 4); } friend bool operator!=(const SkRect& a, const SkRect& b) { return !SkScalarsEqual((SkScalar*)&a, (SkScalar*)&b, 4); } void toQuad(SkPoint quad[4]) const; void setEmpty() { memset(this, 0, sizeof(*this)); } void set(const SkIRect& src) { fLeft = SkIntToScalar(src.fLeft); fTop = SkIntToScalar(src.fTop); fRight = SkIntToScalar(src.fRight); fBottom = SkIntToScalar(src.fBottom); } void set(SkScalar left, SkScalar top, SkScalar right, SkScalar bottom) { fLeft = left; fTop = top; fRight = right; fBottom = bottom; } void setLTRB(SkScalar left, SkScalar top, SkScalar right, SkScalar bottom) { this->set(left, top, right, bottom); } void iset(int left, int top, int right, int bottom) { fLeft = SkIntToScalar(left); fTop = SkIntToScalar(top); fRight = SkIntToScalar(right); fBottom = SkIntToScalar(bottom); } void isetWH(int width, int height) { fLeft = fTop = 0; fRight = SkIntToScalar(width); fBottom = SkIntToScalar(height); } void set(const SkPoint pts[], int count) { (void)this->setBoundsCheck(pts, count); } void setBounds(const SkPoint pts[], int count) { (void)this->setBoundsCheck(pts, count); } bool setBoundsCheck(const SkPoint pts[], int count); void set(const SkPoint& p0, const SkPoint& p1) { fLeft = SkMinScalar(p0.fX, p1.fX); fRight = SkMaxScalar(p0.fX, p1.fX); fTop = SkMinScalar(p0.fY, p1.fY); fBottom = SkMaxScalar(p0.fY, p1.fY); } void setXYWH(SkScalar x, SkScalar y, SkScalar width, SkScalar height) { fLeft = x; fTop = y; fRight = x + width; fBottom = y + height; } void setWH(SkScalar width, SkScalar height) { fLeft = 0; fTop = 0; fRight = width; fBottom = height; } void setLargest() { fLeft = fTop = SK_ScalarMin; fRight = fBottom = SK_ScalarMax; } void setLargestInverted() { fLeft = fTop = SK_ScalarMax; fRight = fBottom = SK_ScalarMin; } SkRect makeOffset(SkScalar dx, SkScalar dy) const { return MakeLTRB(fLeft + dx, fTop + dy, fRight + dx, fBottom + dy); } SkRect makeInset(SkScalar dx, SkScalar dy) const { return MakeLTRB(fLeft + dx, fTop + dy, fRight - dx, fBottom - dy); } SkRect makeOutset(SkScalar dx, SkScalar dy) const { return MakeLTRB(fLeft - dx, fTop - dy, fRight + dx, fBottom + dy); } void offset(SkScalar dx, SkScalar dy) { fLeft += dx; fTop += dy; fRight += dx; fBottom += dy; } void offset(const SkPoint& delta) { this->offset(delta.fX, delta.fY); } void offsetTo(SkScalar newX, SkScalar newY) { fRight += newX - fLeft; fBottom += newY - fTop; fLeft = newX; fTop = newY; } void inset(SkScalar dx, SkScalar dy) { fLeft += dx; fTop += dy; fRight -= dx; fBottom -= dy; } void outset(SkScalar dx, SkScalar dy) { this->inset(-dx, -dy); } bool SK_WARN_UNUSED_RESULT intersect(const SkRect& r); bool SK_WARN_UNUSED_RESULT intersect(SkScalar left, SkScalar top, SkScalar right, SkScalar bottom); bool SK_WARN_UNUSED_RESULT intersect(const SkRect& a, const SkRect& b); private: static bool Intersects(SkScalar al, SkScalar at, SkScalar ar, SkScalar ab, SkScalar bl, SkScalar bt, SkScalar br, SkScalar bb) { SkScalar L = SkMaxScalar(al, bl); SkScalar R = SkMinScalar(ar, br); SkScalar T = SkMaxScalar(at, bt); SkScalar B = SkMinScalar(ab, bb); return L < R && T < B; } public: bool intersects(SkScalar left, SkScalar top, SkScalar right, SkScalar bottom) const { return Intersects(fLeft, fTop, fRight, fBottom, left, top, right, bottom); } bool intersects(const SkRect& r) const { return Intersects(fLeft, fTop, fRight, fBottom, r.fLeft, r.fTop, r.fRight, r.fBottom); } static bool Intersects(const SkRect& a, const SkRect& b) { return Intersects(a.fLeft, a.fTop, a.fRight, a.fBottom, b.fLeft, b.fTop, b.fRight, b.fBottom); } void join(SkScalar left, SkScalar top, SkScalar right, SkScalar bottom); void join(const SkRect& r) { this->join(r.fLeft, r.fTop, r.fRight, r.fBottom); } void joinNonEmptyArg(const SkRect& r) { SkASSERT(!r.isEmpty()); if (fLeft >= fRight || fTop >= fBottom) { *this = r; } else { this->joinPossiblyEmptyRect(r); } } void joinPossiblyEmptyRect(const SkRect& r) { fLeft = SkMinScalar(fLeft, r.left()); fTop = SkMinScalar(fTop, r.top()); fRight = SkMaxScalar(fRight, r.right()); fBottom = SkMaxScalar(fBottom, r.bottom()); } void growToInclude(SkScalar x, SkScalar y) { fLeft = SkMinScalar(x, fLeft); fRight = SkMaxScalar(x, fRight); fTop = SkMinScalar(y, fTop); fBottom = SkMaxScalar(y, fBottom); } void growToInclude(const SkPoint pts[], int count) { this->growToInclude(pts, sizeof(SkPoint), count); } void growToInclude(const SkPoint pts[], size_t stride, int count) { SkASSERT(count >= 0); SkASSERT(stride >= sizeof(SkPoint)); const SkPoint* end = (const SkPoint*)((intptr_t)pts + count * stride); for (; pts < end; pts = (const SkPoint*)((intptr_t)pts + stride)) { this->growToInclude(pts->fX, pts->fY); } } bool contains(const SkRect& r) const { return !r.isEmpty() && !this->isEmpty() && fLeft <= r.fLeft && fTop <= r.fTop && fRight >= r.fRight && fBottom >= r.fBottom; } bool contains(const SkIRect& r) const { return !r.isEmpty() && !this->isEmpty() && fLeft <= SkIntToScalar(r.fLeft) && fTop <= SkIntToScalar(r.fTop) && fRight >= SkIntToScalar(r.fRight) && fBottom >= SkIntToScalar(r.fBottom); } void round(SkIRect* dst) const { SkASSERT(dst); dst->set(SkScalarRoundToInt(fLeft), SkScalarRoundToInt(fTop), SkScalarRoundToInt(fRight), SkScalarRoundToInt(fBottom)); } void roundOut(SkIRect* dst) const { SkASSERT(dst); dst->set(SkScalarFloorToInt(fLeft), SkScalarFloorToInt(fTop), SkScalarCeilToInt(fRight), SkScalarCeilToInt(fBottom)); } void roundOut(SkRect* dst) const { dst->set(SkScalarFloorToScalar(fLeft), SkScalarFloorToScalar(fTop), SkScalarCeilToScalar(fRight), SkScalarCeilToScalar(fBottom)); } void roundIn(SkIRect* dst) const { SkASSERT(dst); dst->set(SkScalarCeilToInt(fLeft), SkScalarCeilToInt(fTop), SkScalarFloorToInt(fRight), SkScalarFloorToInt(fBottom)); } SkIRect round() const { SkIRect ir; this->round(&ir); return ir; } SkIRect roundOut() const { SkIRect ir; this->roundOut(&ir); return ir; } void sort() { if (fLeft > fRight) argument
[all...]
/external/skia/platform_tools/android/apps/sample_app/src/main/jni/
H A Dcom_skia_SkiaSampleRenderer.cpp110 void SkOSWindow::onHandleInval(const SkIRect& rect) argument
/external/skia/samplecode/
H A DSampleDraw.cpp20 SkRect rect = SkRect::MakeXYWH(25, 25, 50, 50); local
21 c.drawRect(rect, paint);
23 c.clipRect(rect);
26 rect = SkRect::MakeXYWH(50, 10, 40, 80);
27 c.clipRect(rect, SkRegion::kUnion_Op);
29 rect = SkRect::MakeXYWH(50, 0, 50, 100);
32 // c.drawRect(rect, paint);
34 c.drawRect(rect, paint);
/external/skia/src/core/
H A DSkClipStack.cpp203 // if the new rect carves out a portion of the old one there is no
221 // are inside the current clip rect since the extensions
622 bool SkClipStack::quickContains(const SkRect& rect) const {
630 // Part of 'rect' could be trimmed off by the inverse-filled clip element
631 if (SkRect::Intersects(element->getBounds(), rect)) {
635 if (!element->contains(rect)) {
726 void SkClipStack::clipDevRect(const SkRect& rect, SkRegion::Op op, bool doAA) { argument
727 Element element(fSaveCount, rect, op, doAA);
864 "rect",
H A DSkMaskFilter.cpp60 static void blitClippedRect(SkBlitter* blitter, const SkIRect& rect, const SkIRect& clipR) { argument
62 if (r.intersect(rect, clipR)) {
202 const SkIRect& cr = clipper.rect();
284 const SkIRect& cr = clipper.rect();
H A DSkPicturePlayback.cpp146 const SkRect& rect = reader->skipT<SkRect>(); local
152 canvas->clipRect(rect, regionOp, doAA);
H A DSkReadBuffer.cpp141 void SkReadBuffer::readIRect(SkIRect* rect) { argument
142 memcpy(rect, fReader.skip(sizeof(SkIRect)), sizeof(SkIRect));
145 void SkReadBuffer::readRect(SkRect* rect) { argument
146 memcpy(rect, fReader.skip(sizeof(SkRect)), sizeof(SkRect));
H A DSkValidatingReadBuffer.cpp138 void SkValidatingReadBuffer::readIRect(SkIRect* rect) { argument
141 memcpy(rect, ptr, sizeof(SkIRect));
145 void SkValidatingReadBuffer::readRect(SkRect* rect) { argument
148 memcpy(rect, ptr, sizeof(SkRect));
H A DSkWriteBuffer.cpp116 void SkWriteBuffer::writeIRect(const SkIRect& rect) { argument
117 fWriter.write(&rect, sizeof(SkIRect));
120 void SkWriteBuffer::writeRect(const SkRect& rect) { argument
121 fWriter.writeRect(rect);
/external/skia/src/effects/
H A DSkAlphaThresholdFilter.cpp319 SkRect rect = SkRect::Make(iter.rect()); local
320 drawContext->drawRect(clip, grPaint, inMatrix, rect);
H A DSkMatrixConvolutionImageFilter.cpp167 SkIRect rect(r);
168 if (!rect.intersect(bounds)) {
171 for (int y = rect.fTop; y < rect.fBottom; ++y) {
172 SkPMColor* dptr = result->getAddr32(rect.fLeft - bounds.fLeft, y - bounds.fTop);
173 for (int x = rect.fLeft; x < rect.fRight; ++x) {
209 const SkIRect& rect,
212 filterPixels<PixelFetcher, true>(src, result, rect, bounds);
214 filterPixels<PixelFetcher, false>(src, result, rect, bound
207 filterPixels(const SkBitmap& src, SkBitmap* result, const SkIRect& rect, const SkIRect& bounds) const argument
218 filterInteriorPixels(const SkBitmap& src, SkBitmap* result, const SkIRect& rect, const SkIRect& bounds) const argument
225 filterBorderPixels(const SkBitmap& src, SkBitmap* result, const SkIRect& rect, const SkIRect& bounds) const argument
[all...]
/external/skia/src/gpu/
H A DGrDrawTarget.cpp356 void GrDrawTarget::clear(const SkIRect* rect, argument
362 if (!rect ||
364 rect->contains(rtRect)) {
365 rect = &rtRect;
367 clippedRect = *rect;
371 rect = &clippedRect;
375 // This works around a driver bug with clear by drawing a rect instead.
378 if (rect == &rtRect) {
387 SkRect scalarRect = SkRect::Make(*rect);
393 GrBatch* batch = new GrClearBatch(*rect, colo
537 clearStencilClip(const SkIRect& rect, bool insideClip, GrRenderTarget* rt) argument
[all...]
H A DGrGpu.cpp237 void GrGpu::clear(const SkIRect& rect, argument
241 SkASSERT(SkIRect::MakeWH(renderTarget->width(), renderTarget->height()).contains(rect));
243 this->onClear(renderTarget, rect, color);
246 void GrGpu::clearStencilClip(const SkIRect& rect, argument
251 this->onClearStencilClip(renderTarget, rect, insideClip);
/external/skia/src/gpu/batches/
H A DGrAAFillRectBatch.cpp80 const SkRect& rect,
105 // create the rotated rect
106 fan0Pos->setRectFan(rect.fLeft, rect.fTop,
107 rect.fRight, rect.fBottom, vertexStride);
231 // We apply the viewmatrix to the rect points on the cpu. However, if the pipeline uses
310 const SkMatrix& viewMatrix, const SkRect& rect,
315 geo.fRect = rect;
321 const SkRect& rect, cons
76 generate_aa_fill_rect_geometry(intptr_t verts, size_t vertexStride, GrColor color, const SkMatrix& viewMatrix, const SkRect& rect, const SkRect& devRect, const GrXPOverridesForBatch& overrides, const SkMatrix* localMatrix) argument
309 append_to_batch(AAFillRectBatchNoLocalMatrix* batch, GrColor color, const SkMatrix& viewMatrix, const SkRect& rect, const SkRect& devRect) argument
319 append_to_batch(AAFillRectBatchLocalMatrix* batch, GrColor color, const SkMatrix& viewMatrix, const SkMatrix& localMatrix, const SkRect& rect, const SkRect& devRect) argument
332 Create(GrColor color, const SkMatrix& viewMatrix, const SkRect& rect, const SkRect& devRect) argument
342 Create(GrColor color, const SkMatrix& viewMatrix, const SkMatrix& localMatrix, const SkRect& rect, const SkRect& devRect) argument
353 Create(GrColor color, const SkMatrix& viewMatrix, const SkMatrix& localMatrix, const SkRect& rect) argument
362 CreateWithLocalRect(GrColor color, const SkMatrix& viewMatrix, const SkRect& rect, const SkRect& localRect) argument
375 Append(GrBatch* origBatch, GrColor color, const SkMatrix& viewMatrix, const SkRect& rect, const SkRect& devRect) argument
385 Append(GrBatch* origBatch, GrColor color, const SkMatrix& viewMatrix, const SkMatrix& localMatrix, const SkRect& rect, const SkRect& devRect) argument
407 SkRect rect = GrTest::TestRect(random); local
416 SkRect rect = GrTest::TestRect(random); local
[all...]
/external/skia/src/gpu/effects/
H A DGrRRectEffect.cpp155 // The inner rect is the rrect bounds inset by the radius. Its left, top, right, and bottom
157 // only rectangular corners, that side's value corresponds to the rect edge's value outset by
193 // computations, compute a separate rect edge alpha for the rect side, and mul the two computed
300 SkRect rect = rrect.getBounds(); local
307 rect.inset(radius, radius);
311 rect.fLeft += radius;
312 rect.fTop += radius;
313 rect.fRight += 0.5f;
314 rect
[all...]
/external/skia/src/pdf/
H A DSkPDFUtils.cpp22 SkPDFArray* SkPDFUtils::RectToArray(const SkRect& rect) { argument
25 result->appendScalar(rect.fLeft);
26 result->appendScalar(rect.fTop);
27 result->appendScalar(rect.fRight);
28 result->appendScalar(rect.fBottom);
107 void SkPDFUtils::AppendRectangle(const SkRect& rect, SkWStream* content) { argument
109 SkScalar bottom = SkMinScalar(rect.fBottom, rect.fTop);
111 SkPDFUtils::AppendScalar(rect.fLeft, content);
115 SkPDFUtils::AppendScalar(rect
[all...]
/external/skia/src/utils/
H A DSkPaintFilterCanvas.cpp61 void SkPaintFilterCanvas::onDrawRect(const SkRect& rect, const SkPaint& paint) { argument
64 this->INHERITED::onDrawRect(rect, *apf.paint());
83 void SkPaintFilterCanvas::onDrawOval(const SkRect& rect, const SkPaint& paint) { argument
86 this->INHERITED::onDrawOval(rect, *apf.paint());
/external/skia/tests/
H A DRRectInPathTest.cpp193 const SkRect& rect,
197 rr.setNinePatch(rect, l, t, r, b);
206 rr2.setRectRadii(rect, radii);
218 SkRect rect = SkRect::MakeLTRB(0, 0, kWidth, kHeight); local
221 rr1.setRect(rect);
226 rr1_2.setRectRadii(rect, rr1_2_radii);
229 rr1_3.setNinePatch(rect, 0, 0, 0, 0);
235 rr2.setOval(rect);
241 rr2_2.setRectRadii(rect, rr2_2_radii);
244 rr2_3.setNinePatch(rect, halfPoin
192 test_9patch_rrect(skiatest::Reporter* reporter, const SkRect& rect, SkScalar l, SkScalar t, SkScalar r, SkScalar b, bool checkRadii) argument
286 SkRect rect = SkRect::MakeLTRB(0, 0, kWidth, kHeight); local
311 SkRect rect = SkRect::MakeLTRB(0, 0, kWidth, kHeight); local
321 SkRect rect = SkRect::MakeLTRB(0, 0, kWidth, kHeight); local
337 SkRect rect = SkRect::MakeLTRB(0, 0, kWidth, kHeight); local
[all...]
H A DSerializationTest.cpp473 SkRect rect = SkRect::MakeXYWH(1, 2, 20, 30); local
475 rrect.setRectRadii(rect, corners);
/external/skia/tools/debugger/
H A DSkObjectParser.cpp108 SkString* SkObjectParser::IRectToString(const SkIRect& rect) { argument
111 mRect->appendS32(rect.left());
113 mRect->appendS32(rect.top());
115 mRect->appendS32(rect.right());
117 mRect->appendS32(rect.bottom());
250 SkString* SkObjectParser::RectToString(const SkRect& rect, const char* title) { argument
260 mRect->appendScalar(rect.left());
262 mRect->appendScalar(rect.top());
264 mRect->appendScalar(rect.right());
266 mRect->appendScalar(rect
[all...]
/external/webrtc/webrtc/modules/desktop_capture/
H A Ddesktop_region.cc31 DesktopRegion::DesktopRegion(const DesktopRect& rect) { argument
32 AddRect(rect);
83 void DesktopRegion::SetRect(const DesktopRect& rect) { argument
85 AddRect(rect);
88 void DesktopRegion::AddRect(const DesktopRect& rect) { argument
89 if (rect.is_empty())
92 // Top of the part of the |rect| that hasn't been inserted yet. Increased as
93 // we iterate over the rows until it reaches |rect.bottom()|.
94 int top = rect.top();
96 // Iterate over all rows that may intersect with |rect| an
269 IntersectWith(const DesktopRect& rect) argument
364 Subtract(const DesktopRect& rect) argument
[all...]
/external/clang/test/Sema/
H A Ddesignated-initializers.c56 struct rect { struct
61 struct rect window = { .top_left.x = 1.0 };
63 struct rect windows[] = {
70 int windows_size[((sizeof(windows) / sizeof(struct rect)) == 6)? 1 : -1];
72 struct rect windows_bad[3] = {
78 struct rect windows[10];
87 struct rect window;
/external/dng_sdk/source/
H A Ddng_utils.cpp357 const dng_rect_real64 &rect)
361 rect.TL ());
365 rect.BL ()));
369 rect.BR ()));
373 rect.TR ()));
382 const dng_rect_real64 &rect)
386 rect));
356 MaxSquaredDistancePointToRect(const dng_point_real64 &point, const dng_rect_real64 &rect) argument
381 MaxDistancePointToRect(const dng_point_real64 &point, const dng_rect_real64 &rect) argument
/external/libvncserver/libvncserver/
H A Dcursor.c39 rfbFramebufferUpdateRectHeader rect; local
55 rect.encoding = Swap32IfLE(rfbEncodingRichCursor);
59 rect.encoding = Swap32IfLE(rfbEncodingXCursor);
75 rect.r.x = rect.r.y = 0;
76 rect.r.w = rect.r.h = 0;
77 memcpy(&cl->updateBuf[cl->ublen], (char *)&rect,
112 rect.r.x = Swap16IfLE(pCursor->xhot);
113 rect
183 rfbFramebufferUpdateRectHeader rect; local
694 sraRegionPtr rect; local
[all...]

Completed in 692 milliseconds

1234567891011>>