| /system/bt/osi/src/ |
| D | list.cc | 20 static list_node_t* list_free_node_(list_t* list, list_node_t* node);
27 list_t* list = (list_t*)zeroed_allocator->alloc(sizeof(list_t)); in list_new_internal() local
28 if (!list) return NULL; in list_new_internal()
30 list->free_cb = callback; in list_new_internal()
31 list->allocator = zeroed_allocator; in list_new_internal()
32 return list; in list_new_internal()
39 void list_free(list_t* list) { in list_free() argument
40 if (!list) return; in list_free()
42 list_clear(list); in list_free()
43 list->allocator->free(list); in list_free()
[all …]
|
| D | fixed_queue.cc | 32 list_t* list; member
52 ret->list = list_new(NULL); in fixed_queue_new()
53 if (!ret->list) goto error; in fixed_queue_new()
74 for (const list_node_t* node = list_begin(queue->list); in fixed_queue_free()
75 node != list_end(queue->list); node = list_next(node)) in fixed_queue_free()
78 list_free(queue->list); in fixed_queue_free()
100 return list_is_empty(queue->list); in fixed_queue_is_empty()
107 return list_length(queue->list); in fixed_queue_length()
124 list_append(queue->list, data); in fixed_queue_enqueue()
138 ret = list_front(queue->list); in fixed_queue_dequeue()
[all …]
|
| /system/bt/osi/test/ |
| D | list_test.cc | 13 list_t* list = list_new(NULL); in TEST_F() local
14 ASSERT_TRUE(list != NULL); in TEST_F()
15 list_free(list); in TEST_F()
24 list_t* list = list_new(NULL); in TEST_F() local
25 EXPECT_TRUE(list_is_empty(list)); in TEST_F()
26 list_free(list); in TEST_F()
30 list_t* list = list_new(NULL); in TEST_F() local
31 EXPECT_EQ(list_length(list), 0U); in TEST_F()
32 list_free(list); in TEST_F()
36 list_t* list = list_new(NULL); in TEST_F() local
[all …]
|
| /system/bt/osi/test/fuzzers/list/ |
| D | fuzz_list.cc | 57 list_node_t* getArbitraryNode(list_t* list, FuzzedDataProvider* dataProvider) { in getArbitraryNode() argument
58 if (list == nullptr || list_is_empty(list)) { in getArbitraryNode()
62 dataProvider->ConsumeIntegralInRange<size_t>(0, list_length(list) - 1); in getArbitraryNode()
63 list_node_t* node = list_begin(list); in getArbitraryNode()
74 list_t* list = nullptr; in callArbitraryFunction() local
83 list = createList(dataProvider); in callArbitraryFunction()
84 list_vector->push_back(list); in callArbitraryFunction()
93 list = reinterpret_cast<list_t*>(list_vector->at(index)); in callArbitraryFunction()
95 list_free(list); in callArbitraryFunction()
97 if (list != nullptr) { in callArbitraryFunction()
[all …]
|
| /system/bt/osi/include/ |
| D | list.h | 48 void list_free(list_t* list);
52 bool list_is_empty(const list_t* list);
56 bool list_contains(const list_t* list, const void* data);
59 size_t list_length(const list_t* list);
63 void* list_front(const list_t* list);
67 void* list_back(const list_t* list);
71 list_node_t* list_back_node(const list_t* list);
78 bool list_insert_after(list_t* list, list_node_t* prev_node, void* data);
86 bool list_prepend(list_t* list, void* data);
93 bool list_append(list_t* list, void* data);
[all …]
|
| /system/core/libcutils/include_outside_system/cutils/ |
| D | list.h | 41 #define list_for_each(node, list) \ argument
42 for ((node) = (list)->next; (node) != (list); (node) = (node)->next)
44 #define list_for_each_reverse(node, list) \ argument
45 for ((node) = (list)->prev; (node) != (list); (node) = (node)->prev)
47 #define list_for_each_safe(node, n, list) \ argument
48 for ((node) = (list)->next, (n) = (node)->next; \
49 (node) != (list); \
80 #define list_empty(list) ((list) == (list)->next) argument
81 #define list_head(list) ((list)->next) argument
82 #define list_tail(list) ((list)->prev) argument
|
| /system/core/libcutils/include/cutils/ |
| D | list.h | 41 #define list_for_each(node, list) \ argument
42 for ((node) = (list)->next; (node) != (list); (node) = (node)->next)
44 #define list_for_each_reverse(node, list) \ argument
45 for ((node) = (list)->prev; (node) != (list); (node) = (node)->prev)
47 #define list_for_each_safe(node, n, list) \ argument
48 for ((node) = (list)->next, (n) = (node)->next; \
49 (node) != (list); \
80 #define list_empty(list) ((list) == (list)->next) argument
81 #define list_head(list) ((list)->next) argument
82 #define list_tail(list) ((list)->prev) argument
|
| /system/timezone/input_tools/android/tzlookup_generator/src/test/java/com/android/libcore/timezone/tzlookup/ |
| D | UtilsTest.java | 51 assertEquals(list("ONE", "TWO", "THREE"), Utils.toUpperCase(list("one", "Two", "THREE"))); in toUpperCase()
52 assertEquals(list(), Utils.toUpperCase(list())); in toUpperCase()
57 assertTrue(Utils.allLowerCaseAscii(list("one", "a", "z"))); in allLowerCaseAscii()
58 assertFalse(Utils.allLowerCaseAscii(list("one", "a", "Z"))); in allLowerCaseAscii()
59 assertFalse(Utils.allLowerCaseAscii(list("one", "A", "z"))); in allLowerCaseAscii()
60 assertFalse(Utils.allLowerCaseAscii(list("onE", "a", "z"))); in allLowerCaseAscii()
117 assertTrue(Utils.allUnique(list())); in allUnique()
118 assertTrue(Utils.allUnique(list("One"))); in allUnique()
119 assertTrue(Utils.allUnique(list("One", "Two"))); in allUnique()
120 assertFalse(Utils.allUnique(list("One", "Two", "One"))); in allUnique()
[all …]
|
| /system/tools/xsdc/src/com/android/xsdc/java/ |
| D | JavaSimpleType.java | 24 final private boolean list; field in JavaSimpleType
29 String rawWritingExpression, boolean list) { in JavaSimpleType() argument
34 this.list = list; in JavaSimpleType()
35 fullName = list ? String.format("java.util.List<%s>", nullableName) : name; in JavaSimpleType()
36 nullableFullName = list ? String.format("java.util.List<%s>", nullableName) : nullableName; in JavaSimpleType()
39 JavaSimpleType(String name, String nullableName, String rawParsingExpression, boolean list) { in JavaSimpleType() argument
40 this(name, nullableName, rawParsingExpression, "%s", list); in JavaSimpleType()
43 JavaSimpleType(String name, String rawParsingExpression, boolean list) { in JavaSimpleType() argument
44 this(name, name, rawParsingExpression, list); in JavaSimpleType()
48 return list; in isList()
[all …]
|
| /system/tools/xsdc/src/com/android/xsdc/cpp/ |
| D | CppSimpleType.java | 23 final private boolean list; field in CppSimpleType
26 CppSimpleType(String name, String rawParsingExpression, boolean list, boolean isEnum) { in CppSimpleType() argument
28 this.list = list; in CppSimpleType()
30 this.fullName = list ? String.format("std::vector<%s>", name) : name; in CppSimpleType()
34 CppSimpleType(String name, String rawParsingExpression, boolean list) { in CppSimpleType() argument
35 this(name, rawParsingExpression, list, false); in CppSimpleType()
39 return list; in isList()
47 if (list) throw new CppCodeGeneratorException("list of list is not supported"); in newListType()
63 if (list) { in getParsingExpression()
88 if (list) { in getWritingExpression()
|
| /system/extras/showslab/ |
| D | showslab.c | 160 static void free_slablist(struct slab_info *list) in free_slablist() argument
162 while (list) { in free_slablist()
163 struct slab_info *temp = list->next; in free_slablist()
164 free(list); in free_slablist()
165 list = temp; in free_slablist()
171 struct slab_info list; in merge_objs() local
172 struct slab_info *p = &list; in merge_objs()
187 return list.next; in merge_objs()
193 static struct slab_info *slabsort(struct slab_info *list) in slabsort() argument
197 if (!list || !list->next) in slabsort()
[all …]
|
| /system/bt/gd/ |
| D | module_unittest.cc | 56 void ListDependencies(ModuleList* list) override { in ListDependencies() argument
86 void ListDependencies(ModuleList* list) override { in ListDependencies() argument
87 list->add<TestModuleNoDependency>(); in ListDependencies()
120 void ListDependencies(ModuleList* list) override { in ListDependencies() argument
147 void ListDependencies(ModuleList* list) override { in ListDependencies() argument
148 list->add<TestModuleOneDependency>(); in ListDependencies()
149 list->add<TestModuleNoDependencyTwo>(); in ListDependencies()
186 void ListDependencies(ModuleList* list) override { in ListDependencies() argument
187 list->add<TestModuleNoDependency>(); in ListDependencies()
223 ModuleList list; in TEST_F() local
[all …]
|
| /system/bt/test/headless/ |
| D | get_options.h | 45 std::list<RawAddress> device_;
46 std::list<std::string> init_flags_;
47 std::list<bluetooth::Uuid> uuid_;
54 mutable std::list<std::string> non_options_;
59 void ParseValue(char* optarg, std::list<std::string>& my_list);
|
| /system/bt/gd/security/ |
| D | security_module.cc | 93 void SecurityModule::ListDependencies(ModuleList* list) { in ListDependencies() argument
94 list->add<l2cap::le::L2capLeModule>(); in ListDependencies()
95 list->add<l2cap::classic::L2capClassicModule>(); in ListDependencies()
96 list->add<hci::HciLayer>(); in ListDependencies()
97 list->add<hci::AclManager>(); in ListDependencies()
98 list->add<hci::Controller>(); in ListDependencies()
99 list->add<storage::StorageModule>(); in ListDependencies()
100 list->add<neighbor::NameDbModule>(); in ListDependencies()
|
| /system/core/debuggerd/libdebuggerd/test/ |
| D | open_files_list_test.cpp | 35 OpenFilesList list; in TEST() local
36 populate_open_files_list(&list, getpid()); in TEST()
40 for (auto& file : list) { in TEST()
|
| /system/logging/logd/ |
| D | SimpleLogBuffer.h | 57 std::list<LogBufferElement>::iterator GetOldest(log_id_t log_id) REQUIRES(logd_lock);
58 std::list<LogBufferElement>::iterator Erase(std::list<LogBufferElement>::iterator it)
66 std::list<LogBufferElement>& logs() { return logs_; } in logs()
79 std::list<LogBufferElement> logs_ GUARDED_BY(logd_lock);
82 std::optional<std::list<LogBufferElement>::iterator> oldest_[LOG_ID_MAX] GUARDED_BY(logd_lock);
|
| D | SerializedFlushToState.h | 29 std::list<SerializedLogChunk>::iterator buffer_it;
48 SerializedFlushToState(uint64_t start, LogMask log_mask, std::list<SerializedLogChunk>* logs)
79 std::list<SerializedLogChunk>* logs_ GUARDED_BY(logd_lock) = nullptr;
|
| /system/extras/latencytop/ |
| D | latencytop.c | 44 static struct latency_entry* read_global_stats(struct latency_entry* list, int erase);
45 static struct latency_entry* read_process_stats(struct latency_entry* list, int erase, int pid);
46 static struct latency_entry* read_thread_stats(struct latency_entry* list, int erase, int pid,
52 static struct latency_entry* read_latency_file(FILE* f, struct latency_entry* list);
174 static struct latency_entry* read_global_stats(struct latency_entry* list, int erase) { in read_global_stats() argument
194 e = read_latency_file(f, list); in read_global_stats()
201 static struct latency_entry* read_process_stats(struct latency_entry* list, int erase, int pid) { in read_process_stats() argument
216 e = list; in read_process_stats()
230 static struct latency_entry* read_thread_stats(struct latency_entry* list, int erase, int pid, in read_thread_stats() argument
246 return list; in read_thread_stats()
[all …]
|
| /system/logging/liblog/ |
| D | logprint.cpp | 1200 } * list, *next; in convertMonotonic() local
1297 list = static_cast<conversionList*>(calloc(1, sizeof(conversionList))); in convertMonotonic()
1298 list_init(&list->node); in convertMonotonic()
1299 list->time = time; in convertMonotonic()
1300 subTimespec(&list->convert, &time, &monotonic); in convertMonotonic()
1301 list_add_tail(&convertHead, &list->node); in convertMonotonic()
1304 list = node_to_item(list_tail(&convertHead), struct conversionList, node); in convertMonotonic()
1305 if (subTimespec(&time, subTimespec(&time, &list->time, &list->convert), in convertMonotonic()
1309 subTimespec(&convert, &list->convert, &suspended_diff); in convertMonotonic()
1312 convert = list->convert; in convertMonotonic()
[all …]
|
| /system/linkerconfig/modules/include/linkerconfig/ |
| D | namespace.h | 93 void AddProvides(const Vec& list) { in AddProvides() argument
94 provides_.insert(list.begin(), list.end()); in AddProvides()
97 void AddRequires(const Vec& list) { in AddRequires() argument
98 requires_.insert(list.begin(), list.end()); in AddRequires()
|
| /system/core/debuggerd/libdebuggerd/ |
| D | open_files_list.cpp | 41 void populate_open_files_list(OpenFilesList* list, pid_t pid) { in populate_open_files_list() argument
59 (*list)[fd].path = target; in populate_open_files_list()
61 (*list)[fd].path = "???"; in populate_open_files_list()
67 void populate_fdsan_table(OpenFilesList* list, std::shared_ptr<unwindstack::Memory> memory, in populate_fdsan_table() argument
80 (*list)[i].fdsan_owner = entry.close_tag.load(); in populate_fdsan_table()
115 (*list)[fd].fdsan_owner = entry.close_tag; in populate_fdsan_table()
|
| /system/hardware/interfaces/suspend/1.0/default/ |
| D | WakeupList.h | 45 void erase(std::list<WakeupInfo>::iterator entry) REQUIRES(mLock);
49 std::list<WakeupInfo> mWakeups GUARDED_BY(mLock);
50 std::unordered_map<std::string, std::list<WakeupInfo>::iterator> mLookupTable GUARDED_BY(mLock);
|
| D | WakeLockEntryList.h | 55 friend std::ostream& operator<<(std::ostream& out, const WakeLockEntryList& list);
60 void deleteEntry(std::list<WakeLockInfo>::iterator entry) REQUIRES(mStatsLock);
80 std::list<WakeLockInfo> mStats GUARDED_BY(mStatsLock);
81 std::unordered_map<std::pair<std::string, int>, std::list<WakeLockInfo>::iterator, LockHash>
|
| /system/bt/gd/facade/ |
| D | read_only_property_server.cc | 40 void ReadOnlyPropertyServerModule::ListDependencies(ModuleList* list) { in ListDependencies() argument
41 GrpcFacadeModule::ListDependencies(list); in ListDependencies()
42 list->add<hci::Controller>(); in ListDependencies()
|
| /system/bt/bta/gatt/ |
| D | database.h | 110 void Clear() { std::list<Service>().swap(services); } in Clear()
113 const std::list<Service>& Services() const { return services; } in Services()
128 std::list<Service> services;
133 Service* FindService(std::list<Service>& services, uint16_t handle);
|