HomeSort by relevance Sort by last modified time
    Searched refs:fUsed (Results 1 - 18 of 18) sorted by null

  /external/chromium_org/third_party/skia/src/lazy/
SkDiscardableMemoryPool.cpp 76 , fUsed(0) {
93 if (fUsed <= budget) {
99 while ((fUsed > budget) && (NULL != cur)) {
105 SkASSERT(fUsed >= dm->fBytes);
106 fUsed -= dm->fBytes;
126 fUsed += bytes;
137 SkASSERT(fUsed >= dm->fBytes);
138 fUsed -= dm->fBytes;
179 return fUsed;
SkDiscardableMemoryPool.h 51 size_t fUsed;
  /external/skia/src/lazy/
SkDiscardableMemoryPool.cpp 76 , fUsed(0) {
93 if (fUsed <= budget) {
99 while ((fUsed > budget) && (NULL != cur)) {
105 SkASSERT(fUsed >= dm->fBytes);
106 fUsed -= dm->fBytes;
126 fUsed += bytes;
137 SkASSERT(fUsed >= dm->fBytes);
138 fUsed -= dm->fBytes;
179 return fUsed;
SkDiscardableMemoryPool.h 51 size_t fUsed;
  /external/chromium_org/third_party/skia/src/pathops/
SkIntersections.cpp 11 for (int index = 0; index < i.fUsed; ++index) {
37 for (int index = 0; index < fUsed; ++index) {
59 for (int index = 0; index < fUsed; ++index) {
69 SkASSERT(fUsed <= 1 || fT[0][0] <= fT[0][1]);
71 for (index = 0; index < fUsed; ++index) {
97 if (fUsed >= fMax) {
100 fUsed = 0;
103 int remaining = fUsed - index;
115 ++fUsed;
134 for (int index = base; index < fUsed; ++index)
    [all...]
SkDLineIntersection.cpp 30 SkASSERT(fUsed == 2);
45 while (fUsed > 2) {
48 if (fUsed == 2 && !parallel) {
60 if ((fUsed = used) == 2) {
94 return fUsed = 0;
102 return fUsed;
139 if (unparallel && fUsed == 0) {
164 SkASSERT(fUsed <= 2);
165 return fUsed;
196 return fUsed = horizontalType
    [all...]
SkDQuadIntersection.cpp 407 SkASSERT(fUsed < 3);
409 return fUsed;
412 return fUsed;
417 return fUsed;
424 return fUsed;
432 if (copyI.fUsed >= 2) {
433 SkASSERT(copyI.fUsed <= 4);
436 for (int index = 2; index < copyI.fUsed; ++index) {
452 bool expectCoincident = copyI.fUsed >= 2 && innerEqual == 2;
456 int last = copyI.fUsed - 1
    [all...]
SkIntersections.h 44 fUsed = i.fUsed;
105 return fUsed > 0 && (t == 0 ? fT[0][0] == 0 : fT[0][fUsed - 1] == 1);
183 fUsed = 0;
201 return fUsed;
275 unsigned char fUsed;
SkDCubicIntersection.cpp 113 SkDebugf(" xlocals.fUsed=%d\n", xlocals.used());
255 if (fUsed < 2) {
258 int last = fUsed - 1;
270 if (fUsed > 2) {
274 fUsed = 2;
447 return fUsed;
459 SkASSERT(fUsed < 4);
462 return fUsed;
465 return fUsed;
472 if (fUsed) {
    [all...]
SkDCubicLineIntersection.cpp 353 fUsed = c.intersectRay(fT[0]);
354 for (int index = 0; index < fUsed; ++index) {
357 return fUsed;
SkDQuadLineIntersection.cpp 408 fUsed = q.intersectRay(fT[0]);
409 for (int index = 0; index < fUsed; ++index) {
412 return fUsed;
  /external/skia/src/pathops/
SkIntersections.cpp 11 for (int index = 0; index < i.fUsed; ++index) {
37 for (int index = 0; index < fUsed; ++index) {
59 for (int index = 0; index < fUsed; ++index) {
69 SkASSERT(fUsed <= 1 || fT[0][0] <= fT[0][1]);
71 for (index = 0; index < fUsed; ++index) {
97 if (fUsed >= fMax) {
100 fUsed = 0;
103 int remaining = fUsed - index;
115 ++fUsed;
134 for (int index = base; index < fUsed; ++index)
    [all...]
SkDLineIntersection.cpp 30 SkASSERT(fUsed == 2);
45 while (fUsed > 2) {
48 if (fUsed == 2 && !parallel) {
60 if ((fUsed = used) == 2) {
94 return fUsed = 0;
102 return fUsed;
139 if (unparallel && fUsed == 0) {
164 SkASSERT(fUsed <= 2);
165 return fUsed;
196 return fUsed = horizontalType
    [all...]
SkDQuadIntersection.cpp 407 SkASSERT(fUsed < 3);
409 return fUsed;
412 return fUsed;
417 return fUsed;
424 return fUsed;
432 if (copyI.fUsed >= 2) {
433 SkASSERT(copyI.fUsed <= 4);
436 for (int index = 2; index < copyI.fUsed; ++index) {
452 bool expectCoincident = copyI.fUsed >= 2 && innerEqual == 2;
456 int last = copyI.fUsed - 1
    [all...]
SkIntersections.h 44 fUsed = i.fUsed;
105 return fUsed > 0 && (t == 0 ? fT[0][0] == 0 : fT[0][fUsed - 1] == 1);
183 fUsed = 0;
201 return fUsed;
275 unsigned char fUsed;
SkDCubicIntersection.cpp 113 SkDebugf(" xlocals.fUsed=%d\n", xlocals.used());
255 if (fUsed < 2) {
258 int last = fUsed - 1;
270 if (fUsed > 2) {
274 fUsed = 2;
447 return fUsed;
459 SkASSERT(fUsed < 4);
462 return fUsed;
465 return fUsed;
472 if (fUsed) {
    [all...]
SkDCubicLineIntersection.cpp 353 fUsed = c.intersectRay(fT[0]);
354 for (int index = 0; index < fUsed; ++index) {
357 return fUsed;
SkDQuadLineIntersection.cpp 408 fUsed = q.intersectRay(fT[0]);
409 for (int index = 0; index < fUsed; ++index) {
412 return fUsed;

Completed in 539 milliseconds