| /external/chromium_org/third_party/mesa/src/src/gallium/drivers/softpipe/ |
| sp_tex_sample.h | 16 * next paragraph) shall be included in all copies or substantial portions
132 struct sp_sampler_variant *next; member in struct:sp_sampler_variant
|
| /external/chromium_org/third_party/mesa/src/src/gallium/drivers/svga/ |
| svga_screen_cache.c | 99 struct list_head *curr, *next; local
109 curr = cache->bucket[bucket].next;
110 next = curr->next;
144 curr = next;
145 next = curr->next;
251 cache->empty.next, head);
303 struct list_head *curr, *next; local
308 curr = cache->validated.next;
[all...] |
| svga_tgsi.h | 106 /* Next compilation result:
108 struct svga_shader_result *next; member in struct:svga_shader_result
|
| /external/chromium_org/third_party/mesa/src/src/glsl/ |
| opt_dead_code_local.cpp | 11 * The above copyright notice and this permission notice (including the next
217 unsigned next = 0; local
222 components[channels++] = next;
223 next++;
289 for (ir = first, ir_next = (ir_instruction *)first->next;;
290 ir = ir_next, ir_next = (ir_instruction *)ir->next) {
|
| opt_tree_grafting.cpp | 11 * The above copyright notice and this permission notice (including the next
224 sig_iter.next();
315 for (ir_instruction *ir = (ir_instruction *)start->next;
316 ir != bb_last->next;
317 ir = (ir_instruction *)ir->next) {
339 ir_instruction *ir, *next; local
341 for (ir = bb_first, next = (ir_instruction *)ir->next;
342 ir != bb_last->next;
343 ir = next, next = (ir_instruction *)ir->next)
[all...] |
| /external/chromium_org/third_party/mesa/src/src/mapi/glapi/gen/ |
| glX_XML.py | 13 # The above copyright notice and this permission notice (including the next
73 child = child.next
182 child = child.next
558 def next(self): member in class:glx_function_iterator
559 f = self.iterator.next()
564 return self.next()
|
| /external/chromium_org/third_party/mesa/src/src/mesa/drivers/dri/i965/ |
| brw_state_cache.c | 15 next paragraph) shall be included in all copies or substantial
90 for (c = cache->items[hash % cache->size]; c; c = c->next)
97 for (c = cache->items[hash % cache->size]; c; c = c->next) {
110 struct brw_cache_item *c, *next; local
117 for (c = cache->items[i]; c; c = next) {
118 next = c->next;
119 c->next = items[c->hash % size];
204 for (item = cache->items[i]; item; item = item->next) {
257 /* Programs are always 64-byte aligned, so set up the next one now *
342 struct brw_cache_item *c, *next; local
[all...] |
| /external/chromium_org/third_party/mesa/src/src/mesa/drivers/dri/intel/ |
| intel_batchbuffer.c | 15 * next paragraph) shall be included in all copies or substantial portions
36 struct cached_batch_item *next; member in struct:cached_batch_item
46 struct cached_batch_item *next = item->next; local
48 item = next;
340 *prev = item->next;
341 item->next = intel->batch.cached_items;
350 prev = &item->next;
357 item->next = intel->batch.cached_items;
|
| /external/chromium_org/third_party/mesa/src/src/mesa/main/ |
| hash.c | 55 struct HashEntry *Next; /**< pointer to next entry */
106 struct HashEntry *next = entry->Next; local
112 entry = next;
141 entry = entry->Next;
193 for (entry = table->Table[pos]; entry; entry = entry->Next) {
212 entry->Next = table->Table[pos];
255 prev->Next = entry->Next;
293 struct HashEntry *entry, *next; local
330 struct HashEntry *entry, *next; local
[all...] |
| /external/chromium_org/third_party/mesa/src/src/mesa/program/ |
| hash_table.c | 11 * The above copyright notice and this permission notice (including the next
36 struct node *next; member in struct:node
|
| symbol_table.c | 11 * The above copyright notice and this permission notice (including the next
30 * Link to the next symbol in the table with the same name
39 * Link to the next symbol in the table with the same scope
75 struct symbol_header *next; member in struct:symbol_header
89 /** Link to next (inner) scope level. */
90 struct scope_level *next; member in struct:scope_level
125 * The next call to \c _mesa_symbol_table_iterator_get will return this
127 * returned by the next call.
139 for (scope = table->current_scope; scope != NULL; scope = scope->next) {
164 table->current_scope = scope->next;
170 struct symbol *const next = sym->next_with_same_scope; local
475 struct symbol_header *next; local
[all...] |
| /external/chromium_org/third_party/npapi/npspy/common/ |
| epmanager.cpp | 46 next(NULL),
56 next(NULL),
80 InstanceList * next = instances->next; local
82 instances = next;
85 PluginEntryPointList * next = eps->next; local
87 eps = next;
123 eps->next = mEntryPoints;
133 for(PluginEntryPointList * eps = mEntryPoints; eps != NULL; eps = eps->next)
[all...] |
| /external/chromium_org/third_party/npapi/npspy/extern/nspr/ |
| plhash.h | 78 PLHashEntry *next; /* hash chain linkage */ member in struct:PLHashEntry
|
| /external/chromium_org/third_party/openssl/openssl/crypto/engine/ |
| eng_int.h | 199 struct engine_st *next; member in struct:engine_st
|
| /external/chromium_org/third_party/protobuf/java/src/main/java/com/google/protobuf/ |
| LazyField.java | 198 public Entry<K, Object> next() { method in class:LazyField.LazyIterator
199 Entry<K, ?> entry = iterator.next();
|
| /external/chromium_org/third_party/skia/include/core/ |
| SkTInternalLList.h | 53 T* next = entry->fNext; local
56 prev->fNext = next;
58 fHead = next;
60 if (NULL != next) {
61 next->fPrev = prev;
156 T* next = existingEntry->fNext; local
158 newEntry->fNext = next;
159 if (NULL == next) {
163 next->fPrev = newEntry;
202 * Return the next/previous element in the list or NULL if at the end
204 T* next() { function in class:SkTInternalLList::Iter
[all...] |
| /external/chromium_org/third_party/skia/src/core/ |
| SkBitmapHeap.cpp | 197 LookupEntry* next = iter->fMoreRecentlyUsed; local
204 iter = next;
|
| SkDeque.cpp | 62 Block* next = head->fNext; local
66 head = next;
247 // Due to how reset and next work, next actually returns the current element
248 // pointed to by fPos and then updates fPos to point to the next one.
249 void* SkDeque::Iter::next() { function in class:SkDeque::Iter
252 if (pos) { // if we were valid, try to move to the next setting
253 char* next = pos + fElemSize; local
254 SkASSERT(next <= fCurBlock->fEnd);
255 if (next == fCurBlock->fEnd) { // exhausted this chunk, move to nex
[all...] |
| SkWriter32.cpp | 34 Block* next = block->fNext; local
36 block = next;
133 Block* next = block->fNext; local
136 block = next;
138 Block* next = block->fNext; local
140 block = next;
|
| /external/chromium_org/third_party/skia/src/gpu/ |
| GrAtlas.cpp | 229 GrPlot* next = plot->fNext; local
231 plot = next;
|
| /external/chromium_org/third_party/skia/src/pathops/ |
| SkDCubicToQuads.cpp | 140 int next = start + 1; local
141 if (next >= inflections) {
144 if (!approximately_equal(inflectT[start], inflectT[next])) {
148 memmove(&inflectT[start], &inflectT[next], sizeof(inflectT[0]) * (--inflections - start));
|
| /external/chromium_org/third_party/skia/src/sfnt/ |
| SkOTUtils.cpp | 182 bool SkOTUtils::LocalizedStrings_NameTable::next(SkTypeface::LocalizedString* localizedString) { function in class:SkOTUtils::LocalizedStrings_NameTable
185 if (fFamilyNameIter.next(record)) {
|
| /external/chromium_org/third_party/sqlite/src/ext/fts1/ |
| fts1_hash.h | 53 fts1HashElem *next, *prev; /* Next and previous elements in the table */ member in struct:fts1HashElem
102 #define fts1HashNext(E) ((E)->next)
|
| /external/chromium_org/third_party/sqlite/src/ext/fts3/ |
| fts3_hash.h | 51 Fts3HashElem *next, *prev; /* Next and previous elements in the table */ member in struct:Fts3HashElem
102 #define fts3HashNext(E) ((E)->next)
|
| /external/chromium_org/third_party/tlslite/tlslite/utils/ |
| xmltools.py | 71 next = child.nextSibling
73 child = next
104 def next(self): member in class:getChildIter.ChildIter
|
