| /bionic/libc/bionic/ |
| H A D | flistxattr.cpp | 9 * notice, this list of conditions and the following disclaimer.
11 * notice, this list of conditions and the following disclaimer in
38 ssize_t flistxattr(int fd, char *list, size_t size) { argument
40 ssize_t result = ___flistxattr(fd, list, size);
58 return listxattr(buf, list, size);
|
| H A D | net_if.cpp | 9 * notice, this list of conditions and the following disclaimer.
11 * notice, this list of conditions and the following disclaimer in
80 if_list(if_list** list) { argument
81 // push_front onto `list`.
82 next = *list;
83 *list = this;
86 static void Free(if_list* list, bool names_too) { argument
87 while (list) {
88 if_list* it = list;
89 list
97 if_list** list = reinterpret_cast<if_list**>(context); local
118 if_list* list = nullptr; local
[all...] |
| H A D | ifaddrs.cpp | 9 * notice, this list of conditions and the following disclaimer.
11 * notice, this list of conditions and the following disclaimer in
62 ifaddrs_storage(ifaddrs** list) { argument
65 // push_front onto `list`.
66 ifa.ifa_next = *list;
67 *list = reinterpret_cast<ifaddrs*>(this);
237 // We construct the result directly into `out`, so terminate the list.
254 void freeifaddrs(ifaddrs* list) { argument
255 while (list != nullptr) {
256 ifaddrs* current = list;
[all...] |
| H A D | system_properties.cpp | 9 * notice, this list of conditions and the following disclaimer.
11 * notice, this list of conditions and the following disclaimer in
689 static inline void list_add(List** list, Args... args) { argument
690 *list = new List(*list, args...);
693 static void list_add_after_len(prefix_node** list, const char* prefix, context_node* context) { argument
696 auto next_list = list;
709 static void list_foreach(List* list, Func func) { argument
710 while (list) {
711 func(list);
717 list_find(List* list, Func func) argument
728 list_free(List** list) argument
[all...] |
| /bionic/tests/ |
| H A D | net_if_test.cpp | 40 struct if_nameindex* list = if_nameindex(); local
41 ASSERT_TRUE(list != nullptr);
43 ASSERT_TRUE(list->if_index != 0);
48 for (struct if_nameindex* it = list; it->if_index != 0; ++it) {
56 if_freenameindex(list);
|
| /bionic/linker/tests/ |
| H A D | linked_list_test.cpp | 49 std::string test_list_to_string(test_list_t& list) { argument
51 list.for_each([&] (const char* c) {
62 test_list_t list; local
63 ASSERT_EQ("", test_list_to_string(list));
66 list.push_front("a");
69 ASSERT_EQ("a", test_list_to_string(list));
70 list.push_front("b");
71 ASSERT_EQ("ba", test_list_to_string(list));
72 list.push_front("c");
73 list
100 test_list_t list; local
120 test_list_t list; local
137 test_list_t list; local
154 test_list_t list; local
199 test_list_t list; local
[all...] |
| /bionic/libc/malloc_debug/ |
| H A D | TrackData.cpp | 9 * notice, this list of conditions and the following disclaimer.
11 * notice, this list of conditions and the following disclaimer in
47 void TrackData::GetList(std::vector<const Header*>* list) { argument
51 list->push_back(header);
55 std::sort(list->begin(), list->end(), [](const Header* a, const Header* b) {
95 std::vector<const Header*> list; local
96 GetList(&list);
99 for (const auto& header : list) {
101 header->real_size(), debug.GetPointer(header), ++track_count, list
129 std::vector<const Header*> list; local
[all...] |
| /bionic/libc/kernel/uapi/linux/ |
| H A D | futex.h | 64 struct robust_list list; member in struct:robust_list_head
|
| /bionic/libc/kernel/uapi/drm/ |
| H A D | drm.h | 245 struct drm_buf_desc __user * list; member in struct:drm_buf_info
250 int __user * list; member in struct:drm_buf_free
264 struct drm_buf_pub __user * list; member in struct:drm_buf_map
|