| /external/qemu/android/ |
| boot-properties.c | 37 struct BootProperty* next; member in struct:BootProperty
50 prop->next = NULL;
65 /* address to store pointer to next new list element */
76 BootProperty *next = NULL; local
78 next = p->next;
80 p = next;
128 _boot_properties_tail = &prop->next;
247 for (; p; p = p->next) {
262 for ( ; p; p = p->next) {
[all...] |
| /external/qemu/telephony/ |
| sysdeps_qemu.c | 54 SysTimer next; member in struct:SysTimerRec_
67 _s_timers0[nn].next = _s_timers0 + (nn+1);
78 _s_free_timers = timer->next;
79 timer->next = NULL;
94 timer->next = _s_free_timers;
159 SysChannel next; member in struct:SysChannelRec_
173 _s_channels0[nn].next = _s_channels0 + (nn+1);
183 _s_free_channels = channel->next;
184 channel->next = NULL;
199 channel->next = _s_free_channels
[all...] |
| /external/quake/quake/src/QW/qwfwd/ |
| qwfwd.c | 72 struct peer *next;
member in struct:peer
199 for (p = peers; p; p = p->next) {
215 for (p = peers; p; p = p->next)
228 p->next = peers;
235 for (p = peers; p; p = p->next)
252 if (!pp && !p->next) {
258 pp->next = p->next;
261 p = pp->next;
264 p = p->next;
[all...] |
| /external/webkit/Tools/DumpRenderTree/mac/PerlSupport/ |
| DumpRenderTreeSupport_wrapPregenerated.c | 79 struct swig_type_info *next; member in struct:swig_type_info
124 swig_type_info *tc, *head, *ret, *next; local
141 next = tc->next;
147 next = 0;
159 head->next = tc;
164 if (next) next->prev = head;
165 head->next = next;
[all...] |
| /libcore/luni/src/main/java/java/util/concurrent/ |
| ConcurrentLinkedDeque.java | 81 * ("prev") and successor ("next") nodes:
83 * class Node<E> { volatile Node<E> prev, next; volatile E item; }
92 * "last" node terminating any chain of next references starting at
97 * next reference in the first or last node to a fresh node
104 * A "self-link" is a next or prev reference that is the same node:
105 * p.prev == p or p.next == p
112 * (p.prev == null && p.next != p) ||
113 * (p.next == null && p.prev != p)
136 * any time, the set of live nodes maintained by prev and next
137 * links are identical, that is, the live nodes found via next
268 volatile Node<E> next; field in class:ConcurrentLinkedDeque.Node
388 final Node<E> next = x.next; local
651 Node<E> next = x.next; local
1321 public E next() { method in class:ConcurrentLinkedDeque.AbstractItr
[all...] |
| /libcore/luni/src/test/java/tests/api/java/util/ |
| AbstractListTest.java | 69 Object obj = i.next();
84 it.next();
86 it.next();
102 assertTrue("Should have next", lit.hasNext());
103 tempValue = (Integer) lit.next();
104 assertTrue("next returned wrong value. Wanted 3, got: " + tempValue,
112 lit2.next();
143 lit.next();
145 lit.next();
225 .next());
[all...] |
| LinkedHashMapTest.java | 225 Map.Entry m = (Map.Entry) i.next();
242 s1.remove(m2.entrySet().iterator().next());
243 assertEquals("jumbo", s1.iterator().next().getKey());
260 assertNull("Failed with null key", m.keySet().iterator().next());
267 Integer remove1 = (Integer) it.next();
270 Integer remove2 = (Integer) it.next();
276 assertTrue("Wrong result", it.next().equals(list.get(0)));
278 assertTrue("Wrong contents", map.keySet().iterator().next().equals(
285 Integer remove3 = (Integer) it2.next();
286 Integer next; local
[all...] |
| /dalvik/dx/src/com/android/dx/cf/code/ |
| BasicBlocker.java | 228 * target and next instruction begin new blocks.)
231 // Fall through to next case...
234 int next = offset + length; local
236 addWorkIfNecessary(next, true);
237 targetLists[offset] = IntList.makeImmutable(next, target);
276 for (int at = 0, next; /*at*/; at = next) {
277 next = Bits.findFirst(blockSet, at + 1);
278 if (next < 0) {
286 * there isn't any, then "next" is the sole target
428 int next = offset + length; local
[all...] |
| /external/elfutils/libebl/ |
| eblgstrtab.c | 39 struct Ebl_GStrent *next; member in struct:Ebl_GStrent
50 struct memoryblock *next; member in struct:memoryblock
113 newmem->next = st->memory;
128 mb = mb->next;
165 newstr->next = NULL;
248 for (subs = (*sep)->next; subs != NULL; subs = subs->next)
264 newstr->next = (*sep)->next;
265 (*sep)->next = newstr
[all...] |
| eblwstrtab.c | 41 struct Ebl_WStrent *next; member in struct:Ebl_WStrent
51 struct memoryblock *next; member in struct:memoryblock
110 newmem->next = st->memory;
127 mb = mb->next;
162 newstr->next = NULL;
237 for (subs = (*sep)->next; subs != NULL; subs = subs->next)
253 newstr->next = (*sep)->next;
254 (*sep)->next = newstr
[all...] |
| /external/openssl/crypto/lhash/ |
| lhash.c | 170 nn=n->next;
199 nn->next=NULL;
234 *rn=nn->next;
290 n=a->next;
334 *n1= (*n1)->next;
335 np->next= *n2;
339 n1= &((*n1)->next);
399 while (n1->next != NULL)
400 n1=n1->next;
401 n1->next=np
[all...] |
| /external/oprofile/module/x86/ |
| op_nmi.c | 310 static int pmc_add_sysctls(ctl_table * next)
312 ctl_table * start = next;
318 next->ctl_name = 1;
319 next->procname = names[i];
320 next->mode = 0755;
325 next->child = tab;
334 next++;
340 next = start;
342 kfree(next->child);
343 next++
[all...] |
| /external/wpa_supplicant_6/wpa_supplicant/src/radius/ |
| radius_client.c | 62 struct radius_msg_list *next; member in struct:radius_msg_list
235 prev->next = entry->next;
237 radius->msgs = entry->next;
240 entry = entry->next;
258 entry = entry->next;
267 HOSTAPD_LEVEL_DEBUG, "Next RADIUS client "
273 struct hostapd_radius_server *next, *old; local
282 for (entry = radius->msgs; entry; entry = entry->next) {
287 next = old + 1
297 struct hostapd_radius_server *next, *old; local
[all...] |
| /frameworks/base/core/java/com/android/internal/widget/ |
| PasswordEntryKeyboardHelper.java | 223 Keyboard next = null; local
225 next = mSymbolsKeyboard;
227 next = mQwertyKeyboard;
229 if (next != null) {
230 mKeyboardView.setKeyboard(next);
245 PasswordEntryKeyboard next = null; local
250 next = isAlphaMode ? mQwertyKeyboardShifted : mSymbolsKeyboardShifted;
253 next = isAlphaMode ? mQwertyKeyboardShifted : mSymbolsKeyboardShifted;
256 next = isAlphaMode ? mQwertyKeyboard : mSymbolsKeyboard;
258 if (next != null)
[all...] |
| /system/core/adb/ |
| usb_windows.c | 37 /// Next entry in the list of opened usb handles
38 usb_handle *next; member in struct:usb_handle
62 .next = &handle_list,
121 for(usb = handle_list.next; usb != &handle_list; usb = usb->next) {
158 handle->next = &handle_list;
160 handle->prev->next = handle;
161 handle->next->prev = handle;
197 ret->next = ret;
381 if ((handle->next != handle) && (handle->prev != handle))
[all...] |
| usb_libusb.c | 46 usb_handle *next; member in struct:usb_handle
64 .next = &handle_list,
213 h->next->prev = h->prev;
214 h->prev->next = h->next;
216 h->next = NULL;
237 h->next->prev = h->prev;
238 h->prev->next = h->next;
240 h->next = NULL
[all...] |
| /external/qemu/distrib/zlib-1.2.3/ |
| infback.c | 84 static code *next; local
92 next = fixed;
93 lenfix = next;
95 inflate_table(LENS, state->lens, 288, &(next), &(bits), state->work);
100 distfix = next;
102 inflate_table(DISTS, state->lens, 32, &(next), &(bits), state->work);
123 next = strm->next_in; \
134 strm->next_in = next; \
152 have = in(in_desc, &next); \
154 next = Z_NULL;
249 unsigned char FAR *next; \/* next input *\/ local
[all...] |
| /external/zlib/ |
| infback.c | 84 static code *next; local
92 next = fixed;
93 lenfix = next;
95 inflate_table(LENS, state->lens, 288, &(next), &(bits), state->work);
100 distfix = next;
102 inflate_table(DISTS, state->lens, 32, &(next), &(bits), state->work);
123 next = strm->next_in; \
134 strm->next_in = next; \
152 have = in(in_desc, &next); \
154 next = Z_NULL;
249 unsigned char FAR *next; \/* next input *\/ local
[all...] |
| /external/mksh/src/ |
| jobs.c | 42 Proc *next; /* next process in pipeline (if any) */ member in struct:proc
76 Job *next; /* next job in list */ member in struct:job
211 for (j = job_list; j != NULL; j = j->next) {
362 pi.p->next = NULL;
376 last_proc->next = pi.p;
418 * ensure next child gets a (slightly) different $RANDOM sequence
520 pi.p = pi.p->next)
597 for (j = job_list; j; j = j->next)
[all...] |
| /external/wpa_supplicant/ |
| eloop.c | 33 struct eloop_timeout *next; member in struct:eloop_timeout
248 timeout->next = NULL;
261 tmp = tmp->next;
265 timeout->next = eloop.timeout;
268 timeout->next = prev->next;
269 prev->next = timeout;
279 struct eloop_timeout *timeout, *prev, *next; local
285 next = timeout->next;
[all...] |
| /external/wpa_supplicant_6/wpa_supplicant/src/utils/ |
| eloop.c | 33 struct eloop_timeout *next; member in struct:eloop_timeout
258 timeout->next = NULL;
271 tmp = tmp->next;
275 timeout->next = eloop.timeout;
278 timeout->next = prev->next;
279 prev->next = timeout;
289 struct eloop_timeout *timeout, *prev, *next; local
295 next = timeout->next;
[all...] |
| /external/expat/lib/ |
| xmlparse.c | 216 struct block *next; member in struct:block
292 struct open_internal_entity *next; member in struct:open_internal_entity
326 const char *s, const char *next);
331 const char *end, int tok, const char *next, const char **nextPtr,
904 openEntityList = openEntity->next;
905 openEntity->next = freeInternalEntities;
2050 const char *next = start; \/* XmlContentTok doesn't always set the last arg *\/ local
2091 const char *next = start; \/* XmlContentTok doesn't always set the last arg *\/ local
2172 const char *next = s; \/* XmlContentTok doesn't always set the last arg *\/ local
3112 const char *next; local
3232 const char *next; local
3489 const char *next = start; local
3554 const char *next = s; local
3596 const char *next = s; local
3633 const char *next = s; local
4624 const char *next = NULL; local
4687 const char *next; local
4747 const char *next; local
4832 const char *next; local
4997 const char *next; local
6162 int next; local
[all...] |
| /external/ipsec-tools/src/racoon/ |
| proposal.c | 116 for (p = *head; p->next; p = p->next)
118 p->next = new;
131 for (p = pp->head; p && p->next; p = p->next)
136 p->next = new;
147 new->next = pp->head;
173 for (tr = pr->head; tr && tr->next; tr = tr->next)
178 tr->next = new
[all...] |
| /bionic/libc/netbsd/isc/ |
| eventlib_p.h | 91 struct evConn * next; member in struct:evConn
124 struct evFile * next; member in struct:evFile
145 struct evStream *prev, *next; member in struct:evStream
161 struct evWait * next; member in struct:evWait
168 struct evWaitList * next; member in struct:evWaitList
179 struct { struct evEvent_p *next; } free; member in struct:evEvent_p::__anon551::__anon557
|
| /bionic/libc/stdio/ |
| findfp.c | 86 g->next = NULL;
112 for (g = &__sglue; g != NULL; g = g->next) {
123 lastglue->next = g;
157 for (g = &__sglue; (n -= g->niobs) > 0 && g->next; g = g->next)
161 lastglue->next = g;
|
