/bionic/libc/stdio/ |
H A D | glue.h | 40 struct glue *next; member in struct:glue
|
H A D | fwalk.c | 47 for (g = &__sglue; g != NULL; g = g->next)
|
H A D | findfp.c | 91 g->next = NULL; 117 for (g = &__sglue; g != NULL; g = g->next) { 128 lastglue->next = g; 162 for (g = &__sglue; (n -= g->niobs) > 0 && g->next; g = g->next) 166 lastglue->next = g;
|
/bionic/libc/private/isc/ |
H A D | list.h | 28 #define LINK(type) struct { type *prev, *next; } 32 (elt)->link.next = (type *)(-1); \ 50 (elt)->link.next = (list).head; \ 58 (list).tail->link.next = (elt); \ 62 (elt)->link.next = NULL; \ 69 if ((elt)->link.next != NULL) \ 70 (elt)->link.next->link.prev = (elt)->link.prev; \ 74 (elt)->link.prev->link.next = (elt)->link.next; \ 76 (list).head = (elt)->link.next; \ [all...] |
/bionic/libc/kernel/common/linux/raid/ |
H A D | xor.h | 14 *** Any manual change here will be lost the next time this script will 25 struct xor_block_template *next; member in struct:xor_block_template
|
/bionic/libc/stdlib/ |
H A D | atexit.h | 34 struct atexit *next; /* next in list */ member in struct:atexit 35 int ind; /* next index in this table */
|
H A D | atexit.c | 90 p->next = __atexit; 126 for (p = __atexit; p != NULL; p = p->next) { 168 p = p->next; 189 while (p != NULL && p->next != NULL) 190 p = p->next; 199 p->next = NULL;
|
/bionic/libc/kernel/arch-mips/asm/ |
H A D | system.h | 14 *** Any manual change here will be lost the next time this script will 34 #define switch_to(prev, next, last) do { __mips_mt_fpaff_switch_to(prev); if (cpu_has_dsp) __save_dsp(prev); (last) = resume(prev, next, task_thread_info(next)); } while (0)
|
/bionic/libc/bionic/ |
H A D | malloc_debug_check_mapinfo.h | 35 struct mapinfo* next; member in struct:mapinfo
|
H A D | malloc_debug_check_mapinfo.cpp | 57 mi->next = 0; 73 mi->next = milist; 88 mi = mi->next; 100 mi = mi->next; 117 mi = mi->next;
|
H A D | pthread_debug.c | 128 struct mapinfo *next; member in struct:mapinfo 155 mi->next = 0; 171 mi->next = milist; 186 mi = mi->next; 203 mi = mi->next; 384 struct MutexInfo* next; member in struct:MutexInfo 422 object->next = 0; 689 HashEntry* next; member in struct:HashEntry 735 HashEntry* next = entry->next; local [all...] |
H A D | malloc_debug_leak.cpp | 119 entry = entry->next; 151 entry->next = gHashTable.slots[slot]; 159 if (entry->next != NULL) { 160 entry->next->prev = entry; 181 e1 = e1->next; 191 HashEntry* next = entry->next; local 193 if (prev != NULL) entry->prev->next = next; 194 if (next ! [all...] |
/bionic/libc/kernel/common/linux/ |
H A D | vmalloc.h | 14 *** Any manual change here will be lost the next time this script will 44 struct vm_struct *next; member in struct:vm_struct
|
H A D | proc_fs.h | 14 *** Any manual change here will be lost the next time this script will 55 struct proc_dir_entry *next, *parent, *subdir; member in struct:proc_dir_entry 66 struct kcore_list *next; member in struct:kcore_list
|
H A D | dm-ioctl.h | 14 *** Any manual change here will be lost the next time this script will 50 uint32_t next; member in struct:dm_target_spec 62 uint32_t next; member in struct:dm_name_list 67 uint32_t next; member in struct:dm_target_versions
|
H A D | file.h | 14 *** Any manual change here will be lost the next time this script will 45 struct fdtable *next; member in struct:fdtable
|
H A D | futex.h | 14 *** Any manual change here will be lost the next time this script will 35 struct robust_list __user *next; member in struct:robust_list
|
H A D | interrupt.h | 14 *** Any manual change here will be lost the next time this script will 72 struct irqaction *next; member in struct:irqaction 111 struct tasklet_struct *next; member in struct:tasklet_struct
|
H A D | skbuff.h | 14 *** Any manual change here will be lost the next time this script will 52 struct sk_buff *next; member in struct:sk_buff_head 105 struct sk_buff *next; member in struct:sk_buff
|
/bionic/libc/unistd/ |
H A D | popen.c | 46 struct pid *next; member in struct:pid 89 for (pcur = pidlist; pcur; pcur = pcur->next) 124 cur->next = pidlist; 143 for (last = NULL, cur = pidlist; cur; last = cur, cur = cur->next) 158 pidlist = cur->next; 160 last->next = cur->next;
|
H A D | abort.c | 65 while (p != NULL && p->next != NULL) 66 p = p->next;
|
/bionic/libc/netbsd/isc/ |
H A D | 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::__anon638::__anon644
|
H A D | ev_streams.c | 82 new->next = ctx->streams; 116 new->next = ctx->streams; 164 old->prev->next = old->next; 166 ctx->streams = old->next; 167 if (old->next != NULL) 168 old->next->prev = old->prev;
|
/bionic/libc/upstream-dlmalloc/ |
H A D | malloc.c | 1108 struct Node { int item; struct Node* next; }; 1119 pool[i]->next = pool[i+1]; 1426 on the next line, as well as in programs that use this malloc. 2088 | Size of next chunk (may or may not be in use) | +-+ 2110 | Size of next chunk (must be in use, or we would have merged)| +-+ 2169 doesn't update its trailing size field since there is no next 2179 chunk is trailed by the first two fields of a fake next-chunk 2210 /* ... and additional padding for fake next-chunk at foot */ 2272 /* Ptr to next or previous physical malloc_chunk. */ 2276 /* extract next chun 2472 struct malloc_segment* next; /* ptr to next segment */ member in struct:malloc_segment 3280 mchunkptr next = chunk_plus_offset(p, sz); local 4278 msegmentptr next = sp->next; local 4386 mchunkptr next = chunk_plus_offset(p, psize); local 4726 mchunkptr next = chunk_plus_offset(p, psize); local 4837 mchunkptr next = chunk_plus_offset(p, oldsize); local 5139 mchunkptr next = next_chunk(p); local 5175 mchunkptr next = next_chunk(q); local 5655 mchunkptr next = chunk_plus_offset(p, psize); local [all...] |
/bionic/libc/netbsd/resolv/ |
H A D | res_cache.c | 1010 struct Entry* hlink; /* next in collision chain */ 1179 struct pending_req_info* next; member in struct:pending_req_info 1197 struct resolv_cache_info* next; member in struct:resolv_cache_info 1209 ri = cache->pending_requests.next; 1213 ri = ri->next; 1220 cache->pending_requests.next = NULL; 1234 ri = cache->pending_requests.next; 1242 ri = ri->next; 1250 prev->next = ri; 1270 ri = cache->pending_requests.next; [all...] |