| /external/chromium_org/third_party/skia/experimental/Intersection/ |
| Intersections.h | 34 for (int index = 0; index < fUsed; ++index) {
49 for (int index = base; index < fUsed; ++index) {
80 return fUsed > 0;
87 fUsed = 0;
97 for (index = 0; index < fUsed; ++index) {
111 return fUsed;
131 unsigned char fUsed;
|
| Intersections.cpp | 18 SkASSERT(coincidentUsed() == fUsed);
23 while (i1 < fUsed && !(fIsCoincident[fSwap] & (1 << i1))) {
26 if (i1 == fUsed) {
29 SkASSERT(i1 < fUsed);
34 SkASSERT(iEnd1 < fUsed);
41 while (i2 < fUsed && !(fIsCoincident[fSwap ^ 1] & (1 << i2))) {
48 SkASSERT(iEnd2 < fUsed);
87 SkASSERT(fUsed < 9);
93 SkASSERT(fUsed <= 1 || fT[0][0] <= fT[0][1]);
95 for (index = 0; index < fUsed; ++index)
[all...] |
| LineCubicIntersection.cpp | 115 return intersections.fUsed;
141 return intersections.fUsed;
167 return intersections.fUsed;
226 int roots = intersections.fUsed;
|
| LineQuadraticIntersection.cpp | 143 return intersections.fUsed;
172 return intersections.fUsed;
201 return intersections.fUsed;
261 int roots = intersections.fUsed;
|
| /external/skia/experimental/Intersection/ |
| Intersections.h | 34 for (int index = 0; index < fUsed; ++index) {
49 for (int index = base; index < fUsed; ++index) {
80 return fUsed > 0;
87 fUsed = 0;
97 for (index = 0; index < fUsed; ++index) {
111 return fUsed;
131 unsigned char fUsed;
|
| Intersections.cpp | 18 SkASSERT(coincidentUsed() == fUsed);
23 while (i1 < fUsed && !(fIsCoincident[fSwap] & (1 << i1))) {
26 if (i1 == fUsed) {
29 SkASSERT(i1 < fUsed);
34 SkASSERT(iEnd1 < fUsed);
41 while (i2 < fUsed && !(fIsCoincident[fSwap ^ 1] & (1 << i2))) {
48 SkASSERT(iEnd2 < fUsed);
87 SkASSERT(fUsed < 9);
93 SkASSERT(fUsed <= 1 || fT[0][0] <= fT[0][1]);
95 for (index = 0; index < fUsed; ++index)
[all...] |
| LineCubicIntersection.cpp | 115 return intersections.fUsed;
141 return intersections.fUsed;
167 return intersections.fUsed;
226 int roots = intersections.fUsed;
|
| /external/chromium_org/third_party/skia/src/core/ |
| SkWriter32.cpp | 75 memcpy(fData, fExternal, fUsed);
85 if ((fSnapshot.get() != NULL) && (fSnapshot->size() != fUsed)) {
92 buffer = (uint8_t*)sk_malloc_throw(fUsed);
93 memcpy(buffer, fData, fUsed);
99 mutable_this.fCapacity = fUsed;
102 mutable_this.fSnapshot.reset(SkData::NewFromMalloc(buffer, fUsed));
|
| /external/skia/src/core/ |
| SkWriter32.cpp | 75 memcpy(fData, fExternal, fUsed);
85 if ((fSnapshot.get() != NULL) && (fSnapshot->size() != fUsed)) {
92 buffer = (uint8_t*)sk_malloc_throw(fUsed);
93 memcpy(buffer, fData, fUsed);
99 mutable_this.fCapacity = fUsed;
102 mutable_this.fSnapshot.reset(SkData::NewFromMalloc(buffer, fUsed));
|
| /external/chromium_org/third_party/skia/src/pathops/ |
| SkIntersections.cpp | 11 for (int index = 0; index < i.fUsed; ++index) {
37 for (int index = 0; index < fUsed; ++index) {
59 for (int index = 0; index < fUsed; ++index) {
69 SkASSERT(fUsed <= 1 || fT[0][0] <= fT[0][1]);
71 for (index = 0; index < fUsed; ++index) {
97 if (fUsed >= fMax) {
100 fUsed = 0;
103 int remaining = fUsed - index;
116 ++fUsed;
126 fPt2[one ? fUsed - 1 : 0] = pt2
[all...] |
| SkDLineIntersection.cpp | 30 SkASSERT(fUsed == 2);
45 while (fUsed > 2) {
48 if (fUsed == 2 && !parallel) {
60 if ((fUsed = used) == 2) {
81 fUsed = 0;
100 return fUsed = 0;
108 return fUsed;
145 if (unparallel && fUsed == 0) {
210 SkASSERT(fUsed <= 2);
211 return fUsed;
[all...] |
| SkDCubicIntersection.cpp | 113 SkDebugf(" xlocals.fUsed=%d\n", xlocals.used());
258 if (fUsed < 2) {
261 int last = fUsed - 1;
273 if (fUsed > 2) {
277 fUsed = 2;
318 for (int index = 0; index < fUsed; ++index) {
481 return fUsed;
493 SkASSERT(fUsed < 4);
496 return fUsed;
499 return fUsed;
[all...] |
| SkDQuadIntersection.cpp | 409 SkASSERT(fUsed < 3);
411 return fUsed;
414 return fUsed;
419 return fUsed;
426 return fUsed;
434 if (copyI.fUsed >= 2) {
435 SkASSERT(copyI.fUsed <= 4);
438 for (int index = 2; index < copyI.fUsed; ++index) {
454 bool expectCoincident = copyI.fUsed >= 2 && innerEqual == 2;
458 int last = copyI.fUsed - 1
[all...] |
| SkIntersections.h | 97 return fUsed > 0 && (t == 0 ? fT[0][0] == 0 : fT[0][fUsed - 1] == 1);
184 fUsed = 0;
206 return fUsed;
281 unsigned char fUsed;
|
| /external/skia/src/pathops/ |
| SkIntersections.cpp | 11 for (int index = 0; index < i.fUsed; ++index) {
37 for (int index = 0; index < fUsed; ++index) {
59 for (int index = 0; index < fUsed; ++index) {
69 SkASSERT(fUsed <= 1 || fT[0][0] <= fT[0][1]);
71 for (index = 0; index < fUsed; ++index) {
97 if (fUsed >= fMax) {
100 fUsed = 0;
103 int remaining = fUsed - index;
116 ++fUsed;
126 fPt2[one ? fUsed - 1 : 0] = pt2
[all...] |
| SkDLineIntersection.cpp | 30 SkASSERT(fUsed == 2);
45 while (fUsed > 2) {
48 if (fUsed == 2 && !parallel) {
60 if ((fUsed = used) == 2) {
81 fUsed = 0;
100 return fUsed = 0;
108 return fUsed;
145 if (unparallel && fUsed == 0) {
207 SkASSERT(fUsed <= 2);
208 return fUsed;
[all...] |
| SkDCubicIntersection.cpp | 113 SkDebugf(" xlocals.fUsed=%d\n", xlocals.used());
258 if (fUsed < 2) {
261 int last = fUsed - 1;
273 if (fUsed > 2) {
277 fUsed = 2;
318 for (int index = 0; index < fUsed; ++index) {
481 return fUsed;
493 SkASSERT(fUsed < 4);
496 return fUsed;
499 return fUsed;
[all...] |
| SkDQuadIntersection.cpp | 409 SkASSERT(fUsed < 3);
411 return fUsed;
414 return fUsed;
419 return fUsed;
426 return fUsed;
434 if (copyI.fUsed >= 2) {
435 SkASSERT(copyI.fUsed <= 4);
438 for (int index = 2; index < copyI.fUsed; ++index) {
454 bool expectCoincident = copyI.fUsed >= 2 && innerEqual == 2;
458 int last = copyI.fUsed - 1
[all...] |
| SkIntersections.h | 97 return fUsed > 0 && (t == 0 ? fT[0][0] == 0 : fT[0][fUsed - 1] == 1);
184 fUsed = 0;
206 return fUsed;
281 unsigned char fUsed;
|
| /external/chromium_org/third_party/skia/experimental/PdfViewer/ |
| SkPdfConfig.h | 52 #define SkPdfMarkObjectUsed() fUsed = true
58 #define SkPdfMarkObjectUnused() fUsed = false
|
| /external/skia/experimental/PdfViewer/ |
| SkPdfConfig.h | 52 #define SkPdfMarkObjectUsed() fUsed = true
58 #define SkPdfMarkObjectUnused() fUsed = false
|
| /external/chromium_org/third_party/skia/include/core/ |
| SkWriter32.h | 39 size_t bytesWritten() const { return fUsed; }
51 fUsed = 0;
64 size_t offset = fUsed;
65 size_t totalRequired = fUsed + size;
69 fUsed = totalRequired;
80 SkASSERT(offset < fUsed);
91 SkASSERT(offset < fUsed);
218 fUsed = offset;
223 memcpy(dst, fData, fUsed);
227 return stream->write(fData, fUsed);
[all...] |
| /external/skia/include/core/ |
| SkWriter32.h | 39 size_t bytesWritten() const { return fUsed; }
51 fUsed = 0;
64 size_t offset = fUsed;
65 size_t totalRequired = fUsed + size;
69 fUsed = totalRequired;
80 SkASSERT(offset < fUsed);
91 SkASSERT(offset < fUsed);
218 fUsed = offset;
223 memcpy(dst, fData, fUsed);
227 return stream->write(fData, fUsed);
[all...] |
| /external/chromium_org/third_party/skia/src/lazy/ |
| SkDiscardableMemoryPool.cpp | 57 size_t fUsed;
135 , fUsed(0) {
152 if (fUsed <= budget) {
158 while ((fUsed > budget) && (cur)) {
164 SkASSERT(fUsed >= dm->fBytes);
165 fUsed -= dm->fBytes;
185 fUsed += bytes;
196 SkASSERT(fUsed >= dm->fBytes);
197 fUsed -= dm->fBytes;
238 return fUsed;
[all...] |
| /external/skia/src/lazy/ |
| SkDiscardableMemoryPool.cpp | 56 size_t fUsed;
134 , fUsed(0) {
151 if (fUsed <= budget) {
157 while ((fUsed > budget) && (NULL != cur)) {
163 SkASSERT(fUsed >= dm->fBytes);
164 fUsed -= dm->fBytes;
184 fUsed += bytes;
195 SkASSERT(fUsed >= dm->fBytes);
196 fUsed -= dm->fBytes;
237 return fUsed;
[all...] |
