Searched refs:bounds (Results 26 - 50 of 1705) sorted by last modified time

1234567891011>>

/external/skia/src/core/
H A DSkBBoxRecord.cpp38 // If path is inverse filled, use the current clip bounds as the
59 // in the computed bounds.
113 // Set vertical bounds to max extents from font metrics
118 // Pad horizontal bounds on each side by half of max vertical extents (this is sort of
290 bool SkBBoxRecord::transformBounds(const SkRect& bounds, const SkPaint* paint) { argument
291 SkRect outBounds = bounds;
300 // set bounds to current clip
H A DSkBBoxRecord.h76 bool transformBounds(const SkRect& bounds, const SkPaint* paint);
H A DSkBitmap.cpp142 void SkBitmap::getBounds(SkRect* bounds) const {
143 SkASSERT(bounds);
144 bounds->set(0, 0,
148 void SkBitmap::getBounds(SkIRect* bounds) const {
149 SkASSERT(bounds);
150 bounds->set(0, 0, fInfo.fWidth, fInfo.fHeight);
846 // If the upper left of the rectangle was outside the bounds of this SkBitmap, we should have
1160 // compute our (larger?) dst bounds if we have a filter
H A DSkBlitter.cpp427 SkDEBUGCODE(const SkIRect& bounds = fRgn->getBounds();)
433 SkASSERT(left >= bounds.fLeft && right <= bounds.fRight);
462 SkIRect bounds;
463 bounds.set(x, y, x + 1, y + height);
465 SkRegion::Cliperator iter(*fRgn, bounds);
469 SkASSERT(bounds.contains(r));
477 SkIRect bounds;
478 bounds.set(x, y, x + width, y + height);
480 SkRegion::Cliperator iter(*fRgn, bounds);
[all...]
H A DSkBlitter.h170 const SkIRect* bounds = NULL);
H A DSkCanvas.cpp113 by the device's XY offset and bitmap-bounds.
311 const SkRect* bounds = NULL) : fOrigPaint(paint) {
322 (void)canvas->internalSaveLayer(bounds, &tmp, SkCanvas::kARGB_ClipLayer_SaveFlag,
431 #define LOOPER_BEGIN(paint, type, bounds) \
433 AutoDrawLooper looper(this, paint, false, bounds); \
587 /* Now we update our initial region to have the bounds of the new device,
588 and then intersect all of the clips in our stack with these bounds,
589 to ensure that we can't draw outside of the device's bounds (and trash
598 accurately take advantage of the new device bounds.
601 SkIRect bounds; local
820 clipRectBounds(const SkRect* bounds, SaveFlags flags, SkIRect* intersection, const SkImageFilter* imageFilter) argument
864 saveLayer(const SkRect* bounds, const SkPaint* paint) argument
869 saveLayer(const SkRect* bounds, const SkPaint* paint, SaveFlags flags) argument
881 internalSaveLayer(const SkRect* bounds, const SkPaint* paint, SaveFlags flags, bool justForImageFilter, SaveLayerStrategy strategy) argument
945 saveLayerAlpha(const SkRect* bounds, U8CPU alpha) argument
949 saveLayerAlpha(const SkRect* bounds, U8CPU alpha, SaveFlags flags) argument
1171 const SkRect* bounds = NULL; local
1537 updateClipConservativelyUsingBounds(const SkRect& bounds, SkRegion::Op op, bool inverseFilled) argument
1880 const SkRect* bounds = NULL; local
1907 const SkRect* bounds = NULL; local
1926 const SkRect* bounds = NULL; local
1945 const SkRect* bounds = NULL; local
1975 const SkRect* bounds = NULL; local
1998 const SkRect* bounds = NULL; local
2029 SkRect bounds = { local
2058 const SkRect* bounds = &dst; local
2103 const SkRect* bounds = &dst; local
[all...]
H A DSkClipStack.cpp229 // occur w/in the intersection of the two finite bounds
259 // lie within the union of the two finite bounds
270 // union of the two bounds. If the two clips exactly overlapped
320 // occur in the union of the two finite bounds
624 SkRect bounds; local
626 this->getBounds(&bounds, &bt);
628 if (bounds.contains(*rect)) {
636 return rect->intersect(bounds);
H A DSkDeviceLooper.cpp12 const SkIRect& bounds, bool aa)
27 if (rc.isEmpty() || !fClippedBounds.intersect(bounds, rc.getBounds())) {
10 SkDeviceLooper(const SkBitmap& base, const SkRasterClip& rc, const SkIRect& bounds, bool aa) argument
H A DSkDeviceLooper.h28 * at all, and if not (i.e. the specified bounds and base bitmap area already
34 const SkIRect& bounds, bool aa);
H A DSkDraw.cpp1146 // set the mask's bounds to the transformed bitmap-bounds,
1295 SkIRect bounds; local
1296 bounds.set(x, y, x + bitmap.width(), y + bitmap.height());
1298 if (fRC->quickReject(bounds)) {
1312 SkScan::FillIRect(bounds, *fRC, blitter);
1321 r.set(bounds);
1429 SkIRect* bounds = &mask.fBounds; local
1438 bounds = &storage;
1452 state.blitMask(mask, *bounds);
2277 compute_bounds(const SkPath& devPath, const SkIRect* clipBounds, const SkMaskFilter* filter, const SkMatrix* filterMatrix, SkIRect* bounds) argument
[all...]
H A DSkEdgeClipper.cpp13 static bool quick_reject(const SkRect& bounds, const SkRect& clip) { argument
14 return bounds.fTop >= clip.fBottom || bounds.fBottom <= clip.fTop;
201 SkRect bounds; local
202 bounds.set(srcPts, 3);
204 if (!quick_reject(bounds, clip)) {
409 SkRect bounds;
410 bounds.set(srcPts, 4);
412 if (!quick_reject(bounds, clip)) {
H A DSkGeometry.cpp1445 void SkConic::computeTightBounds(SkRect* bounds) const {
1458 bounds->set(pts, count);
1461 void SkConic::computeFastBounds(SkRect* bounds) const {
1462 bounds->set(fPts, 3);
H A DSkGeometry.h256 void computeTightBounds(SkRect* bounds) const;
257 void computeFastBounds(SkRect* bounds) const;
H A DSkImageFilter.cpp128 * bounds with the clip bounds. This is so that the cached result
129 * is always the full size of the primitive's bounds,
151 SkRect bounds; local
152 input->computeFastBounds(src, &bounds);
153 dst->join(bounds);
180 SkIRect bounds; local
181 if (!this->applyCropRect(ctx, proxy, input, &srcOffset, &bounds, &input)) {
184 SkRect srcRect = SkRect::Make(bounds);
190 desc.fWidth = bounds
241 applyCropRect(const Context& ctx, Proxy* proxy, const SkBitmap& src, SkIPoint* srcOffset, SkIRect* bounds, SkBitmap* dst) const argument
282 SkIRect bounds; local
[all...]
H A DSkLineClipper.cpp79 SkRect bounds; local
81 bounds.set(src, 2);
82 if (containsNoEmptyCheck(clip, bounds)) {
90 if (nestedLT(bounds.fRight, clip.fLeft, bounds.width()) ||
91 nestedLT(clip.fRight, bounds.fLeft, bounds.width()) ||
92 nestedLT(bounds.fBottom, clip.fTop, bounds.height()) ||
93 nestedLT(clip.fBottom, bounds
[all...]
H A DSkMaskFilter.cpp43 const SkIRect& bounds, const SkIRect& clipR) {
45 if (r.intersect(bounds, clipR)) {
42 blitClippedMask(SkBlitter* blitter, const SkMask& mask, const SkIRect& bounds, const SkIRect& clipR) argument
H A DSkMatrixClipStateMgr.cpp145 int SkMatrixClipStateMgr::saveLayer(const SkRect* bounds, const SkPaint* paint, argument
175 fPicRecord->recordSaveLayer(bounds, paint, flags | SkCanvas::kMatrixClip_SaveFlag);
H A DSkMatrixClipStateMgr.h280 int saveLayer(const SkRect* bounds, const SkPaint* paint, SkCanvas::SaveFlags flags);
H A DSkPaint.cpp1021 static void set_bounds(const SkGlyph& g, SkRect* bounds) { argument
1022 bounds->set(SkIntToScalar(g.fLeft),
1036 static void join_bounds_x(const SkGlyph& g, SkRect* bounds, Sk48Dot16 dx) { argument
1038 bounds->join(SkIntToScalar(g.fLeft) + sx,
1044 static void join_bounds_y(const SkGlyph& g, SkRect* bounds, Sk48Dot16 dy) { argument
1046 bounds->join(SkIntToScalar(g.fLeft),
1062 int* count, SkRect* bounds) const {
1066 if (bounds) {
1067 bounds->setEmpty();
1074 NULL != bounds);
1134 measureText(const void* textData, size_t length, SkRect* bounds, SkScalar zoom) const argument
1326 set_bounds(const SkGlyph& g, SkRect* bounds, SkScalar scale) argument
[all...]
H A DSkPath.cpp21 * Path.bounds is defined to be the bounds of all the control points.
22 * If we called bounds.join(r) we would skip r if r was empty, which breaks
55 used when we know the bounds of the amount we are going to add to the path
59 cached bounds), and then if it can, it updates the cache bounds explicitly,
94 // Cannot use fRect for our bounds unless we know it is sorted
97 // Mark the path's bounds as dirty if (1) they are, or (2) the path
98 // is non-finite, and therefore its bounds are not meaningful
184 // note: don't need to look at isConvex or bounds, sinc
1086 const SkRect& bounds = rrect.getBounds(); local
2195 SkRect bounds; local
[all...]
H A DSkPathRef.cpp76 * Here we optimize the bounds computation, by noting if the bounds are
82 * if it is non-finite. In those cases bounds need to stay empty,
226 const SkRect& bounds = this->getBounds(); local
242 buffer->write(&bounds, sizeof(bounds));
H A DSkPictureRecord.cpp177 SkCanvas::SaveLayerStrategy SkPictureRecord::willSaveLayer(const SkRect* bounds, argument
181 fMCMgr.saveLayer(bounds, paint, flags);
186 this->recordSaveLayer(bounds, paint, flags);
192 this->INHERITED::willSaveLayer(bounds, paint, flags);
201 void SkPictureRecord::recordSaveLayer(const SkRect* bounds, const SkPaint* paint, argument
203 // op + bool for 'bounds'
205 if (NULL != bounds) {
206 size += sizeof(*bounds); // + rect
214 this->addRectPtr(bounds);
451 * SAVE_LAYER (with NULL == bounds)
1211 SkRect bounds; local
[all...]
H A DSkPictureRecord.h297 void recordSaveLayer(const SkRect* bounds, const SkPaint* paint, SaveFlags flags);
H A DSkQuadTree.cpp49 SkQuadTree::SkQuadTree(const SkIRect& bounds) : fRoot(NULL) { argument
50 SkASSERT((bounds.width() * bounds.height()) > 0);
51 fRootBounds = bounds;
156 void SkQuadTree::insert(void* data, const SkIRect& bounds, bool) { argument
157 if (bounds.isEmpty()) {
163 entry->fBounds = bounds;
H A DSkQuadTree.h31 * @param bounds The bounding box for the root of the quad tree.
32 * giving the quad tree bounds that fall outside the root
33 * bounds may result in pathological but correct behavior.
35 SkQuadTree(const SkIRect& bounds);
40 * Insert a node, consisting of bounds and a data value into the tree, if we don't immediately
44 * @param bounds The corresponding bounding box
47 virtual void insert(void* data, const SkIRect& bounds, bool defer = false) SK_OVERRIDE;

Completed in 248 milliseconds

1234567891011>>