/external/chromium_org/third_party/skia/src/gpu/gl/ |
H A D | 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; member in class:GrGLNameAllocator::SparseNameRange 181 SkASSERT(fFirst > count); // We can't allocate at or below 0. 183 SkASSERT(fLeft->first() == fFirst - count); 261 fFirst = fLeft->first(); 278 fFirst [all...] |
/external/skia/src/gpu/gl/ |
H A D | 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; member in class:GrGLNameAllocator::SparseNameRange 181 SkASSERT(fFirst > count); // We can't allocate at or below 0. 183 SkASSERT(fLeft->first() == fFirst - count); 261 fFirst = fLeft->first(); 278 fFirst [all...] |
/external/chromium_org/third_party/skia/src/gpu/ |
H A D | GrRedBlackTree.h | 177 Node* fFirst; member in class:GrRedBlackTree 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/ |
H A D | GrRedBlackTree.h | 177 Node* fFirst; member in class:GrRedBlackTree 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/ |
H A D | 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; curren [all...] |
H A D | reslist.h | 107 struct SResource *fFirst; member in struct:SResTable 116 struct SResource *fFirst; member in struct:SResArray
|
H A D | wrtjava.c | 336 current = res->u.fArray.fFirst; 346 current = res->u.fArray.fFirst; 523 current = res->u.fTable.fFirst;
|
H A D | wrtxml.cpp | 692 current = res->u.fArray.fFirst; 935 current = res->u.fTable.fFirst;
|
H A D | parse.cpp | 662 current = list->fFirst;
|
/external/chromium_org/third_party/icu/source/tools/genrb/ |
H A D | reslist.c | 247 for (current = res->u.fArray.fFirst; current != NULL; current = current->fNext) { 256 for (current = res->u.fArray.fFirst; current != NULL; current = current->fNext) { 282 for (current = res->u.fTable.fFirst; current != NULL; current = current->fNext) { 320 for (current = res->u.fTable.fFirst; current != NULL; current = current->fNext) { 323 for (current = res->u.fTable.fFirst; current != NULL; current = current->fNext) { 408 for (current = res->u.fArray.fFirst; current != NULL; current = current->fNext) { 424 for (current = res->u.fTable.fFirst; current != NULL; current = current->fNext) { 523 for (i = 0, current = res->u.fArray.fFirst; current != NULL; ++i, current = current->fNext) { 529 for (current = res->u.fArray.fFirst; current != NULL; current = current->fNext) { 574 for (i = 0, current = res->u.fTable.fFirst; curren [all...] |
H A D | reslist.h | 109 struct SResource *fFirst; member in struct:SResTable 118 struct SResource *fFirst; member in struct:SResArray
|
H A D | wrtjava.c | 336 current = res->u.fArray.fFirst; 346 current = res->u.fArray.fFirst; 523 current = res->u.fTable.fFirst;
|
H A D | wrtxml.cpp | 682 current = res->u.fArray.fFirst; 925 current = res->u.fTable.fFirst;
|
H A D | parse.cpp | 641 current = list->fFirst;
|
/external/chromium_org/third_party/skia/include/core/ |
H A D | SkPathEffect.h | 95 SkPath fFirst; // If not empty, contains geometry for first point member in class:SkPathEffect::PointData
|
/external/skia/include/core/ |
H A D | SkPathEffect.h | 95 SkPath fFirst; // If not empty, contains geometry for first point member in class:SkPathEffect::PointData
|
/external/stlport/test/eh/ |
H A D | 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; member in struct:test_insert_range
|
/external/skia/src/effects/ |
H A D | SkDashPathEffect.cpp | 168 results->fFirst.addRect(x - halfWidth, y - halfHeight,
|
/external/chromium_org/third_party/skia/src/effects/ |
H A D | SkDashPathEffect.cpp | 288 results->fFirst.addRect(x - halfWidth, y - halfHeight,
|
/external/chromium_org/third_party/skia/src/core/ |
H A D | SkDraw.cpp | 651 if (!pointData.fFirst.isEmpty()) { 653 fDevice->drawPath(*this, pointData.fFirst, newP); 655 this->drawPath(pointData.fFirst, newP);
|
/external/skia/src/core/ |
H A D | SkDraw.cpp | 650 if (!pointData.fFirst.isEmpty()) { 652 fDevice->drawPath(*this, pointData.fFirst, newP); 654 this->drawPath(pointData.fFirst, newP);
|