/external/chromium_org/third_party/mesa/src/src/mesa/program/ |
prog_cache.c | 15 * next paragraph) shall be included in all copies or substantial portions 42 struct cache_item *next; member in struct:cache_item 85 struct cache_item *c, *next; local 95 for (c = cache->items[i]; c; c = next) { 96 next = c->next; 97 c->next = items[c->hash % size]; 111 struct cache_item *c, *next; local 117 for (c = cache->items[i]; c; c = next) { 118 next = c->next [all...] |
/external/chromium_org/third_party/npapi/npspy/extern/nspr/ |
prlog.h | 156 struct PRLogModuleInfo *next; member in struct:PRLogModuleInfo
|
/external/chromium_org/third_party/openssl/openssl/crypto/pqueue/ |
pqueue.c | 79 item->next = NULL; 113 pitem *curr, *next; local 121 for(curr = NULL, next = pq->items; 122 next != NULL; 123 curr = next, next = next->next) 127 int cmp = memcmp(next->priority, item->priority,8); 128 if (cmp > 0) /* next > item * 170 pitem *next; local [all...] |
/external/chromium_org/third_party/protobuf/java/src/main/java/com/google/protobuf/ |
BoundedByteString.java | 147 public Byte next() { method in class:BoundedByteString.BoundedByteIterator
|
/external/chromium_org/third_party/protobuf/java/src/test/java/com/google/protobuf/ |
UnmodifiableLazyStringListTest.java | 100 iter.next(); 120 iter.next();
|
/external/chromium_org/third_party/skia/include/core/ |
SkTDStack.h | 27 Rec* next = rec->fNext; local 29 rec = next;
|
SkTDict.h | 121 const char* next(T* value) function in class:SkTDict::Iter
|
/external/chromium_org/third_party/skia/src/core/ |
SkChunkAlloc.cpp | 32 Block* next = block->fNext; local 34 block = next;
|
/external/chromium_org/third_party/skia/src/effects/ |
SkLayerDrawLooper.cpp | 36 Rec* next = rec->fNext; local 38 rec = next; 174 bool SkLayerDrawLooper::next(SkCanvas* canvas, SkPaint* paint) { function in class:SkLayerDrawLooper
|
/external/chromium_org/third_party/skia/src/gpu/ |
GrAllocPool.cpp | 21 static Block* Create(size_t size, Block* next) { 25 block->fNext = next; 72 Block* next = block->fNext; local 74 block = next; 97 Block* next = fBlock->fNext; local 99 fBlock = next;
|
GrAtlas.h | 33 GrAtlas* next = atlas->fNext; local 35 atlas = next;
|
/external/chromium_org/third_party/skia/src/pathops/ |
SkPathOpsSimplify.cpp | 47 SkOpSegment* next = current->findNextWinding(&chaseArray, &nextStart, &nextEnd, local 49 if (!next) { 64 current = next; 112 SkOpSegment* next = current->findNextXor(&nextStart, &nextEnd, &unsortable); local 113 if (!next) { 128 current = next; 180 SkOpContour* next; local 182 next = *nextPtr++; 183 } while (AddIntersectTs(current, next) && nextPtr != listEnd);
|
/external/chromium_org/third_party/skia/src/utils/ |
SkOSFile.cpp | 139 bool SkOSFile::Iter::next(SkString* name, bool getDir) function in class:SkOSFile::Iter 211 bool SkOSFile::Iter::next(SkString* name, bool getDir) function in class:SkOSFile::Iter
|
/external/chromium_org/third_party/skia/src/views/win/ |
skia_win.cpp | 140 TCHAR exename[1024], *next; local 145 TCHAR* arg = _tcstok_s(lpCmdLine, _T(" "), &next); 148 arg = _tcstok_s(NULL, _T(" "), &next);
|
/external/chromium_org/third_party/sqlite/src/ext/fts1/ |
ft_hash.h | 53 HashElem *next, *prev; /* Next and previous elements in the table */ member in struct:HashElem 101 #define HashNext(E) ((E)->next)
|
/external/chromium_org/third_party/sqlite/src/ext/fts2/ |
fts2_hash.h | 51 fts2HashElem *next, *prev; /* Next and previous elements in the table */ member in struct:fts2HashElem 100 #define fts2HashNext(E) ((E)->next)
|
/external/chromium_org/third_party/tcmalloc/chromium/src/ |
free_list.h | 68 inline void EnsureNonLoop(void* node, void* next) { 71 if (node != next) return; 72 Log(kCrash, __FILE__, __LINE__, "Circular loop in list detected: ", next); 92 // Returns value of the |next| pointer w/out running a sanity check. 116 void *next = FL_Next_No_Check(t); local 117 if (next) { 118 FL_EqualityCheck(FL_Previous_No_Check(next), t, __FILE__, __LINE__); 120 return next; 124 // |*list|, and updates |*list| to point to the next element in the
|
span.h | 47 Span* next; // Used when in link list member in struct:tcmalloc::Span 85 // pointers of adjacent Spans and setting span's next and prev to NULL. 90 return list->next == list;
|
/external/chromium_org/third_party/tcmalloc/vendor/src/ |
span.h | 47 Span* next; // Used when in link list member in struct:tcmalloc::Span 85 // pointers of adjacent Spans and setting span's next and prev to NULL. 90 return list->next == list;
|
/external/chromium_org/third_party/yasm/source/patched-yasm/libyasm/ |
insn.c | 175 yasm_insn_operand *cur, *next; local 179 next = STAILQ_NEXT(cur, link); 191 cur = next;
|
/external/chromium_org/third_party/zlib/ |
inftrees.c | 27 on return points to the next available entry's address. bits is the 54 code FAR *next; /* next available space in table */ local 151 filled is at next and has curr index bits. The code being used is huff 203 next = *table; /* current table to fill in */ 235 min = fill; /* save offset to next table */ 238 next[(huff >> drop) + fill] = here; 252 /* go to next symbol, update count, len */ 266 next += min; /* here min is 1 << curr */ 268 /* determine length of next table * [all...] |
/external/chromium_org/v8/src/ |
hydrogen-representation-changes.cc | 37 HInstruction* next = NULL; local 39 next = use_value->block()->predecessors()->at(use_index)->end(); 41 next = HInstruction::cast(use_value); 66 new_value->InsertBefore(next); 171 HInstruction* next = current->next(); local 173 current = next;
|
/external/chromium_org/v8/test/cctest/ |
test-liveedit.cc | 68 len1(len1_param), len2(len2_param), next(NULL) {} 73 DiffChunkStruct* next; member in class:__anon17112::DiffChunkStruct 87 next_chunk_pointer_ = ¤t_chunk_->next; 117 chunk = chunk->next) {
|
/external/clang/test/SemaTemplate/ |
instantiate-member-expr.cpp | 77 struct List { List *next; }; member in struct:PR14124::List 78 template<typename T, T *(T::*p) = &T::next> struct A {}; 81 template<typename T, T *(T::*p) = &T::next> struct B {};
|
/external/dropbear/ |
auth.h | 105 struct SignKeyList *next; member in struct:SignKeyList
|