| /bionic/libc/kernel/arch-sh/asm/ |
| D | system_64.h | 19 struct task_struct *next,
22 …next,last) do { if (last_task_used_math != next) { struct pt_regs *regs = next->thread.uregs;… argument
|
| D | system_32.h | 18 struct task_struct *next);
20 …next, last) do { register u32 *__ts1 __asm__ ("r1") = (u32 *)&prev->thread.sp; register u32 *… argument
|
| D | mmu.h | 52 struct pmb_entry *next; member
|
| /bionic/libc/private/isc/ |
| D | list.h | 28 #define LINK(type) struct { type *prev, *next; }
32 (elt)->link.next = (type *)(-1); \
50 (elt)->link.next = (list).head; \
58 (list).tail->link.next = (elt); \
62 (elt)->link.next = NULL; \
69 if ((elt)->link.next != NULL) \
70 (elt)->link.next->link.prev = (elt)->link.prev; \
74 (elt)->link.prev->link.next = (elt)->link.next; \
76 (list).head = (elt)->link.next; \
83 #define NEXT(elt, link) ((elt)->link.next)
[all …]
|
| /bionic/libc/unistd/ |
| D | popen.c | 46 struct pid *next; member
89 for (pcur = pidlist; pcur; pcur = pcur->next) in popen()
124 cur->next = pidlist; in popen()
143 for (last = NULL, cur = pidlist; cur; last = cur, cur = cur->next) in pclose()
158 pidlist = cur->next; in pclose()
160 last->next = cur->next; in pclose()
|
| D | abort.c | 70 while (p != NULL && p->next != NULL) in __libc_android_abort()
71 p = p->next; in __libc_android_abort()
|
| /bionic/libc/stdio/ |
| D | findfp.c | 86 g->next = NULL; in moreglue()
112 for (g = &__sglue; g != NULL; g = g->next) { in __sfp()
123 lastglue->next = g; in __sfp()
157 for (g = &__sglue; (n -= g->niobs) > 0 && g->next; g = g->next)
161 lastglue->next = g;
|
| D | glue.h | 40 struct glue *next; member
|
| D | flockfile.c | 55 struct FileLock* next; member
110 pnode = &node->next; in lock_table_lookup()
133 lock->next = NULL; in flockfile()
204 *lookup = lock->next; in __fremovelock()
|
| D | fwalk.c | 47 for (g = &__sglue; g != NULL; g = g->next) in _fwalk()
|
| /bionic/libc/kernel/common/linux/raid/ |
| D | xor.h | 20 struct xor_block_template *next; member
|
| /bionic/libc/stdlib/ |
| D | atexit.c | 90 p->next = __atexit; in __cxa_atexit()
136 for (p = __atexit; p != NULL; p = p->next) { in __cxa_finalize()
176 p = p->next; in __cxa_finalize()
196 while (p != NULL && p->next != NULL) in __atexit_register_cleanup()
197 p = p->next; in __atexit_register_cleanup()
206 p->next = NULL; in __atexit_register_cleanup()
|
| D | atexit.h | 34 struct atexit *next; /* next in list */ member
|
| /bionic/libc/netbsd/isc/ |
| D | eventlib_p.h | 91 struct evConn * next; member
124 struct evFile * next; member
145 struct evStream *prev, *next; member
161 struct evWait * next; member
168 struct evWaitList * next; member
179 struct { struct evEvent_p *next; } free; member
|
| D | ev_streams.c | 82 new->next = ctx->streams; in evWrite()
116 new->next = ctx->streams; in evRead()
164 old->prev->next = old->next; in evCancelRW()
166 ctx->streams = old->next; in evCancelRW()
167 if (old->next != NULL) in evCancelRW()
168 old->next->prev = old->prev; in evCancelRW()
|
| /bionic/libc/kernel/common/linux/ |
| D | vmalloc.h | 37 struct vm_struct *next; member
|
| D | proc_fs.h | 47 struct proc_dir_entry *next, *parent, *subdir; member
57 struct kcore_list *next; member
|
| D | dm-ioctl.h | 47 uint32_t next; member
61 uint32_t next; member
66 uint32_t next; member
|
| D | interrupt.h | 61 struct irqaction *next; member
100 struct tasklet_struct *next; member
|
| D | futex.h | 28 struct robust_list __user *next; member
|
| D | skbuff.h | 47 struct sk_buff *next; member
105 struct sk_buff *next; member
|
| D | file.h | 38 struct fdtable *next; member
|
| /bionic/libc/bionic/ |
| D | malloc_debug_leak.c | 126 entry = entry->next; in find_entry()
157 entry->next = gHashTable.slots[slot]; in record_backtrace()
165 if (entry->next != NULL) { in record_backtrace()
166 entry->next->prev = entry; in record_backtrace()
188 e1 = e1->next; in is_valid_entry()
199 HashEntry* next = entry->next; in remove_entry() local
201 if (prev != NULL) entry->prev->next = next; in remove_entry()
202 if (next != NULL) entry->next->prev = prev; in remove_entry()
206 gHashTable.slots[entry->slot] = entry->next; in remove_entry()
|
| D | malloc_debug_common.h | 56 HashEntry* next; member
|
| /bionic/libc/regex/ |
| D | regcomp.c | 56 char *next; /* next character in RE */ member
113 #define PEEK() (*p->next)
114 #define PEEK2() (*(p->next+1))
115 #define MORE() (p->next < p->end)
116 #define MORE2() (p->next+1 < p->end)
121 #define NEXT() (p->next++)
122 #define NEXT2() (p->next += 2)
123 #define NEXTn(n) (p->next += (n))
124 #define GETNEXT() (*p->next++)
188 p->next = (char *)pattern; /* convenience; we do not modify it */ in regcomp()
[all …]
|