Searched refs:entries (Results 1 - 16 of 16) sorted by relevance

/bionic/libc/kernel/uapi/linux/
H A Dnet_dropmon.h42 __u32 entries; member in struct:net_dm_config_msg
47 __u32 entries; member in struct:net_dm_alert_msg
H A Dvirtio_net.h122 __virtio32 entries; member in struct:virtio_net_ctrl_mac
H A Dkd.h84 struct unipair __user * entries; member in struct:unimapdesc
H A Dkvm.h862 struct kvm_irq_routing_entry entries[0]; member in struct:kvm_irq_routing
H A Dvideodev2.h1184 __u32 entries; member in struct:v4l2_enc_idx
/bionic/tests/libs/
H A Dbionic_tests_zipalign.cpp32 fprintf(stderr, " The new alignment of all entries in the new zip file.\n");
41 static bool GetEntries(ZipArchiveHandle handle, std::vector<ZipData>* entries) { argument
45 fprintf(stderr, "Unable to iterate over entries: %s\n", ErrorCodeString(return_value));
52 entries->push_back(std::make_pair(new ZipEntry(entry), new ZipString(name)));
55 fprintf(stderr, "Error while iterating over zip entries: %s\n", ErrorCodeString(return_value));
58 std::sort(entries->begin(), entries->end(),
67 std::vector<ZipData> entries; local
68 // We will not free the memory created in entries since the program
70 if (!GetEntries(handle, &entries)) {
[all...]
/bionic/tests/
H A Ddirent_test.cpp41 void ScanEntries(DirEntT** entries, int entry_count, argument
44 name_set.insert(entries[i]->d_name);
45 name_list.push_back(entries[i]->d_name);
46 free(entries[i]);
48 free(entries);
53 dirent** entries; local
54 int entry_count = scandir("/proc/self", &entries, NULL, alphasort);
61 // Turn the directory entries into a set and vector of the names.
64 ScanEntries(entries, entry_count, name_set, unsorted_name_list);
69 // All entries sorte
86 dirent** entries; local
117 dirent** entries; local
124 dirent64** entries; local
133 dirent** entries; local
143 dirent64** entries; local
[all...]
H A Dstdlib_test.cpp206 s entries[3]; local
207 strcpy(entries[0].name, "charlie");
208 strcpy(entries[1].name, "bravo");
209 strcpy(entries[2].name, "alpha");
211 qsort(entries, 3, sizeof(s), s::comparator);
212 ASSERT_STREQ("alpha", entries[0].name);
213 ASSERT_STREQ("bravo", entries[1].name);
214 ASSERT_STREQ("charlie", entries[2].name);
216 qsort(entries, 3, sizeof(s), s::comparator);
217 ASSERT_STREQ("alpha", entries[
[all...]
/bionic/libc/kernel/uapi/linux/netfilter_arp/
H A Darp_tables.h40 #define ARPT_ENTRY_ITERATE(entries,size,fn,args...) XT_ENTRY_ITERATE(struct arpt_entry, entries, size, fn, ##args)
121 struct arpt_entry entries[0]; member in struct:arpt_replace
/bionic/libc/kernel/uapi/linux/netfilter_ipv4/
H A Dip_tables.h61 #define IPT_ENTRY_ITERATE(entries,size,fn,args...) XT_ENTRY_ITERATE(struct ipt_entry, entries, size, fn, ##args)
139 struct ipt_entry entries[0]; member in struct:ipt_replace
/bionic/libc/kernel/uapi/linux/netfilter/
H A Dx_tables.h114 #define XT_ENTRY_ITERATE_CONTINUE(type,entries,size,n,fn,args...) \
115 ({ unsigned int __i, __n; int __ret = 0; type * __entry; for(__i = 0, __n = 0; __i < (size); __i += __entry->next_offset, __n ++) { __entry = (void *) (entries) + __i; if(__n < n) continue; __ret = fn(__entry, ##args); if(__ret != 0) break; } __ret; \
117 #define XT_ENTRY_ITERATE(type,entries,size,fn,args...) XT_ENTRY_ITERATE_CONTINUE(type, entries, size, 0, fn, args)
/bionic/libc/kernel/uapi/linux/netfilter_bridge/
H A Debtables.h51 char __user * entries; member in struct:ebt_replace
64 char * entries; member in struct:ebt_replace_kernel
169 #define EBT_ENTRY_ITERATE(entries,size,fn,args...) \
170 ({ unsigned int __i; int __ret = 0; struct ebt_entry * __entry; for(__i = 0; __i < (size);) { __entry = (void *) (entries) + __i; __ret = fn(__entry, ##args); if(__ret != 0) break; if(__entry->bitmask != 0) __i += __entry->next_offset; else __i += sizeof(struct ebt_entries); } if(__ret == 0) { if(__i != (size)) __ret = - EINVAL; } __ret; \
/bionic/libc/kernel/uapi/linux/netfilter_ipv6/
H A Dip6_tables.h61 #define IP6T_ENTRY_ITERATE(entries,size,fn,args...) XT_ENTRY_ITERATE(struct ip6t_entry, entries, size, fn, ##args)
162 struct ip6t_entry entries[0]; member in struct:ip6t_replace
/bionic/libc/kernel/uapi/asm-x86/asm/
H A Dkvm.h202 struct kvm_msr_entry entries[0]; member in struct:kvm_msrs
224 struct kvm_cpuid_entry entries[0]; member in struct:kvm_cpuid
246 struct kvm_cpuid_entry2 entries[0]; member in struct:kvm_cpuid2
/bionic/libc/
H A Dcrt.mk8 # entries in the .ctors section. (on ARM this is done through the
/bionic/libc/dns/resolv/
H A Dres_cache.c108 /* default number of entries kept in the cache. This value has been
1228 Entry* entries; member in struct:resolv_cache
1378 Entry** pnode = (Entry**) &cache->entries[nn];
1422 cache->entries = calloc(sizeof(*cache->entries), cache->max_entries);
1423 if (cache->entries) {
1522 Entry** pnode = (Entry**) &cache->entries[ index ];
1595 /* Remove all expired entries from the hash table.
1674 /* remove stale entries here */
1885 free(cache_info->cache->entries);
[all...]

Completed in 1156 milliseconds