| /external/chromium_org/third_party/skia/src/gpu/gl/ |
| GrGLNameAllocator.cpp | 13 * names within the half-open range [fFirst, fEnd). The inner nodes can be
15 * but the bounds are tight, so fFirst *is* guaranteed to be allocated, and so
27 GrGLuint first() const { return fFirst; }
50 * range [fFirst, fEnd).
98 * the very beginning or very end of the range, the boundaries [fFirst, fEnd)
117 GrGLuint fFirst;
181 SkASSERT(fFirst > count); // We can't allocate at or below 0.
183 SkASSERT(fLeft->first() == fFirst - count);
261 fFirst = fLeft->first();
278 fFirst = first
[all...] |
| /external/skia/src/gpu/gl/ |
| GrGLNameAllocator.cpp | 13 * names within the half-open range [fFirst, fEnd). The inner nodes can be
15 * but the bounds are tight, so fFirst *is* guaranteed to be allocated, and so
27 GrGLuint first() const { return fFirst; }
50 * range [fFirst, fEnd).
98 * the very beginning or very end of the range, the boundaries [fFirst, fEnd)
117 GrGLuint fFirst;
181 SkASSERT(fFirst > count); // We can't allocate at or below 0.
183 SkASSERT(fLeft->first() == fFirst - count);
261 fFirst = fLeft->first();
278 fFirst = first
[all...] |
| /external/chromium_org/third_party/skia/src/gpu/ |
| GrRedBlackTree.h | 177 Node* fFirst;
228 fFirst = NULL;
241 return Iter(fFirst, this);
337 fFirst = NULL;
376 fFirst = x;
599 SkASSERT(fFirst != x);
624 } else if (x == fFirst) {
626 fFirst = fRoot;
629 SkASSERT(fFirst == fLast && x == fFirst);
[all...] |
| /external/skia/src/gpu/ |
| GrRedBlackTree.h | 177 Node* fFirst;
228 fFirst = NULL;
241 return Iter(fFirst, this);
337 fFirst = NULL;
376 fFirst = x;
599 SkASSERT(fFirst != x);
624 } else if (x == fFirst) {
626 fFirst = fRoot;
629 SkASSERT(fFirst == fLast && x == fFirst);
[all...] |
| /external/icu/icu4c/source/tools/genrb/ |
| reslist.c | 196 for (current = res->u.fArray.fFirst; current != NULL; current = current->fNext) {
209 for (current = res->u.fTable.fFirst; current != NULL; current = current->fNext) {
344 for (current = res->u.fArray.fFirst; current != NULL; current = current->fNext) {
353 for (current = res->u.fArray.fFirst; current != NULL; current = current->fNext) {
379 for (current = res->u.fTable.fFirst; current != NULL; current = current->fNext) {
417 for (current = res->u.fTable.fFirst; current != NULL; current = current->fNext) {
420 for (current = res->u.fTable.fFirst; current != NULL; current = current->fNext) {
505 for (current = res->u.fArray.fFirst; current != NULL; current = current->fNext) {
521 for (current = res->u.fTable.fFirst; current != NULL; current = current->fNext) {
620 for (i = 0, current = res->u.fArray.fFirst; current != NULL; ++i, current = current->fNext)
[all...] |
| reslist.h | 107 struct SResource *fFirst;
116 struct SResource *fFirst;
|
| wrtjava.c | 336 current = res->u.fArray.fFirst;
346 current = res->u.fArray.fFirst;
523 current = res->u.fTable.fFirst;
|
| wrtxml.cpp | 692 current = res->u.fArray.fFirst;
935 current = res->u.fTable.fFirst;
[all...] |
| parse.cpp | 662 current = list->fFirst;
[all...] |
| /external/chromium_org/third_party/icu/source/tools/genrb/ |
| reslist.c | 245 for (current = res->u.fArray.fFirst; current != NULL; current = current->fNext) {
254 for (current = res->u.fArray.fFirst; current != NULL; current = current->fNext) {
280 for (current = res->u.fTable.fFirst; current != NULL; current = current->fNext) {
318 for (current = res->u.fTable.fFirst; current != NULL; current = current->fNext) {
321 for (current = res->u.fTable.fFirst; current != NULL; current = current->fNext) {
406 for (current = res->u.fArray.fFirst; current != NULL; current = current->fNext) {
422 for (current = res->u.fTable.fFirst; current != NULL; current = current->fNext) {
521 for (i = 0, current = res->u.fArray.fFirst; current != NULL; ++i, current = current->fNext) {
527 for (current = res->u.fArray.fFirst; current != NULL; current = current->fNext) {
572 for (i = 0, current = res->u.fTable.fFirst; current != NULL; ++i, current = current->fNext)
[all...] |
| reslist.h | 109 struct SResource *fFirst;
118 struct SResource *fFirst;
|
| wrtjava.c | 339 current = res->u.fArray.fFirst;
349 current = res->u.fArray.fFirst;
530 save = current = res->u.fTable.fFirst;
|
| wrtxml.cpp | 681 current = res->u.fArray.fFirst;
926 save = current = res->u.fTable.fFirst;
[all...] |
| parse.c | 644 current = list->fFirst;
[all...] |
| /external/chromium_org/third_party/skia/include/core/ |
| SkPathEffect.h | 95 SkPath fFirst; // If not empty, contains geometry for first point
|
| /external/skia/include/core/ |
| SkPathEffect.h | 95 SkPath fFirst; // If not empty, contains geometry for first point
|
| /external/stlport/test/eh/ |
| test_insert.h | 500 : fFirst( first ),
520 // prepare_insert_range( c, fPos, fFirst, fLast );
521 do_insert_range( c, fPos, fFirst, fLast, container_category(c) );
526 VerifyInsertion( original, c, fFirst, fLast, fPos );
529 Iter fFirst, fLast;
|
| /external/chromium_org/third_party/icu/source/i18n/ |
| zstrfmt.cpp | [all...] |
| zstrfmt.h | 519 ZSFCacheEntry *fFirst;
|
| /external/chromium_org/third_party/skia/src/effects/ |
| SkDashPathEffect.cpp | 168 results->fFirst.addRect(x - halfWidth, y - halfHeight,
|
| /external/skia/src/effects/ |
| SkDashPathEffect.cpp | 168 results->fFirst.addRect(x - halfWidth, y - halfHeight,
|
| /external/chromium_org/third_party/skia/src/core/ |
| SkDraw.cpp | 650 if (!pointData.fFirst.isEmpty()) {
652 fDevice->drawPath(*this, pointData.fFirst, newP);
654 this->drawPath(pointData.fFirst, newP);
[all...] |
| /external/skia/src/core/ |
| SkDraw.cpp | 650 if (!pointData.fFirst.isEmpty()) {
652 fDevice->drawPath(*this, pointData.fFirst, newP);
654 this->drawPath(pointData.fFirst, newP);
[all...] |
