Searched refs:prev (Results 201 - 225 of 1447) sorted by relevance

1234567891011>>

/external/chromium_org/third_party/mesa/src/src/gallium/drivers/nv50/codegen/
H A Dnv50_ir_graph.cpp56 prev[0]->next[0] = next[0];
57 next[0]->prev[0] = prev[0];
64 prev[1]->next[1] = next[1];
65 next[1]->prev[1] = prev[1];
102 edge->prev[0] = this->out->prev[0];
103 edge->prev[0]->next[0] = edge;
104 this->out->prev[
[all...]
/external/chromium_org/third_party/mesa/src/src/mesa/drivers/dri/intel/
H A Dintel_resolve_map.h81 struct intel_resolve_map *prev; member in struct:intel_resolve_map
/external/chromium_org/third_party/mesa/src/src/mesa/main/
H A Dmm.c79 heap->prev = block;
85 block->prev = heap;
115 newblock->prev = p;
116 p->next->prev = newblock;
139 newblock->prev = p;
140 p->next->prev = newblock;
228 q->next->prev = p;
261 if (b->prev != b->heap)
262 Join2Blocks(b->prev);
/external/chromium_org/third_party/skia/src/core/
H A DSkTMultiMap.h61 ValueList* prev = NULL; local
63 prev = list;
72 } else if (prev) {
73 prev->fNext = NULL;
/external/chromium_org/third_party/skia/third_party/lua/src/
H A Dlfunc.c66 uv->u.l.prev = &g->uvhead; /* double link it in `uvhead' list */
68 uv->u.l.next->u.l.prev = uv;
70 lua_assert(uv->u.l.next->u.l.prev == uv && uv->u.l.prev->u.l.next == uv);
76 lua_assert(uv->u.l.next->u.l.prev == uv && uv->u.l.prev->u.l.next == uv);
77 uv->u.l.next->u.l.prev = uv->u.l.prev; /* remove from `uvhead' list */
78 uv->u.l.prev->u.l.next = uv->u.l.next;
/external/chromium_org/third_party/sqlite/src/src/
H A Dhash.h60 HashElem *next, *prev; /* Next and previous elements in the table */ member in struct:HashElem
/external/chromium_org/third_party/tcmalloc/chromium/src/base/
H A Datomicops-internals-x86.h75 Atomic32 prev; local
77 : "=a" (prev)
80 return prev;
199 Atomic64 prev; local
201 : "=a" (prev)
204 return prev;
305 Atomic64 prev; local
311 : "=A" (prev) // as contents of ptr:
316 return prev;
/external/chromium_org/third_party/tcmalloc/vendor/src/base/
H A Datomicops-internals-x86.h75 Atomic32 prev; local
77 : "=a" (prev)
80 return prev;
199 Atomic64 prev; local
201 : "=a" (prev)
204 return prev;
305 Atomic64 prev; local
311 : "=A" (prev) // as contents of ptr:
316 return prev;
/external/freetype/src/base/
H A Dftutil.c271 node->prev = before;
292 node->prev = 0;
297 after->prev = node;
312 before = node->prev;
321 after->prev = before;
336 before = node->prev;
346 after->prev = before;
350 node->prev = 0;
352 list->head->prev = node;
/external/icu/icu4c/source/i18n/
H A Dnortrans.cpp139 int32_t prev = start; local
151 start=prev;
160 text.handleReplaceBetween(prev, start, normalized);
163 int32_t delta = normalized.length() - (start - prev);
/external/libcxx/test/containers/associative/map/map.modifiers/
H A Dinsert_iter_cv.pass.cpp40 assert(r == prev(m.end()));
46 assert(r == prev(m.end()));
69 assert(r == prev(m.end()));
75 assert(r == prev(m.end()));
H A Dinsert_iter_rv.pass.cpp44 assert(r == prev(m.end()));
50 assert(r == prev(m.end()));
74 assert(r == prev(m.end()));
80 assert(r == prev(m.end()));
/external/libcxx/test/containers/associative/multimap/multimap.modifiers/
H A Dinsert_cv.pass.cpp40 assert(r == prev(m.end()));
46 assert(r == prev(m.end()));
69 assert(r == prev(m.end()));
75 assert(r == prev(m.end()));
H A Dinsert_iter_rv.pass.cpp44 assert(r == prev(m.end()));
50 assert(r == prev(m.end()));
74 assert(r == prev(m.end()));
80 assert(r == prev(m.end()));
H A Dinsert_rv.pass.cpp43 assert(r == prev(m.end()));
49 assert(r == prev(m.end()));
72 assert(r == prev(m.end()));
78 assert(r == prev(m.end()));
/external/libcxx/test/containers/associative/set/
H A Dinsert_cv.pass.cpp41 assert(r.first == prev(m.end()));
47 assert(r.first == prev(m.end()));
70 assert(r.first == prev(m.end()));
76 assert(r.first == prev(m.end()));
H A Dinsert_rv.pass.cpp43 assert(r.first == prev(m.end()));
49 assert(r.first == prev(m.end()));
72 assert(r.first == prev(m.end()));
78 assert(r.first == prev(m.end()));
/external/mesa3d/src/egl/main/
H A Degldisplay.c434 _EGLResource *prev; local
436 prev = res->Display->ResourceLists[type];
437 if (prev != res) {
438 while (prev) {
439 if (prev->Next == res)
441 prev = prev->Next;
443 assert(prev);
444 prev->Next = res->Next;
/external/mesa3d/src/gallium/auxiliary/util/
H A Du_mm.c88 heap->prev = block;
94 block->prev = heap;
124 newblock->prev = p;
125 p->next->prev = newblock;
148 newblock->prev = p;
149 p->next->prev = newblock;
241 q->next->prev = p;
274 if (b->prev != b->heap)
275 Join2Blocks(b->prev);
/external/mesa3d/src/gallium/drivers/llvmpipe/
H A Dlp_state_setup.h13 struct lp_setup_variant_list_item *next, *prev; member in struct:lp_setup_variant_list_item
/external/mesa3d/src/gallium/drivers/nv50/codegen/
H A Dnv50_ir_graph.cpp56 prev[0]->next[0] = next[0];
57 next[0]->prev[0] = prev[0];
64 prev[1]->next[1] = next[1];
65 next[1]->prev[1] = prev[1];
102 edge->prev[0] = this->out->prev[0];
103 edge->prev[0]->next[0] = edge;
104 this->out->prev[
[all...]
/external/mesa3d/src/mesa/drivers/dri/intel/
H A Dintel_resolve_map.h81 struct intel_resolve_map *prev; member in struct:intel_resolve_map
/external/mesa3d/src/mesa/main/
H A Dmm.c79 heap->prev = block;
85 block->prev = heap;
115 newblock->prev = p;
116 p->next->prev = newblock;
139 newblock->prev = p;
140 p->next->prev = newblock;
228 q->next->prev = p;
261 if (b->prev != b->heap)
262 Join2Blocks(b->prev);
/external/okhttp/okio/src/main/java/okio/
H A DSegmentPool.java52 if (segment.next != null || segment.prev != null) throw new IllegalArgumentException();
/external/qemu/distrib/sdl-1.2.15/src/timer/
H A DSDL_timer.c107 SDL_TimerID t, prev, next; local
113 for ( prev = NULL, t = SDL_timers; t; t = next ) {
146 if ( prev ) {
147 prev->next = next;
157 /* Don't update prev if the timer has disappeared */
159 prev = t;
208 SDL_TimerID t, prev = NULL; local
214 for (t = SDL_timers; t; prev=t, t = t->next ) {
216 if(prev) {
217 prev
[all...]

Completed in 3500 milliseconds

1234567891011>>