/external/skia/src/core/ |
SkRWBuffer.h | 28 size_t size() const { return fUsed; } 63 const size_t fUsed;
|
SkRWBuffer.cpp | 16 size_t fUsed; 21 size_t avail() const { return fCapacity - fUsed; } 22 void* availData() { return (char*)this->startData() + fUsed; } 28 block->fUsed = 0; 38 fUsed += amount; 46 SkASSERT(fUsed <= fCapacity); 72 head->fBlock.fUsed = 0; 105 totalUsed += block->fUsed; 117 SkROBuffer::SkROBuffer(const SkBufferHead* head, size_t used) : fHead(head), fUsed(used) { 129 fHead->validate(fUsed); [all...] |
SkWriter32.cpp | 75 memcpy(fData, fExternal, fUsed); 80 return SkData::NewWithCopy(fData, fUsed);
|
/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; 89 ++fUsed; 90 SkASSERT(fUsed <= SK_ARRAY_COUNT(fPt)); 125 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 | 107 return fUsed > 0 && (t == 0 ? fT[0][0] == 0 : fT[0][fUsed - 1] == 1); 185 fUsed = 0; 207 return fUsed; 215 SkASSERT(fUsed == 1); 218 fUsed = 0; 307 unsigned char fUsed;
|
SkDConicLineIntersection.cpp | 348 fUsed = c.intersectRay(fT[0]); 349 for (int index = 0; index < fUsed; ++index) { 352 return fUsed;
|
SkDCubicLineIntersection.cpp | 422 fUsed = c.intersectRay(fT[0]); 423 for (int index = 0; index < fUsed; ++index) { 426 return fUsed;
|
SkDQuadLineIntersection.cpp | 429 fUsed = q.intersectRay(fT[0]); 430 for (int index = 0; index < fUsed; ++index) { 433 return fUsed;
|
SkPathOpsTSect.h | [all...] |
SkPathOpsDebug.cpp | [all...] |
/external/skia/include/core/ |
SkWriter32.h | 39 size_t bytesWritten() const { return fUsed; } 50 fUsed = 0; 63 size_t offset = fUsed; 64 size_t totalRequired = fUsed + size; 68 fUsed = totalRequired; 79 SkASSERT(offset < fUsed); 90 SkASSERT(offset < fUsed); 216 fUsed = offset; 221 memcpy(dst, fData, fUsed); 225 return stream->write(fData, fUsed); [all...] |
/external/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; 184 fUsed += bytes; 195 SkASSERT(fUsed >= dm->fBytes); 196 fUsed -= dm->fBytes; 230 return fUsed; [all...] |
/external/skia/src/gpu/batches/ |
GrBatch.cpp | 55 SkDEBUGCODE(fUsed = false;)
|
GrBatch.h | 101 SkDEBUGCODE(bool isUsed() const { return fUsed; }) 154 SkDEBUGCODE(bool fUsed;)
|
/external/skia/tests/ |
PathOpsDebug.cpp | 185 SkDebugf("used=%d of %d", fUsed, fMax); 186 for (int index = 0; index < fUsed; ++index) { [all...] |