Searched refs:prev (Results 76 - 100 of 1047) sorted by relevance

1234567891011>>

/external/valgrind/callgrind/
H A Dcosts.h49 CostChunk *next, *prev; member in struct:_CostChunk
/external/wpa_supplicant_8/hostapd/src/ap/
H A Dap_list.c25 /* AP list is a double linked list with head->prev pointing to the end of the
67 ap->prev = iface->ap_list->prev;
68 iface->ap_list->prev = ap;
70 ap->prev = ap;
81 ap->prev->next = ap->next;
84 ap->next->prev = ap->prev;
86 iface->ap_list->prev = ap->prev;
131 struct ap_info *ap, *prev; local
[all...]
H A Dpmksa_cache_auth.c53 struct rsn_pmksa_cache_entry *pos, *prev; local
62 prev = NULL;
65 if (prev != NULL)
66 prev->hnext = entry->hnext;
71 prev = pos;
77 prev = NULL;
80 if (prev != NULL)
81 prev->next = entry->next;
86 prev = pos;
199 struct rsn_pmksa_cache_entry *pos, *prev; local
355 struct rsn_pmksa_cache_entry *entry, *prev; local
510 struct rsn_pmksa_cache_entry *entry, *prev; local
[all...]
/external/wpa_supplicant_8/src/ap/
H A Dap_list.c25 /* AP list is a double linked list with head->prev pointing to the end of the
67 ap->prev = iface->ap_list->prev;
68 iface->ap_list->prev = ap;
70 ap->prev = ap;
81 ap->prev->next = ap->next;
84 ap->next->prev = ap->prev;
86 iface->ap_list->prev = ap->prev;
131 struct ap_info *ap, *prev; local
[all...]
H A Dpmksa_cache_auth.c53 struct rsn_pmksa_cache_entry *pos, *prev; local
62 prev = NULL;
65 if (prev != NULL)
66 prev->hnext = entry->hnext;
71 prev = pos;
77 prev = NULL;
80 if (prev != NULL)
81 prev->next = entry->next;
86 prev = pos;
199 struct rsn_pmksa_cache_entry *pos, *prev; local
355 struct rsn_pmksa_cache_entry *entry, *prev; local
510 struct rsn_pmksa_cache_entry *entry, *prev; local
[all...]
/external/wpa_supplicant_8/wpa_supplicant/src/ap/
H A Dap_list.c25 /* AP list is a double linked list with head->prev pointing to the end of the
67 ap->prev = iface->ap_list->prev;
68 iface->ap_list->prev = ap;
70 ap->prev = ap;
81 ap->prev->next = ap->next;
84 ap->next->prev = ap->prev;
86 iface->ap_list->prev = ap->prev;
131 struct ap_info *ap, *prev; local
[all...]
H A Dpmksa_cache_auth.c53 struct rsn_pmksa_cache_entry *pos, *prev; local
62 prev = NULL;
65 if (prev != NULL)
66 prev->hnext = entry->hnext;
71 prev = pos;
77 prev = NULL;
80 if (prev != NULL)
81 prev->next = entry->next;
86 prev = pos;
199 struct rsn_pmksa_cache_entry *pos, *prev; local
355 struct rsn_pmksa_cache_entry *entry, *prev; local
510 struct rsn_pmksa_cache_entry *entry, *prev; local
[all...]
/external/compiler-rt/lib/msan/
H A Dmsan_origin.h110 static Origin CreateChainedOrigin(Origin prev, StackTrace *stack) { argument
111 int depth = prev.isChainedOrigin() ? prev.depth() : 0;
116 return prev;
124 if (!h.valid()) return prev;
128 if (use_count > flags()->origin_history_per_stack_limit) return prev;
132 bool inserted = ChainedOriginDepotPut(h.id(), prev.raw_id(), &chained_id);
/external/selinux/policycoreutils/restorecond/
H A Dstringslist.c36 struct stringsList *prev = NULL; local
44 prev = ptr;
52 if (prev)
53 prev->next = newptr;
72 struct stringsList *prev = NULL; local
75 prev = ptr;
77 free(prev);
/external/icu/icu4j/main/classes/collate/src/com/ibm/icu/impl/coll/
H A DBOCSU.java92 * code points. Lexical order is preserved if "prev" is always moved
95 * <p>Additionally, "prev" is moved from anywhere in the Unihan
100 public static int writeIdenticalLevelRun(int prev, CharSequence s, int i, int length, ByteArrayWrapper sink) { argument
111 if (prev < 0x4e00 || prev >= 0xa000) {
112 prev = (prev & ~0x7f) - SLOPE_REACH_NEG_1_;
116 prev = 0x9fff - SLOPE_REACH_POS_2_;
123 prev = 0;
125 p = writeDiff(c - prev, buffe
[all...]
/external/libdrm/tests/
H A Ddristat.c191 drmStatsT prev, curr; local
197 if (drmGetStats(fd, &prev)) return;
199 for (j = 0; j < prev.count; j++) {
201 printf(prev.data[j].long_format, prev.data[j].long_name);
202 if (prev.data[j].isvalue) printf(" 0x%08lx\n", prev.data[j].value);
203 else printf(" %10lu\n", prev.data[j].value);
209 for (j = 0; j < prev.count; j++)
210 if (!prev
[all...]
/external/selinux/libsemanage/src/
H A Ddatabase_llist.c49 entry->prev = NULL;
54 dbase->cache->prev = entry;
76 cache_entry_t *prev, *ptr = dbase->cache;
78 prev = ptr;
80 dbase->rtable->free(prev->data);
81 free(prev);
262 for (ptr = dbase->cache_tail; ptr != NULL; ptr = ptr->prev) {
283 cache_entry_t *ptr, *prev = NULL; local
287 if (prev != NULL)
288 prev
321 cache_entry_t *prev, *ptr = dbase->cache; local
[all...]
/external/libxml2/
H A Dlist.c34 struct _xmlLink *prev; member in struct:_xmlLink
61 (lk->prev)->next = lk->next;
62 (lk->next)->prev = lk->prev;
124 for(lk = l->sentinel->prev;lk != l->sentinel && l->linkCompare(lk->data, data) >0 ;lk = lk->prev);
207 l->sentinel->prev = l->sentinel;
288 lkPlace = lkPlace->prev;
290 (lkPlace->next)->prev = lkNew;
292 lkNew->prev
[all...]
H A DgenUnicode.py156 prev = -1 variable
162 prev = val variable
164 elif val == prev + 1:
165 prev = val variable
167 elif prev == start:
168 ranges.append((prev, prev))
170 prev = val variable
173 ranges.append((start, prev))
175 prev variable
[all...]
/external/javassist/src/main/javassist/bytecode/stackmap/
H A DBasicBlock.java314 BasicBlock prev;
316 prev = getBBlock(marks[i++]);
318 prev = makeBlock(0);
320 blocks.add(prev);
326 if (prev.length > 0) {
328 prev = makeBlock(prev.position + prev.length);
329 blocks.add(prev);
332 prev
[all...]
/external/libcxx/test/std/containers/associative/multimap/multimap.modifiers/
H A Dinsert_iter_cv.pass.cpp40 assert(r == prev(m.end()));
45 r = m.insert(prev(m.end()), M::value_type(3, 4.5));
46 assert(r == prev(m.end(), 2));
69 assert(r == prev(m.end()));
74 r = m.insert(prev(m.end()), M::value_type(3, 4.5));
75 assert(r == prev(m.end(), 2));
/external/icu/icu4c/source/common/
H A Ducnvbocu.cpp46 * Additionally, "prev" is moved from anywhere in the Unihan and Hangul
50 * "prev" is reset for C0 controls but not for space.
53 /* initial value for "prev": middle of the ASCII range */
236 /* compute new prev */
259 * fromUnicodeStatus encoder's prev (0 will be interpreted as BOCU1_ASCII_PREV)
261 * toUnicodeStatus decoder's prev (0 will be interpreted as BOCU1_ASCII_PREV)
398 int32_t prev, c, diff; local
414 prev=(int32_t)cnv->fromUnicodeStatus;
415 if(prev==0) {
416 prev
651 int32_t prev, c, diff; local
947 int32_t prev, count, diff, c; local
1169 int32_t prev, count, diff, c; local
[all...]
/external/openfst/src/include/fst/
H A Dpartition.h46 Element() : value(0), next(0), prev(0) {}
47 Element(T v) : value(v), next(0), prev(0) {}
51 Element* prev; member in struct:fst::Partition::Element
111 classes_[class_id]->prev = element;
113 element->prev = 0;
126 if (element->next) element->next->prev = element->prev;
127 if (element->prev) element->prev->next = element->next;
174 split_el->prev
[all...]
/external/icu/icu4c/source/test/cintltst/
H A Dbocu1tst.c54 * Additionally, "prev" is moved from anywhere in the Unihan and Hangul
58 * "prev" is reset for C0 controls but not for space.
61 /* initial value for "prev": middle of the ASCII range */
224 int32_t prev, count, diff; member in struct:Bocu1Rx
254 /* compute new prev */
365 int32_t prev; local
372 prev=*pPrev;
373 if(prev==0) {
375 prev=*pPrev=BOCU1_ASCII_PREV;
392 * are encoded with the difference c-prev
529 int32_t prev, c, count; local
711 int32_t c, prev, i; local
790 uint8_t prev[5], level[5]; local
[all...]
/external/libcxx/test/std/iterators/iterator.primitives/iterator.operations/
H A Dprev.pass.cpp13 // Iter prev(Iter x, Iter::difference_type n = 1);
24 assert(std::prev(i, n) == x);
31 assert(std::prev(i) == x);
/external/mesa3d/src/gallium/winsys/svga/drm/
H A Dvmw_fence.c177 int32_t prev = old; local
180 old = prev;
181 prev = p_atomic_cmpxchg(&vfence->signalled, old, old | vflags);
182 } while (prev != old);
221 int32_t prev = old; local
224 old = prev;
225 prev = p_atomic_cmpxchg(&vfence->signalled, old, old | vflags);
226 } while (prev != old);
/external/smali/dexlib2/src/main/java/org/jf/dexlib2/writer/pool/
H A DAnnotationSetPool.java51 Integer prev = internedItems.put(annotationSet, 0);
52 if (prev == null) {
H A DTypePool.java50 Integer prev = internedItems.put(typeString, 0);
51 if (prev == null) {
/external/bison/lib/
H A Dfd-hook.c101 struct fd_hook *prev = link->private_prev; local
103 if (next != NULL && prev != NULL)
106 prev->private_next = next;
107 next->private_prev = prev;
/external/libcxx/test/std/containers/associative/multiset/
H A Dinsert_cv.pass.cpp38 assert(r == prev(m.end()));
43 assert(r == prev(m.end()));
63 assert(r == prev(m.end()));
68 assert(r == prev(m.end()));

Completed in 6547 milliseconds

1234567891011>>