| /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()
69 if (fUsed >= fMax) { in insert()
72 fUsed = 0; in insert()
75 int remaining = fUsed - index; in insert()
89 ++fUsed; in insert()
124 fUsed = 1; in merge()
129 for (int index = 0; index < fUsed; ++index) { in mostOutside()
[all …]
|
| D | SkDLineIntersection.cpp | 11 while (fUsed > 2) { in cleanUpParallelLines()
14 if (fUsed == 2 && !parallel) { in cleanUpParallelLines()
22 if (fUsed == 2) { in cleanUpParallelLines()
29 if ((fUsed = used) == 2) { in computePoints()
63 return fUsed = 0; in intersectRay()
71 return fUsed; in intersectRay()
108 if (unparallel && fUsed == 0) { in intersect()
172 SkASSERT(fUsed <= 2); in intersect()
173 return fUsed; in intersect()
216 if (result == 1 && fUsed == 0) { in horizontal()
[all …]
|
| D | SkConicLineIntersection.cpp | 32 fUsed = c.intersectRay(fT[0]); in intersectRay()
33 for (int index = 0; index < fUsed; ++index) { in intersectRay()
36 return fUsed; in intersectRay()
|
| D | SkIntersections.h | 104 return fUsed > 0 && (t == 0 ? fT[0][0] == 0 : fT[0][fUsed - 1] == 1); in hasT()
182 fUsed = 0; in reset()
203 return fUsed; in used()
211 SkASSERT(fUsed == 1); in unBumpT()
214 fUsed = 0; in unBumpT()
294 unsigned char fUsed; variable
|
| D | SkDQuadLineIntersection.cpp | 429 fUsed = q.intersectRay(fT[0]); in intersectRay()
430 for (int index = 0; index < fUsed; ++index) { in intersectRay()
433 return fUsed; in intersectRay()
|
| D | SkDConicLineIntersection.cpp | 348 fUsed = c.intersectRay(fT[0]); in intersectRay()
349 for (int index = 0; index < fUsed; ++index) { in intersectRay()
352 return fUsed; in intersectRay()
|
| D | SkDCubicLineIntersection.cpp | 422 fUsed = c.intersectRay(fT[0]); in intersectRay()
423 for (int index = 0; index < fUsed; ++index) { in intersectRay()
426 return fUsed; in intersectRay()
|
| D | SkPathOpsTSect.h | 1852 : fUsed(0) { in SkClosestSect()
1857 SkClosestRecord<TCurve, OppCurve>* record = &fClosest[fUsed]; in find()
1865 for (int index = 0; index < fUsed; ++index) { in find()
1876 ++fUsed; in find()
1884 for (int index = 0; index < fUsed; ++index) { in finish()
1889 for (int index = 0; index < fUsed; ++index) { in finish()
1897 int fUsed; member
|
| D | SkPathOpsDebug.cpp | 510 for (int index = 0; index < fUsed; ++index) { in debugCoincidentUsed()
|
| /external/skia/include/core/ |
| D | SkWriter32.h | 39 size_t bytesWritten() const { return fUsed; } in bytesWritten()
50 fUsed = 0;
63 size_t offset = fUsed; in reserve()
64 size_t totalRequired = fUsed + size; in reserve()
68 fUsed = totalRequired; in reserve()
79 SkASSERT(offset < fUsed); in readTAt()
90 SkASSERT(offset < fUsed); in overwriteTAt()
216 fUsed = offset; in rewindToOffset()
221 memcpy(dst, fData, fUsed); in flatten()
225 return stream->write(fData, fUsed); in writeToStream()
[all …]
|
| /external/skia/src/lazy/ |
| D | SkDiscardableMemoryPool.cpp | 57 size_t fUsed; member in __anonc6ded2be0111::DiscardableMemoryPool
135 , fUsed(0) { in DiscardableMemoryPool()
152 if (fUsed <= budget) { in dumpDownTo()
158 while ((fUsed > budget) && (cur)) { in dumpDownTo()
164 SkASSERT(fUsed >= dm->fBytes); in dumpDownTo()
165 fUsed -= dm->fBytes; in dumpDownTo()
185 fUsed += bytes; in create()
196 SkASSERT(fUsed >= dm->fBytes); in free()
197 fUsed -= dm->fBytes; in free()
238 return fUsed; in getRAMUsed()
|
| /external/skia/src/core/ |
| D | SkRWBuffer.cpp | 16 size_t fUsed; member
21 size_t avail() const { return fCapacity - fUsed; } in avail()
22 void* availData() { return (char*)this->startData() + fUsed; } in availData()
28 block->fUsed = 0; in Alloc()
38 fUsed += amount; in append()
46 SkASSERT(fUsed <= fCapacity); in validate()
72 head->fBlock.fUsed = 0; in Alloc()
105 totalUsed += block->fUsed; in validate()
117 SkROBuffer::SkROBuffer(const SkBufferHead* head, size_t used) : fHead(head), fUsed(used) { in SkROBuffer()
129 fHead->validate(fUsed); in ~SkROBuffer()
[all …]
|
| D | SkRWBuffer.h | 28 size_t size() const { return fUsed; } in size()
63 const size_t fUsed; variable
|
| D | SkWriter32.cpp | 75 memcpy(fData, fExternal, fUsed); in growToAtLeast()
80 return SkData::NewWithCopy(fData, fUsed); in snapshotAsData()
|
| /external/skia/src/gpu/ |
| D | GrBatch.h | 43 GrBatch() : fClassID(kIllegalBatchClassID), fNumberOfDraws(0) { SkDEBUGCODE(fUsed = false;) } in SK_DECLARE_INST_COUNT()
95 SkDEBUGCODE(bool isUsed() const { return fUsed; }) in SkDEBUGCODE() argument
171 SkDEBUGCODE(bool fUsed;)
|
| /external/skia/experimental/PdfViewer/ |
| D | SkPdfConfig.h | 52 #define SkPdfMarkObjectUsed() fUsed = true
58 #define SkPdfMarkObjectUnused() fUsed = false
|
| /external/skia/experimental/PdfViewer/pdfparser/native/ |
| D | SkPdfNativeObject.cpp | 107 SkPdfReportIf(!fUsed, kInfo_SkPdfIssueSeverity, kUnusedObject_SkPdfIssue, in releaseData()
|
| D | SkPdfNativeObject.h | 113 mutable bool fUsed; variable
139 , fUsed(false) in SkPdfNativeObject()
|
| /external/skia/tests/ |
| D | PathOpsDebug.cpp | 188 SkDebugf("used=%d of %d", fUsed, fMax); in dump()
189 for (int index = 0; index < fUsed; ++index) { in dump()
|