/bionic/libc/kernel/arch-sh/asm/ |
H A D | system_64.h | 19 struct task_struct *next, 22 #define switch_to(prev,next,last) do { if (last_task_used_math != next) { struct pt_regs *regs = next->thread.uregs; if (regs) regs->sr |= SR_FD; } last = sh64_switch_to(prev, &prev->thread, next, &next->thread); } while (0)
|
H A D | system_32.h | 18 struct task_struct *next); 20 #define switch_to(prev, next, last) do { register u32 *__ts1 __asm__ ("r1") = (u32 *)&prev->thread.sp; register u32 *__ts2 __asm__ ("r2") = (u32 *)&prev->thread.pc; register u32 *__ts4 __asm__ ("r4") = (u32 *)prev; register u32 *__ts5 __asm__ ("r5") = (u32 *)next; register u32 *__ts6 __asm__ ("r6") = (u32 *)&next->thread.sp; register u32 __ts7 __asm__ ("r7") = next->thread.pc; struct task_struct *__last; __asm__ __volatile__ ( ".balign 4\n\t" "stc.l gbr, @-r15\n\t" "sts.l pr, @-r15\n\t" "mov.l r8, @-r15\n\t" "mov.l r9, @-r15\n\t" "mov.l r10, @-r15\n\t" "mov.l r11, @-r15\n\t" "mov.l r12, @-r15\n\t" "mov.l r13, @-r15\n\t" "mov.l r14, @-r15\n\t" "mov.l r15, @r1\t! save SP\n\t" "mov.l @r6, r15\t! change to new stack\n\t" "mova 1f, %0\n\t" "mov.l %0, @r2\t! save PC\n\t" "mov.l 2f, %0\n\t" "jmp @%0\t! call __switch_to\n\t" " lds r7, pr\t! with return to new PC\n\t" ".balign 4\n" "2:\n\t" ".long __switch_to\n" "1:\n\t" "mov.l @r15+, r14\n\t" "mov.l @r15+, r13\n\t" "mov.l @r15+, r12\n\t" "mov.l @r15+, r11\n\t" "mov.l @r15+, r10\n\t" "mov.l @r15+, r9\n\t" "mov.l @r15+, r8\n\t" "lds.l @r15+, pr\n\t" "ldc.l @r15+, gbr\n\t" : "=z" (__last) : "r" (__ts1), "r" (__ts2), "r" (__ts4), "r" (__ts5), "r" (__ts6), "r" (__ts7) : "r3", "t"); last = __last; } while (0)
|
H A D | mmu.h | 52 struct pmb_entry *next; member in struct:pmb_entry
|
/bionic/libc/stdio/ |
H A D | glue.h | 40 struct glue *next; member in struct:glue
|
H A D | findfp.c | 83 g->next = NULL; 107 for (g = &__sglue;; g = g->next) { 111 if (g->next == NULL && (g->next = moreglue(NDYNAMIC)) == NULL) 145 for (g = &__sglue; (n -= g->niobs) > 0 && g->next; g = g->next) 148 g->next = moreglue(n);
|
H A D | fwalk.c | 47 for (g = &__sglue; g != NULL; g = g->next)
|
H A D | flockfile.c | 55 struct FileLock* next; member in struct:FileLock 110 pnode = &node->next; 133 lock->next = NULL; 204 *lookup = lock->next;
|
/bionic/libc/private/isc/ |
H A 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; \ [all...] |
/bionic/libc/kernel/common/linux/raid/ |
H A D | xor.h | 20 struct xor_block_template *next; member in struct:xor_block_template
|
/bionic/libc/stdlib/ |
H A D | atexit.h | 34 struct atexit *next; /* next in list */ member in struct:atexit 35 int ind; /* next index in this table */
|
H A D | atexit.c | 90 p->next = __atexit; 134 for (p = __atexit; p != NULL; p = p->next) { 174 p = p->next; 194 while (p != NULL && p->next != NULL) 195 p = p->next; 204 p->next = NULL;
|
/bionic/libc/kernel/common/linux/ |
H A D | vmalloc.h | 37 struct vm_struct *next; member in struct:vm_struct
|
H A D | proc_fs.h | 47 struct proc_dir_entry *next, *parent, *subdir; member in struct:proc_dir_entry 57 struct kcore_list *next; member in struct:kcore_list
|
H A D | dm-ioctl.h | 47 uint32_t next; member in struct:dm_target_spec 61 uint32_t next; member in struct:dm_name_list 66 uint32_t next; member in struct:dm_target_versions
|
H A D | file.h | 38 struct fdtable *next; member in struct:fdtable
|
H A D | futex.h | 28 struct robust_list __user *next; member in struct:robust_list
|
H A D | interrupt.h | 61 struct irqaction *next; member in struct:irqaction 100 struct tasklet_struct *next; member in struct:tasklet_struct
|
H A D | skbuff.h | 47 struct sk_buff *next; member in struct:sk_buff_head 105 struct sk_buff *next; member in struct:sk_buff
|
/bionic/libc/unistd/ |
H A D | popen.c | 46 struct pid *next; member in struct:pid 86 for (pcur = pidlist; pcur; pcur = pcur->next) 127 cur->next = pidlist; 146 for (last = NULL, cur = pidlist; cur; last = cur, cur = cur->next) 161 pidlist = cur->next; 163 last->next = cur->next;
|
H A D | abort.c | 70 while (p != NULL && p->next != NULL) 71 p = p->next;
|
/bionic/libc/bionic/ |
H A D | malloc_debug_leak.c | 126 entry = entry->next; 157 entry->next = gHashTable.slots[slot]; 165 if (entry->next != NULL) { 166 entry->next->prev = entry; 188 e1 = e1->next; 199 HashEntry* next = entry->next; local 201 if (prev != NULL) entry->prev->next = next; 202 if (next ! [all...] |
H A D | malloc_debug_common.h | 56 HashEntry* next; member in struct:HashEntry
|
/bionic/libc/netbsd/isc/ |
H A D | eventlib_p.h | 91 struct evConn * next; member in struct:evConn 124 struct evFile * next; member in struct:evFile 145 struct evStream *prev, *next; member in struct:evStream 161 struct evWait * next; member in struct:evWait 168 struct evWaitList * next; member in struct:evWaitList 179 struct { struct evEvent_p *next; } free; member in struct:evEvent_p::__anon489::__anon495
|
H A D | ev_streams.c | 82 new->next = ctx->streams; 116 new->next = ctx->streams; 164 old->prev->next = old->next; 166 ctx->streams = old->next; 167 if (old->next != NULL) 168 old->next->prev = old->prev;
|
/bionic/libc/regex/ |
H A D | regcomp.c | 56 char *next; /* next character in RE */ member in struct:parse 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 [all...] |