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

123

/bionic/libc/stdio/
H A Dglue.h40 struct glue *next; member in struct:glue
H A Dfindfp.c91 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/bionic/
H A Dpthread_internals.cpp38 if (thread->next != NULL) {
39 thread->next->prev = thread->prev;
42 thread->prev->next = thread->next;
44 gThreadList = thread->next;
58 thread->next = gThreadList;
60 if (thread->next != NULL) {
61 thread->next->prev = thread;
H A Ddebug_mapinfo.cpp54 mi->next = 0;
69 mi->next = milist;
81 mi = mi->next;
88 for (; mi != NULL; mi = mi->next) {
H A Ddebug_mapinfo.h35 struct mapinfo_t* next; member in struct:mapinfo_t
H A Ddirent.cpp117 dirent* next = __readdir_locked(d); local
118 if (errno != 0 && next == NULL) {
122 if (next != NULL) {
123 memcpy(entry, next, next->d_reclen);
H A Dmalloc_debug_leak.cpp121 entry = entry->next;
153 entry->next = gHashTable.slots[slot];
161 if (entry->next != NULL) {
162 entry->next->prev = entry;
183 e1 = e1->next;
193 HashEntry* next = entry->next; local
195 if (prev != NULL) entry->prev->next = next;
196 if (next !
[all...]
H A Dpthread_accessor.h28 for (thread_ = gThreadList; thread_ != NULL; thread_ = thread_->next) {
H A Dpthread_debug.cpp205 struct MutexInfo* next; member in struct:MutexInfo
243 object->next = 0;
502 HashEntry* next; member in struct:HashEntry
548 HashEntry* next = entry->next; local
549 if (prev != NULL) entry->prev->next = next;
550 if (next != NULL) entry->next->prev = prev;
552 // we are the head of the list. set the head to be next
[all...]
H A Dmalloc_debug_common.h60 HashEntry* next; member in struct:HashEntry
H A Dpthread_internal.h39 struct pthread_internal_t* next; member in struct:pthread_internal_t
/bionic/libc/upstream-netbsd/libc/include/isc/
H A Dlist.h28 #define LINK(type) struct { type *prev, *next; }
32 (elt)->link.next = (type *)(-1); \
37 (void *)((elt)->link.next) != (void *)(-1))
51 (elt)->link.next = (list).head; \
59 (list).tail->link.next = (elt); \
63 (elt)->link.next = NULL; \
70 if ((elt)->link.next != NULL) \
71 (elt)->link.next->link.prev = (elt)->link.prev; \
77 (elt)->link.prev->link.next = (elt)->link.next; \
[all...]
/bionic/libc/kernel/common/linux/raid/
H A Dxor.h14 *** 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/kernel/arch-mips/asm/
H A Dsystem.h14 *** 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/kernel/common/linux/
H A Dvmalloc.h14 *** 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 Dproc_fs.h14 *** 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 Ddm-ioctl.h14 *** 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 Dfile.h14 *** Any manual change here will be lost the next time this script will
45 struct fdtable *next; member in struct:fdtable
H A Dfutex.h14 *** Any manual change here will be lost the next time this script will
35 struct robust_list __user *next; member in struct:robust_list
/bionic/libc/stdlib/
H A Datexit.h36 struct atexit *next; /* next in list */ member in struct:atexit
37 int ind; /* next index in this table */
H A Datexit.c91 p->next = __atexit;
127 for (p = __atexit; p != NULL; p = p->next) {
169 p = p->next;
/bionic/libc/upstream-netbsd/libc/gen/
H A Dpopen.c68 struct pid *next; member in struct:pid
131 for (old = pidlist; old; old = old->next)
178 cur->next = pidlist;
202 for (last = NULL, cur = pidlist; cur; last = cur, cur = cur->next)
214 pidlist = cur->next;
216 last->next = cur->next;
/bionic/libc/upstream-freebsd/lib/libc/stdio/
H A Dfwalk.c60 for (g = &__sglue; g != NULL; g = g->next)
/bionic/libc/netbsd/resolv/
H A Dres_cache.c1006 struct Entry* hlink; /* next in collision chain */
1231 struct pending_req_info* next; member in struct:pending_req_info
1249 struct resolv_cache_info* next; member in struct:resolv_cache_info
1259 struct resolv_pidiface_info* next; member in struct:resolv_pidiface_info
1265 struct resolv_uidiface_info* next; member in struct:resolv_uidiface_info
1275 ri = cache->pending_requests.next;
1279 ri = ri->next;
1286 cache->pending_requests.next = NULL;
1300 ri = cache->pending_requests.next;
1308 ri = ri->next;
2468 struct resolv_uidiface_info *next; local
2484 struct resolv_pidiface_info *next; local
[all...]
/bionic/libc/upstream-netbsd/libc/isc/
H A Deventlib_p.h88 struct evConn * next; member in struct:evConn
121 struct evFile * next; member in struct:evFile
142 struct evStream *prev, *next; member in struct:evStream
158 struct evWait * next; member in struct:evWait
165 struct evWaitList * next; member in struct:evWaitList
176 struct { struct evEvent_p *next; } free; member in struct:evEvent_p::__anon678::__anon684

Completed in 522 milliseconds

123