/bionic/libc/tzcode/ |
H A D | bionic.cpp | 166 index_entry_t* entry = reinterpret_cast<index_entry_t*>(index); local 169 memcpy(this_id, entry->buf, NAME_LENGTH); 173 specific_zone_offset = ntohl(entry->start) + ntohl(header.data_offset); 174 *entry_length = ntohl(entry->length); 178 ++entry;
|
/bionic/libc/upstream-freebsd/lib/libc/stdlib/ |
H A D | hsearch_r.c | 39 * Look up an unused entry in the hash table for a given hash. For this 49 ENTRY *entry = &hsearch->entries[index & hsearch->index_mask]; local 50 if (entry->key == NULL) 51 return (entry); 79 ENTRY *entry, *old_entries, *new_entries; local 86 * Search the hash table for an existing entry for this key. 87 * Stop searching if we run into an unused hash table entry. 90 entry = &hsearch->entries[index & hsearch->index_mask]; 91 if (entry->key == NULL) 93 if (strcmp(entry [all...] |
/bionic/libc/upstream-openbsd/lib/libc/stdlib/ |
H A D | insque.c | 40 insque(void *entry, void *pred) argument 42 struct qelem *e = entry;
|
/bionic/linker/ |
H A D | linked_list.h | 45 explicit LinkedListIterator(LinkedListEntry<T>* entry) : entry_(entry) {} argument 120 LinkedListEntry<T>* entry = head_; local 121 T* element = entry->element; 122 head_ = entry->next; 123 Allocator::free(entry);
|
H A D | linker.cpp | 284 void SoinfoListAllocator::free(LinkedListEntry<soinfo>* entry) { argument 285 g_soinfo_links_allocator.free(entry); 292 void NamespaceListAllocator::free(LinkedListEntry<android_namespace_t>* entry) { argument 293 g_namespace_list_allocator.free(entry); 983 ZipEntry entry; local 985 if (FindEntry(handle, ZipString(file_path), &entry) != 0) { 992 if (entry.method != kCompressStored || (entry.offset % PAGE_SIZE) != 0) { 997 *file_offset = entry.offset; 1116 "library \"%s\" has invalid DT_NEEDED entry \" [all...] |
/bionic/tests/libs/ |
H A D | bionic_tests_zipalign.cpp | 50 ZipEntry entry; local 52 while ((return_value = Next(cookie, &entry, &name)) == 0) { 53 entries->emplace_back(std::make_pair(std::make_unique<ZipEntry>(entry), 79 for (auto& entry : entries) { 80 ZipEntry* zip_entry = entry.first.get(); 81 ZipString* zip_str = entry.second.get(); 104 fprintf(stderr, "Failed to verify zip stream writer entry.\n");
|
/bionic/tests/ |
H A D | link_test.cpp | 71 static uintptr_t read_exidx_func(uintptr_t* entry) { argument 72 int32_t offset = *entry; 77 return reinterpret_cast<uintptr_t>(entry) + offset;
|
H A D | mntent_test.cpp | 29 struct mntent entry; local 31 while (getmntent_r(fp, &entry, buf, sizeof(buf)) != NULL) { 32 if (strcmp(entry.mnt_fsname, "proc") == 0 && strcmp(entry.mnt_dir, "/proc") == 0) {
|
/bionic/libc/bionic/ |
H A D | dirent.cpp | 115 dirent* entry = d->next_; local 116 d->next_ = reinterpret_cast<dirent*>(reinterpret_cast<char*>(entry) + entry->d_reclen); 117 d->available_bytes_ -= entry->d_reclen; 118 // The directory entry offset uses 0, 1, 2 instead of real file offset, 120 d->current_pos_ = static_cast<long>(entry->d_off); 121 return entry; 131 int readdir_r(DIR* d, dirent* entry, dirent** result) { argument 147 memcpy(entry, next, next->d_reclen); 148 *result = entry; [all...] |
H A D | pthread_atfork.cpp | 64 void push_back(atfork_t* entry) { argument 65 entry->next = nullptr; 66 entry->prev = last_; 67 if (entry->prev != nullptr) { 68 entry->prev->next = entry; 71 first_ = entry; 73 last_ = entry; 81 atfork_t* entry = it; local 83 remove(entry); 91 remove(atfork_t* entry) argument 157 atfork_t* entry = reinterpret_cast<atfork_t*>(malloc(sizeof(atfork_t))); local [all...] |
H A D | scandir.cpp | 52 bool Add(dirent* entry) { argument 64 dirent* copy = CopyDirent(entry); 115 dirent* entry; local 116 while ((entry = reader.ReadEntry()) != nullptr) { 118 if (filter != nullptr && !(*filter)(entry)) { 121 names.Add(entry);
|
H A D | sysinfo.cpp | 55 dirent* entry; local 56 while ((entry = reader.ReadEntry()) != NULL) { 57 if (entry->d_type == DT_DIR && __matches_cpuN(entry->d_name)) {
|
/bionic/libc/include/ |
H A D | search.h | 20 typedef struct entry { struct
|
/bionic/libc/kernel/uapi/linux/ |
H A D | coff.h | 59 char entry[4]; member in struct:__anon352
|
H A D | flat.h | 26 unsigned long entry; member in struct:flat_hdr
|
H A D | kvm.h | 1074 __u16 entry; member in struct:kvm_assigned_msix_entry
|
H A D | mpls.h | 24 __be32 entry; member in struct:mpls_label
|
H A D | videodev2.h | 1010 struct v4l2_enc_idx_entry entry[V4L2_ENC_IDX_ENTRIES]; member in struct:v4l2_enc_idx
|
/bionic/libc/kernel/uapi/linux/netfilter_ipv6/ |
H A D | ip6_tables.h | 87 struct ip6t_entry entry; member in struct:ip6t_standard 91 struct ip6t_entry entry; member in struct:ip6t_error 98 {.entry = IP6T_ENTRY_INIT(sizeof(struct ip6t_standard)),.target = XT_TARGET_INIT(XT_STANDARD_TARGET, sizeof(struct xt_standard_target)),.target.verdict = - (__verdict) - 1, \ 101 {.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 | 36 struct privcmd_mmap_entry __user * entry; member in struct:privcmd_mmap
|
/bionic/libc/malloc_debug/ |
H A D | Config.cpp | 487 auto entry = kOptions.find(option); local 488 if (entry == kOptions.end()) { 494 const OptionInfo* info = &entry->second;
|
H A D | MapData.cpp | 60 MapEntry* entry = new MapEntry(start, end, offset, name, name_len); local 63 entry->load_base = 0; 64 entry->load_base_read = true; 66 return entry; 70 static inline bool get_val(MapEntry* entry, uintptr_t addr, T* store) { argument 71 if (addr < entry->start || addr + sizeof(T) > entry->end) { 82 static void read_loadbase(MapEntry* entry) { argument 83 entry->load_base = 0; 84 entry 121 MapEntry* entry = parse_line(buffer.data()); local 160 MapEntry* entry = *it; local [all...] |
H A D | PointerData.cpp | 139 auto entry = key_to_index_.find(key); local 140 if (entry == key_to_index_.end()) { 148 hash_index = entry->second; 190 auto entry = pointers_.find(pointer); local 191 if (entry == pointers_.end()) { 196 hash_index = entry->second.hash_index; 208 auto entry = pointers_.find(pointer); local 209 if (entry == pointers_.end()) { 212 hash_index = entry->second.hash_index; 351 for (const auto& entry [all...] |
H A D | RecordData.cpp | 92 ThreadData(RecordData* record_data, ThreadCompleteEntry* entry) argument 93 : record_data(record_data), entry(entry) {} 95 ThreadCompleteEntry* entry; member in struct:ThreadData 108 thread_data->record_data->AddEntryOnly(thread_data->entry); 201 void RecordData::AddEntryOnly(const RecordEntry* entry) { argument 204 entries_[entry_index] = entry; 208 void RecordData::AddEntry(const RecordEntry* entry) { argument 215 AddEntryOnly(entry);
|
H A D | backtrace.cpp | 151 const MapEntry* entry = g_map_data.find(frames[frame_num], &rel_pc); local 153 const char* soname = (entry != nullptr) ? entry->name.c_str() : info.dli_fname; 159 if (entry != nullptr && entry->offset != 0) { 160 snprintf(offset_buf, sizeof(offset_buf), " (offset 0x%" PRIxPTR ")", entry->offset);
|