HomeSort by relevance Sort by last modified time
    Searched defs:next (Results 1051 - 1075 of 3921) sorted by null

<<41424344454647484950>>

  /external/mesa3d/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/mesa3d/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/mesa3d/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/mesa3d/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/mesa3d/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/openssl/crypto/engine/
eng_int.h 199 struct engine_st *next; member in struct:engine_st
  /external/oprofile/libdb/
odb.h 45 odb_index_t next; /**< next entry for this bucket */ member in struct:__anon24365
  /external/ppp/pppd/
demand.c 66 struct packet *next; member in struct:packet
149 nextpkt = pkt->next;
286 pkt->next = NULL;
291 pend_qtail->next = pkt;
311 nextpkt = pkt->next;
319 prev->next = pkt;
325 prev->next = NULL;
  /external/proguard/src/proguard/gui/
TabbedPane.java 205 * Selects the next tab.
207 public void next() method in class:TabbedPane
209 cardLayout.next(cardPanel);
  /external/qemu/android/utils/
filelock.c 79 FileLock* next; member in struct:FileLock
368 for (lock = _all_filelocks; lock != NULL; lock = lock->next)
407 lock->next = _all_filelocks;
410 if (lock->next == NULL)
tempfile.c 47 TempFile* next; member in struct:TempFile
103 tempfile->next = _all_tempfiles;
106 if ( !tempfile->next ) {
196 for (tempfile = _all_tempfiles; tempfile; tempfile = tempfile->next)
  /external/qemu/distrib/sdl-1.2.15/src/timer/
SDL_timer.c 46 struct _SDL_TimerID *next; member in struct:_SDL_TimerID
107 SDL_TimerID t, prev, next; local
113 for ( prev = NULL, t = SDL_timers; t; t = next ) {
116 next = t->next;
147 prev->next = next;
149 SDL_timers = next;
174 t->next = SDL_timers;
214 for (t = SDL_timers; t; prev=t, t = t->next ) {
    [all...]
  /external/qemu/distrib/sdl-1.2.15/src/video/Xext/extensions/
extutil.h 49 struct _XExtDisplayInfo *next; /* keep a linked list */ member in struct:_XExtDisplayInfo
  /external/qemu/distrib/sdl-1.2.15/src/video/dga/
SDL_dgavideo.h 62 struct vidmem_bucket *next; member in struct:vidmem_bucket
  /external/qemu/distrib/zlib-1.2.3/
infback.c 84 static code *next; local
92 next = fixed;
93 lenfix = next;
95 inflate_table(LENS, state->lens, 288, &(next), &(bits), state->work);
100 distfix = next;
102 inflate_table(DISTS, state->lens, 32, &(next), &(bits), state->work);
123 next = strm->next_in; \
134 strm->next_in = next; \
152 have = in(in_desc, &next); \
154 next = Z_NULL;
249 unsigned char FAR *next; \/* next input *\/ local
    [all...]
  /external/qemu/elff/
dwarf_die.cc 27 DIEObject* next = to_del->prev_sibling(); local
29 to_del = next;
  /external/qemu/proxy/
proxy_int.h 71 ProxyConnection* next; member in struct:ProxyConnection
  /external/robolectric/src/main/java/com/xtremelabs/robolectric/tester/org/apache/http/
TestHttpResponse.java 126 @Override public Object next() { method
160 @Override public Object next() { method
  /external/robolectric/src/test/java/com/xtremelabs/robolectric/shadows/
SQLiteStatementTest.java 54 assertThat(resultSet.next(), equalTo(true));
59 assertThat(resultSet.next(), equalTo(true));
63 assertThat(resultSet.next(), equalTo(true));
  /external/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/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/skia/src/gpu/
GrAtlas.cpp 229 GrPlot* next = plot->fNext; local
231 plot = next;

Completed in 806 milliseconds

<<41424344454647484950>>