/system/core/libcutils/ |
H A D | list.c | 21 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 D | dir_hash.c | 119 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 D | hashmap.c | 31 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 D | fdpool.c | 31 .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 D | fdpool.h | 22 struct pooled_fd *next; member in struct:pooled_fd
|
/system/core/include/cutils/ |
H A D | list.h | 24 struct listnode *next; member in struct:listnode 33 .next = &name, \ 38 for (node = (list)->next; node != (list); node = node->next) 47 #define list_empty(list) ((list) == (list)->next) 48 #define list_head(list) ((list)->next)
|
H A D | config_utils.h | 29 cnode *next; member in struct:cnode
|
/system/core/sh/ |
H A D | alias.h | 40 struct alias *next; member in struct:alias
|
H A D | nodes.h | 88 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 D | nodes.c | 162 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 D | alias.c | 70 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 D | expand.h | 38 struct strlist *next; member in struct:strlist
|
H A D | expand.c | 81 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 D | nodes.c.pat | 101 lp = lp->next; 131 lp = lp->next; 132 lpp = &(*lpp)->next;
|
/system/core/nexus/ |
H A D | DhcpListener.cpp | 50 char *next = buffer; local 55 if (!(tmp = strsep(&next, ":"))) { 64 char *next = buffer + 9; local 67 if (!inet_aton(strsep(&next, ":"), &ipaddr)) { 70 if (!inet_aton(strsep(&next, ":"), &netmask)) { 73 if (!inet_aton(strsep(&next, ":"), &broadcast)) { 76 if (!inet_aton(strsep(&next, ":"), &gateway)) { 79 if (!inet_aton(strsep(&next, ":"), &dns1)) { 82 if (!inet_aton(strsep(&next, ":"), &dns2)) { 89 char *next local [all...] |
/system/extras/ext4_utils/ |
H A D | backed_block.c | 28 struct data_block *next; member in struct:data_block 48 new_db->next = data_blocks; 55 there if the next block number is higher */ 62 for (; db->next && db->next->block < new_db->block; db = db->next) 65 if (db->next == NULL) { 66 db->next = new_db; 68 new_db->next = db->next; 156 struct data_block *next = db->next; local [all...] |
/system/extras/showslab/ |
H A D | showslab.c | 21 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 D | readtty.c | 29 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 D | jdwp_service.c | 106 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 D | transport.c | 31 .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 936 atransport *t, *next; local [all...] |
H A D | usb_windows.c | 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)) { 382 handle->next [all...] |
H A D | 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 [all...] |
/system/core/libdiskconfig/ |
H A D | write_lst.c | 53 item->next = (*lst); 63 temp_wr = lst->next; 72 for(; lst; lst = lst->next) {
|
/system/core/libzipfile/ |
H A D | zipfile.c | 35 Zipentry* next = entry->next; local 37 entry = next; 51 entry = entry->next; 143 entry = entry->next; 156 entry = entry->next;
|
/system/core/debuggerd/arm/ |
H A D | machine.c | 87 mapinfo *next = NULL; local 92 next = map->next; 96 next = map; 102 map = map->next; 106 * Show "next" then "match" then "prev" so that the addresses appear in 109 if (next != NULL) { 110 _LOG(tfd, false, "%08x-%08x %s\n", next->start, next->end, next [all...] |