/external/skia/src/pathops/ |
D | SkIntersections.cpp | 14 for (int index = 0; index < fUsed; ++index) { in closestTo() 29 for (int index = 0; index < fUsed; ++index) { in flip() 39 SkASSERT(fUsed <= 1 || fT[0][0] <= fT[0][1]); in insert() 41 for (index = 0; index < fUsed; ++index) { in insert() 57 int remaining = fUsed - index - 1; in insert() 64 --fUsed; in insert() 73 for (index = 0; index < fUsed; ++index) { in insert() 78 if (fUsed >= fMax) { in insert() 81 fUsed = 0; in insert() 84 int remaining = fUsed - index; in insert() [all …]
|
D | SkDLineIntersection.cpp | 13 while (fUsed > 2) { in cleanUpParallelLines() 16 if (fUsed == 2 && !parallel) { in cleanUpParallelLines() 29 if (fUsed == 2) { in cleanUpParallelLines() 36 if ((fUsed = used) == 2) { in computePoints() 70 return fUsed = 0; in intersectRay() 78 return fUsed; in intersectRay() 115 if (unparallel && fUsed == 0) { in intersect() 179 SkASSERT(fUsed <= 2); in intersect() 180 return fUsed; in intersect() 225 if (result == 1 && fUsed == 0) { in horizontal() [all …]
|
D | SkIntersections.h | 112 return fUsed > 0 && (t == 0 ? fT[0][0] == 0 : fT[0][fUsed - 1] == 1); in hasT() 117 return fUsed > 0 && (fT[1][0] == t || fT[1][fUsed - 1] == t); in hasOppT() 194 fUsed = 0; in reset() 216 return fUsed; in used() 224 SkASSERT(fUsed == 1); in unBumpT() 227 fUsed = 0; in unBumpT() 320 unsigned char fUsed; variable
|
D | SkDQuadLineIntersection.cpp | 445 fUsed = q.intersectRay(fT[0]); in intersectRay() 446 for (int index = 0; index < fUsed; ++index) { in intersectRay() 449 return fUsed; in intersectRay()
|
D | SkDCubicLineIntersection.cpp | 440 fUsed = c.intersectRay(fT[0]); in intersectRay() 441 for (int index = 0; index < fUsed; ++index) { in intersectRay() 444 return fUsed; in intersectRay()
|
D | SkDConicLineIntersection.cpp | 369 fUsed = c.intersectRay(fT[0]); in intersectRay() 370 for (int index = 0; index < fUsed; ++index) { in intersectRay() 373 return fUsed; in intersectRay()
|
D | SkPathOpsTSect.cpp | 1727 : fUsed(0) { in SkClosestSect() 1733 SkClosestRecord* record = &fClosest[fUsed]; in find() 1741 for (int index = 0; index < fUsed; ++index) { in find() 1752 ++fUsed; in find() 1760 for (int index = 0; index < fUsed; ++index) { in finish() 1764 for (int index = 0; index < fUsed; ++index) { in finish() 1772 int fUsed; member
|
/external/skqp/src/pathops/ |
D | SkIntersections.cpp | 14 for (int index = 0; index < fUsed; ++index) { in closestTo() 29 for (int index = 0; index < fUsed; ++index) { in flip() 39 SkASSERT(fUsed <= 1 || fT[0][0] <= fT[0][1]); in insert() 41 for (index = 0; index < fUsed; ++index) { in insert() 57 int remaining = fUsed - index - 1; in insert() 64 --fUsed; in insert() 73 for (index = 0; index < fUsed; ++index) { in insert() 78 if (fUsed >= fMax) { in insert() 81 fUsed = 0; in insert() 84 int remaining = fUsed - index; in insert() [all …]
|
D | SkDLineIntersection.cpp | 13 while (fUsed > 2) { in cleanUpParallelLines() 16 if (fUsed == 2 && !parallel) { in cleanUpParallelLines() 29 if (fUsed == 2) { in cleanUpParallelLines() 36 if ((fUsed = used) == 2) { in computePoints() 70 return fUsed = 0; in intersectRay() 78 return fUsed; in intersectRay() 115 if (unparallel && fUsed == 0) { in intersect() 179 SkASSERT(fUsed <= 2); in intersect() 180 return fUsed; in intersect() 225 if (result == 1 && fUsed == 0) { in horizontal() [all …]
|
D | SkIntersections.h | 112 return fUsed > 0 && (t == 0 ? fT[0][0] == 0 : fT[0][fUsed - 1] == 1); in hasT() 117 return fUsed > 0 && (fT[1][0] == t || fT[1][fUsed - 1] == t); in hasOppT() 194 fUsed = 0; in reset() 216 return fUsed; in used() 224 SkASSERT(fUsed == 1); in unBumpT() 227 fUsed = 0; in unBumpT() 320 unsigned char fUsed; variable
|
D | SkDQuadLineIntersection.cpp | 445 fUsed = q.intersectRay(fT[0]); in intersectRay() 446 for (int index = 0; index < fUsed; ++index) { in intersectRay() 449 return fUsed; in intersectRay()
|
D | SkDConicLineIntersection.cpp | 369 fUsed = c.intersectRay(fT[0]); in intersectRay() 370 for (int index = 0; index < fUsed; ++index) { in intersectRay() 373 return fUsed; in intersectRay()
|
D | SkDCubicLineIntersection.cpp | 440 fUsed = c.intersectRay(fT[0]); in intersectRay() 441 for (int index = 0; index < fUsed; ++index) { in intersectRay() 444 return fUsed; in intersectRay()
|
D | SkPathOpsTSect.cpp | 1726 : fUsed(0) { in SkClosestSect() 1732 SkClosestRecord* record = &fClosest[fUsed]; in find() 1740 for (int index = 0; index < fUsed; ++index) { in find() 1751 ++fUsed; in find() 1759 for (int index = 0; index < fUsed; ++index) { in finish() 1764 for (int index = 0; index < fUsed; ++index) { in finish() 1772 int fUsed; member
|
/external/skia/src/core/ |
D | SkWriter32.h | 40 size_t bytesWritten() const { return fUsed; } in bytesWritten() 54 fUsed = 0; 61 size_t offset = fUsed; in reserve() 62 size_t totalRequired = fUsed + size; in reserve() 66 fUsed = totalRequired; in reserve() 77 SkASSERT(offset < fUsed); in readTAt() 88 SkASSERT(offset < fUsed); in overwriteTAt() 221 fUsed = offset; in rewindToOffset() 226 memcpy(dst, fData, fUsed); in flatten() 230 return stream->write(fData, fUsed); in writeToStream() [all …]
|
D | SkWriter32.cpp | 54 memcpy(fData, fExternal, fUsed); in growToAtLeast() 59 return SkData::MakeWithCopy(fData, fUsed); in snapshotAsData()
|
/external/skqp/src/core/ |
D | SkWriter32.h | 40 size_t bytesWritten() const { return fUsed; } in bytesWritten() 54 fUsed = 0; 61 size_t offset = fUsed; in reserve() 62 size_t totalRequired = fUsed + size; in reserve() 66 fUsed = totalRequired; in reserve() 77 SkASSERT(offset < fUsed); in readTAt() 88 SkASSERT(offset < fUsed); in overwriteTAt() 228 fUsed = offset; in rewindToOffset() 233 memcpy(dst, fData, fUsed); in flatten() 237 return stream->write(fData, fUsed); in writeToStream() [all …]
|
D | SkRWBuffer.cpp | 23 size_t fUsed; // updated by the writer member 26 SkBufferBlock(size_t capacity) : fNext(nullptr), fUsed(0), fCapacity(capacity) {} in SkBufferBlock() 30 size_t avail() const { return fCapacity - fUsed; } in avail() 31 void* availData() { return (char*)this->startData() + fUsed; } in availData() 46 fUsed += amount; in append() 56 SkASSERT(fUsed <= fCapacity); in validate() 113 totalUsed += block->fUsed; in validate()
|
D | SkWriter32.cpp | 84 memcpy(fData, fExternal, fUsed); in growToAtLeast() 89 return SkData::MakeWithCopy(fData, fUsed); in snapshotAsData()
|
D | SkLiteDL.h | 26 bool empty() const { return fUsed == 0; } in empty() 87 size_t fUsed = 0; variable
|
D | SkLiteDL.cpp | 468 if (fUsed + skip > fReserved) { in push() 471 fReserved = (fUsed + skip + SKLITEDL_PAGE) & ~(SKLITEDL_PAGE-1); in push() 474 SkASSERT(fUsed + skip <= fReserved); in push() 475 auto op = (T*)(fBytes.get() + fUsed); in push() 476 fUsed += skip; in push() 485 auto end = fBytes.get() + fUsed; in map() 670 fUsed = 0; in reset()
|
/external/skqp/src/lazy/ |
D | SkDiscardableMemoryPool.cpp | 58 size_t fUsed; member in __anon84d28adc0111::DiscardableMemoryPool 128 , fUsed(0) { in DiscardableMemoryPool() 143 if (fUsed <= budget) { in dumpDownTo() 149 while ((fUsed > budget) && (cur)) { in dumpDownTo() 154 SkASSERT(fUsed >= dm->fBytes); in dumpDownTo() 155 fUsed -= dm->fBytes; in dumpDownTo() 174 fUsed += bytes; in make() 183 SkASSERT(fUsed >= dm->fBytes); in removeFromPool() 184 fUsed -= dm->fBytes; in removeFromPool() 218 return fUsed; in getRAMUsed()
|
/external/skia/src/lazy/ |
D | SkDiscardableMemoryPool.cpp | 57 size_t fUsed; member in __anon05bb27650111::DiscardableMemoryPool 127 , fUsed(0) { in DiscardableMemoryPool() 142 if (fUsed <= budget) { in dumpDownTo() 148 while ((fUsed > budget) && (cur)) { in dumpDownTo() 153 SkASSERT(fUsed >= dm->fBytes); in dumpDownTo() 154 fUsed -= dm->fBytes; in dumpDownTo() 173 fUsed += bytes; in make() 182 SkASSERT(fUsed >= dm->fBytes); in removeFromPool() 183 fUsed -= dm->fBytes; in removeFromPool() 217 return fUsed; in getRAMUsed()
|
/external/skia/src/gpu/mock/ |
D | GrMockRenderTask.h | 22 void addUsed(sk_sp<GrSurfaceProxy> proxy) { fUsed.push_back(std::move(proxy)); } in addUsed() 31 for (const auto& entry : fUsed) { in onIsUsed() 45 SkTArray<sk_sp<GrSurfaceProxy>> fUsed;
|
/external/skia/tests/ |
D | PathOpsDebug.cpp | 206 SkDebugf("used=%d of %d", fUsed, fMax); in dump() 207 for (int index = 0; index < fUsed; ++index) { in dump()
|