Searched refs:next (Results 1 - 25 of 77) sorted by relevance

1234

/system/core/libcutils/
H A Dlist.c21 node->next = node;
27 item->next = head;
29 head->prev->next = item;
35 item->next->prev = item->prev;
36 item->prev->next = item->next;
H A Ddir_hash.c119 struct list *next; member in struct:list
153 struct list *next; local
154 for (f = list; f != NULL; f = next) {
155 next = f->next;
168 node->next = list;
174 for (f = list; f != NULL; f = f->next) {
183 struct list *next; local
184 for (f = list; f != NULL; f = f->next) {
185 next
211 struct list *next; local
237 struct list *next; local
249 struct list *next; local
287 struct list *next; local
305 struct list *next; local
324 struct list *next; local
[all...]
H A Dhashmap.c31 Entry* next; member in struct:Entry
117 Entry* next = entry->next; local
119 entry->next = newBuckets[index];
121 entry = next;
145 Entry* next = entry->next; local
147 entry = next;
174 entry->next = NULL;
216 // Move to next entr
313 Entry *next = entry->next; local
[all...]
/system/extras/fatblock/
H A Dfdpool.c31 .next = &fdpool_head
38 struct pooled_fd *next = prev->next; local
42 prev->next = node;
44 node->next = next;
45 next->prev = node;
53 struct pooled_fd *next = node->next; local
56 assert(next);
[all...]
H A Dfdpool.h22 struct pooled_fd *next; member in struct:pooled_fd
/system/core/include/cutils/
H A Dlist.h28 struct listnode *next; member in struct:listnode
37 .next = &name, \
42 for (node = (list)->next; node != (list); node = node->next)
51 #define list_empty(list) ((list) == (list)->next)
52 #define list_head(list) ((list)->next)
H A Dconfig_utils.h29 cnode *next; member in struct:cnode
/system/core/sh/
H A Dalias.h40 struct alias *next; member in struct:alias
H A Dnodes.h88 union node *next; member in struct:nclist
96 union node *next; member in struct:narg
104 union node *next; member in struct:nfile
113 union node *next; member in struct:ndup
122 union node *next; member in struct:nhere
153 struct nodelist *next; member in struct:nodelist
H A Dnodes.c162 calcsize(n->nclist.next);
168 calcsize(n->narg.next);
176 calcsize(n->nfile.next);
181 calcsize(n->ndup.next);
186 calcsize(n->nhere.next);
203 lp = lp->next;
260 new->nclist.next = copynode(n->nclist.next);
266 new->narg.next = copynode(n->narg.next);
[all...]
H A Dalias.c70 for (ap = *app; ap; ap = ap->next) {
85 * alias value off the input before processing the next alias, we
95 * resulting token(s) is next checked for further alias sub. The
111 ap->next = *app;
123 for (ap = *app; ap; app = &(ap->next), ap = ap->next) {
136 *app = ap->next;
171 ap = ap->next;
183 for (; ap; ap = ap->next) {
219 for (ap = atab[i]; ap; ap = ap->next) {
[all...]
H A Dexpand.h38 struct strlist *next; member in struct:strlist
H A Dexpand.c81 struct ifsregion *next; /* next region in list */ member in struct:ifsregion
141 ifsfirst.next = NULL;
164 exparg.lastp = &sp->next;
224 argbackq = argbackq->next;
309 while (ifsfirst.next != NULL) {
312 ifsp = ifsfirst.next->next;
313 ckfree(ifsfirst.next);
314 ifsfirst.next
[all...]
H A Dnodes.c.pat101 lp = lp->next;
131 lp = lp->next;
132 lpp = &(*lpp)->next;
/system/core/libsparse/
H A Dbacked_block.c46 struct backed_block *next; member in struct:backed_block
62 return bb->next;
135 struct backed_block *next = bb->next; local
137 bb = next;
155 for (end = start; end && end->next; end = end->next)
166 from->data_blocks = end->next;
168 for (bb = from->data_blocks; bb; bb = bb->next) {
169 if (bb->next
[all...]
/system/extras/showslab/
H A Dshowslab.c21 struct slab_info *next; member in struct:slab_info
141 prev->next = p;
149 p->next = NULL;
163 struct slab_info *temp = list->next;
176 p->next = a;
178 a = a->next;
180 p->next = b;
182 b = b->next;
186 p->next = (a == NULL) ? b : a;
187 return list.next;
[all...]
/system/core/toolbox/
H A Dreadtty.c29 char *next; local
32 next = strchr(map[i].chars, current);
33 if(next && next[1])
34 return next[1];
44 char *next; local
47 next = strchr(map[i].chars+1, current);
48 if(next && next[-1])
49 return next[
[all...]
/system/core/adb/
H A Djdwp_service.c106 JdwpProcess* next; member in struct:JdwpProcess
126 JdwpProcess* proc = _jdwp_list.next;
128 for ( ; proc != &_jdwp_list; proc = proc->next ) {
164 proc->prev->next = proc->next;
165 proc->next->prev = proc->prev;
206 proc->next = proc;
221 proc->next = &_jdwp_list;
222 proc->prev = proc->next->prev;
224 proc->prev->next
627 JdwpTracker* next; member in struct:JdwpTracker
[all...]
H A Dtransport.c31 .next = &transport_list,
86 adisconnect* dis = t->disconnects.next;
90 adisconnect* next = dis->next; local
92 dis = next;
389 device_tracker* next; member in struct:device_tracker
404 *pnode = node->next;
407 pnode = &node->next;
484 tracker->next = device_tracker_list;
502 device_tracker* next local
1039 atransport *t, *next; local
[all...]
H A Dusb_windows.c38 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)) {
382 handle->next
[all...]
H A Dusb_libusb.c46 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
[all...]
/system/core/libdiskconfig/
H A Dwrite_lst.c53 item->next = (*lst);
63 temp_wr = lst->next;
72 for(; lst; lst = lst->next) {
/system/core/libzipfile/
H A Dzipfile.c35 Zipentry* next = entry->next; local
37 entry = next;
51 entry = entry->next;
143 entry = entry->next;
156 entry = entry->next;
H A Dprivate.h18 struct Zipentry* next; member in struct:Zipentry
/system/core/include/corkscrew/
H A Dmap_info.h31 struct map_info* next; member in struct:map_info

Completed in 96 milliseconds

1234