| /bionic/libc/bionic/ |
| H A D | pthread_atfork.cpp | 89 atfork_t* entry = reinterpret_cast<atfork_t*>(malloc(sizeof(atfork_t))); local
90 if (entry == NULL) {
94 entry->prepare = prepare;
95 entry->parent = parent;
96 entry->child = child;
100 // Append 'entry' to the list.
101 entry->next = NULL;
102 entry->prev = g_atfork_list.last;
103 if (entry->prev != NULL) {
104 entry
[all...] |
| H A D | malloc_debug_leak.cpp | 81 HashEntry* entry; member in struct:AllocationEntry
111 HashEntry* entry = table->slots[slot]; local
112 while (entry != NULL) {
113 //debug_log("backtrace: %p, entry: %p entry->backtrace: %p\n",
114 // backtrace, entry, (entry != NULL) ? entry->backtrace : NULL);
116 * See if the entry matches exactly. We compare the "size" field,
119 if (entry
143 HashEntry* entry = find_entry(g_hash_table, slot, backtrace, numEntries, size); local
175 is_valid_entry(HashEntry* entry) argument
190 remove_entry(HashEntry* entry) argument
354 HashEntry* entry = header->entry; local
[all...] |
| H A D | scandir.cpp | 49 bool Add(dirent* entry) { argument
60 dirent* copy = CopyDirent(entry);
100 dirent* entry; local
101 while ((entry = reader.ReadEntry()) != NULL) {
103 if (filter != NULL && !(*filter)(entry)) {
106 names.Add(entry);
|
| H A D | dirent.cpp | 100 dirent* entry = d->next_; local
101 d->next_ = reinterpret_cast<dirent*>(reinterpret_cast<char*>(entry) + entry->d_reclen);
102 d->available_bytes_ -= entry->d_reclen;
103 return entry;
112 int readdir_r(DIR* d, dirent* entry, dirent** result) { argument
126 memcpy(entry, next, next->d_reclen);
127 *result = entry;
|
| H A D | system_properties_compat.c | 85 unsigned entry = *toc++; local
86 if(TOC_NAME_LEN(entry) != len) continue;
88 pi = TOC_TO_INFO(pa, entry);
127 unsigned entry = pa->toc[i]; local
128 prop_info_compat *pi = TOC_TO_INFO(pa, entry);
|
| H A D | malloc_debug_common.cpp | 36 // (to fill allocation entry hash table, for example). So, all relevant
165 // "*infoSize" is set to the size of a single entry
196 HashEntry* entry = g_hash_table.slots[i]; local
197 while (entry != NULL) {
198 list[index] = entry;
199 *totalMemory = *totalMemory + ((entry->size & ~SIZE_FLAG_MASK) * entry->allocations);
201 entry = entry->next;
223 HashEntry* entry local
[all...] |
| H A D | sysconf.cpp | 88 dirent* entry; local
89 while ((entry = reader.ReadEntry()) != NULL) {
90 if (entry->d_type == DT_DIR && __matches_cpuN(entry->d_name)) {
|
| /bionic/libc/upstream-netbsd/lib/libc/stdlib/ |
| H A D | insque.c | 43 insque(void *entry, void *pred) argument
45 struct qelem *e = (struct qelem *) entry;
|
| /bionic/libc/kernel/uapi/linux/ |
| H A D | flat.h | 27 unsigned long entry; member in struct:flat_hdr
|
| H A D | coff.h | 70 char entry[4]; member in struct:__anon239
|
| H A D | kvm.h | 1010 __u16 entry; member in struct:kvm_assigned_msix_entry
|
| H A D | videodev2.h | 1040 struct v4l2_enc_idx_entry entry[V4L2_ENC_IDX_ENTRIES]; member in struct:v4l2_enc_idx
|
| /bionic/linker/ |
| H A D | linked_list.h | 63 LinkedListEntry<T>* entry = head_; local
64 T* element = entry->element;
65 head_ = entry->next;
66 Allocator::free(entry);
|
| H A D | linker.h | 105 static void free(LinkedListEntry<soinfo>* entry);
118 ElfW(Addr) entry; member in struct:soinfo
|
| H A D | linker.cpp | 278 void SoinfoListAllocator::free(LinkedListEntry<soinfo>* entry) { argument
279 g_soinfo_links_allocator.free(entry);
339 /* prev will never be NULL, because the first entry in solist is
1507 PRINT("\"%s\": ignoring %zd-entry DT_PREINIT_ARRAY in shared library!",
1754 // Set the DT_DEBUG entry to the address of _r_debug for GDB
1852 // Set the DT_MIPS_RLD_MAP entry to the address of _r_debug for GDB.
1878 DEBUG("Unused DT entry: type %p arg %p",
2161 si->entry = args.getauxval(AT_ENTRY);
2164 * the first entry is the PHDR because this will not be true
2254 TRACE("[ Ready to execute '%s' @ %p ]", si->name, reinterpret_cast<void*>(si->entry));
[all...] |
| /bionic/libc/kernel/uapi/linux/netfilter/ |
| H A D | x_tables.h | 114 #define xt_ematch_foreach(pos, entry) for ((pos) = (struct xt_entry_match *)entry->elems; (pos) < (struct xt_entry_match *)((char *)(entry) + (entry)->target_offset); (pos) = (struct xt_entry_match *)((char *)(pos) + (pos)->u.match_size))
|
| /bionic/libc/kernel/uapi/linux/netfilter_ipv6/ |
| H A D | ip6_tables.h | 102 struct ip6t_entry entry; member in struct:ip6t_standard
107 struct ip6t_entry entry; member in struct:ip6t_error
112 #define IP6T_STANDARD_INIT(__verdict) { .entry = IP6T_ENTRY_INIT(sizeof(struct ip6t_standard)), .target = XT_TARGET_INIT(XT_STANDARD_TARGET, sizeof(struct xt_standard_target)), .target.verdict = -(__verdict) - 1, }
114 #define IP6T_ERROR_INIT { .entry = IP6T_ENTRY_INIT(sizeof(struct ip6t_error)), .target = XT_TARGET_INIT(XT_ERROR_TARGET, sizeof(struct xt_error_target)), .target.errorname = "ERROR", }
|
| /bionic/libc/kernel/uapi/xen/ |
| H A D | privcmd.h | 40 struct privcmd_mmap_entry __user *entry; member in struct:privcmd_mmap
|
| /bionic/libc/tzcode/ |
| H A D | localtime.c | 2217 struct index_entry_t* entry = (struct index_entry_t*) index; local
2220 memcpy(this_id, entry->buf, NAME_LENGTH);
2224 specific_zone_offset = ntohl(entry->start) + ntohl(header.data_offset);
2225 *data_size = ntohl(entry->length);
2229 ++entry;
|