Searched defs:next (Results 1 - 25 of 31) sorted by relevance

12

/bionic/libc/stdio/
H A Dglue.h44 struct glue *next; member in struct:glue
/bionic/libc/bionic/
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) {
H A Dpthread_internal.h60 class pthread_internal_t* next; member in class:pthread_internal_t
H A Dsystem_properties.cpp648 context_node(context_node* next, const char* context, prop_area* pa) argument
649 : next(next), context_(strdup(context)), pa_(pa), no_access_(false) {
663 context_node* next; member in class:context_node
676 prefix_node(struct prefix_node* next, const char* prefix, context_node* context) argument
677 : prefix(strdup(prefix)), prefix_len(strlen(prefix)), context(context), next(next) {
685 struct prefix_node* next; member in struct:prefix_node
703 next_list = &(*next_list)->next;
712 list = list->next;
[all...]
/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/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/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/linker/
H A Dlinker_block_allocator.cpp31 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 Dlinker_allocator.h60 small_object_block_record* next; member in struct:small_object_block_record
H A Dlinker_reloc_iterators.h43 rel_t* next() { function in class:plain_reloc_iterator
77 rel_t* next() { function in class:packed_reloc_iterator
H A Dlinked_list.h24 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 Dlinker.h202 soinfo* next; member in struct:soinfo
/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/kernel/uapi/linux/
H A Dromfs_fs.h14 *** Any manual change here will be lost the next time this script will
46 __be32 next; member in struct:romfs_inode
H A Dvirtio_ring.h14 *** Any manual change here will be lost the next time this script will
39 __virtio16 next; member in struct:vring_desc
H A Dfutex.h14 *** 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 Ddm-ioctl.h14 *** 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
/bionic/libc/kernel/uapi/asm-x86/asm/
H A Dbootparam.h14 *** Any manual change here will be lost the next time this script will
55 __u64 next; member in struct:setup_data
/bionic/libc/kernel/uapi/drm/
H A Dvia_drm.h14 *** Any manual change here will be lost the next time this script will
157 unsigned char next, prev; member in struct:_drm_via_tex_region
/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::__anon1030::__anon1036
/bionic/libc/upstream-netbsd/lib/libc/regex/
H A Dregcomp.c109 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/upstream-openbsd/lib/libc/gdtoa/
H A Dgdtoaimp.h150 * digits, each string is assigned to the next available sequence
475 struct Bigint *next; member in struct:Bigint

Completed in 580 milliseconds

12