Home
last modified time | relevance | path

Searched refs:list (Results 1 – 25 of 38) sorted by relevance

12

/bionic/linker/
Dlinked_list_test.cpp61 std::string test_list_to_string(test_list_t& list) { in test_list_to_string() argument
63 list.for_each([&] (const char* c) { in test_list_to_string()
74 test_list_t list; in TEST() local
75 ASSERT_EQ("", test_list_to_string(list)); in TEST()
78 list.push_front("a"); in TEST()
81 ASSERT_EQ("a", test_list_to_string(list)); in TEST()
82 list.push_front("b"); in TEST()
83 ASSERT_EQ("ba", test_list_to_string(list)); in TEST()
84 list.push_front("c"); in TEST()
85 list.push_front("d"); in TEST()
[all …]
Dldd.sh16 linker --list "$1"
19 linker64 --list "$1"
DNOTICE8 notice, this list of conditions and the following disclaimer.
10 notice, this list of conditions and the following disclaimer in
36 notice, this list of conditions and the following disclaimer.
38 notice, this list of conditions and the following disclaimer in
64 notice, this list of conditions and the following disclaimer.
66 notice, this list of conditions and the following disclaimer in
92 notice, this list of conditions and the following disclaimer.
94 notice, this list of conditions and the following disclaimer in
120 notice, this list of conditions and the following disclaimer.
122 notice, this list of conditions and the following disclaimer in
[all …]
Dld.config.format.md42 # namespace. The default namespace is the namespace for the main executable. This list is
65 # This declares linked namespaces - comma separated list.
68 # For every link define list of shared libraries. This is list of the libraries accessible from
/bionic/libc/upstream-netbsd/lib/libc/include/isc/
Dlist.h25 #define INIT_LIST(list) \ argument
26 do { (list).head = NULL; (list).tail = NULL; } while (/*CONSTCOND*/0)
39 #define HEAD(list) ((list).head) argument
40 #define TAIL(list) ((list).tail) argument
41 #define EMPTY(list) ((list).head == NULL) argument
43 #define PREPEND(list, elt, link) \ argument
46 if ((list).head != NULL) \
47 (list).head->link.prev = (elt); \
49 (list).tail = (elt); \
51 (elt)->link.next = (list).head; \
[all …]
/bionic/libc/bionic/
Dnet_if.cpp70 explicit if_list(if_list** list) { in if_list()
72 next = *list; in if_list()
73 *list = this; in if_list()
76 static void Free(if_list* list, bool names_too) { in Free()
77 while (list) { in Free()
78 if_list* it = list; in Free()
79 list = it->next; in Free()
87 if_list** list = reinterpret_cast<if_list**>(context); in __if_nameindex_callback() local
92 if_list* new_link = new if_list(list); in __if_nameindex_callback()
108 if_list* list = nullptr; in if_nameindex() local
[all …]
Dflistxattr.cpp40 ssize_t flistxattr(int fd, char* list, size_t size) { in flistxattr() argument
42 ssize_t result = __flistxattr(fd, list, size); in flistxattr()
57 return listxattr(FdPath(fd).c_str(), list, size); in flistxattr()
Difaddrs.cpp64 explicit ifaddrs_storage(ifaddrs** list) { in ifaddrs_storage()
68 ifa.ifa_next = *list; in ifaddrs_storage()
69 *list = reinterpret_cast<ifaddrs*>(this); in ifaddrs_storage()
251 static void resolve_or_remove_nameless_interfaces(ifaddrs** list) { in resolve_or_remove_nameless_interfaces() argument
252 ifaddrs_storage* addr = reinterpret_cast<ifaddrs_storage*>(*list); in resolve_or_remove_nameless_interfaces()
267 *list = next_addr; in resolve_or_remove_nameless_interfaces()
280 static void get_interface_flags_via_ioctl(ifaddrs** list) { in get_interface_flags_via_ioctl() argument
289 for (ifaddrs_storage* addr = reinterpret_cast<ifaddrs_storage*>(*list); addr != nullptr; in get_interface_flags_via_ioctl()
339 void freeifaddrs(ifaddrs* list) { in freeifaddrs() argument
340 while (list != nullptr) { in freeifaddrs()
[all …]
Dlibc_init_static.cpp68 static void call_array(init_func_t** list, int argc, char* argv[], char* envp[]) { in call_array() argument
70 while (*++list) { in call_array()
71 (*list)(argc, argv, envp); in call_array()
/bionic/libc/system_properties/
Dcontexts_split.cpp69 static inline void ListAdd(List** list, Args... args) { in ListAdd() argument
70 *list = new List(*list, args...); in ListAdd()
73 static void ListAddAfterLen(PrefixNode** list, const char* prefix, ContextListNode* context) { in ListAddAfterLen() argument
76 auto next_list = list; in ListAddAfterLen()
89 static void ListForEach(List* list, Func func) { in ListForEach() argument
90 while (list) { in ListForEach()
91 func(list); in ListForEach()
92 list = list->next; in ListForEach()
97 static List* ListFind(List* list, Func func) { in ListFind() argument
98 while (list) { in ListFind()
[all …]
/bionic/tests/
Dnet_if_test.cpp40 struct if_nameindex* list = if_nameindex(); in TEST() local
41 ASSERT_TRUE(list != nullptr); in TEST()
43 ASSERT_TRUE(list->if_index != 0); in TEST()
48 for (struct if_nameindex* it = list; it->if_index != 0; ++it) { in TEST()
56 if_freenameindex(list); in TEST()
DNOTICE40 notice, this list of conditions and the following disclaimer.
42 notice, this list of conditions and the following disclaimer in
100 notice, this list of conditions and the following disclaimer.
102 notice, this list of conditions and the following disclaimer in
144 notice, this list of conditions and the following disclaimer.
146 notice, this list of conditions and the following disclaimer in
188 notice, this list of conditions and the following disclaimer.
190 notice, this list of conditions and the following disclaimer in
232 notice, this list of conditions and the following disclaimer.
234 notice, this list of conditions and the following disclaimer in
[all …]
/bionic/libc/malloc_debug/
DPointerData.cpp385 void PointerData::GetList(std::vector<ListInfoType>* list, bool only_with_backtrace) in GetList() argument
417 list->emplace_back(ListInfoType{entry.first, 1, entry.second.RealSize(), in GetList()
422 std::sort(list->begin(), list->end(), [](const ListInfoType& a, const ListInfoType& b) { in GetList()
457 void PointerData::GetUniqueList(std::vector<ListInfoType>* list, bool only_with_backtrace) in GetUniqueList() argument
459 GetList(list, only_with_backtrace); in GetUniqueList()
462 for (auto iter = list->begin(); iter != list->end();) { in GetUniqueList()
467 for (; dup_iter != list->end(); ++dup_iter) { in GetUniqueList()
474 iter = list->erase(iter + 1, dup_iter); in GetUniqueList()
479 std::vector<ListInfoType> list; in LogLeaks() local
483 GetList(&list, false); in LogLeaks()
[all …]
DPointerData.h153 static void GetAllocList(std::vector<ListInfoType>* list);
168 static void GetList(std::vector<ListInfoType>* list, bool only_with_backtrace);
169 static void GetUniqueList(std::vector<ListInfoType>* list, bool only_with_backtrace);
DREADME_marshmallow_and_earlier.md59 entry is returned in the list.
88 a list of freed allocations. In addition to being added to the list, the
93 When the list of freed allocations reaches 100, the oldest allocation
94 on the list is removed and verified that it still contains the pattern 0xef.
/bionic/libc/kernel/tools/
Dkernel.py133 list = cpp.BlockParser().parseFile(path)
134 if list:
140 list.optimizeMacros(macros)
141 list.optimizeIf01()
142 includes = list.findIncludes()
/bionic/libm/
DNOTICE193 notice, this list of conditions and the following disclaimer.
195 notice, this list of conditions and the following disclaimer in the
235 notice, this list of conditions and the following disclaimer.
237 notice, this list of conditions and the following disclaimer in
263 notice, this list of conditions and the following disclaimer.
265 notice, this list of conditions and the following disclaimer in
291 notice, this list of conditions and the following disclaimer.
293 notice, this list of conditions and the following disclaimer in the
320 notice, this list of conditions and the following disclaimer.
322 notice, this list of conditions and the following disclaimer in the
[all …]
/bionic/libfdtrack/
DNOTICE8 notice, this list of conditions and the following disclaimer.
10 notice, this list of conditions and the following disclaimer in
36 notice, this list of conditions and the following disclaimer.
38 notice, this list of conditions and the following disclaimer in
/bionic/libc/
DNOTICE8 notice, this list of conditions and the following disclaimer.
10 notice, this list of conditions and the following disclaimer in the
34 notice, this list of conditions and the following disclaimer.
36 notice, this list of conditions and the following disclaimer in the
76 notice, this list of conditions and the following disclaimer.
78 notice, this list of conditions and the following disclaimer in the
105 notice, this list of conditions and the following disclaimer.
107 notice, this list of conditions and the following disclaimer in the
184 notice, this list of conditions and the following disclaimer.
186 notice, this list of conditions and the following disclaimer in
[all …]
/bionic/libc/kernel/uapi/linux/
Dudmabuf.h39 struct udmabuf_create_item list[]; member
Dfutex.h55 struct robust_list list; member
/bionic/benchmarks/linker_relocation/
DAndroid.bp8 // notice, this list of conditions and the following disclaimer.
10 // notice, this list of conditions and the following disclaimer in
38 // into the testcases/linker_reloc_bench directory. The obvious way to do that is to list each
/bionic/libc/malloc_debug/tests/
Dmalloc_debug_system_tests.cpp161 logger_list* list; in GetLogStr() local
162 list = android_logger_list_open(log, ANDROID_LOG_NONBLOCK, 1000, pid); in GetLogStr()
163 ASSERT_TRUE(list != nullptr); in GetLogStr()
167 ssize_t actual = android_logger_list_read(list, &msg); in GetLogStr()
194 android_logger_list_close(list); in GetLogStr()
/bionic/benchmarks/
DNOTICE88 notice, this list of conditions and the following disclaimer.
90 notice, this list of conditions and the following disclaimer in
132 notice, this list of conditions and the following disclaimer.
134 notice, this list of conditions and the following disclaimer in
160 notice, this list of conditions and the following disclaimer.
162 notice, this list of conditions and the following disclaimer in
/bionic/benchmarks/spawn/
DAndroid.bp9 // notice, this list of conditions and the following disclaimer.
11 // notice, this list of conditions and the following disclaimer in

12