Searched refs:next (Results 226 - 250 of 3487) sorted by relevance

1234567891011>>

/external/qemu/
H A Dasync.c124 QEMUBH *next; member in struct:QEMUBH
133 bh->next = async_context->first_bh;
144 for (bh = async_context->first_bh; bh; bh = bh->next) {
159 *bhp = bh->next;
162 bhp = &bh->next;
201 for (bh = async_context->first_bh; bh; bh = bh->next) {
/external/skia/src/gpu/
H A DGrAllocPool.cpp21 static Block* Create(size_t size, Block* next) { argument
25 block->fNext = next;
72 Block* next = block->fNext; local
74 block = next;
97 Block* next = fBlock->fNext; local
99 fBlock = next;
/external/tcpdump/
H A Dprint-igrp.c84 u_int nint, nsys, next; local
94 next = EXTRACT_16BITS(&hdr->ig_nx);
103 next);
115 } else if (next > 0) {
118 --next;
126 if (nint == 0 && nsys == 0 && next == 0)
/external/libusb/libusb/
H A Dlibusbi.h40 struct list_head *prev, *next; member in struct:list_head
57 for (pos = list_entry((head)->next, typeof(*pos), member); \
59 pos = list_entry(pos->member.next, typeof(*pos), member))
62 for (pos = list_entry((head)->next, typeof(*pos), member), \
63 n = list_entry(pos->member.next, typeof(*pos), member); \
65 pos = n, n = list_entry(n->member.next, typeof(*n), member))
67 #define list_empty(entry) ((entry)->next == (entry))
71 entry->prev = entry->next = entry;
76 entry->next = head->next;
[all...]
/external/openssh/
H A Dmonitor_mm.c58 RB_GENERATE(mmtree, mm_share, next, mm_compare)
121 struct mm_share *mms, *next; local
123 for (mms = RB_ROOT(head); mms; mms = next) {
124 next = RB_NEXT(mmtree, head, mms);
231 if (RB_LEFT(prev, next)) {
232 prev = RB_LEFT(prev, next);
233 while (RB_RIGHT(prev, next))
234 prev = RB_RIGHT(prev, next);
236 if (RB_PARENT(prev, next) &&
237 (prev == RB_RIGHT(RB_PARENT(prev, next), nex
[all...]
/external/dropbear/
H A Dcli-runopts.c75 char ** next = 0; local
78 int nextiskey = 0; /* A flag if the next argument is a keyfile */
139 if (next) {
141 *next = argv[i];
142 if (*next == NULL) {
145 next = NULL;
157 next = &cli_opts.remoteport;
195 next = &cli_opts.username;
219 next = &dummy;
227 if (next
[all...]
/external/elfutils/libebl/
H A Deblstrtab.c76 struct Ebl_Strent *next; member in struct:Ebl_Strent
86 struct memoryblock *next; member in struct:memoryblock
145 newmem->next = st->memory;
162 mb = mb->next;
192 newstr->next = NULL;
260 for (struct Ebl_Strent *subs = (*sep)->next; subs != NULL;
261 subs = subs->next)
277 newstr->next = (*sep)->next;
278 (*sep)->next
[all...]
/external/ppp/pppd/plugins/radius/
H A Ddict.c98 vdict->next = vendor_dictionaries;
201 attr->next = vdict->attributes;
204 attr->next = dictionary_attributes;
262 dval->next = dictionary_values;
306 attr = attr->next;
318 attr = attr->next;
344 attr = attr->next;
355 attr = attr->next;
357 dict = dict->next;
382 val = val->next;
[all...]
/external/smack/src/org/jivesoftware/smack/provider/
H A DProviderManager.java174 parser.next();
175 parser.next();
177 parser.next();
178 parser.next();
180 parser.next();
181 parser.next();
207 parser.next();
208 parser.next();
210 parser.next();
211 parser.next();
[all...]
/external/valgrind/main/coregrind/
H A Dm_hashtable.c47 UInt iterChain; // next chain to be traversed by the iterator
128 VgHashNode* next = node->next; local
130 node->next = chains[chain];
132 node = next;
146 node->next = table->chains[chain];
166 curr = curr->next;
183 *prev_next_ptr = curr->next;
187 prev_next_ptr = &(curr->next);
188 curr = curr->next;
[all...]
/external/wpa_supplicant_8/hostapd/src/radius/
H A Dradius_client.c108 * next_try - Time for the next transmission attempt
140 * next - Next message in the list
142 struct radius_msg_list *next; member in struct:radius_msg_list
395 prev->next = entry->next;
397 radius->msgs = entry->next;
400 entry = entry->next;
418 entry = entry->next;
433 struct hostapd_radius_server *next, *old; local
442 for (entry = radius->msgs; entry; entry = entry->next) {
457 struct hostapd_radius_server *next, *old; local
[all...]
/external/wpa_supplicant_8/src/radius/
H A Dradius_client.c108 * next_try - Time for the next transmission attempt
140 * next - Next message in the list
142 struct radius_msg_list *next; member in struct:radius_msg_list
395 prev->next = entry->next;
397 radius->msgs = entry->next;
400 entry = entry->next;
418 entry = entry->next;
433 struct hostapd_radius_server *next, *old; local
442 for (entry = radius->msgs; entry; entry = entry->next) {
457 struct hostapd_radius_server *next, *old; local
[all...]
/external/wpa_supplicant_8/wpa_supplicant/src/radius/
H A Dradius_client.c108 * next_try - Time for the next transmission attempt
140 * next - Next message in the list
142 struct radius_msg_list *next; member in struct:radius_msg_list
395 prev->next = entry->next;
397 radius->msgs = entry->next;
400 entry = entry->next;
418 entry = entry->next;
433 struct hostapd_radius_server *next, *old; local
442 for (entry = radius->msgs; entry; entry = entry->next) {
457 struct hostapd_radius_server *next, *old; local
[all...]
/external/wpa_supplicant_8/hostapd/src/rsn_supp/
H A Dpmksa_cache.c61 pmksa->pmksa = entry->next;
164 pmksa->pmksa = pos->next;
166 prev->next = pos->next;
181 pos = pos->next;
194 pos = pos->next;
195 pmksa->pmksa->next = pos ? pos->next : NULL;
197 pmksa->pmksa = pos->next;
215 pos = pos->next;
[all...]
/external/wpa_supplicant_8/src/rsn_supp/
H A Dpmksa_cache.c61 pmksa->pmksa = entry->next;
164 pmksa->pmksa = pos->next;
166 prev->next = pos->next;
181 pos = pos->next;
194 pos = pos->next;
195 pmksa->pmksa->next = pos ? pos->next : NULL;
197 pmksa->pmksa = pos->next;
215 pos = pos->next;
[all...]
/external/wpa_supplicant_8/wpa_supplicant/src/rsn_supp/
H A Dpmksa_cache.c61 pmksa->pmksa = entry->next;
164 pmksa->pmksa = pos->next;
166 prev->next = pos->next;
181 pos = pos->next;
194 pos = pos->next;
195 pmksa->pmksa->next = pos ? pos->next : NULL;
197 pmksa->pmksa = pos->next;
215 pos = pos->next;
[all...]
/external/zlib/src/contrib/infback9/
H A Dinfback9.c57 code *next, *lenfix, *distfix; local
67 next = fixed;
68 lenfix = next;
70 inflate_table9(LENS, state.lens, 288, &(next), &(bits), state.work);
75 distfix = next;
77 inflate_table9(DISTS, state.lens, 32, &(next), &(bits), state.work);
128 have = in(in_desc, &next); \
130 next = Z_NULL; \
143 hold += (unsigned long)(*next++) << bits; \
225 unsigned char FAR *next; /* nex local
[all...]
/external/elfutils/libdwfl/
H A Ddwfl_getmodules.c79 m = m->next;
105 m = m->next;
/external/guava/guava/src/com/google/common/util/concurrent/
H A DAtomicDoubleArray.java103 long next = doubleToRawLongBits(newValue);
104 longs.set(i, next);
116 // long next = doubleToRawLongBits(newValue);
117 // longs.lazySet(i, next);
129 long next = doubleToRawLongBits(newValue);
130 return longBitsToDouble(longs.getAndSet(i, next));
186 long next = doubleToRawLongBits(nextVal);
187 if (longs.compareAndSet(i, current, next)) {
205 long next = doubleToRawLongBits(nextVal);
206 if (longs.compareAndSet(i, current, next)) {
[all...]
/external/iproute2/lib/
H A Dll_map.c29 struct idxmap * next; member in struct:idxmap
62 for (imp=&idxmap[h]; (im=*imp)!=NULL; imp = &im->next)
70 im->next = *imp;
97 for (im = idxmap[idx&0xF]; im; im = im->next)
118 for (im = idxmap[idx&0xF]; im; im = im->next)
131 for (im = idxmap[idx&0xF]; im; im = im->next)
145 for (im = idxmap[idx&0xF]; im; im = im->next) {
171 for (im = idxmap[i]; im; im = im->next) {
/external/junit/src/org/junit/internal/runners/statements/
H A DExpectException.java13 public ExpectException(Statement next, Class<? extends Throwable> expected) { argument
14 fNext= next;
H A DRunAfters.java20 public RunAfters(Statement next, List<FrameworkMethod> afters, Object target) { argument
21 fNext= next;
/external/libsepol/include/sepol/policydb/
H A Dconstraint.h61 struct constraint_expr *next; /* next expression */ member in struct:constraint_expr
67 struct constraint_node *next; /* next constraint */ member in struct:constraint_node
/external/libxml2/
H A Dhash.c60 struct _xmlHashEntry *next; member in struct:_xmlHashEntry
236 xmlHashEntryPtr iter, next; local
274 table->table[key].next = NULL;
278 iter = oldtable[i].next;
280 next = iter->next;
290 table->table[key].next = NULL;
293 iter->next = table->table[key].next;
294 table->table[key].next
327 xmlHashEntryPtr next; local
868 xmlHashEntryPtr next; local
942 xmlHashEntryPtr next; local
982 xmlHashEntryPtr next; local
[all...]
/external/llvm/lib/Support/Windows/
H A DPath.inc626 char *next = pathname;
629 next = strchr(pathname+2, '/');
630 if (next == NULL)
634 next = strchr(next+1, '/');
635 if (next == NULL)
638 next++;
639 if (*next == 0)
644 next += 2; // skip drive letter
645 if (*next
[all...]

Completed in 530 milliseconds

1234567891011>>