| /bionic/benchmarks/ |
| D | malloc_sql_benchmark.cpp | 53 void BenchmarkMalloc(MallocEntry entries[], size_t total_entries, size_t max_allocs) { in BenchmarkMalloc() argument
57 switch (entries[i].type) { in BenchmarkMalloc()
59 ptrs[entries[i].idx] = malloc(entries[i].size); in BenchmarkMalloc()
62 reinterpret_cast<uint8_t*>(ptrs[entries[i].idx])[0] = 10; in BenchmarkMalloc()
65 ptrs[entries[i].idx] = calloc(entries[i].arg2, entries[i].size); in BenchmarkMalloc()
68 reinterpret_cast<uint8_t*>(ptrs[entries[i].idx])[0] = 20; in BenchmarkMalloc()
71 ptrs[entries[i].idx] = memalign(entries[i].arg2, entries[i].size); in BenchmarkMalloc()
74 reinterpret_cast<uint8_t*>(ptrs[entries[i].idx])[0] = 30; in BenchmarkMalloc()
77 if (entries[i].arg2 == 0) { in BenchmarkMalloc()
78 ptrs[entries[i].idx] = realloc(nullptr, entries[i].size); in BenchmarkMalloc()
[all …]
|
| /bionic/tests/ |
| D | dirent_test.cpp | 42 void ScanEntries(DirEntT** entries, int entry_count, in ScanEntries() argument
45 name_set.insert(entries[i]->d_name); in ScanEntries()
46 name_list.push_back(entries[i]->d_name); in ScanEntries()
47 free(entries[i]); in ScanEntries()
49 free(entries); in ScanEntries()
54 dirent** entries; in TEST() local
55 int entry_count = scandir("/proc/self", &entries, nullptr, alphasort); in TEST()
65 ScanEntries(entries, entry_count, name_set, unsorted_name_list); in TEST()
88 dirent** entries; in TEST() local
89 int entry_count = scandir("/proc/self", &entries, nullptr, alphasort); in TEST()
[all …]
|
| D | link_test.cpp | 256 eit_entry_t* entries = reinterpret_cast<eit_entry_t*>(dl_unwind_find_exidx( in TEST() local
258 ASSERT_TRUE(entries != nullptr); in TEST()
266 ASSERT_TRUE((entries[i].one & (1<<31)) == 0); in TEST()
268 uintptr_t exidx_func = read_exidx_func(&entries[i].one); in TEST()
276 EXPECT_GE(exidx_func, read_exidx_func(&entries[i - 1].one)) << i; in TEST()
|
| D | stdlib_test.cpp | 417 s entries[3]; in TEST() local
418 strcpy(entries[0].name, "charlie"); in TEST()
419 strcpy(entries[1].name, "bravo"); in TEST()
420 strcpy(entries[2].name, "alpha"); in TEST()
422 qsort(entries, 3, sizeof(s), s::comparator); in TEST()
423 ASSERT_STREQ("alpha", entries[0].name); in TEST()
424 ASSERT_STREQ("bravo", entries[1].name); in TEST()
425 ASSERT_STREQ("charlie", entries[2].name); in TEST()
427 qsort(entries, 3, sizeof(s), s::comparator); in TEST()
428 ASSERT_STREQ("alpha", entries[0].name); in TEST()
[all …]
|
| D | search_test.cpp | 297 std::vector<char*> entries; in TEST() local
305 entries.push_back(p); in TEST()
309 for (auto& p : entries) { in TEST()
314 for (auto& p : entries) free(p); in TEST()
|
| /bionic/tests/libs/ |
| D | bionic_tests_zipalign.cpp | 42 static bool GetEntries(ZipArchiveHandle handle, std::vector<ZipData>* entries) { in GetEntries() argument
53 entries->emplace_back(std::make_pair(std::make_unique<ZipEntry>(entry), name)); in GetEntries()
59 std::sort(entries->begin(), entries->end(), in GetEntries()
68 std::vector<ZipData> entries; in CreateAlignedZip() local
71 if (!GetEntries(handle, &entries)) { in CreateAlignedZip()
78 for (auto& entry : entries) { in CreateAlignedZip()
|
| /bionic/libc/upstream-freebsd/lib/libc/stdlib/ |
| D | hsearch_r.c | 49 ENTRY *entry = &hsearch->entries[index & hsearch->index_mask]; in hsearch_lookup_free()
90 entry = &hsearch->entries[index & hsearch->index_mask]; in hsearch_r()
108 old_entries = hsearch->entries; in hsearch_r()
120 hsearch->entries = new_entries; in hsearch_r()
|
| D | hcreate_r.c | 48 hsearch->entries = calloc(16, sizeof(ENTRY)); in hcreate_r()
49 if (hsearch->entries == NULL) { in hcreate_r()
|
| D | hsearch.h | 37 ENTRY *entries; /* Hash table entries. */ member
|
| D | hdestroy_r.c | 41 free(hsearch->entries); in hdestroy_r()
|
| /bionic/libc/kernel/uapi/linux/netfilter/ |
| D | x_tables.h | 96 #define XT_ENTRY_ITERATE_CONTINUE(type,entries,size,n,fn,args...) \ argument
97 …__i < (size); __i += __entry->next_offset, __n ++) { __entry = (void *) (entries) + __i; if(__n < …
99 #define XT_ENTRY_ITERATE(type,entries,size,fn,args...) XT_ENTRY_ITERATE_CONTINUE(type, entries, siz… argument
|
| /bionic/libc/private/ |
| D | bionic_fdsan.h | 47 FdEntry entries[0]; member
57 FdEntry entries[inline_fds]; member
|
| /bionic/libc/kernel/uapi/linux/netfilter_arp/ |
| D | arp_tables.h | 37 #define ARPT_ENTRY_ITERATE(entries,size,fn,args...) XT_ENTRY_ITERATE(struct arpt_entry, entries, si… argument
102 struct arpt_entry entries[]; member
|
| /bionic/libc/kernel/uapi/linux/netfilter_bridge/ |
| D | ebtables.h | 48 char * entries; member
58 char * entries; member
152 #define EBT_ENTRY_ITERATE(entries,size,fn,args...) \ argument
153 …t ebt_entry * __entry; for(__i = 0; __i < (size);) { __entry = (void *) (entries) + __i; __ret = f…
|
| /bionic/libc/kernel/uapi/linux/netfilter_ipv4/ |
| D | ip_tables.h | 54 #define IPT_ENTRY_ITERATE(entries,size,fn,args...) XT_ENTRY_ITERATE(struct ipt_entry, entries, size… argument
116 struct ipt_entry entries[]; member
|
| /bionic/libc/kernel/uapi/linux/netfilter_ipv6/ |
| D | ip6_tables.h | 54 #define IP6T_ENTRY_ITERATE(entries,size,fn,args...) XT_ENTRY_ITERATE(struct ip6t_entry, entries, si… argument
136 struct ip6t_entry entries[]; member
|
| /bionic/libc/kernel/uapi/linux/ |
| D | net_dropmon.h | 38 __u32 entries; member
42 __u32 entries; member
|
| D | xdp_diag.h | 61 __u32 entries; member
|
| D | kd.h | 71 struct unipair * entries; member
|
| D | virtio_net.h | 157 __virtio32 entries; member
|
| /bionic/libc/malloc_debug/ |
| D | README_api.md | 20 *backtrace\_size* is set to the maximum number of backtrace entries
45 of backtrace entries is less than *backtrace\_size*, the rest of the
46 entries are zero.
|
| /bionic/linker/ |
| D | linker_note_gnu_property_test.cpp | 114 ++entries; in push()
137 dump_member("entries ", entries); in dump()
138 if (entries > 0) { in dump()
176 size_t entries = 0; member in GnuPropertySectionBuilder
|
| /bionic/libc/kernel/uapi/rdma/ |
| D | mana-abi.h | 60 struct rss_resp_entry entries[64]; member
|
| /bionic/libc/kernel/uapi/asm-x86/asm/ |
| D | kvm.h | 174 struct kvm_msr_entry entries[]; member
209 struct kvm_cpuid_entry entries[]; member
227 struct kvm_cpuid_entry2 entries[]; member
|
| /bionic/libc/bionic/ |
| D | fdsan.cpp | 59 return &entries[idx]; in at()
107 return &local_overflow->entries[offset]; in at()
|