| /external/chromium_org/third_party/skia/include/gpu/ |
| GrRect.h | 15 int16_t fLeft, fTop, fRight, fBottom;
23 int width() const { return fRight - fLeft; }
26 bool isEmpty() const { return fLeft >= fRight || fTop >= fBottom; }
31 fLeft = SkToS16(r.fLeft);
|
| /external/skia/include/gpu/ |
| GrRect.h | 15 int16_t fLeft, fTop, fRight, fBottom;
23 int width() const { return fRight - fLeft; }
26 bool isEmpty() const { return fLeft >= fRight || fTop >= fBottom; }
31 fLeft = SkToS16(r.fLeft);
|
| /external/chromium_org/third_party/skia/src/gpu/gl/ |
| GrGLIRect.h | 21 GrGLint fLeft;
27 GR_GL_CALL(gl, Viewport(fLeft, fBottom, fWidth, fHeight));
31 GR_GL_CALL(gl, Scissor(fLeft, fBottom, fWidth, fHeight));
48 fLeft = glRect.fLeft + leftOffset;
57 SkASSERT(fLeft >= 0);
64 return fLeft <= glRect.fLeft &&
66 fLeft + fWidth >= glRect.fLeft + glRect.fWidth &
[all...] |
| GrGLNameAllocator.cpp | 129 : fLeft(left),
131 SkASSERT(fLeft.get());
137 // Try allocating the range inside fLeft's internal gaps.
138 fLeft.reset(fLeft->internalAllocate(outName));
144 if (fLeft->end() + 1 == fRight->first()) {
145 // It closed the gap between fLeft and fRight; merge.
148 *outName = fLeft->appendNames(1 + removedCount);
150 return fLeft.detach();
156 // There is guaranteed to be a gap between fLeft and fRight, and th
[all...] |
| /external/skia/src/gpu/gl/ |
| GrGLIRect.h | 21 GrGLint fLeft;
27 GR_GL_CALL(gl, Viewport(fLeft, fBottom, fWidth, fHeight));
31 GR_GL_CALL(gl, Scissor(fLeft, fBottom, fWidth, fHeight));
48 fLeft = glRect.fLeft + leftOffset;
57 SkASSERT(fLeft >= 0);
64 return fLeft <= glRect.fLeft &&
66 fLeft + fWidth >= glRect.fLeft + glRect.fWidth &
[all...] |
| GrGLNameAllocator.cpp | 129 : fLeft(left),
131 SkASSERT(fLeft.get());
137 // Try allocating the range inside fLeft's internal gaps.
138 fLeft.reset(fLeft->internalAllocate(outName));
144 if (fLeft->end() + 1 == fRight->first()) {
145 // It closed the gap between fLeft and fRight; merge.
148 *outName = fLeft->appendNames(1 + removedCount);
150 return fLeft.detach();
156 // There is guaranteed to be a gap between fLeft and fRight, and th
[all...] |
| /external/chromium_org/third_party/skia/src/pathops/ |
| SkPathOpsRect.h | 13 double fLeft, fTop, fRight, fBottom;
16 if (fLeft > pt.fX) {
17 fLeft = pt.fX;
31 return approximately_between(fLeft, pt.fX, fRight)
36 SkASSERT(fLeft <= fRight);
38 SkASSERT(r->fLeft <= r->fRight);
40 return r->fLeft <= fRight && fLeft <= r->fRight && r->fTop <= fBottom && fTop <= r->fBottom;
44 fLeft = fRight = pt.fX;
49 return fRight - fLeft;
[all...] |
| SkPathOpsBounds.h | 16 return AlmostLessOrEqualUlps(a.fLeft, b.fRight)
17 && AlmostLessOrEqualUlps(b.fLeft, a.fRight)
26 if (left < fLeft) fLeft = left;
33 add(toAdd.fLeft, toAdd.fTop, toAdd.fRight, toAdd.fBottom);
37 if (pt.fX < fLeft) fLeft = pt.fX;
44 return AlmostLessOrEqualUlps(fLeft, pt.fX)
54 return !(fLeft <= fRight) || !(fTop <= fBottom)
55 || (fLeft == fRight && fTop == fBottom)
[all...] |
| /external/skia/src/pathops/ |
| SkPathOpsRect.h | 13 double fLeft, fTop, fRight, fBottom;
16 if (fLeft > pt.fX) {
17 fLeft = pt.fX;
31 return approximately_between(fLeft, pt.fX, fRight)
36 SkASSERT(fLeft <= fRight);
38 SkASSERT(r->fLeft <= r->fRight);
40 return r->fLeft <= fRight && fLeft <= r->fRight && r->fTop <= fBottom && fTop <= r->fBottom;
44 fLeft = fRight = pt.fX;
49 return fRight - fLeft;
[all...] |
| SkPathOpsBounds.h | 16 return AlmostLessOrEqualUlps(a.fLeft, b.fRight)
17 && AlmostLessOrEqualUlps(b.fLeft, a.fRight)
26 if (left < fLeft) fLeft = left;
33 add(toAdd.fLeft, toAdd.fTop, toAdd.fRight, toAdd.fBottom);
37 if (pt.fX < fLeft) fLeft = pt.fX;
44 return AlmostLessOrEqualUlps(fLeft, pt.fX)
54 return !(fLeft <= fRight) || !(fTop <= fBottom)
55 || (fLeft == fRight && fTop == fBottom)
[all...] |
| /external/chromium_org/third_party/skia/src/animator/ |
| SkBoundable.cpp | 22 fBounds.fLeft = 0x7fff;
27 if (fBounds.fLeft == (int16_t)0x8000U) {
31 rect->fLeft = SkIntToScalar(fBounds.fLeft);
38 fBounds.fLeft = 0;
|
| SkBoundable.h | 22 bool hasBounds() { return fBounds.fLeft != (int16_t)0x8000U; }
25 void clearBounds() { fBounds.fLeft = (int16_t) SkToU16(0x8000); }; // mark bounds as unset
|
| /external/skia/src/animator/ |
| SkBoundable.cpp | 22 fBounds.fLeft = 0x7fff;
27 if (fBounds.fLeft == (int16_t)0x8000U) {
31 rect->fLeft = SkIntToScalar(fBounds.fLeft);
38 fBounds.fLeft = 0;
|
| SkBoundable.h | 22 bool hasBounds() { return fBounds.fLeft != (int16_t)0x8000U; }
25 void clearBounds() { fBounds.fLeft = (int16_t) SkToU16(0x8000); }; // mark bounds as unset
|
| /external/chromium_org/third_party/skia/src/core/ |
| SkRect.cpp | 19 if (fLeft >= fRight || fTop >= fBottom) {
22 if (left < fLeft) fLeft = left;
30 if (fLeft > fRight) {
31 SkTSwap<int32_t>(fLeft, fRight);
41 if (fLeft > fRight) {
42 SkTSwap<SkScalar>(fLeft, fRight);
52 quad[0].set(fLeft, fTop);
55 quad[3].set(fLeft, fBottom);
105 fLeft < right && left < fRight && fTop < bottom && top < fBottom
[all...] |
| /external/skia/src/core/ |
| SkRect.cpp | 19 if (fLeft >= fRight || fTop >= fBottom) {
22 if (left < fLeft) fLeft = left;
30 if (fLeft > fRight) {
31 SkTSwap<int32_t>(fLeft, fRight);
41 if (fLeft > fRight) {
42 SkTSwap<SkScalar>(fLeft, fRight);
52 quad[0].set(fLeft, fTop);
55 quad[3].set(fLeft, fBottom);
105 fLeft < right && left < fRight && fTop < bottom && top < fBottom
[all...] |
| /external/chromium_org/third_party/skia/include/core/ |
| SkRect.h | 21 int32_t fLeft, fTop, fRight, fBottom;
59 int left() const { return fLeft; }
65 int x() const { return fLeft; }
72 int width() const { return fRight - fLeft; }
87 int centerX() const { return (fRight + fLeft) >> 1; }
101 bool isEmpty() const { return fLeft >= fRight || fTop >= fBottom; }
103 bool isLargest() const { return SK_MinS32 == fLeft &&
117 return SkIsS16(fLeft) && SkIsS16(fTop) &&
126 fLeft = left;
137 fLeft = x
[all...] |
| /external/skia/include/core/ |
| SkRect.h | 21 int32_t fLeft, fTop, fRight, fBottom;
59 int left() const { return fLeft; }
65 int x() const { return fLeft; }
72 int width() const { return fRight - fLeft; }
87 int centerX() const { return (fRight + fLeft) >> 1; }
101 bool isEmpty() const { return fLeft >= fRight || fTop >= fBottom; }
103 bool isLargest() const { return SK_MinS32 == fLeft &&
117 return SkIsS16(fLeft) && SkIsS16(fTop) &&
126 fLeft = left;
137 fLeft = x
[all...] |
| /external/chromium_org/third_party/skia/include/views/animated/ |
| SkBorderView.h | 22 SkScalar getLeft() const { return fLeft; }
34 SkScalar fLeft, fRight, fTop, fBottom; //margin on each side
|
| /external/skia/include/views/animated/ |
| SkBorderView.h | 22 SkScalar getLeft() const { return fLeft; }
34 SkScalar fLeft, fRight, fTop, fBottom; //margin on each side
|
| /external/chromium_org/third_party/skia/src/gpu/ |
| GrSoftwarePathRenderer.cpp | 91 rect.iset(devClipBounds.fLeft, devClipBounds.fTop,
95 if (devClipBounds.fLeft < devPathBounds.fLeft) {
96 rect.iset(devClipBounds.fLeft, devPathBounds.fTop,
97 devPathBounds.fLeft, devPathBounds.fBottom);
106 rect.iset(devClipBounds.fLeft, devPathBounds.fBottom,
|
| /external/skia/src/gpu/ |
| GrSoftwarePathRenderer.cpp | 91 rect.iset(devClipBounds.fLeft, devClipBounds.fTop,
95 if (devClipBounds.fLeft < devPathBounds.fLeft) {
96 rect.iset(devClipBounds.fLeft, devPathBounds.fTop,
97 devPathBounds.fLeft, devPathBounds.fBottom);
106 rect.iset(devClipBounds.fLeft, devPathBounds.fBottom,
|
| /frameworks/base/core/jni/android/graphics/ |
| NinePatchImpl.cpp | 80 if (!getColor(bitmap, src.fLeft, src.fTop, &c)) {
208 SkScalarToFloat(bounds.fLeft), SkScalarToFloat(bounds.fTop),
234 src.fLeft = 0;
235 dst.fLeft = bounds.fLeft;
259 i <= numXDivs && src.fLeft < bitmapWidth;
270 const int srcXSize = src.fRight - src.fLeft;
272 dst.fRight = dst.fLeft + calculateStretch(bounds.fRight, dst.fLeft,
278 dst.fRight = dst.fLeft + SkIntToScalar(srcXSize)
[all...] |
| /external/chromium_org/third_party/skia/bench/ |
| QuadTreeBench.cpp | 111 query.fLeft = rand.nextU() % GENERATE_EXTENTS;
113 query.fRight = query.fLeft + (GENERATE_EXTENTS / 20);
117 query.fLeft = rand.nextU() % GENERATE_EXTENTS;
119 query.fRight = query.fLeft + (GENERATE_EXTENTS / 2);
123 query.fLeft = -GENERATE_EXTENTS;
130 query.fLeft = rand.nextU() % GENERATE_EXTENTS;
132 query.fRight = query.fLeft + 1 + rand.nextU() % (GENERATE_EXTENTS / 2);
154 out.fLeft = index % GRID_WIDTH;
156 out.fRight = out.fLeft + 1 + rand.nextU() % (GENERATE_EXTENTS / 3);
163 out.fLeft = index / GRID_WIDTH
[all...] |
| RTreeBench.cpp | 121 query.fLeft = rand.nextU() % GENERATE_EXTENTS;
123 query.fRight = query.fLeft + (GENERATE_EXTENTS / 20);
127 query.fLeft = rand.nextU() % GENERATE_EXTENTS;
129 query.fRight = query.fLeft + (GENERATE_EXTENTS / 2);
133 query.fLeft = -GENERATE_EXTENTS;
140 query.fLeft = rand.nextU() % GENERATE_EXTENTS;
142 query.fRight = query.fLeft + 1 + rand.nextU() % (GENERATE_EXTENTS / 2);
165 out.fLeft = index % GRID_WIDTH;
167 out.fRight = out.fLeft + 1 + rand.nextU() % (GENERATE_EXTENTS / 3);
173 out.fLeft = index / GRID_WIDTH
[all...] |
