/system/core/include/cutils/ |
H A D | list.h | 28 struct listnode *next; member in struct:listnode 37 .next = &name, \ 42 for (node = (list)->next; node != (list); node = node->next) 48 for (node = (list)->next, n = node->next; \ 50 node = n, n = node->next) 54 node->next = node; 60 item->next = head; 62 head->prev->next [all...] |
H A D | config_utils.h | 29 cnode *next; member in struct:cnode
|
/system/sepolicy/tools/fc_sort/ |
H A D | fc_sort.c | 35 * next points to the next node in the linked list. 44 struct file_context_node *next; member in struct:file_context_node 62 * next points to the next bucket in the linked list. 66 struct file_context_bucket *next; member in struct:file_context_bucket 158 while (a_current->next && b_current) { 159 jumpto = a_current->next; 162 * and the next a node.*/ 163 while (b_current && a_current->next [all...] |
/system/extras/perfprofd/quipper/kernel-headers/tools/perf/util/include/linux/ |
H A D | types.h | 14 *** Any manual change here will be lost the next time this script will 31 struct list_head * next, * prev; member in struct:list_head 39 struct hlist_node * next, * * pprev; member in struct:hlist_node
|
/system/extras/perfprofd/quipper/original-kernel-headers/tools/perf/util/include/linux/ |
H A D | types.h | 18 struct list_head *next, *prev; member in struct:list_head 26 struct hlist_node *next, **pprev; member in struct:hlist_node
|
/system/core/liblog/ |
H A D | config_read.h | 30 for (transp = node_to_item((transports)->next, \ 34 transp = node_to_item(transp->node.next, \ 38 for (transp = node_to_item((transports)->next, \ 40 n = transp->node.next; \ 44 n = transp->node.next)
|
H A D | config_write.h | 30 for (transp = node_to_item((transports)->next, \ 34 transp = node_to_item(transp->node.next, \ 38 for (transp = node_to_item((transports)->next, \ 40 n = transp->node.next; \ 44 n = transp->node.next)
|
/system/core/libsparse/ |
H A D | backed_block.c | 46 struct backed_block *next; member in struct:backed_block 62 return bb->next; 135 struct backed_block *next = bb->next; local 137 bb = next; 155 for (end = start; end && end->next; end = end->next) 166 from->data_blocks = end->next; 168 for (bb = from->data_blocks; bb; bb = bb->next) { 169 if (bb->next [all...] |
/system/bt/osi/src/ |
H A D | list.c | 8 struct list_node_t *next; member in struct:list_node_t 98 node->next = prev_node->next; 100 prev_node->next = node; 114 node->next = list->head; 130 node->next = NULL; 136 list->tail->next = node; 151 list_node_t *next = list_free_node_(list, list->head); local 153 list->tail = next; 154 list->head = next; 183 list_node_t *next = node->next; local 215 list_node_t *next = node->next; local [all...] |
/system/extras/showslab/ |
H A D | showslab.c | 21 struct slab_info *next; member in struct:slab_info 141 prev->next = p; 149 p->next = NULL; 163 struct slab_info *temp = list->next; 176 p->next = a; 178 a = a->next; 180 p->next = b; 182 b = b->next; 186 p->next = (a == NULL) ? b : a; 187 return list.next; [all...] |
/system/core/adb/ |
H A D | adb_listeners.cpp | 31 .next = &listener_list, 86 if (l->next) { 87 l->next->prev = l->prev; 88 l->prev->next = l->next; 89 l->next = l->prev = l; 143 for (alistener* l = listener_list.next; l != &listener_list; l = l->next) { 160 for (l = listener_list.next; l != &listener_list; l = l->next) { [all...] |
H A D | jdwp_service.cpp | 127 JdwpProcess* next; member in struct:JdwpProcess 147 JdwpProcess* proc = _jdwp_list.next; 149 for ( ; proc != &_jdwp_list; proc = proc->next ) { 185 proc->prev->next = proc->next; 186 proc->next->prev = proc->prev; 228 proc->next = proc; 243 proc->next = &_jdwp_list; 244 proc->prev = proc->next->prev; 246 proc->prev->next 637 JdwpTracker* next; member in struct:JdwpTracker [all...] |
H A D | usb_windows.cpp | 48 usb_handle *next; member in struct:usb_handle 72 .next = &handle_list, 128 for(usb = handle_list.next; usb != &handle_list; usb = usb->next) { 165 handle->next = &handle_list; 167 handle->prev->next = handle; 168 handle->next->prev = handle; 279 ret->next = ret; 513 if ((handle->next != handle) && (handle->prev != handle)) { 514 handle->next [all...] |
/system/core/libcutils/ |
H A D | hashmap.c | 31 Entry* next; member in struct:Entry 120 Entry* next = entry->next; local 122 entry->next = newBuckets[index]; 124 entry = next; 148 Entry* next = entry->next; local 150 entry = next; 181 entry->next = NULL; 223 // Move to next entr 320 Entry *next = entry->next; local [all...] |
H A D | config_utils.c | 44 for(node = root->first_child; node; node = node->next) 58 root->last_child->next = node; 119 char next; member in struct:__anon1613 130 if(cs->next != 0) { 131 c = cs->next; 132 cs->next = 0; 212 cs->next = *data; 297 cs.next = 0; 326 cur = cur->next;
|
/system/sepolicy/tools/sepolicy-analyze/ |
H A D | typecmp.c | 15 for (p = type_rules, c = type_rules->next; c; p = c, c = c->next) { 49 n->next = p->next; 50 p->next = n; 115 l = l->next; 126 for (c = l2; c; c = c->next) { 205 if (!type_rules[i].next) 209 free_type_rules(type_rules[i].next); 210 type_rules[i].next [all...] |
/system/bt/btif/src/ |
H A D | btif_uid.c | 33 struct uid_set_node_t* next; member in struct:uid_set_node_t 53 node = node->next; 66 node = node->next; 72 node->next = set->head; 108 node = node->next; 124 node = node->next;
|
/system/core/libpackagelistparser/ |
H A D | packagelistparser.c | 96 char *next; local 122 next = buf; 124 cur = strsep(&next, " \t\r\n"); 126 errmsg = "Could not get next token for \"package name\""; 135 cur = strsep(&next, " \t\r\n"); 137 errmsg = "Could not get next token for field \"uid\""; 158 cur = strsep(&next, " \t\r\n"); 160 errmsg = "Could not get next token for field \"debuggable\""; 178 cur = strsep(&next, " \t\r\n"); 180 errmsg = "Could not get next toke [all...] |
/system/update_engine/payload_consumer/ |
H A D | bzip_extent_writer.h | 37 explicit BzipExtentWriter(std::unique_ptr<ExtentWriter> next) argument 38 : next_(std::move(next)) {
|
/system/core/libdiskconfig/ |
H A D | write_lst.c | 53 item->next = (*lst); 63 temp_wr = lst->next; 72 for(; lst; lst = lst->next) {
|
/system/extras/ext4_utils/ |
H A D | allocate.c | 28 struct xattr_list_element *next; member in struct:xattr_list_element 43 alloc->next = NULL; 50 for (element = aux_info.xattrs; element != NULL; element = element->next) { 62 element->next = aux_info.xattrs; 69 reg->prev->next = reg->next; 71 if (reg->next) 72 reg->next->prev = reg->prev; 75 list->first = reg->next; 80 reg->next 599 struct region *next; local 772 struct region *next = reg->next; local 779 struct region *next = reg->next; local [all...] |
/system/core/logcat/tests/ |
H A D | logcat_benchmark.cpp | 94 timestamp next(buffer); 95 if (next < last) { 102 if (next.valid()) {
|
/system/extras/tests/crypto/ |
H A D | get_dm_versions.c | 50 while (v->next) { 52 v = (struct dm_target_versions *)(((char *)v) + v->next);
|
/system/core/libmemunreachable/ |
H A D | Allocator.cpp | 100 MapAllocation* next; member in struct:HeapImpl::MapAllocation 337 for (LinkedList<Chunk*> *it = free_chunks_[i].next(); it->data() != NULL; it = it->next()) { 342 for (LinkedList<Chunk*> *it = full_chunks_[i].next(); it->data() != NULL; it = it->next()) { 355 Chunk *chunk = free_chunks_[i].next()->data(); 360 Chunk *chunk = full_chunks_[i].next()->data(); 381 return free_chunks_[bucket].next()->data()->Alloc(); 411 allocation->next = map_allocation_list_; 420 allocation = &(*allocation)->next; [all...] |
/system/extras/f2fs_utils/ |
H A D | f2fs_ioutils.c | 92 struct buf_item *next; member in struct:buf_item 113 buf_list = buf_list->next; 134 bi->next = buf_list;
|