Searched defs:prev (Results 101 - 125 of 789) sorted by relevance

1234567891011>>

/external/wpa_supplicant_8/wpa_supplicant/src/utils/
H A Dlist.h17 struct dl_list *prev; member in struct:dl_list
25 list->prev = list;
31 item->prev = list;
32 list->next->prev = item;
38 dl_list_add(list->prev, item);
43 item->next->prev = item->prev;
44 item->prev->next = item->next;
46 item->prev = NULL;
76 dl_list_entry((list)->prev, typ
[all...]
/external/blktrace/btt/
H A Dlist.h35 struct list_head *next, *prev; member in struct:list_head
46 list->prev = list;
53 * the prev/next entries already!
56 struct list_head *prev,
59 next->prev = new;
61 new->prev = prev;
62 prev->next = new;
88 __list_add(new, head->prev, head);
92 * Delete a list entry by making the prev/nex
55 __list_add(struct list_head *new, struct list_head *prev, struct list_head *next) argument
98 __list_del(struct list_head * prev, struct list_head * next) argument
[all...]
/external/boringssl/src/crypto/fipsmodule/rand/
H A Drand.c70 /* next and prev form a NULL-terminated, double-linked list of all states in
72 struct rand_thread_state *next, *prev; member in struct:rand_thread_state
108 if (state->prev != NULL) {
109 state->prev->next = state->next;
115 state->next->prev = state->prev;
290 state->next->prev = state;
292 state->prev = NULL;
/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/compiler-rt/lib/sanitizer_common/
H A Dsanitizer_mutex.h112 u32 prev = atomic_fetch_sub(&state_, kWriteLock, memory_order_release); local
113 DCHECK_NE(prev & kWriteLock, 0);
114 (void)prev;
118 u32 prev = atomic_fetch_add(&state_, kReadLock, memory_order_acquire); local
119 if ((prev & kWriteLock) == 0)
125 u32 prev = atomic_fetch_sub(&state_, kReadLock, memory_order_release); local
126 DCHECK_EQ(prev & kWriteLock, 0);
127 DCHECK_GT(prev & ~kWriteLock, 0);
128 (void)prev;
164 u32 prev local
[all...]
/external/e2fsprogs/e2fsck/
H A Dmtrace.h143 size_t prev; /* Index of previous free cluster. */ member in struct:__anon5084::__anon5088
167 struct list *prev; member in struct:list
H A Dregion.c62 struct region_el *r, *new_region, *prev, *next; local
78 for (r = region->allocated, prev=NULL; r; prev = r, r = r->next) {
113 if (prev)
114 prev->next = new_region;
/external/e2fsprogs/lib/ext2fs/
H A Dinode_io.c117 struct inode_private_data *prev, *data = NULL; local
124 for (data = top_intern, prev = NULL; data;
125 prev = data, data = data->next)
130 if (prev)
131 prev->next = data->next;
/external/eigen/test/
H A Dsparse_permutations.cpp26 Index prev = -1; local
29 if(prev>=it.index())
31 prev = it.index();
/external/elfutils/libdw/
H A Dcfi.c47 Dwarf_Frame *prev)
54 copy->prev = prev;
340 Dwarf_Frame *prev = fs->prev; local
341 cfi_assert (prev != NULL);
343 fs = prev;
410 while (fs->prev != NULL)
412 Dwarf_Frame *prev = fs->prev; local
46 duplicate_frame_state(const Dwarf_Frame *original, Dwarf_Frame *prev) argument
[all...]
/external/fio/
H A Dflist.h22 * sometimes we already know the next/prev entries and we can
28 struct flist_head *next, *prev; member in struct:flist_head
37 (ptr)->next = (ptr); (ptr)->prev = (ptr); \
44 * the prev/next entries already!
47 struct flist_head *prev,
50 next->prev = new_entry;
52 new_entry->prev = prev;
53 prev->next = new_entry;
73 __flist_add(new_entry, head->prev, hea
46 __flist_add(struct flist_head *new_entry, struct flist_head *prev, struct flist_head *next) argument
83 __flist_del(struct flist_head *prev, struct flist_head * next) argument
122 __flist_splice(const struct flist_head *list, struct flist_head *prev, struct flist_head *next) argument
[all...]
/external/fio/lib/
H A Dprio_tree.c81 struct prio_tree_node *first = NULL, *prev, *last = NULL; local
98 prev = last;
102 prev->left = last;
103 last->parent = prev;
/external/icu/android_icu4j/src/main/java/android/icu/impl/coll/
H A DBOCSU.java95 * code points. Lexical order is preserved if "prev" is always moved
98 * <p>Additionally, "prev" is moved from anywhere in the Unihan
103 public static int writeIdenticalLevelRun(int prev, CharSequence s, int i, int length, ByteArrayWrapper sink) { argument
114 if (prev < 0x4e00 || prev >= 0xa000) {
115 prev = (prev & ~0x7f) - SLOPE_REACH_NEG_1_;
119 prev = 0x9fff - SLOPE_REACH_POS_2_;
126 prev = 0;
128 p = writeDiff(c - prev, buffe
[all...]
/external/icu/icu4c/source/common/
H A Dlocutil.cpp171 int32_t prev, i; local
172 prev = 0;
174 i = id.indexOf((UChar)0x40, prev);
176 // no @ between prev and the rest of the string
177 id.extract(prev, INT32_MAX, buffer + prev, BUFLEN - prev, US_INV);
181 id.extract(prev, i - prev, buffer + prev, BUFLE
[all...]
/external/icu/icu4c/source/i18n/
H A Ducsdet.cpp166 UBool prev = csd->getStripTagsFlag(); local
170 return prev;
/external/icu/icu4c/source/tools/toolutil/
H A Dwritesrc.c237 int prev2, prev, c; local
242 prev2=prev=-1;
251 (col>=24 && prev2>=0x20 && prev==0) ||
253 (col>=16 && (prev==0 || prev>=0x20) && 0<c && c<0x20)
262 prev2=prev;
263 prev=c;
/external/icu/icu4j/main/classes/collate/src/com/ibm/icu/impl/coll/
H A DBOCSU.java94 * code points. Lexical order is preserved if "prev" is always moved
97 * <p>Additionally, "prev" is moved from anywhere in the Unihan
102 public static int writeIdenticalLevelRun(int prev, CharSequence s, int i, int length, ByteArrayWrapper sink) { argument
113 if (prev < 0x4e00 || prev >= 0xa000) {
114 prev = (prev & ~0x7f) - SLOPE_REACH_NEG_1_;
118 prev = 0x9fff - SLOPE_REACH_POS_2_;
125 prev = 0;
127 p = writeDiff(c - prev, buffe
[all...]
/external/jemalloc/test/unit/
H A Dph.c77 "auxelm's prev doesn't link to auxelm");
107 "sibling's prev doesn't link to sibling");
128 "auxelm's prev doesn't link to auxelm");
238 node_t *prev = NULL; local
243 if (prev != NULL) {
245 prev), 0,
248 prev = node;
252 node_t *prev = NULL; local
257 if (prev != NULL) {
259 prev),
[all...]
/external/libcups/cups/
H A Doptions.c29 cups_option_t *option, int prev, int *rdiff);
586 int prev, /* I - Previous index */
596 DEBUG_printf(("7cups_find_option(name=\"%s\", num_options=%d, options=%p, prev=%d, rdiff=%p)", name, num_options, (void *)options, prev, (void *)rdiff));
606 if (prev >= 0)
612 if ((diff = cups_compare_options(&key, options + prev)) == 0 ||
613 (diff < 0 && prev == 0) ||
614 (diff > 0 && prev == (num_options - 1)))
617 return (prev);
626 right = prev;
582 cups_find_option( const char *name, int num_options, cups_option_t *options, int prev, int *rdiff) argument
[all...]
/external/libcxxabi/src/
H A Dfallback_malloc.cpp92 heap_node *p, *prev; local
100 for (p = freelist, prev = 0;
101 p && p != list_end; prev = p, p = node_from_offset ( p->next_node)) {
114 if (prev == 0)
117 prev->next_node = p->next_node;
130 struct heap_node *p, *prev; local
138 for (p = freelist, prev = 0;
139 p && p != list_end; prev = p, p = node_from_offset (p->next_node)) {
159 if ( prev == 0 ) {
164 prev
178 struct heap_node *p, *prev; local
[all...]
/external/libdrm/
H A Dutil_double_list.h43 struct list_head *prev; member in struct:list_head
49 item->prev = item;
55 item->prev = list;
57 list->next->prev = item;
64 item->prev = list->prev;
65 list->prev->next = item;
66 list->prev = item;
71 to->prev = from->prev;
[all...]
/external/libldac/src/
H A Dsigana_ldac.c108 SCALAR prev; local
110 prev = _scalar(0.0);
112 if (prev * *p_time < _scalar(0.0)) {
115 prev = *p_time++;
/external/libnfnetlink/src/
H A Drtnl.c76 struct rtnl_handler *h, *prev = NULL; local
83 if (prev)
84 prev->next = h->next;
89 prev = h;
/external/libpng/contrib/intel/
H A Dfilter_sse2_intrinsics.c26 * prev: c b
66 png_const_bytep prev)
95 png_const_bytep prev)
116 png_const_bytep prev)
130 b = load4(prev);
141 prev += 3;
146 b = load3(prev);
158 prev += 3;
165 png_const_bytep prev)
179 b = load4(prev);
65 png_read_filter_row_sub3_sse2(png_row_infop row_info, png_bytep row, png_const_bytep prev) argument
94 png_read_filter_row_sub4_sse2(png_row_infop row_info, png_bytep row, png_const_bytep prev) argument
115 png_read_filter_row_avg3_sse2(png_row_infop row_info, png_bytep row, png_const_bytep prev) argument
164 png_read_filter_row_avg4_sse2(png_row_infop row_info, png_bytep row, png_const_bytep prev) argument
225 png_read_filter_row_paeth3_sse2(png_row_infop row_info, png_bytep row, png_const_bytep prev) argument
319 png_read_filter_row_paeth4_sse2(png_row_infop row_info, png_bytep row, png_const_bytep prev) argument
[all...]
/external/libxml2/
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...]

Completed in 730 milliseconds

1234567891011>>