| /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 | 41 void ScanEntries(DirEntT** entries, int entry_count, in ScanEntries() argument
44 name_set.insert(entries[i]->d_name); in ScanEntries()
45 name_list.push_back(entries[i]->d_name); in ScanEntries()
46 free(entries[i]); in ScanEntries()
48 free(entries); in ScanEntries()
53 dirent** entries; in TEST() local
54 int entry_count = scandir("/proc/self", &entries, nullptr, alphasort); in TEST()
64 ScanEntries(entries, entry_count, name_set, unsorted_name_list); in TEST()
86 dirent** entries; in TEST() local
87 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 | 415 s entries[3]; in TEST() local
416 strcpy(entries[0].name, "charlie"); in TEST()
417 strcpy(entries[1].name, "bravo"); in TEST()
418 strcpy(entries[2].name, "alpha"); in TEST()
420 qsort(entries, 3, sizeof(s), s::comparator); in TEST()
421 ASSERT_STREQ("alpha", entries[0].name); in TEST()
422 ASSERT_STREQ("bravo", entries[1].name); in TEST()
423 ASSERT_STREQ("charlie", entries[2].name); in TEST()
425 qsort(entries, 3, sizeof(s), s::comparator); in TEST()
426 ASSERT_STREQ("alpha", entries[0].name); in TEST()
[all …]
|
| /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/kernel/uapi/linux/netfilter_bridge/ |
| D | ebtables.h | 48 char __user * 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_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[0]; member
|
| /bionic/libc/private/ |
| D | bionic_fdsan.h | 47 FdEntry entries[0]; member
57 FdEntry entries[inline_fds]; member
|
| /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[0]; 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[0]; member
|
| /bionic/libc/kernel/uapi/linux/ |
| D | net_dropmon.h | 38 __u32 entries; member
42 __u32 entries; member
|
| D | xdp_diag.h | 59 __u32 entries; member
|
| D | kd.h | 71 struct unipair __user * entries; member
|
| D | virtio_net.h | 152 __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/libc/kernel/uapi/asm-x86/asm/ |
| D | kvm.h | 168 struct kvm_msr_entry entries[0]; member
185 struct kvm_cpuid_entry entries[0]; member
203 struct kvm_cpuid_entry2 entries[0]; member
|
| /bionic/libc/bionic/ |
| D | fdsan.cpp | 59 return &entries[idx]; in at()
107 return &local_overflow->entries[offset]; in at()
|
| /bionic/libc/dns/resolv/ |
| D | res_cache.c | 1284 Entry* entries; member
1434 Entry** pnode = (Entry**) &cache->entries[nn]; in _cache_flush_locked()
1478 cache->entries = calloc(sizeof(*cache->entries), cache->max_entries); in _resolv_cache_create()
1479 if (cache->entries) { in _resolv_cache_create()
1578 Entry** pnode = (Entry**) &cache->entries[ index ]; in _cache_lookup_p()
1934 free(cache_info->cache->entries); in _resolv_delete_cache_for_net()
|
| /bionic/ |
| D | android-changes-for-ndk-developers.md | 91 to dlopen(3) (as opposed to being referenced by DT_NEEDED entries).
115 tried to load both. This also applied to DT_NEEDED entries.
117 Some apps have bad DT_NEEDED entries (usually absolute paths on the build
157 System.loadLibrary, DT_NEEDED entries, and direct calls to dlopen(3)
287 While library dependencies (DT_NEEDED entries in the ELF headers) can be
301 DT_NEEDED entries that point to a file on the build host, something that
345 configured your build system to generate incorrect SONAME entries (using
362 will be searched to resolve DT_NEEDED entries. The string `${ORIGIN}` will
|
| /bionic/libc/kernel/uapi/linux/raid/ |
| D | md_p.h | 246 struct ppl_header_entry entries[PPL_HDR_MAX_ENTRIES]; member
|