| /bionic/libc/bionic/ |
| H A D | pthread-atfork.c | 111 struct atfork_t *entry = malloc(sizeof(struct atfork_t)); local
113 if (entry == NULL) {
117 entry->prepare = prepare;
118 entry->parent = parent;
119 entry->child = child;
122 CIRCLEQ_INSERT_TAIL(&atfork_head, entry, entries);
|
| H A D | scandir.cpp | 48 bool Add(dirent* entry) { argument
59 dirent* copy = CopyDirent(entry);
101 dirent* entry; local
102 while ((entry = reader.ReadEntry()) != NULL) {
104 if (filter != NULL && !(*filter)(entry)) {
107 names.Add(entry);
|
| H A D | system_properties_compat.c | 83 unsigned entry = *toc++; local
84 if(TOC_NAME_LEN(entry) != len) continue;
86 pi = TOC_TO_INFO(pa, entry);
125 unsigned entry = pa->toc[i]; local
126 prop_info_compat *pi = TOC_TO_INFO(pa, entry);
|
| H A D | dirent.cpp | 98 dirent* entry = d->next_; local
99 d->next_ = reinterpret_cast<dirent*>(reinterpret_cast<char*>(entry) + entry->d_reclen);
100 d->available_bytes_ -= entry->d_reclen;
101 return entry;
109 int readdir_r(DIR* d, dirent* entry, dirent** result) { argument
123 memcpy(entry, next, next->d_reclen);
124 *result = entry;
|
| H A D | malloc_debug_leak.cpp | 78 HashEntry* entry; member in struct:AllocationEntry
108 HashEntry* entry = table->slots[slot]; local
109 while (entry != NULL) {
110 //debug_log("backtrace: %p, entry: %p entry->backtrace: %p\n",
111 // backtrace, entry, (entry != NULL) ? entry->backtrace : NULL);
113 * See if the entry matches exactly. We compare the "size" field,
116 if (entry
140 HashEntry* entry = find_entry(&gHashTable, slot, backtrace, numEntries, size); local
172 is_valid_entry(HashEntry* entry) argument
191 remove_entry(HashEntry* entry) argument
314 HashEntry* entry = header->entry; local
[all...] |
| H A D | sysconf.cpp | 89 dirent* entry; local
90 while ((entry = reader.ReadEntry()) != NULL) {
91 if (entry->d_type == DT_DIR && __matches_cpuN(entry->d_name)) {
|
| H A D | malloc_debug_common.cpp | 37 * (to fill allocation entry hash table, for example). So, all relevant
111 * "*infoSize" is set to the size of a single entry
140 HashEntry* entry = gHashTable.slots[i]; local
141 while (entry != NULL) {
142 list[index] = entry;
144 ((entry->size & ~SIZE_FLAG_MASK) * entry->allocations);
146 entry = entry->next;
169 HashEntry* entry local
[all...] |
| H A D | pthread_debug.cpp | 321 // copy the last entry to the new free slot
351 * ourselves on entry and clear the mark on exit. If we ever encounter
545 static void hashmap_removeEntry(HashTable* table, HashEntry* entry) argument
547 HashEntry* prev = entry->prev;
548 HashEntry* next = entry->next;
549 if (prev != NULL) entry->prev->next = next;
550 if (next != NULL) entry->next->prev = prev;
553 table->slots[entry->slot] = entry->next;
564 HashEntry* entry local
597 HashEntry* entry = hashmap_lookup(&sMutexMap, local
621 HashEntry* entry = hashmap_lookup(&sThreadMap, local
[all...] |
| /bionic/libc/kernel/common/linux/ |
| H A D | timer.h | 27 struct list_head entry; member in struct:timer_list
|
| H A D | workqueue.h | 29 struct list_head entry; member in struct:work_struct
40 #define __WORK_INITIALIZER(n, f, d) { .entry = { &(n).entry, &(n).entry }, .func = (f), .data = (d), .timer = TIMER_INITIALIZER(NULL, 0, 0), }
44 #define INIT_WORK(_work, _func, _data) do { INIT_LIST_HEAD(&(_work)->entry); (_work)->pending = 0; PREPARE_WORK((_work), (_func), (_data)); init_timer(&(_work)->timer); } while (0)
|
| H A D | sysdev.h | 42 struct list_head entry; member in struct:sysdev_driver
|
| H A D | videodev2.h | 1801 struct v4l2_enc_idx_entry entry[V4L2_ENC_IDX_ENTRIES]; member in struct:v4l2_enc_idx
|
| /bionic/libthread_db/ |
| H A D | libthread_db.c | 222 struct dirent * entry; local
232 while ((entry = readdir(dir)) != NULL) {
233 if (strcmp(entry->d_name, ".") == 0 || strcmp(entry->d_name, "..") == 0) {
236 handle.tid = atoi(entry->d_name);
|
| /bionic/linker/ |
| H A D | linker.h | 105 Elf32_Addr entry; member in struct:soinfo
|
| /bionic/libc/kernel/arch-mips/asm/sn/sn0/ |
| H A D | hubio.h | 639 u64 entry; member in union:iprte_a
|