| /system/core/include/cutils/ |
| D | list.h | 28 struct listnode *next; member
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; in list_init()
60 item->next = head; in list_add_tail()
62 head->prev->next = item; in list_add_tail()
68 item->next = head->next; in list_add_head()
70 head->next->prev = item; in list_add_head()
[all …]
|
| /system/sepolicy/tools/fc_sort/ |
| D | fc_sort.c | 44 struct file_context_node *next; member
66 struct file_context_bucket *next; member
158 while (a_current->next && b_current) { in fc_merge()
159 jumpto = a_current->next; in fc_merge()
163 while (b_current && a_current->next && in fc_merge()
164 fc_compare(a_current->next, in fc_merge()
168 temp = a_current->next; in fc_merge()
169 a_current->next = b_current; in fc_merge()
170 b_current = b_current->next; in fc_merge()
171 a_current->next->next = temp; in fc_merge()
[all …]
|
| /system/core/libsparse/ |
| D | backed_block.c | 46 struct backed_block *next; member
62 return bb->next; in backed_block_iter_next()
135 struct backed_block *next = bb->next; in backed_block_list_destroy() local
137 bb = next; in backed_block_list_destroy()
155 for (end = start; end && end->next; end = end->next) in backed_block_list_move()
166 from->data_blocks = end->next; in backed_block_list_move()
168 for (bb = from->data_blocks; bb; bb = bb->next) { in backed_block_list_move()
169 if (bb->next == start) { in backed_block_list_move()
170 bb->next = end->next; in backed_block_list_move()
178 end->next = NULL; in backed_block_list_move()
[all …]
|
| /system/bt/osi/src/ |
| D | list.c | 8 struct list_node_t *next; member
98 node->next = prev_node->next; in list_insert_after()
100 prev_node->next = node; in list_insert_after()
114 node->next = list->head; in list_prepend()
130 node->next = NULL; in list_append()
136 list->tail->next = node; in list_append()
151 list_node_t *next = list_free_node_(list, list->head); in list_remove() local
153 list->tail = next; in list_remove()
154 list->head = next; in list_remove()
158 …or (list_node_t *prev = list->head, *node = list->head->next; node; prev = node, node = node->next) in list_remove()
[all …]
|
| /system/extras/showslab/ |
| D | showslab.c | 21 struct slab_info *next; member
141 prev->next = p; in get_slabinfo()
149 p->next = NULL; in get_slabinfo()
163 struct slab_info *temp = list->next; in free_slablist()
176 p->next = a; in merge_objs()
178 a = a->next; in merge_objs()
180 p->next = b; in merge_objs()
182 b = b->next; in merge_objs()
186 p->next = (a == NULL) ? b : a; in merge_objs()
187 return list.next; in merge_objs()
[all …]
|
| /system/core/adb/ |
| D | adb_listeners.cpp | 31 .next = &listener_list,
86 if (l->next) { in free_listener()
87 l->next->prev = l->prev; in free_listener()
88 l->prev->next = l->next; in free_listener()
89 l->next = l->prev = l; in free_listener()
143 for (alistener* l = listener_list.next; l != &listener_list; l = l->next) { in format_listeners()
160 for (l = listener_list.next; l != &listener_list; l = l->next) { in remove_listener()
172 for (l = listener_list.next; l != &listener_list; l = l_next) { in remove_all_listeners()
173 l_next = l->next; in remove_all_listeners()
187 for (alistener* l = listener_list.next; l != &listener_list; l = l->next) { in install_listener()
[all …]
|
| D | jdwp_service.cpp | 127 JdwpProcess* next; member
147 JdwpProcess* proc = _jdwp_list.next; in jdwp_process_list()
149 for ( ; proc != &_jdwp_list; proc = proc->next ) { in jdwp_process_list()
185 proc->prev->next = proc->next; in jdwp_process_free()
186 proc->next->prev = proc->prev; in jdwp_process_free()
228 proc->next = proc; in jdwp_process_alloc()
243 proc->next = &_jdwp_list; in jdwp_process_alloc()
244 proc->prev = proc->next->prev; in jdwp_process_alloc()
246 proc->prev->next = proc; in jdwp_process_alloc()
247 proc->next->prev = proc; in jdwp_process_alloc()
[all …]
|
| D | usb_windows.cpp | 48 usb_handle *next; member
72 .next = &handle_list,
128 for(usb = handle_list.next; usb != &handle_list; usb = usb->next) { in known_device_locked()
165 handle->next = &handle_list; in register_new_device()
167 handle->prev->next = handle; in register_new_device()
168 handle->next->prev = handle; in register_new_device()
279 ret->next = ret; in do_usb_open()
513 if ((handle->next != handle) && (handle->prev != handle)) { in usb_close()
514 handle->next->prev = handle->prev; in usb_close()
515 handle->prev->next = handle->next; in usb_close()
[all …]
|
| D | sockets.cpp | 46 .next = &local_socket_list, .prev = &local_socket_list,
54 .next = &local_socket_closing_list, .prev = &local_socket_closing_list,
65 for (s = local_socket_list.next; s != &local_socket_list; s = s->next) { in find_local_socket()
79 s->next = list; in insert_local_socket()
80 s->prev = s->next->prev; in insert_local_socket()
81 s->prev->next = s; in insert_local_socket()
82 s->next->prev = s; in insert_local_socket()
100 if (s->prev && s->next) { in remove_socket()
101 s->prev->next = s->next; in remove_socket()
102 s->next->prev = s->prev; in remove_socket()
[all …]
|
| /system/sepolicy/tools/sepolicy-analyze/ |
| D | typecmp.c | 15 for (p = type_rules, c = type_rules->next; c; p = c, c = c->next) { in insert_type_rule()
49 n->next = p->next; in insert_type_rule()
50 p->next = n; in insert_type_rule()
115 l = l->next; in free_type_rules()
126 for (c = l2; c; c = c->next) { in find_match()
205 if (!type_rules[i].next) in analyze_types()
209 free_type_rules(type_rules[i].next); in analyze_types()
210 type_rules[i].next = NULL; in analyze_types()
216 free_type_rules(type_rules[j].next); in analyze_types()
217 type_rules[j].next = NULL; in analyze_types()
[all …]
|
| /system/bt/embdrv/sbc/decoder/srce/ |
| D | framing.c | 111 INLINE OI_CHAR crc_iterate(OI_UINT8 oldcrc, OI_UINT8 next) in crc_iterate() argument
115 idx = oldcrc^next; in crc_iterate()
126 INLINE OI_CHAR crc_iterate_top4(OI_UINT8 oldcrc, OI_UINT8 next) in crc_iterate_top4() argument
130 idx = (oldcrc ^ next) >> 4; in crc_iterate_top4()
143 INLINE OI_UINT8 crc_iterate_top4(OI_UINT8 oldcrc, OI_UINT8 next) in crc_iterate_top4() argument
145 return (oldcrc << 4) ^ crc8_narrow[(oldcrc^next) >> 4]; in crc_iterate_top4()
149 INLINE OI_UINT8 crc_iterate(OI_UINT8 crc, OI_UINT8 next) in crc_iterate() argument
151 crc = (crc << 4) ^ crc8_narrow[(crc^next) >> 4]; in crc_iterate()
152 crc = (crc << 4) ^ crc8_narrow[((crc>>4)^next)&0xf]; in crc_iterate()
158 INLINE OI_UINT8 crc_iterate(OI_UINT8 crc, OI_UINT8 next) in crc_iterate() argument
[all …]
|
| /system/core/libcutils/ |
| D | hashmap.c | 31 Entry* next; member
120 Entry* next = entry->next; in expandIfNecessary() local
122 entry->next = newBuckets[index]; in expandIfNecessary()
124 entry = next; in expandIfNecessary()
148 Entry* next = entry->next; in hashmapFree() local
150 entry = next; in hashmapFree()
181 entry->next = NULL; in createEntry()
224 p = ¤t->next; in hashmapPut()
237 entry = entry->next; in hashmapGet()
252 entry = entry->next; in hashmapContainsKey()
[all …]
|
| D | config_utils.c | 44 for(node = root->first_child; node; node = node->next) in config_find()
58 root->last_child->next = node; in _config_create()
119 char next; member
130 if(cs->next != 0) { in _lex()
131 c = cs->next; in _lex()
132 cs->next = 0; in _lex()
212 cs->next = *data; in _lex()
297 cs.next = 0; in config_load()
326 cur = cur->next; in config_free()
|
| /system/extras/ext4_utils/ |
| D | allocate.c | 28 struct xattr_list_element *next; member
43 alloc->next = NULL; in create_allocation()
50 for (element = aux_info.xattrs; element != NULL; element = element->next) { in xattr_list_find()
62 element->next = aux_info.xattrs; in xattr_list_insert()
69 reg->prev->next = reg->next; in region_list_remove()
71 if (reg->next) in region_list_remove()
72 reg->next->prev = reg->prev; in region_list_remove()
75 list->first = reg->next; in region_list_remove()
80 reg->next = NULL; in region_list_remove()
93 list->last->next = reg; in region_list_append()
[all …]
|
| /system/core/liblog/ |
| 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)
|
| 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)
|
| D | logger.h | 127 for (transp = node_to_item((logger_list)->transport.next, \
134 transp = node_to_item(transp->node.next, \
138 for (logp = node_to_item((logger_list)->logger.next, \
143 logp = node_to_item((logp)->node.next, \
|
| /system/core/libpackagelistparser/ |
| D | packagelistparser.c | 96 char *next; in packagelist_parse() local
122 next = buf; in packagelist_parse()
124 cur = strsep(&next, " \t\r\n"); in packagelist_parse()
135 cur = strsep(&next, " \t\r\n"); in packagelist_parse()
158 cur = strsep(&next, " \t\r\n"); in packagelist_parse()
178 cur = strsep(&next, " \t\r\n"); in packagelist_parse()
189 cur = strsep(&next, " \t\r\n"); in packagelist_parse()
200 cur = strsep(&next, " \t\r\n"); in packagelist_parse()
|
| /system/bt/btif/src/ |
| D | btif_uid.c | 33 struct uid_set_node_t* next; member
53 node = node->next; in uid_set_destroy()
66 node = node->next; in uid_set_find_or_create_node()
72 node->next = set->head; in uid_set_find_or_create_node()
108 node = node->next; in uid_set_read_and_clear()
124 node = node->next; in uid_set_read_and_clear()
|
| /system/core/libmemunreachable/ |
| D | Allocator.cpp | 100 MapAllocation* next; member
337 for (LinkedList<Chunk*> *it = free_chunks_[i].next(); it->data() != NULL; it = it->next()) { in Empty()
342 for (LinkedList<Chunk*> *it = full_chunks_[i].next(); it->data() != NULL; it = it->next()) { in Empty()
355 Chunk *chunk = free_chunks_[i].next()->data(); in ~HeapImpl()
360 Chunk *chunk = full_chunks_[i].next()->data(); in ~HeapImpl()
381 return free_chunks_[bucket].next()->data()->Alloc(); in AllocLocked()
411 allocation->next = map_allocation_list_; in MapAlloc()
420 allocation = &(*allocation)->next; in MapFree()
427 *allocation = (*allocation)->next; in MapFree()
444 while (node->next() != head && node->data() != nullptr in MoveToList()
[all …]
|
| /system/core/libdiskconfig/ |
| D | write_lst.c | 53 item->next = (*lst); in wlist_add()
63 temp_wr = lst->next; in wlist_free()
72 for(; lst; lst = lst->next) { in wlist_commit()
|
| /system/extras/perfprofd/quipper/original-kernel-headers/tools/perf/util/include/linux/ |
| D | types.h | 18 struct list_head *next, *prev; member
26 struct hlist_node *next, **pprev; member
|
| /system/extras/perfprofd/quipper/kernel-headers/tools/perf/util/include/linux/ |
| D | types.h | 31 struct list_head * next, * prev; member
39 struct hlist_node * next, * * pprev; member
|
| /system/extras/showmap/ |
| D | showmap.cpp | 12 mapinfo *next; member
156 prev->next = map; in enqueue_map()
160 map->next = current; in enqueue_map()
165 current = current->next; in enqueue_map()
195 mapinfo *next; in load_maps() local
196 if (!parse_header(line, current, &next)) { in load_maps()
198 current = next; in load_maps()
295 mi = mi->next; in show_map()
|
| /system/core/lmkd/ |
| D | lmkd.c | 96 struct adjslot_list *next; member
158 struct adjslot_list *next = head->next; in adjslot_insert() local
160 new->next = next; in adjslot_insert()
161 next->prev = new; in adjslot_insert()
162 head->next = new; in adjslot_insert()
168 struct adjslot_list *next = old->next; in adjslot_remove() local
169 next->prev = prev; in adjslot_remove()
170 prev->next = next; in adjslot_remove()
775 procadjslot_list[i].next = &procadjslot_list[i]; in init()
|