Searched refs:fBounds (Results 1 - 25 of 138) sorted by relevance

123456

/external/chromium_org/third_party/skia/src/animator/
H A DSkBoundable.cpp16 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 DSkBoundable.h22 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 DSkDisplayBounds.cpp30 fBounds.setEmpty();
34 if (inval && fBounds.isEmpty() == false) {
38 rect = fBounds;
40 rect.join(fBounds);
/external/skia/src/animator/
H A DSkBoundable.cpp16 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 DSkBoundable.h22 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 DSkDisplayBounds.cpp30 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 DSkMask.h34 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/skia/include/core/
H A DSkMask.h34 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 DSkMaskFilter.cpp33 SkASSERT(src.fBounds.contains(dst->fBounds));
35 const int dx = dst->fBounds.left() - src.fBounds.left();
36 const int dy = dst->fBounds.top() - src.fBounds.top();
59 for (int y = mask.fBounds.top(); y < mask.fBounds.bottom(); ++y) {
60 for (int x = mask.fBounds.left(); x < mask.fBounds
[all...]
H A DSkRTree.h111 SkIRect fBounds; member in struct:SkRTree::Branch
134 return lhs.fBounds.*fSide < rhs.fBounds.*fSide;
142 return ((lhs.fBounds.fRight - lhs.fBounds.fLeft) >> 1) <
143 ((rhs.fBounds.fRight - lhs.fBounds.fLeft) >> 1);
149 return ((lhs.fBounds.fBottom - lhs.fBounds.fTop) >> 1) <
150 ((rhs.fBounds
[all...]
H A DSkMask.cpp22 return safeMul32(fBounds.height(), fRowBytes);
66 SkASSERT(fBounds.contains(x, y));
70 addr += (y - fBounds.fTop) * fRowBytes;
71 addr += (x - fBounds.fLeft) << maskFormatToShift(fFormat);
H A DSkRTree.cpp61 newBranch.fBounds = bounds;
76 fRoot.fBounds = this->computeBounds(fRoot.fChild.subtree);
85 fRoot.fBounds = this->computeBounds(fRoot.fChild.subtree);
100 fRoot.fBounds = fDeferredInserts[0].fBounds;
117 if (!this->isEmpty() && SkIRect::IntersectsNoEmptyCheck(fRoot.fBounds, query)) {
143 root->child(childIndex)->fBounds = this->computeBounds(
172 branch->fBounds = this->computeBounds(newSibling);
191 const SkIRect& subtreeBounds = root->child(i)->fBounds;
192 int32_t areaIncrease = get_area_increase(subtreeBounds, branch->fBounds);
[all...]
H A DSkRegion.cpp73 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;
223 *itop = fBounds.fTop;
224 *ibot = fBounds.fBottom;
278 if (SkRegion::RunsAreARect(runs, count, &fBounds)) {
[all...]
/external/skia/src/core/
H A DSkMaskFilter.cpp33 SkASSERT(src.fBounds.contains(dst->fBounds));
35 const int dx = dst->fBounds.left() - src.fBounds.left();
36 const int dy = dst->fBounds.top() - src.fBounds.top();
59 for (int y = mask.fBounds.top(); y < mask.fBounds.bottom(); ++y) {
60 for (int x = mask.fBounds.left(); x < mask.fBounds
[all...]
H A DSkRTree.h111 SkIRect fBounds; member in struct:SkRTree::Branch
134 return lhs.fBounds.*fSide < rhs.fBounds.*fSide;
142 return ((lhs.fBounds.fRight - lhs.fBounds.fLeft) >> 1) <
143 ((rhs.fBounds.fRight - lhs.fBounds.fLeft) >> 1);
149 return ((lhs.fBounds.fBottom - lhs.fBounds.fTop) >> 1) <
150 ((rhs.fBounds
[all...]
H A DSkQuadTree.cpp60 switch(child_intersect(entry->fBounds, node->fSplitPoint)) {
88 node->fSplitPoint = SkIPoint::Make(node->fBounds.centerX(),
89 node->fBounds.centerY());
93 node->fChildren[0]->fBounds = SkIRect::MakeLTRB(
94 node->fBounds.fLeft, node->fBounds.fTop,
96 node->fChildren[1]->fBounds = SkIRect::MakeLTRB(
97 node->fSplitPoint.fX, node->fBounds.fTop,
98 node->fBounds.fRight, node->fSplitPoint.fY);
99 node->fChildren[2]->fBounds
[all...]
H A DSkMask.cpp22 return safeMul32(fBounds.height(), fRowBytes);
66 SkASSERT(fBounds.contains(x, y));
70 addr += (y - fBounds.fTop) * fRowBytes;
71 addr += (x - fBounds.fLeft) << maskFormatToShift(fFormat);
H A DSkRTree.cpp54 newBranch.fBounds = bounds;
69 fRoot.fBounds = this->computeBounds(fRoot.fChild.subtree);
78 fRoot.fBounds = this->computeBounds(fRoot.fChild.subtree);
93 fRoot.fBounds = fDeferredInserts[0].fBounds;
110 if (!this->isEmpty() && SkIRect::IntersectsNoEmptyCheck(fRoot.fBounds, query)) {
136 root->child(childIndex)->fBounds = this->computeBounds(
165 branch->fBounds = this->computeBounds(newSibling);
184 const SkIRect& subtreeBounds = root->child(i)->fBounds;
185 int32_t areaIncrease = get_area_increase(subtreeBounds, branch->fBounds);
[all...]
H A DSkRegion.cpp73 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;
223 *itop = fBounds.fTop;
224 *ibot = fBounds.fBottom;
278 if (SkRegion::RunsAreARect(runs, count, &fBounds)) {
[all...]
/external/chromium_org/third_party/skia/include/gpu/
H A DGrGlyph.h29 GrIRect16 fBounds; member in struct:GrGlyph
36 fBounds.set(bounds);
47 int width() const { return fBounds.width(); }
48 int height() const { return fBounds.height(); }
49 bool isEmpty() const { return fBounds.isEmpty(); }
/external/skia/include/gpu/
H A DGrGlyph.h28 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 DSkStippleMaskFilter.cpp20 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/chromium_org/third_party/skia/src/gpu/
H A DGrPath.h28 fBounds(skPath.getBounds()) {
38 const SkRect& getBounds() const { return fBounds; }
45 SkRect fBounds; member in class:GrPath
/external/skia/src/gpu/
H A DGrPath.h25 fBounds(skPath.getBounds()) {
34 const SkRect& getBounds() const { return fBounds; }
41 SkRect fBounds; member in class:GrPath
H A DGrLayerCache.h30 fBounds = bounds;
38 return fBounds;
43 GrIRect16 fBounds; // only valid is fPlot != NULL member in class:GrAtlasLocation

Completed in 303 milliseconds

123456