| /bionic/libc/upstream-netbsd/lib/libc/include/isc/ |
| 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; \
80 (list).head = (elt)->link.next; \
[all …]
|
| /bionic/tests/ |
| D | search_test.cpp | 148 q_node* next; member
166 for (q_node* q = &zero; q != nullptr; q = q->next) { in TEST()
182 ASSERT_EQ(2, head->next->i); in TEST()
183 ASSERT_EQ(nullptr, head->next->next); in TEST()
187 ASSERT_EQ(nullptr, head->next); in TEST()
193 zero.next = &zero; in TEST()
200 ASSERT_EQ(1, head->next->i); in TEST()
201 ASSERT_EQ(2, head->next->next->i); in TEST()
202 ASSERT_EQ(0, head->next->next->next->i); in TEST()
203 ASSERT_EQ(1, head->next->next->next->next->i); in TEST()
[all …]
|
| /bionic/tests/libs/ |
| D | ld_config_test_helper_lib3.cpp | 9 void (*next)(void) = reinterpret_cast<void (*)()>(dlsym(RTLD_NEXT, "foo")); in foo() local
10 if (next != nullptr) next(); in foo()
15 void (*next)(void) = reinterpret_cast<void (*)()>(dlsym(RTLD_NEXT, "bar")); in bar() local
16 if (next != nullptr) next(); in bar()
|
| D | ld_config_test_helper_lib2.cpp | 9 void (*next)(void) = reinterpret_cast<void (*)()>(dlsym(RTLD_NEXT, "bar")); in bar() local
10 if (next != nullptr) next(); in bar()
|
| D | ld_config_test_helper_lib1.cpp | 9 void (*next)(void) = reinterpret_cast<void (*)()>(dlsym(RTLD_NEXT, "foo")); in foo() local
10 if (next != nullptr) next(); in foo()
|
| D | elftls_dtv_resize_helper.cpp | 127 ASSERT_EQ(nullptr, zero_dtv->next); in main()
140 ASSERT_EQ(zero_dtv, initial_dtv->next); in main()
202 ASSERT_EQ(initial_dtv, new_dtv->next); in main()
|
| /bionic/linker/ |
| D | linked_list.h | 35 LinkedListEntry<T>* next; member
53 entry_ = entry_->next;
115 new_entry->next = header_->head; in push_front()
126 new_entry->next = nullptr; in push_back()
131 header_->tail->next = new_entry; in push_back()
141 header_->head = entry->next; in pop_front()
160 header_->head = header_->head->next; in clear()
177 for (LinkedListEntry<T>* e = head(); e != nullptr; e = e->next) { in visit()
190 LinkedListEntry<T>* next = e->next; in remove_if() local
192 header_->head = next; in remove_if()
[all …]
|
| D | linker_block_allocator.cpp | 45 LinkerBlockAllocatorPage* next; member
110 for (LinkerBlockAllocatorPage* page = page_list_; page != nullptr; page = page->next) { in protect_all()
133 page->next = page_list_; in create_new_page()
143 if (block >= (page_ptr + sizeof(page->next)) && block < (page_ptr + kAllocateSize)) { in find_page()
147 page = page->next; in find_page()
160 LinkerBlockAllocatorPage* next = page->next; in purge() local
162 page = next; in purge()
|
| /bionic/libc/bionic/ |
| D | pthread_atfork.cpp | 36 atfork_t* next; member
52 for (atfork_t* it = first_; it != nullptr; it = it->next) { in walk_forward()
65 entry->next = nullptr; in push_back()
68 entry->prev->next = entry; in push_back()
82 it = it->next; in remove_if()
85 it = it->next; in remove_if()
93 entry->prev->next = entry->next; in remove()
95 first_ = entry->next; in remove()
98 if (entry->next != nullptr) { in remove()
99 entry->next->prev = entry->prev; in remove()
|
| D | pthread_internal.cpp | 53 thread->next = g_thread_list; in __pthread_internal_add()
55 if (thread->next != nullptr) { in __pthread_internal_add()
56 thread->next->prev = thread; in __pthread_internal_add()
65 if (thread->next != nullptr) { in __pthread_internal_remove()
66 thread->next->prev = thread->prev; in __pthread_internal_remove()
69 thread->prev->next = thread->next; in __pthread_internal_remove()
71 g_thread_list = thread->next; in __pthread_internal_remove()
102 for (pthread_internal_t* t = g_thread_list; t != nullptr; t = t->next) { in __pthread_internal_find()
194 for (pthread_internal_t* t = g_thread_list; t != nullptr; t = t->next) { in __pthread_internal_remap_stack_with_mte()
248 for (pthread_internal_t* t = g_thread_list; t != nullptr; t = t->next) { in android_run_on_all_threads()
|
| D | __cxa_thread_atexit_impl.cpp | 27 thread_local_dtor* next; member in thread_local_dtor
43 dtor->next = thread->thread_local_dtors; in __cxa_thread_atexit_impl()
55 thread->thread_local_dtors = current->next; in __cxa_thread_finalize()
|
| D | net_if.cpp | 67 if_list* next; member
72 next = *list; in if_list()
79 list = it->next; in Free()
120 for (if_list* it = list; it != nullptr; it = it->next) { in if_nameindex()
128 for (if_list* it = list; it != nullptr; it = it->next) { in if_nameindex()
|
| D | dirent.cpp | 149 dirent* next = __readdir_locked(d); in readdir_r() local
150 if (errno != 0 && next == nullptr) { in readdir_r()
154 if (next != nullptr) { in readdir_r()
155 memcpy(entry, next, next->d_reclen); in readdir_r()
|
| D | bionic_allocator.cpp | 123 next_free->next = block_record->next; in alloc()
127 page->free_block_list = block_record->next; in alloc()
174 block_record->next = page->free_block_list; in free()
214 first_block->next = nullptr; in alloc_page()
|
| D | spawn.cpp | 76 __posix_spawn_file_action* next; member
122 for (__posix_spawn_file_action* action = head; action != nullptr; action = action->next) { in Do()
329 a = a->next; in posix_spawn_file_actions_destroy()
349 action->next = nullptr; in posix_spawn_add_file_action()
368 (*actions)->last->next = action; in posix_spawn_add_file_action()
|
| /bionic/libc/system_properties/ |
| D | contexts_split.cpp | 44 ContextListNode(ContextListNode* next, const char* context, const char* filename) in ContextListNode() argument
45 : ContextNode(strdup(context), filename), next(next) { in ContextListNode()
52 ContextListNode* next; member in ContextListNode
56 PrefixNode(struct PrefixNode* next, const char* prefix, ContextListNode* context) in PrefixNode()
57 : prefix(strdup(prefix)), prefix_len(strlen(prefix)), context(context), next(next) { in PrefixNode()
65 PrefixNode* next; member
83 next_list = &(*next_list)->next; in ListAddAfterLen()
92 list = list->next; in ListForEach()
102 list = list->next; in ListFind()
111 *list = old_list->next; in ListFree()
|
| /bionic/libc/upstream-freebsd/lib/libc/stdlib/ |
| D | quick_exit.c | 42 struct quick_exit_handler *next; member
66 h->next = handlers; in at_quick_exit()
82 for (h = handlers; NULL != h; h = h->next) { in quick_exit()
|
| /bionic/tools/versioner/src/ |
| D | Preprocessor.cpp | 280 auto next = current; in mergeGuards() local
281 ++next; in mergeGuards()
283 while (next != guard_map.end()) { in mergeGuards()
284 if (current->second != next->second) { in mergeGuards()
286 ++next; in mergeGuards()
295 FileLocation end_location = next->first.start; in mergeGuards()
370 to_string(next->first).c_str()); in mergeGuards()
372 ++next; in mergeGuards()
377 to_string(next->first).c_str()); in mergeGuards()
380 merged.end = next->first.end; in mergeGuards()
[all …]
|
| /bionic/libc/upstream-netbsd/lib/libc/isc/ |
| D | eventlib_p.h | 88 struct evConn * next; member
121 struct evFile * next; member
142 struct evStream *prev, *next; member
158 struct evWait * next; member
165 struct evWaitList * next; member
176 struct { struct evEvent_p *next; } free; member
|
| D | ev_streams.c | 88 new->next = ctx->streams; in evWrite()
122 new->next = ctx->streams; in evRead()
170 old->prev->next = old->next; in evCancelRW()
172 ctx->streams = old->next; in evCancelRW()
173 if (old->next != NULL) in evCancelRW()
174 old->next->prev = old->prev; in evCancelRW()
|
| /bionic/libc/upstream-netbsd/lib/libc/regex/ |
| D | regcomp.c | 106 const char *next; /* next character in RE */ member
194 #define PEEK() (*p->next)
195 #define PEEK2() (*(p->next+1))
196 #define MORE() (p->next < p->end)
197 #define MORE2() (p->next+1 < p->end)
204 #define NEXT() (p->next++)
205 #define NEXT2() (p->next += 2)
206 #define NEXTn(n) (p->next += (n))
207 #define GETNEXT() (*p->next++)
329 p->next = pattern; /* convenience; we do not modify it */ in regcomp_internal()
[all …]
|
| /bionic/libc/kernel/uapi/linux/ |
| D | dm-ioctl.h | 33 __u32 next; member
43 __u32 next; member
49 __u32 next; member
|
| /bionic/libc/dns/resolv/ |
| D | res_cache.c | 1272 struct pending_req_info* next; member
1287 struct resolv_cache_info* next; member
1314 ri = cache->pending_requests.next; in _cache_flush_pending_requests_locked()
1318 ri = ri->next; in _cache_flush_pending_requests_locked()
1325 cache->pending_requests.next = NULL; in _cache_flush_pending_requests_locked()
1339 ri = (*cache)->pending_requests.next; in _cache_check_pending_request_locked()
1347 ri = ri->next; in _cache_check_pending_request_locked()
1355 prev->next = ri; in _cache_check_pending_request_locked()
1378 ri = cache->pending_requests.next; in _cache_notify_waiting_tid_locked()
1386 ri = ri->next; in _cache_notify_waiting_tid_locked()
[all …]
|
| /bionic/libc/stdio/ |
| D | glue.h | 44 struct glue *next; member
|
| /bionic/libc/upstream-openbsd/lib/libc/gdtoa/ |
| D | misc.c | 65 freelist[k] = rv->next;
111 v->next = freelist[v->k];
419 p5->next = 0;
426 p5->next = 0;
439 if ((p51 = p5->next) == 0) {
442 if (!(p51 = p5->next)) {
443 p51 = p5->next = mult(p5,p5);
446 p51->next = 0;
450 p51 = p5->next = mult(p5,p5);
453 p51->next = 0;
|