Searched refs:prev (Results 151 - 175 of 1047) sorted by relevance

1234567891011>>

/external/selinux/policycoreutils/newrole/
H A Dhashtab.c48 hashtab_ptr_t prev, cur, newnode; local
54 prev = NULL;
57 prev = cur;
70 if (prev) {
71 newnode->next = prev->next;
72 prev->next = newnode;
120 hashtab_ptr_t prev, cur, newnode; local
126 prev = NULL;
129 prev = cur;
145 if (prev) {
[all...]
/external/v8/src/base/
H A Datomicops_internals_mips_gcc.h26 Atomic32 prev, tmp; local
30 "ll %0, 0(%4)\n" // prev = *ptr
31 "bne %0, %2, 2f\n" // if (prev != old_value) goto 2
38 : "=&r" (prev), "=&r" (tmp)
41 return prev;
/external/chromium-trace/trace-viewer/third_party/Paste/paste/auth/
H A Ddigest.py44 prev = None
47 if prev.count('"') == 1:
48 prev = "%s,%s" % (prev, item)
51 if prev == None:
52 prev = item
56 yield prev.strip()
57 prev = item
59 yield prev.strip()
/external/freetype/src/base/
H A Dftutil.c279 node->prev = before;
305 node->prev = NULL;
310 after->prev = node;
328 before = node->prev;
337 after->prev = before;
355 before = node->prev;
365 after->prev = before;
369 node->prev = NULL;
371 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/std/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/std/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/std/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/libdrm/intel/
H A Dmm.c75 heap->prev = block;
81 block->prev = heap;
110 newblock->prev = p;
111 p->next->prev = newblock;
135 newblock->prev = p;
136 p->next->prev = newblock;
219 q->next->prev = p;
251 if (b->prev != b->heap)
252 Join2Blocks(b->prev);
H A Dmm.h33 struct mem_block *next, *prev; member in struct:mem_block
/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/okio/src/main/java/okio/
H A DSegmentPool.java50 if (segment.next != null || segment.prev != null) throw new IllegalArgumentException();
/external/pdfium/third_party/freetype/src/base/
H A Dftutil.c279 node->prev = before;
305 node->prev = 0;
310 after->prev = node;
328 before = node->prev;
337 after->prev = before;
355 before = node->prev;
365 after->prev = before;
369 node->prev = 0;
371 list->head->prev = node;
/external/skia/src/core/
H A DSkTMultiMap.h61 ValueList* prev = NULL; local
63 prev = list;
72 } else if (prev) {
73 prev->fNext = NULL;
/external/wpa_supplicant_8/hostapd/src/ap/
H A Dap_list.h15 /* Note: next/prev pointers are updated whenever a new beacon is
19 struct ap_info *prev; /* previous entry in AP list */ member in struct:ap_info
/external/wpa_supplicant_8/src/ap/
H A Dap_list.h15 /* Note: next/prev pointers are updated whenever a new beacon is
19 struct ap_info *prev; /* previous entry in AP list */ member in struct:ap_info

Completed in 3565 milliseconds

1234567891011>>