/external/chromium_org/third_party/skia/src/animator/ |
H A D | SkBoundable.cpp | 16 fBounds.fTop = 0; 17 fBounds.fRight = 0; 18 fBounds.fBottom = 0; 22 fBounds.fLeft = 0x7fff; 27 if (fBounds.fLeft == (int16_t)0x8000U) { 31 rect->fLeft = SkIntToScalar(fBounds.fLeft); 32 rect->fTop = SkIntToScalar(fBounds.fTop); 33 rect->fRight = SkIntToScalar(fBounds.fRight); 34 rect->fBottom = SkIntToScalar(fBounds.fBottom); 38 fBounds [all...] |
H A D | SkBoundable.h | 22 bool hasBounds() { return fBounds.fLeft != (int16_t)0x8000U; } 23 void setBounds(SkIRect& bounds) { fBounds = bounds; } 25 void clearBounds() { fBounds.fLeft = (int16_t) SkToU16(0x8000); }; // mark bounds as unset 26 SkIRect fBounds; member in class:SkBoundable
|
H A D | SkDisplayBounds.cpp | 30 fBounds.setEmpty(); 34 if (inval && fBounds.isEmpty() == false) { 38 rect = fBounds; 40 rect.join(fBounds);
|
/external/skia/src/animator/ |
H A D | SkBoundable.cpp | 16 fBounds.fTop = 0; 17 fBounds.fRight = 0; 18 fBounds.fBottom = 0; 22 fBounds.fLeft = 0x7fff; 27 if (fBounds.fLeft == (int16_t)0x8000U) { 31 rect->fLeft = SkIntToScalar(fBounds.fLeft); 32 rect->fTop = SkIntToScalar(fBounds.fTop); 33 rect->fRight = SkIntToScalar(fBounds.fRight); 34 rect->fBottom = SkIntToScalar(fBounds.fBottom); 38 fBounds [all...] |
H A D | SkBoundable.h | 22 bool hasBounds() { return fBounds.fLeft != (int16_t)0x8000U; } 23 void setBounds(SkIRect& bounds) { fBounds = bounds; } 25 void clearBounds() { fBounds.fLeft = (int16_t) SkToU16(0x8000); }; // mark bounds as unset 26 SkIRect fBounds; member in class:SkBoundable
|
H A D | SkDisplayBounds.cpp | 30 fBounds.setEmpty(); 34 if (inval && fBounds.isEmpty() == false) { 38 rect = fBounds; 40 rect.join(fBounds);
|
/external/chromium_org/third_party/skia/include/core/ |
H A D | SkMask.h | 34 SkIRect fBounds; member in struct:SkMask 40 bool isEmpty() const { return fBounds.isEmpty(); } 56 x,y are in the same coordiate space as fBounds. 60 SkASSERT(fBounds.contains(x, y)); 62 return fImage + ((x - fBounds.fLeft) >> 3) + (y - fBounds.fTop) * fRowBytes; 67 x,y are in the same coordiate space as fBounds. 71 SkASSERT(fBounds.contains(x, y)); 73 return fImage + x - fBounds.fLeft + (y - fBounds [all...] |
H A D | SkRegion.h | 86 const SkIRect& getBounds() const { return fBounds; } 197 SkASSERT(this->isEmpty() == fBounds.isEmpty()); // valid region 201 /* fBounds.contains(left, top, right, bottom); */ 202 fBounds.fLeft <= left && fBounds.fTop <= top && 203 fBounds.fRight >= right && fBounds.fBottom >= bottom; 213 !SkIRect::Intersects(fBounds, rect); 223 !SkIRect::Intersects(fBounds, rgn.fBounds); 406 SkIRect fBounds; member in class:SkRegion [all...] |
/external/skia/include/core/ |
H A D | SkMask.h | 34 SkIRect fBounds; member in struct:SkMask 40 bool isEmpty() const { return fBounds.isEmpty(); } 56 x,y are in the same coordiate space as fBounds. 60 SkASSERT(fBounds.contains(x, y)); 62 return fImage + ((x - fBounds.fLeft) >> 3) + (y - fBounds.fTop) * fRowBytes; 67 x,y are in the same coordiate space as fBounds. 71 SkASSERT(fBounds.contains(x, y)); 73 return fImage + x - fBounds.fLeft + (y - fBounds [all...] |
/external/chromium_org/third_party/skia/src/core/ |
H A D | SkMaskFilter.cpp | 31 SkASSERT(src.fBounds.contains(dst->fBounds)); 33 const int dx = dst->fBounds.left() - src.fBounds.left(); 34 const int dy = dst->fBounds.top() - src.fBounds.top(); 57 for (int y = mask.fBounds.top(); y < mask.fBounds.bottom(); ++y) { 58 for (int x = mask.fBounds.left(); x < mask.fBounds [all...] |
H A D | SkRTree.h | 104 SkIRect fBounds; member in struct:SkRTree::Branch 127 return lhs.fBounds.*fSide < rhs.fBounds.*fSide; 135 return ((lhs.fBounds.fRight - lhs.fBounds.fLeft) >> 1) < 136 ((rhs.fBounds.fRight - lhs.fBounds.fLeft) >> 1); 142 return ((lhs.fBounds.fBottom - lhs.fBounds.fTop) >> 1) < 143 ((rhs.fBounds [all...] |
H A D | SkMask.cpp | 25 return safeMul32(fBounds.height(), fRowBytes); 69 SkASSERT(fBounds.contains(x, y)); 73 addr += (y - fBounds.fTop) * fRowBytes; 74 addr += (x - fBounds.fLeft) << maskFormatToShift(fFormat);
|
H A D | SkRTree.cpp | 56 newBranch.fBounds = bounds; 71 fRoot.fBounds = this->computeBounds(fRoot.fChild.subtree); 80 fRoot.fBounds = this->computeBounds(fRoot.fChild.subtree); 95 fRoot.fBounds = fDeferredInserts[0].fBounds; 112 if (!this->isEmpty() && SkIRect::IntersectsNoEmptyCheck(fRoot.fBounds, query)) { 138 root->child(childIndex)->fBounds = this->computeBounds( 167 branch->fBounds = this->computeBounds(newSibling); 186 const SkIRect& subtreeBounds = root->child(i)->fBounds; 187 int32_t areaIncrease = get_area_increase(subtreeBounds, branch->fBounds); [all...] |
H A D | SkRegion.cpp | 73 fBounds.set(0, 0, 0, 0); 123 SkTSwap<SkIRect>(fBounds, other.fBounds); 138 fBounds.set(0, 0, 0, 0); 149 fBounds.set(left, top, right, bottom); 162 fBounds = src.fBounds; 228 *itop = fBounds.fTop; 229 *ibot = fBounds.fBottom; 283 if (SkRegion::RunsAreARect(runs, count, &fBounds)) { [all...] |
/external/skia/src/core/ |
H A D | SkMaskFilter.cpp | 31 SkASSERT(src.fBounds.contains(dst->fBounds)); 33 const int dx = dst->fBounds.left() - src.fBounds.left(); 34 const int dy = dst->fBounds.top() - src.fBounds.top(); 57 for (int y = mask.fBounds.top(); y < mask.fBounds.bottom(); ++y) { 58 for (int x = mask.fBounds.left(); x < mask.fBounds [all...] |
H A D | SkRTree.h | 104 SkIRect fBounds; member in struct:SkRTree::Branch 127 return lhs.fBounds.*fSide < rhs.fBounds.*fSide; 135 return ((lhs.fBounds.fRight - lhs.fBounds.fLeft) >> 1) < 136 ((rhs.fBounds.fRight - lhs.fBounds.fLeft) >> 1); 142 return ((lhs.fBounds.fBottom - lhs.fBounds.fTop) >> 1) < 143 ((rhs.fBounds [all...] |
H A D | SkMask.cpp | 25 return safeMul32(fBounds.height(), fRowBytes); 69 SkASSERT(fBounds.contains(x, y)); 73 addr += (y - fBounds.fTop) * fRowBytes; 74 addr += (x - fBounds.fLeft) << maskFormatToShift(fFormat);
|
H A D | SkRTree.cpp | 56 newBranch.fBounds = bounds; 71 fRoot.fBounds = this->computeBounds(fRoot.fChild.subtree); 80 fRoot.fBounds = this->computeBounds(fRoot.fChild.subtree); 95 fRoot.fBounds = fDeferredInserts[0].fBounds; 112 if (!this->isEmpty() && SkIRect::IntersectsNoEmptyCheck(fRoot.fBounds, query)) { 138 root->child(childIndex)->fBounds = this->computeBounds( 167 branch->fBounds = this->computeBounds(newSibling); 186 const SkIRect& subtreeBounds = root->child(i)->fBounds; 187 int32_t areaIncrease = get_area_increase(subtreeBounds, branch->fBounds); [all...] |
H A D | SkRegion.cpp | 73 fBounds.set(0, 0, 0, 0); 123 SkTSwap<SkIRect>(fBounds, other.fBounds); 138 fBounds.set(0, 0, 0, 0); 149 fBounds.set(left, top, right, bottom); 162 fBounds = src.fBounds; 228 *itop = fBounds.fTop; 229 *ibot = fBounds.fBottom; 283 if (SkRegion::RunsAreARect(runs, count, &fBounds)) { [all...] |
/external/chromium_org/third_party/skia/src/gpu/ |
H A D | GrPath.h | 20 const SkRect& getBounds() const { return fBounds; } 23 SkRect fBounds; member in class:GrPath
|
/external/skia/src/gpu/ |
H A D | GrPath.h | 20 const SkRect& getBounds() const { return fBounds; } 23 SkRect fBounds; member in class:GrPath
|
/external/chromium_org/third_party/skia/include/gpu/ |
H A D | GrGlyph.h | 28 GrIRect16 fBounds; member in struct:GrGlyph 35 fBounds.set(bounds); 46 int width() const { return fBounds.width(); } 47 int height() const { return fBounds.height(); } 48 bool isEmpty() const { return fBounds.isEmpty(); }
|
/external/chromium_org/third_party/skia/src/effects/ |
H A D | SkStippleMaskFilter.cpp | 20 dst->fBounds = src.fBounds; 21 dst->fRowBytes = dst->fBounds.width(); 36 for (int y = 0; y < src.fBounds.height(); ++y) { 37 for (int x = 0; x < src.fBounds.width(); ++x) {
|
/external/skia/include/gpu/ |
H A D | GrGlyph.h | 28 GrIRect16 fBounds; member in struct:GrGlyph 35 fBounds.set(bounds); 46 int width() const { return fBounds.width(); } 47 int height() const { return fBounds.height(); } 48 bool isEmpty() const { return fBounds.isEmpty(); }
|
/external/skia/src/effects/ |
H A D | SkStippleMaskFilter.cpp | 20 dst->fBounds = src.fBounds; 21 dst->fRowBytes = dst->fBounds.width(); 36 for (int y = 0; y < src.fBounds.height(); ++y) { 37 for (int x = 0; x < src.fBounds.width(); ++x) {
|