Searched refs:fUsed (Results 1 - 19 of 19) sorted by relevance

/external/skia/src/pathops/
H A DSkConicLineIntersection.cpp32 fUsed = c.intersectRay(fT[0]);
33 for (int index = 0; index < fUsed; ++index) {
36 return fUsed;
H A DSkIntersections.cpp14 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;
124 fUsed = 1;
129 for (int index = 0; index < fUsed;
[all...]
H A DSkDLineIntersection.cpp11 while (fUsed > 2) {
14 if (fUsed == 2 && !parallel) {
22 if (fUsed == 2) {
29 if ((fUsed = used) == 2) {
63 return fUsed = 0;
71 return fUsed;
108 if (unparallel && fUsed == 0) {
172 SkASSERT(fUsed <= 2);
173 return fUsed;
216 if (result == 1 && fUsed
[all...]
H A DSkIntersections.h104 return fUsed > 0 && (t == 0 ? fT[0][0] == 0 : fT[0][fUsed - 1] == 1);
182 fUsed = 0;
203 return fUsed;
211 SkASSERT(fUsed == 1);
214 fUsed = 0;
294 unsigned char fUsed; member in class:SkIntersections
H A DSkDConicLineIntersection.cpp348 fUsed = c.intersectRay(fT[0]);
349 for (int index = 0; index < fUsed; ++index) {
352 return fUsed;
H A DSkDCubicLineIntersection.cpp422 fUsed = c.intersectRay(fT[0]);
423 for (int index = 0; index < fUsed; ++index) {
426 return fUsed;
H A DSkDQuadLineIntersection.cpp429 fUsed = q.intersectRay(fT[0]);
430 for (int index = 0; index < fUsed; ++index) {
433 return fUsed;
H A DSkPathOpsTSect.h1852 : fUsed(0) {
1857 SkClosestRecord<TCurve, OppCurve>* record = &fClosest[fUsed];
1865 for (int index = 0; index < fUsed; ++index) {
1876 ++fUsed;
1884 for (int index = 0; index < fUsed; ++index) {
1889 for (int index = 0; index < fUsed; ++index) {
1897 int fUsed; member in struct:SkClosestSect
H A DSkPathOpsDebug.cpp510 for (int index = 0; index < fUsed; ++index) {
/external/skia/experimental/PdfViewer/
H A DSkPdfConfig.h52 #define SkPdfMarkObjectUsed() fUsed = true
58 #define SkPdfMarkObjectUnused() fUsed = false
/external/skia/src/core/
H A DSkRWBuffer.h28 size_t size() const { return fUsed; }
63 const size_t fUsed; member in class:SkROBuffer
H A DSkRWBuffer.cpp16 size_t fUsed; member in struct:SkBufferBlock
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...]
H A DSkWriter32.cpp75 memcpy(fData, fExternal, fUsed);
80 return SkData::NewWithCopy(fData, fUsed);
/external/skia/include/core/
H A DSkWriter32.h39 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);
243 size_t fUsed; // Number of bytes written. member in class:SkWriter32
[all...]
/external/skia/src/lazy/
H A DSkDiscardableMemoryPool.cpp57 size_t fUsed; member in class:__anon14043::DiscardableMemoryPool
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/gpu/
H A DGrBatch.h43 GrBatch() : fClassID(kIllegalBatchClassID), fNumberOfDraws(0) { SkDEBUGCODE(fUsed = false;) }
95 SkDEBUGCODE(bool isUsed() const { return fUsed; })
171 SkDEBUGCODE(bool fUsed;)
/external/skia/experimental/PdfViewer/pdfparser/native/
H A DSkPdfNativeObject.cpp107 SkPdfReportIf(!fUsed, kInfo_SkPdfIssueSeverity, kUnusedObject_SkPdfIssue,
H A DSkPdfNativeObject.h113 mutable bool fUsed; member in class:SkPdfNativeObject
139 , fUsed(false)
/external/skia/tests/
H A DPathOpsDebug.cpp188 SkDebugf("used=%d of %d", fUsed, fMax);
189 for (int index = 0; index < fUsed; ++index) {

Completed in 329 milliseconds