/bionic/libc/bionic/ |
H A D | pthread_internal.cpp | 48 thread->next = g_thread_list; 50 if (thread->next != NULL) { 51 thread->next->prev = thread; 60 if (thread->next != NULL) { 61 thread->next->prev = thread->prev; 64 thread->prev->next = thread->next; 66 g_thread_list = thread->next; 92 for (pthread_internal_t* t = g_thread_list; t != NULL; t = t->next) {
|
H A D | __cxa_thread_atexit_impl.cpp | 25 thread_local_dtor* next; member in class:thread_local_dtor 36 dtor->next = thread->thread_local_dtors; 45 thread->thread_local_dtors = current->next;
|
H A D | pthread_atfork.cpp | 36 atfork_t* next; member in struct:atfork_t 52 for (atfork_t* it = first_; it != nullptr; it = it->next) { 65 entry->next = nullptr; 68 entry->prev->next = entry; 82 it = it->next; 85 it = it->next; 93 entry->prev->next = entry->next; 95 first_ = entry->next; 98 if (entry->next ! [all...] |
H A D | dirent.cpp | 133 dirent* next = __readdir_locked(d); local 134 if (errno != 0 && next == NULL) { 138 if (next != NULL) { 139 memcpy(entry, next, next->d_reclen);
|
H A D | net_if.cpp | 77 if_list* next; member in struct:if_list 82 next = *list; 89 list = it->next; 130 for (if_list* it = list; it != nullptr; it = it->next) { 138 for (if_list* it = list; it != nullptr; it = it->next) {
|
H A D | pthread_internal.h | 60 class pthread_internal_t* next; member in class:pthread_internal_t
|
/bionic/libc/stdio/ |
H A D | glue.h | 44 struct glue *next; member in struct:glue
|
/bionic/libc/upstream-netbsd/lib/libc/include/isc/ |
H A D | list.h | 28 #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/tests/ |
H A D | search_test.cpp | 141 q_node* next; member in struct:q_node 159 for (q_node* q = &zero; q != NULL; q = q->next) { 175 ASSERT_EQ(2, head->next->i); 176 ASSERT_EQ(nullptr, head->next->next); 180 ASSERT_EQ(nullptr, head->next); 186 zero.next = &zero; 193 ASSERT_EQ(1, head->next->i); 194 ASSERT_EQ(2, head->next->next [all...] |
/bionic/libc/upstream-freebsd/lib/libc/stdlib/ |
H A D | quick_exit.c | 38 struct quick_exit_handler *next; member in struct:quick_exit_handler 62 h->next = handlers; 77 for (h = handlers; NULL != h; h = h->next)
|
/bionic/linker/ |
H A D | linked_list.h | 24 LinkedListEntry<T>* next; member in struct:LinkedListEntry 42 entry_ = entry_->next; 84 new_entry->next = head_; 94 new_entry->next = nullptr; 99 tail_->next = new_entry; 111 head_ = entry->next; 132 head_ = head_->next; 149 for (LinkedListEntry<T>* e = head_; e != nullptr; e = e->next) { 161 LinkedListEntry<T>* next = e->next; local [all...] |
H A D | linker_allocator.cpp | 84 next_free->next = block_record->next; 88 free_blocks_list_ = block_record->next; 113 free_blocks_list_ = free_blocks_list_->next; 119 while (current->next > page_start && current->next < page_end) { 120 current->next = current->next->next; 123 current = current->next; [all...] |
H A D | linker_block_allocator.cpp | 31 LinkerBlockAllocatorPage* next; member in struct:LinkerBlockAllocatorPage 96 for (LinkerBlockAllocatorPage* page = page_list_; page != nullptr; page = page->next) { 124 page->next = page_list_; 136 if (block >= (page_ptr + sizeof(page->next)) && block < (page_ptr + PAGE_SIZE)) { 140 page = page->next;
|
H A D | linker_reloc_iterators.h | 43 rel_t* next() { function in class:plain_reloc_iterator 77 rel_t* next() { function in class:packed_reloc_iterator
|
/bionic/libc/upstream-openbsd/lib/libc/stdio/ |
H A D | fwalk.c | 47 for (g = &__sglue; g != NULL; g = g->next)
|
/bionic/libc/upstream-netbsd/lib/libc/gen/ |
H A D | popen.c | 68 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/stdlib/ |
H A D | atexit.c | 45 struct atexit *next; /* next in list */ member in struct:atexit 46 int ind; /* next index in this table */ 113 p->next = __atexit; 147 for (p = __atexit; p != NULL; p = p->next) { 181 p = p->next;
|
/bionic/libc/kernel/uapi/linux/ |
H A D | dm-ioctl.h | 14 *** Any manual change here will be lost the next time this script will 51 __u32 next; member in struct:dm_target_spec 64 __u32 next; member in struct:dm_name_list 69 __u32 next; member in struct:dm_target_versions
|
H A D | virtio_ring.h | 14 *** Any manual change here will be lost the next time this script will 39 __virtio16 next; member in struct:vring_desc
|
H A D | futex.h | 14 *** Any manual change here will be lost the next time this script will 60 struct robust_list __user * next; member in struct:robust_list
|
H A D | romfs_fs.h | 14 *** Any manual change here will be lost the next time this script will 46 __be32 next; member in struct:romfs_inode
|
/bionic/libc/upstream-netbsd/lib/libc/isc/ |
H A D | eventlib_p.h | 88 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::__anon1030::__anon1036
|
H A D | ev_streams.c | 88 new->next = ctx->streams; 122 new->next = ctx->streams; 170 old->prev->next = old->next; 172 ctx->streams = old->next; 173 if (old->next != NULL) 174 old->next->prev = old->prev;
|
/bionic/libc/upstream-netbsd/lib/libc/regex/ |
H A D | regcomp.c | 109 const char *next; /* next character in RE */ local 182 #define PEEK() (*p->next) 183 #define PEEK2() (*(p->next+1)) 184 #define MORE() (p->next < p->end) 185 #define MORE2() (p->next+1 < p->end) 190 #define NEXT() (p->next++) 191 #define NEXT2() (p->next += 2) 192 #define NEXTn(n) (p->next += (n)) 193 #define GETNEXT() (*p->next [all...] |
/bionic/libc/dns/resolv/ |
H A D | res_cache.c | 995 struct Entry* hlink; /* next in collision chain */ 1220 struct pending_req_info* next; member in struct:pending_req_info 1235 struct resolv_cache_info* next; member in struct:resolv_cache_info 1251 // lock protecting everything in the _resolve_cache_info structs (next ptr, etc) 1262 ri = cache->pending_requests.next; 1266 ri = ri->next; 1273 cache->pending_requests.next = NULL; 1287 ri = (*cache)->pending_requests.next; 1295 ri = ri->next; 1303 prev->next [all...] |