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

123

/bionic/libc/stdio/
H A Dglue.h44 struct glue *next; member in struct:glue
/bionic/libc/upstream-netbsd/lib/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/tests/
H A Dsearch_test.cpp141 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/bionic/
H A Dpthread_internal.cpp67 thread->next = g_thread_list;
69 if (thread->next != nullptr) {
70 thread->next->prev = thread;
79 if (thread->next != nullptr) {
80 thread->next->prev = thread->prev;
83 thread->prev->next = thread->next;
85 g_thread_list = thread->next;
111 for (pthread_internal_t* t = g_thread_list; t != nullptr; t = t->next) {
H A D__cxa_thread_atexit_impl.cpp25 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 Dpthread_atfork.cpp36 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 Ddirent.cpp133 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 Dnet_if.cpp77 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) {
/bionic/libc/upstream-freebsd/lib/libc/stdlib/
H A Dquick_exit.c38 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 Dlinked_list.h36 LinkedListEntry<T>* next; member in struct:LinkedListEntry
54 entry_ = entry_->next;
96 new_entry->next = head_;
106 new_entry->next = nullptr;
111 tail_->next = new_entry;
123 head_ = entry->next;
144 head_ = head_->next;
165 for (LinkedListEntry<T>* e = head_; e != nullptr; e = e->next) {
177 LinkedListEntry<T>* next = e->next; local
[all...]
H A Dlinker_allocator.cpp101 next_free->next = block_record->next;
105 free_blocks_list_ = block_record->next;
130 free_blocks_list_ = free_blocks_list_->next;
136 while (current->next > page_start && current->next < page_end) {
137 current->next = current->next->next;
140 current = current->next;
[all...]
H A Dlinker_block_allocator.cpp43 LinkerBlockAllocatorPage* next; member in struct:LinkerBlockAllocatorPage
108 for (LinkerBlockAllocatorPage* page = page_list_; page != nullptr; page = page->next) {
134 page->next = page_list_;
146 if (block >= (page_ptr + sizeof(page->next)) && block < (page_ptr + PAGE_SIZE)) {
150 page = page->next;
H A Dlinker_reloc_iterators.h55 rel_t* next() { function in class:plain_reloc_iterator
89 rel_t* next() { function in class:packed_reloc_iterator
/bionic/libc/upstream-openbsd/lib/libc/stdio/
H A Dfwalk.c47 for (g = &__sglue; g != NULL; g = g->next)
/bionic/libc/upstream-netbsd/lib/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/stdlib/
H A Datexit.c45 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 Ddm-ioctl.h14 *** Any manual change here will be lost the next time this script will
45 __u32 next; member in struct:dm_target_spec
55 __u32 next; member in struct:dm_name_list
59 __u32 next; member in struct:dm_target_versions
H A Dvirtio_ring.h14 *** Any manual change here will be lost the next time this script will
35 __virtio16 next; member in struct:vring_desc
/bionic/libc/versioner-dependencies/common/kernel_uapi/linux/
H A Ddm-ioctl.h14 *** Any manual change here will be lost the next time this script will
45 __u32 next; member in struct:dm_target_spec
55 __u32 next; member in struct:dm_name_list
59 __u32 next; member in struct:dm_target_versions
H A Dvirtio_ring.h14 *** Any manual change here will be lost the next time this script will
35 __virtio16 next; member in struct:vring_desc
/bionic/tools/versioner/dependencies/common/kernel_uapi/linux/
H A Ddm-ioctl.h14 *** Any manual change here will be lost the next time this script will
45 __u32 next; member in struct:dm_target_spec
55 __u32 next; member in struct:dm_name_list
59 __u32 next; member in struct:dm_target_versions
H A Dvirtio_ring.h14 *** Any manual change here will be lost the next time this script will
35 __virtio16 next; member in struct:vring_desc
/bionic/libc/upstream-netbsd/lib/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::__anon1144::__anon1150
H A Dev_streams.c88 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/tools/versioner/src/
H A DPreprocessor.cpp280 auto next = current; local
281 ++next;
283 while (next != guard_map.end()) {
284 if (current->second != next->second) {
286 ++next;
290 // Scan from the end of current to the beginning of next.
295 FileLocation end_location = next->first.start;
370 to_string(next->first).c_str());
372 ++next;
377 to_string(next
[all...]

Completed in 367 milliseconds

123