| /system/core/libcutils/include_outside_system/cutils/ |
| D | list.h | 27 struct listnode *next; member
36 .next = &(name), \
44 for ((node) = (list)->next, (n) = (node)->next; \
46 (node) = (n), (n) = (node)->next)
49 for (struct listnode* __n = ((node) = (list)->next)->next; (node) != (list); \
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()
[all …]
|
| /system/core/libcutils/include/cutils/ |
| D | list.h | 27 struct listnode *next; member
36 .next = &(name), \
44 for ((node) = (list)->next, (n) = (node)->next; \
46 (node) = (n), (n) = (node)->next)
49 for (struct listnode* __n = ((node) = (list)->next)->next; (node) != (list); \
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()
[all …]
|
| /system/chre/util/ |
| D | intrusive_list_base.cc | 25 Node *nextNode = mSentinelNode.next; in doLinkFront()
27 newNode->next = nextNode; in doLinkFront()
29 mSentinelNode.next = newNode; in doLinkFront()
35 prevNode->next = newNode; in doLinkBack()
37 newNode->next = &mSentinelNode; in doLinkBack()
43 node->prev->next = node->next; in doUnlinkNode()
44 node->next->prev = node->prev; in doUnlinkNode()
45 node->next = nullptr; in doUnlinkNode()
51 Node *backNode = frontNode->next; in doLinkAfter()
52 frontNode->next = newNode; in doLinkAfter()
[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/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/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/tools/aidl/tests/golden_output/frozen/aidl-test-interface-ndk-source/gen/include/aidl/android/aidl/tests/ |
| D | RecursiveList.h | 33 std::unique_ptr<::aidl::android::aidl::tests::RecursiveList> next; variable
39 return std::tie(value, next) == std::tie(_rhs.value, _rhs.next);
42 return std::tie(value, next) < std::tie(_rhs.value, _rhs.next);
62 _aidl_os << ", next: " << ::android::internal::ToString(next); in toString()
|
| /system/tools/aidl/tests/golden_output/aidl-test-interface-ndk-source/gen/include/aidl/android/aidl/tests/ |
| D | RecursiveList.h | 33 std::unique_ptr<::aidl::android::aidl::tests::RecursiveList> next; variable
39 return std::tie(value, next) == std::tie(_rhs.value, _rhs.next);
42 return std::tie(value, next) < std::tie(_rhs.value, _rhs.next);
62 _aidl_os << ", next: " << ::android::internal::ToString(next); in toString()
|
| /system/tools/aidl/tests/golden_output/frozen/aidl-test-interface-cpp-source/gen/include/android/aidl/tests/ |
| D | RecursiveList.h | 25 ::std::unique_ptr<::android::aidl::tests::RecursiveList> next;
27 return std::tie(value, next) == std::tie(_rhs.value, _rhs.next);
30 return std::tie(value, next) < std::tie(_rhs.value, _rhs.next);
55 _aidl_os << ", next: " << ::android::internal::ToString(next); in toString()
|
| /system/tools/aidl/tests/golden_output/aidl-test-interface-cpp-source/gen/include/android/aidl/tests/ |
| D | RecursiveList.h | 25 ::std::unique_ptr<::android::aidl::tests::RecursiveList> next;
27 return std::tie(value, next) == std::tie(_rhs.value, _rhs.next);
30 return std::tie(value, next) < std::tie(_rhs.value, _rhs.next);
55 _aidl_os << ", next: " << ::android::internal::ToString(next); in toString()
|
| /system/tools/aidl/tests/golden_output/aidl-test-interface-rust-source/gen/android/aidl/tests/ |
| D | RecursiveList.rs | 10 pub r#next: Option<Box<crate::mangled::_7_android_4_aidl_5_tests_13_RecursiveList>>,
16 r#next: Default::default(), in default()
24 subparcel.write(&self.r#next)?; in write_to_parcel()
34 self.r#next = subparcel.read()?; in read_from_parcel()
|
| /system/tools/aidl/tests/golden_output/frozen/aidl-test-interface-rust-source/gen/android/aidl/tests/ |
| D | RecursiveList.rs | 10 pub r#next: Option<Box<crate::mangled::_7_android_4_aidl_5_tests_13_RecursiveList>>,
16 r#next: Default::default(), in default()
24 subparcel.write(&self.r#next)?; in write_to_parcel()
34 self.r#next = subparcel.read()?; in read_from_parcel()
|
| /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/memory/libmemunreachable/ |
| D | Allocator.cpp | 97 MapAllocation* next; member
305 for (LinkedList<Chunk*>* it = free_chunks_[i].next(); it->data() != NULL; it = it->next()) { in Empty()
310 for (LinkedList<Chunk*>* it = full_chunks_[i].next(); it->data() != NULL; it = it->next()) { in Empty()
323 Chunk* chunk = free_chunks_[i].next()->data(); in ~HeapImpl()
328 Chunk* chunk = full_chunks_[i].next()->data(); in ~HeapImpl()
349 return free_chunks_[bucket].next()->data()->Alloc(); in AllocLocked()
378 allocation->next = map_allocation_list_; in MapAlloc()
386 while (*allocation && (*allocation)->ptr != ptr) allocation = &(*allocation)->next; in MapFree()
393 *allocation = (*allocation)->next; in MapFree()
410 while (node->next() != head && node->data() != nullptr && in MoveToList()
[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/tools/aidl/tests/golden_output/frozen/aidl-test-interface-java-source/gen/android/aidl/tests/ |
| D | RecursiveList.java | 9 public android.aidl.tests.RecursiveList next; field in RecursiveList
27 _aidl_parcel.writeTypedObject(next, _aidl_flag); in writeToParcel()
42 next = _aidl_parcel.readTypedObject(android.aidl.tests.RecursiveList.CREATOR); in readFromParcel()
53 _mask |= describeContents(next); in describeContents()
|
| /system/tools/aidl/tests/golden_output/aidl-test-interface-java-source/gen/android/aidl/tests/ |
| D | RecursiveList.java | 9 public android.aidl.tests.RecursiveList next; field in RecursiveList
27 _aidl_parcel.writeTypedObject(next, _aidl_flag); in writeToParcel()
42 next = _aidl_parcel.readTypedObject(android.aidl.tests.RecursiveList.CREATOR); in readFromParcel()
53 _mask |= describeContents(next); in describeContents()
|
| /system/keymaster/android_keymaster/ |
| D | keymaster_configuration.cpp | 243 for (auto next = vbmeta_string.begin(); next != vbmeta_string.end(); next += 2) { in GetVbmetaDigest() local
244 auto high_nibble = HexCharToInt(*next); in GetVbmetaDigest()
245 auto low_nibble = HexCharToInt(*(next + 1)); in GetVbmetaDigest()
247 LOG(ERROR) << "invalid input: '" << *next << "' or '" << *(next + 1) << "'"; in GetVbmetaDigest()
|
| /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/fs_mgr/libdm/ |
| D | dm.cpp | 398 uint32_t next = sizeof(*io); in GetAvailableTargets() local
399 data_size = io->data_size - next; in GetAvailableTargets()
401 reinterpret_cast<struct dm_target_versions*>(static_cast<char*>(buffer.get()) + next); in GetAvailableTargets()
402 while (next && data_size) { in GetAvailableTargets()
404 if (vers->next == 0) { in GetAvailableTargets()
407 next += vers->next; in GetAvailableTargets()
408 data_size -= vers->next; in GetAvailableTargets()
410 next); in GetAvailableTargets()
475 uint32_t next = sizeof(*io); in GetAvailableDevices() local
476 data_size = io->data_size - next; in GetAvailableDevices()
[all …]
|
| /system/librustutils/system_properties/ |
| D | parsers_formatters.rs | 39 let mut current = chars.next(); in parse_list_with()
48 current = chars.next() in parse_list_with()
53 current = chars.next(); in parse_list_with()
57 current = chars.next() in parse_list_with()
|
| /system/security/keystore2/src/ |
| D | permission.rs | 198 fn next(&mut self) -> Option<Self::Item> { in next() method
722 assert_eq!(i.next().unwrap().name(), "delete"); in key_perm_set_all_test()
723 assert_eq!(i.next().unwrap().name(), "gen_unique_id"); in key_perm_set_all_test()
724 assert_eq!(i.next().unwrap().name(), "get_info"); in key_perm_set_all_test()
725 assert_eq!(i.next().unwrap().name(), "grant"); in key_perm_set_all_test()
726 assert_eq!(i.next().unwrap().name(), "manage_blob"); in key_perm_set_all_test()
727 assert_eq!(i.next().unwrap().name(), "rebind"); in key_perm_set_all_test()
728 assert_eq!(i.next().unwrap().name(), "req_forced_op"); in key_perm_set_all_test()
729 assert_eq!(i.next().unwrap().name(), "update"); in key_perm_set_all_test()
730 assert_eq!(i.next().unwrap().name(), "use"); in key_perm_set_all_test()
[all …]
|
| /system/update_engine/payload_consumer/ |
| D | bzip_extent_writer.h | 36 explicit BzipExtentWriter(std::unique_ptr<ExtentWriter> next) in BzipExtentWriter() argument
37 : next_(std::move(next)) { in BzipExtentWriter()
|