| /external/skia/src/pathops/ |
| SkIntersections.cpp | 14 for (int index = 0; index < fUsed; ++index) {
29 for (int index = 0; index < fUsed; ++index) {
39 SkASSERT(fUsed <= 1 || fT[0][0] <= fT[0][1]);
41 for (index = 0; index < fUsed; ++index) {
69 if (fUsed >= fMax) {
72 fUsed = 0;
75 int remaining = fUsed - index;
93 ++fUsed;
94 SkASSERT(fUsed <= SK_ARRAY_COUNT(fPt));
129 fUsed = 1
[all...] |
| SkDLineIntersection.cpp | 11 while (fUsed > 2) {
14 if (fUsed == 2 && !parallel) {
27 if (fUsed == 2) {
34 if ((fUsed = used) == 2) {
68 return fUsed = 0;
76 return fUsed;
113 if (unparallel && fUsed == 0) {
177 SkASSERT(fUsed <= 2);
178 return fUsed;
221 if (result == 1 && fUsed == 0)
[all...] |
| SkIntersections.h | 112 return fUsed > 0 && (t == 0 ? fT[0][0] == 0 : fT[0][fUsed - 1] == 1);
117 return fUsed > 0 && (fT[1][0] == t || fT[1][fUsed - 1] == t);
194 fUsed = 0;
216 return fUsed;
224 SkASSERT(fUsed == 1);
227 fUsed = 0;
316 unsigned char fUsed;
|
| SkDConicLineIntersection.cpp | 369 fUsed = c.intersectRay(fT[0]);
370 for (int index = 0; index < fUsed; ++index) {
373 return fUsed;
|
| SkDCubicLineIntersection.cpp | 440 fUsed = c.intersectRay(fT[0]);
441 for (int index = 0; index < fUsed; ++index) {
444 return fUsed;
|
| SkDQuadLineIntersection.cpp | 445 fUsed = q.intersectRay(fT[0]);
446 for (int index = 0; index < fUsed; ++index) {
449 return fUsed;
|
| SkPathOpsTSect.h | [all...] |
| /external/skqp/src/pathops/ |
| SkIntersections.cpp | 14 for (int index = 0; index < fUsed; ++index) {
29 for (int index = 0; index < fUsed; ++index) {
39 SkASSERT(fUsed <= 1 || fT[0][0] <= fT[0][1]);
41 for (index = 0; index < fUsed; ++index) {
69 if (fUsed >= fMax) {
72 fUsed = 0;
75 int remaining = fUsed - index;
93 ++fUsed;
94 SkASSERT(fUsed <= SK_ARRAY_COUNT(fPt));
129 fUsed = 1
[all...] |
| SkDLineIntersection.cpp | 11 while (fUsed > 2) {
14 if (fUsed == 2 && !parallel) {
27 if (fUsed == 2) {
34 if ((fUsed = used) == 2) {
68 return fUsed = 0;
76 return fUsed;
113 if (unparallel && fUsed == 0) {
177 SkASSERT(fUsed <= 2);
178 return fUsed;
221 if (result == 1 && fUsed == 0)
[all...] |
| SkIntersections.h | 112 return fUsed > 0 && (t == 0 ? fT[0][0] == 0 : fT[0][fUsed - 1] == 1);
117 return fUsed > 0 && (fT[1][0] == t || fT[1][fUsed - 1] == t);
194 fUsed = 0;
216 return fUsed;
224 SkASSERT(fUsed == 1);
227 fUsed = 0;
316 unsigned char fUsed;
|
| SkDConicLineIntersection.cpp | 369 fUsed = c.intersectRay(fT[0]);
370 for (int index = 0; index < fUsed; ++index) {
373 return fUsed;
|
| SkDCubicLineIntersection.cpp | 440 fUsed = c.intersectRay(fT[0]);
441 for (int index = 0; index < fUsed; ++index) {
444 return fUsed;
|
| SkDQuadLineIntersection.cpp | 445 fUsed = q.intersectRay(fT[0]);
446 for (int index = 0; index < fUsed; ++index) {
449 return fUsed;
|
| /external/skia/src/core/ |
| SkWriter32.h | 40 size_t bytesWritten() const { return fUsed; }
51 fUsed = 0;
58 size_t offset = fUsed;
59 size_t totalRequired = fUsed + size;
63 fUsed = totalRequired;
74 SkASSERT(offset < fUsed);
85 SkASSERT(offset < fUsed);
223 fUsed = offset;
228 memcpy(dst, fData, fUsed);
232 return stream->write(fData, fUsed);
[all...] |
| SkWriter32.cpp | 82 memcpy(fData, fExternal, fUsed);
87 return SkData::MakeWithCopy(fData, fUsed);
|
| SkRWBuffer.cpp | 22 size_t fUsed; // updated by the writer
25 SkBufferBlock(size_t capacity) : fNext(nullptr), fUsed(0), fCapacity(capacity) {}
29 size_t avail() const { return fCapacity - fUsed; }
30 void* availData() { return (char*)this->startData() + fUsed; }
45 fUsed += amount;
50 // Do not call in the reader thread, since the writer may be updating fUsed.
55 SkASSERT(fUsed <= fCapacity);
112 totalUsed += block->fUsed;
126 // block.fUsed, which may be updated by the writer.
|
| SkLiteDL.h | 26 bool empty() const { return fUsed == 0; }
92 size_t fUsed = 0;
|
| SkLiteDL.cpp | 512 if (fUsed + skip > fReserved) {
515 fReserved = (fUsed + skip + SKLITEDL_PAGE) & ~(SKLITEDL_PAGE-1);
518 SkASSERT(fUsed + skip <= fReserved);
519 auto op = (T*)(fBytes.get() + fUsed);
520 fUsed += skip;
529 auto end = fBytes.get() + fUsed;
735 fUsed = 0;
|
| /external/skqp/src/core/ |
| SkWriter32.h | 40 size_t bytesWritten() const { return fUsed; }
51 fUsed = 0;
58 size_t offset = fUsed;
59 size_t totalRequired = fUsed + size;
63 fUsed = totalRequired;
74 SkASSERT(offset < fUsed);
85 SkASSERT(offset < fUsed);
223 fUsed = offset;
228 memcpy(dst, fData, fUsed);
232 return stream->write(fData, fUsed);
[all...] |
| SkWriter32.cpp | 82 memcpy(fData, fExternal, fUsed);
87 return SkData::MakeWithCopy(fData, fUsed);
|
| SkRWBuffer.cpp | 22 size_t fUsed; // updated by the writer
25 SkBufferBlock(size_t capacity) : fNext(nullptr), fUsed(0), fCapacity(capacity) {}
29 size_t avail() const { return fCapacity - fUsed; }
30 void* availData() { return (char*)this->startData() + fUsed; }
45 fUsed += amount;
50 // Do not call in the reader thread, since the writer may be updating fUsed.
55 SkASSERT(fUsed <= fCapacity);
112 totalUsed += block->fUsed;
126 // block.fUsed, which may be updated by the writer.
|
| SkLiteDL.h | 26 bool empty() const { return fUsed == 0; }
92 size_t fUsed = 0;
|
| SkLiteDL.cpp | 512 if (fUsed + skip > fReserved) {
515 fReserved = (fUsed + skip + SKLITEDL_PAGE) & ~(SKLITEDL_PAGE-1);
518 SkASSERT(fUsed + skip <= fReserved);
519 auto op = (T*)(fBytes.get() + fUsed);
520 fUsed += skip;
529 auto end = fBytes.get() + fUsed;
735 fUsed = 0;
|
| /external/skia/src/lazy/ |
| SkDiscardableMemoryPool.cpp | 58 size_t fUsed;
128 , fUsed(0) {
143 if (fUsed <= budget) {
149 while ((fUsed > budget) && (cur)) {
154 SkASSERT(fUsed >= dm->fBytes);
155 fUsed -= dm->fBytes;
174 fUsed += bytes;
183 SkASSERT(fUsed >= dm->fBytes);
184 fUsed -= dm->fBytes;
218 return fUsed;
[all...] |
| /external/skqp/src/lazy/ |
| SkDiscardableMemoryPool.cpp | 58 size_t fUsed;
128 , fUsed(0) {
143 if (fUsed <= budget) {
149 while ((fUsed > budget) && (cur)) {
154 SkASSERT(fUsed >= dm->fBytes);
155 fUsed -= dm->fBytes;
174 fUsed += bytes;
183 SkASSERT(fUsed >= dm->fBytes);
184 fUsed -= dm->fBytes;
218 return fUsed;
[all...] |
