| /system/core/libcutils/include_outside_system/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/core/libcutils/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/core/libsparse/ |
| D | backed_block.cpp | 46 struct backed_block* next; member
60 return bb->next; in backed_block_iter_next()
123 struct backed_block* next = bb->next; in backed_block_list_destroy() local
125 bb = next; in backed_block_list_destroy()
141 for (end = start; end && end->next; end = end->next) in backed_block_list_move()
152 from->data_blocks = end->next; in backed_block_list_move()
154 for (bb = from->data_blocks; bb; bb = bb->next) { in backed_block_list_move()
155 if (bb->next == start) { in backed_block_list_move()
156 bb->next = end->next; in backed_block_list_move()
164 end->next = nullptr; in backed_block_list_move()
[all …]
|
| /system/bt/osi/src/ |
| D | list.cc | 8 struct list_node_t* next; member
97 node->next = prev_node->next; in list_insert_after()
99 prev_node->next = node; in list_insert_after()
111 node->next = list->head; in list_prepend()
125 node->next = NULL; in list_append()
131 list->tail->next = node; in list_append()
145 list_node_t* next = list_free_node_(list, list->head); in list_remove() local
146 if (list->tail == list->head) list->tail = next; in list_remove()
147 list->head = next; in list_remove()
151 for (list_node_t *prev = list->head, *node = list->head->next; node; 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/bt/embdrv/sbc/decoder/srce/ |
| D | framing.c | 156 INLINE OI_CHAR crc_iterate(uint8_t oldcrc, uint8_t next) { in crc_iterate() argument
159 idx = oldcrc ^ next; in crc_iterate()
170 INLINE OI_CHAR crc_iterate_top4(uint8_t oldcrc, uint8_t next) { in crc_iterate_top4() argument
173 idx = (oldcrc ^ next) >> 4; in crc_iterate_top4()
186 INLINE uint8_t crc_iterate_top4(uint8_t oldcrc, uint8_t next) { in crc_iterate_top4() argument
187 return (oldcrc << 4) ^ crc8_narrow[(oldcrc ^ next) >> 4]; in crc_iterate_top4()
191 INLINE uint8_t crc_iterate(uint8_t crc, uint8_t next) { in crc_iterate() argument
192 crc = (crc << 4) ^ crc8_narrow[(crc ^ next) >> 4]; in crc_iterate()
193 crc = (crc << 4) ^ crc8_narrow[((crc >> 4) ^ next) & 0xf]; in crc_iterate()
199 INLINE uint8_t crc_iterate(uint8_t crc, uint8_t next) { in crc_iterate() argument
[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()
212 if (!type_rules[i].next) in analyze_types()
216 free_type_rules(type_rules[i].next); in analyze_types()
217 type_rules[i].next = NULL; in analyze_types()
223 free_type_rules(type_rules[j].next); in analyze_types()
224 type_rules[j].next = NULL; in analyze_types()
[all …]
|
| /system/core/libcutils/ |
| D | hashmap.cpp | 31 Entry* next; member
116 Entry* next = entry->next; in expandIfNecessary() local
118 entry->next = newBuckets[index]; in expandIfNecessary()
120 entry = next; in expandIfNecessary()
144 Entry* next = entry->next; in hashmapFree() local
146 entry = next; in hashmapFree()
177 entry->next = NULL; in createEntry()
220 p = ¤t->next; in hashmapPut()
233 entry = entry->next; in hashmapGet()
249 *p = current->next; in hashmapRemove()
[all …]
|
| D | config_utils.cpp | 43 for(node = root->first_child; node; node = node->next) in config_find()
57 root->last_child->next = node; in _config_create()
118 char next; member
129 if(cs->next != 0) { in _lex()
130 c = cs->next; in _lex()
131 cs->next = 0; in _lex()
211 cs->next = *data; in _lex()
296 cs.next = 0; in config_load()
325 cur = cur->next; in config_free()
|
| /system/bt/btif/src/ |
| D | btif_uid.cc | 33 struct uid_set_node_t* next; member
51 node = node->next; in uid_set_destroy()
63 node = node->next; in uid_set_find_or_create_node()
69 node->next = set->head; in uid_set_find_or_create_node()
99 node = node->next; in uid_set_read_and_clear()
117 node = node->next; in uid_set_read_and_clear()
|
| D | btif_sock_l2cap.cc | 38 struct packet *next, *prev; member
45 struct l2cap_socket* next; // link to next list item member
108 sock->first_packet = p->next; in packet_get_head_l()
146 p->next = sock->first_packet; in packet_put_head_l()
148 if (p->next) in packet_put_head_l()
149 p->next->prev = p; in packet_put_head_l()
168 p->next = NULL; in packet_put_tail_l()
172 p->prev->next = p; in packet_put_tail_l()
190 while (sock && sock->id != id) sock = sock->next; in btsock_l2cap_find_by_id_l()
199 while (t && t != sock) t = t->next; in btsock_l2cap_free_l()
[all …]
|
| /system/core/property_service/libpropertyinfoserializer/ |
| D | space_tokenizer.h | 29 auto next = std::string(); in GetNext() local
31 next.push_back(*it_++); in GetNext()
36 return next; in GetNext()
|
| /system/teeui/libteeui/src/ |
| D | evdev.cpp | 46 return a.next > b.next; in timerOrder()
60 while (!timers_.empty() && timers_[0].next <= now) { in runTimers()
65 auto diff = now - current.next; in runTimers()
66 current.next += ((diff / current.duration) + 1) * current.duration; in runTimers()
73 auto& next = *timers_.begin(); in runTimers() local
74 auto diff = next.next - now; in runTimers()
101 std::chrono::steady_clock::time_point next = std::chrono::steady_clock::now() + duration; in addTimer() local
102 newTimers_.emplace_back(next, duration, std::move(handler), oneShot); in addTimer()
|
| /system/core/fs_mgr/libdm/ |
| D | dm.cpp | 345 uint32_t next = sizeof(*io); in GetAvailableTargets() local
346 data_size = io->data_size - next; in GetAvailableTargets()
348 reinterpret_cast<struct dm_target_versions*>(static_cast<char*>(buffer.get()) + next); in GetAvailableTargets()
349 while (next && data_size) { in GetAvailableTargets()
351 if (vers->next == 0) { in GetAvailableTargets()
354 next += vers->next; in GetAvailableTargets()
355 data_size -= vers->next; in GetAvailableTargets()
357 next); in GetAvailableTargets()
422 uint32_t next = sizeof(*io); in GetAvailableDevices() local
423 data_size = io->data_size - next; in GetAvailableDevices()
[all …]
|
| /system/memory/libmemunreachable/ |
| D | Allocator.cpp | 99 MapAllocation* next; member
325 for (LinkedList<Chunk*>* it = free_chunks_[i].next(); it->data() != NULL; it = it->next()) { in Empty()
330 for (LinkedList<Chunk*>* it = full_chunks_[i].next(); it->data() != NULL; it = it->next()) { in Empty()
343 Chunk* chunk = free_chunks_[i].next()->data(); in ~HeapImpl()
348 Chunk* chunk = full_chunks_[i].next()->data(); in ~HeapImpl()
369 return free_chunks_[bucket].next()->data()->Alloc(); in AllocLocked()
398 allocation->next = map_allocation_list_; in MapAlloc()
406 while (*allocation && (*allocation)->ptr != ptr) allocation = &(*allocation)->next; in MapFree()
413 *allocation = (*allocation)->next; in MapFree()
430 while (node->next() != head && node->data() != nullptr && in MoveToList()
[all …]
|
| /system/extras/simpleperf/ |
| D | CallChainJoiner.h | 101 CacheNode* next = &nodes_[node->leaf_link_next]; in RemoveNodeFromLRUList() local
103 next->leaf_link_prev = node->leaf_link_prev; in RemoveNodeFromLRUList()
107 CacheNode* next = &nodes_[0]; in AppendNodeToLRUList() local
108 CacheNode* prev = &nodes_[next->leaf_link_prev]; in AppendNodeToLRUList()
110 node->leaf_link_prev = next->leaf_link_prev; in AppendNodeToLRUList()
111 next->leaf_link_prev = prev->leaf_link_next = GetNodeIndex(node); in AppendNodeToLRUList()
|
| /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/update_engine/payload_consumer/ |
| D | bzip_extent_writer.h | 37 explicit BzipExtentWriter(std::unique_ptr<ExtentWriter> next) in BzipExtentWriter() argument
38 : next_(std::move(next)) { in BzipExtentWriter()
|
| /system/nvram/core/tests/ |
| D | gtest_stubs.cpp | 28 for (TestDeclarationBase* decl = tests_; decl; decl = decl->next) { in RunAllTests()
43 test_declaration->next = tests_; in Register()
|
| /system/logging/logcat/tests/ |
| D | logcat_benchmark.cpp | 92 timestamp next(buffer); in BM_logcat_sorted_order() local
93 if (next < last) { in BM_logcat_sorted_order()
100 if (next.valid()) { in BM_logcat_sorted_order()
|
| /system/security/keystore2/src/ |
| D | permission.rs | 368 fn next(&mut self) -> Option<Self::Item> { in next() method
955 assert_eq!(i.next().unwrap().to_selinux(), "delete"); in key_perm_set_all_test()
956 assert_eq!(i.next().unwrap().to_selinux(), "gen_unique_id"); in key_perm_set_all_test()
957 assert_eq!(i.next().unwrap().to_selinux(), "get_info"); in key_perm_set_all_test()
958 assert_eq!(i.next().unwrap().to_selinux(), "grant"); in key_perm_set_all_test()
959 assert_eq!(i.next().unwrap().to_selinux(), "manage_blob"); in key_perm_set_all_test()
960 assert_eq!(i.next().unwrap().to_selinux(), "rebind"); in key_perm_set_all_test()
961 assert_eq!(i.next().unwrap().to_selinux(), "req_forced_op"); in key_perm_set_all_test()
962 assert_eq!(i.next().unwrap().to_selinux(), "update"); in key_perm_set_all_test()
963 assert_eq!(i.next().unwrap().to_selinux(), "use"); in key_perm_set_all_test()
[all …]
|
| /system/extras/tests/crypto/ |
| D | get_dm_versions.c | 49 while (v->next) { in main()
51 v = (struct dm_target_versions *)(((char *)v) + v->next); in main()
|
| /system/bt/gd/l2cap/internal/ |
| D | basic_mode_channel_data_controller.cc | 50 auto next = std::move(pdu_queue_.front()); in GetNextPacket() local
52 return next; in GetNextPacket()
|
| /system/libufdt/ |
| D | ufdt_node_pool.c | 57 struct ufdt_node_pool_entry_header *next; member
107 next_ptr = &entry->next; in _ufdt_node_pool_create_block()
127 block->first_free_entry = entry->next; in _ufdt_node_pool_block_alloc()
137 entry->next = block->first_free_entry; in _ufdt_node_pool_block_free()
|
| /system/extras/sound/ |
| D | playwav.c | 125 static char *next; variable
132 memcpy(buf, next, sz); in fill_buffer()
133 next += sz; in fill_buffer()
141 next = malloc(count); in play_file()
142 if (!next) { in play_file()
146 if (read(fd, next, count) != (ssize_t) count) { in play_file()
|