Home
last modified time | relevance | path

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

12

/bionic/linker/tests/
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 …]
/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.cpp80 explicit if_list(if_list** list) { in if_list()
82 next = *list; in if_list()
83 *list = this; in if_list()
86 static void Free(if_list* list, bool names_too) { in Free()
87 while (list) { in Free()
88 if_list* it = list; in Free()
89 list = it->next; in Free()
97 if_list** list = reinterpret_cast<if_list**>(context); in __if_nameindex_callback() local
102 if_list* new_link = new if_list(list); in __if_nameindex_callback()
118 if_list* list = nullptr; in if_nameindex() local
[all …]
Dflistxattr.cpp38 ssize_t flistxattr(int fd, char *list, size_t size) { in flistxattr() argument
40 ssize_t result = ___flistxattr(fd, list, size); in flistxattr()
58 return listxattr(buf, list, size); in flistxattr()
Dlibc_init_static.cpp49 static void call_array(void(**list)()) { in call_array() argument
51 while (*++list) { in call_array()
52 (*list)(); in call_array()
Difaddrs.cpp62 explicit ifaddrs_storage(ifaddrs** list) { in ifaddrs_storage()
66 ifa.ifa_next = *list; in ifaddrs_storage()
67 *list = reinterpret_cast<ifaddrs*>(this); in ifaddrs_storage()
254 void freeifaddrs(ifaddrs* list) { in freeifaddrs() argument
255 while (list != nullptr) { in freeifaddrs()
256 ifaddrs* current = list; in freeifaddrs()
257 list = list->ifa_next; in freeifaddrs()
Dsystem_properties.cpp742 static inline void list_add(List** list, Args... args) { in list_add() argument
743 *list = new List(*list, args...); in list_add()
746 static void list_add_after_len(prefix_node** list, const char* prefix, context_node* context) { in list_add_after_len() argument
749 auto next_list = list; in list_add_after_len()
762 static void list_foreach(List* list, Func func) { in list_foreach() argument
763 while (list) { in list_foreach()
764 func(list); in list_foreach()
765 list = list->next; in list_foreach()
770 static List* list_find(List* list, Func func) { in list_find() argument
771 while (list) { in list_find()
[all …]
/bionic/libc/malloc_debug/
DTrackData.cpp50 void TrackData::GetList(std::vector<const Header*>* list) { in GetList() argument
52 list->push_back(header); in GetList()
56 std::sort(list->begin(), list->end(), [](const Header* a, const Header* b) { in GetList()
88 std::vector<const Header*> list; in DisplayLeaks() local
89 GetList(&list); in DisplayLeaks()
92 for (const auto& header : list) { in DisplayLeaks()
94 header->real_size(), debug_->GetPointer(header), ++track_count, list.size()); in DisplayLeaks()
122 std::vector<const Header*> list; in GetInfo() local
123 GetList(&list); in GetInfo()
127 for (const auto& header : list) { in GetInfo()
DTrackData.h52 void GetList(std::vector<const Header*>* list);
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.
DREADME.md154 a list of freed allocations. In addition to being added to the list, the
163 When the list is full, an allocation is removed from the list and is
165 being placed on the list. When the program terminates, all of the allocations
166 left on the list are verified.
169 in the list. The default is to record 100 freed allocations, the max
/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()
/bionic/libc/include/sys/
Dxattr.h49 ssize_t listxattr(const char* path, char* list, size_t size) __INTRODUCED_IN(16);
50 ssize_t llistxattr(const char* path, char* list, size_t size) __INTRODUCED_IN(16);
51 ssize_t flistxattr(int fd, char* list, size_t size) __INTRODUCED_IN(16);
/bionic/tools/bionicbb/
Dgmail.py62 response = service.users().messages().list(
68 response = service.users().messages().list(
Dtasks.py94 labels = gmail_service.users().labels().list(userId='me').execute()
/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/linker/
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 accessilbe from
DAndroid.bp106 // to the list of static libraries which needs to be
133 // Important: The liblinker_malloc should be the last library in the list
/bionic/libc/
DNOTICE7 notice, this list of conditions and the following disclaimer.
9 notice, this list of conditions and the following disclaimer in the
38 notice, this list of conditions and the following disclaimer.
40 notice, this list of conditions and the following disclaimer in the
67 notice, this list of conditions and the following disclaimer.
69 notice, this list of conditions and the following disclaimer in the
93 notice, this list of conditions and the following disclaimer.
95 notice, this list of conditions and the following disclaimer in the
259 notice, this list of conditions and the following disclaimer.
261 notice, this list of conditions and the following disclaimer in the
[all …]
DSECCOMP_BLACKLIST.TXT20 # - alias_list is optional comma separated list of function aliases
/bionic/tools/relocation_packer/
DLICENSE8 // notice, this list of conditions and the following disclaimer.
10 // copyright notice, this list of conditions and the following disclaimer
/bionic/libc/kernel/uapi/linux/
Dfutex.h64 struct robust_list list; member
/bionic/libc/kernel/uapi/drm/
Ddrm.h249 struct drm_buf_desc __user * list; member
254 int __user * list; member
272 struct drm_buf_pub __user * list; member
/bionic/libc/tools/
Dgenseccomp.py64 return list(set(names))
/bionic/libc/kernel/
DREADME.TXT82 Finally, run this command to regenerate the syscalls list:

12