/seL4-refos-master/libs/libmuslc/src/search/ |
H A D | insque.c | 5 struct node *prev; member in struct:node 14 e->next = e->prev = 0; 18 e->prev = p; 21 e->next->prev = e; 29 e->next->prev = e->prev; 30 if (e->prev) 31 e->prev->next = e->next;
|
/seL4-refos-master/libs/libmuslc/src/process/ |
H A D | fdop.h | 6 struct fdop *next, *prev; member in struct:fdop
|
H A D | posix_spawn_file_actions_addclose.c | 12 if ((op->next = fa->__actions)) op->next->prev = op; 13 op->prev = 0;
|
H A D | posix_spawn_file_actions_adddup2.c | 13 if ((op->next = fa->__actions)) op->next->prev = op; 14 op->prev = 0;
|
H A D | posix_spawn_file_actions_addopen.c | 16 if ((op->next = fa->__actions)) op->next->prev = op; 17 op->prev = 0;
|
/seL4-refos-master/libs/libmuslc/src/stdio/ |
H A D | fclose.c | 18 if (f->prev) f->prev->next = f->next; 19 if (f->next) f->next->prev = f->prev;
|
H A D | ofl_add.c | 7 if (*head) (*head)->prev = f;
|
/seL4-refos-master/kernel/include/arch/arm/arch/model/ |
H A D | smp.h | 19 static inline bool_t try_arch_atomic_exchange_rlx(void *ptr, void *new_val, void **prev) argument 32 *prev = temp;
|
/seL4-refos-master/projects/util_libs/libethdrivers/src/plat/imx6/uboot/ |
H A D | list.h | 22 * sometimes we already know the next/prev entries and we can 28 struct list_head *next, *prev; member in struct:list_head 34 list->prev = list; 41 * the prev/next entries already! 44 struct list_head *prev, 47 next->prev = new; 49 new->prev = prev; 50 prev->next = new; 76 __list_add(new, head->prev, hea 43 __list_add(struct list_head *new, struct list_head *prev, struct list_head *next) argument 86 __list_del(struct list_head *prev, struct list_head *next) argument 249 __list_splice(const struct list_head *list, struct list_head *prev, struct list_head *next) argument [all...] |
/seL4-refos-master/projects/util_libs/libethdrivers/src/plat/zynq7000/uboot/ |
H A D | list.h | 19 * sometimes we already know the next/prev entries and we can 25 struct list_head *next, *prev; member in struct:list_head 36 list->prev = list; 43 * the prev/next entries already! 46 struct list_head *prev, 49 next->prev = new; 51 new->prev = prev; 52 prev->next = new; 78 __list_add(new, head->prev, hea 45 __list_add(struct list_head *new, struct list_head *prev, struct list_head *next) argument 88 __list_del(struct list_head *prev, struct list_head *next) argument 251 __list_splice(const struct list_head *list, struct list_head *prev, struct list_head *next) argument [all...] |
/seL4-refos-master/projects/util_libs/libethdrivers/src/plat/tx2/uboot/ |
H A D | list.h | 19 * sometimes we already know the next/prev entries and we can 25 struct list_head *next, *prev; member in struct:list_head 36 list->prev = list; 43 * the prev/next entries already! 46 struct list_head *prev, 49 next->prev = new; 51 new->prev = prev; 52 prev->next = new; 78 __list_add(new, head->prev, hea 45 __list_add(struct list_head *new, struct list_head *prev, struct list_head *next) argument 88 __list_del(struct list_head *prev, struct list_head *next) argument 254 __list_splice(const struct list_head *list, struct list_head *prev, struct list_head *next) argument [all...] |
/seL4-refos-master/libs/libmuslc/src/thread/ |
H A D | pthread_mutex_unlock.c | 21 volatile void *prev = m->_m_prev; local 23 *(volatile void *volatile *)prev = next; 25 ((char *)next - sizeof(void *)) = prev;
|
H A D | pthread_cond_timedwait.c | 31 struct waiter *prev, *next; member in struct:waiter 95 else node.next->prev = &node; 131 else if (node.prev) node.prev->next = node.next; 132 if (c->_c_tail == &node) c->_c_tail = node.prev; 133 else if (node.next) node.next->prev = node.prev; 158 if (node.prev) 159 unlock_requeue(&node.prev->barrier, &m->_m_lock, m->_m_type & 128); 184 for (p=c->_c_tail; n && p; p=p->prev) { [all...] |
H A D | pthread_atfork.c | 8 struct atfork_funcs *prev, *next; member in struct:atfork_funcs 24 for (p=funcs; p; p = p->prev) { 40 new->prev = 0; 44 if (funcs) funcs->prev = new;
|
/seL4-refos-master/libs/libmuslc/src/malloc/ |
H A D | malloc_usable_size.c | 7 struct chunk *next, *prev; member in struct:chunk
|
/seL4-refos-master/kernel/include/smp/ |
H A D | lock.h | 63 clh_qnode_t *prev; local 73 (void **) &prev)) { 90 return prev; 95 clh_qnode_t *prev; local 98 prev = sel4_atomic_exchange(&big_kernel_lock.head, irqPath, cpu, __ATOMIC_ACQ_REL); 100 big_kernel_lock.node_owners[cpu].next = prev;
|
/seL4-refos-master/kernel/include/arch/x86/arch/model/ |
H A D | smp.h | 39 static inline bool_t try_arch_atomic_exchange_rlx(void *ptr, void *new_val, void **prev) argument 41 *prev = __atomic_exchange_n((void **) ptr, new_val, __ATOMIC_RELAXED);
|
/seL4-refos-master/projects/refos/impl/apps/nethack/src/nethack-3.4.3/include/ |
H A D | lev.h | 35 struct bubble *prev, *next; /* need to traverse the list up and down */ member in struct:bubble
|
/seL4-refos-master/apps/nethack/src/nethack-3.4.3/include/ |
H A D | lev.h | 35 struct bubble *prev, *next; /* need to traverse the list up and down */ member in struct:bubble
|
/seL4-refos-master/kernel/include/arch/riscv/arch/model/ |
H A D | smp.h | 46 static inline bool_t try_arch_atomic_exchange_rlx(void *ptr, void *new_val, void **prev) 48 *prev = __atomic_exchange_n((void **)ptr, new_val, __ATOMIC_RELAXED);
|
/seL4-refos-master/libs/libutils/src/ |
H A D | list.c | 110 for (node_t *prev = NULL, *n = l->head; n != NULL; prev = n, n = n->next) { 112 if (prev == NULL) { 116 prev->next = n->next;
|
/seL4-refos-master/projects/util_libs/libutils/src/ |
H A D | list.c | 110 for (node_t *prev = NULL, *n = l->head; n != NULL; prev = n, n = n->next) { 112 if (prev == NULL) { 116 prev->next = n->next;
|
/seL4-refos-master/projects/refos/impl/apps/nethack/src/nethack-3.4.3/src/ |
H A D | light.c | 94 light_source *curr, *prev; local 109 for (prev = 0, curr = light_base; curr; prev = curr, curr = curr->next) { 112 if (prev) 113 prev->next = curr->next; 235 light_source **prev, *curr; local 247 for (prev = &light_base; (curr = *prev) != 0; ) { 267 *prev = curr->next; 270 prev [all...] |
/seL4-refos-master/apps/nethack/src/nethack-3.4.3/src/ |
H A D | light.c | 94 light_source *curr, *prev; local 109 for (prev = 0, curr = light_base; curr; prev = curr, curr = curr->next) { 112 if (prev) 113 prev->next = curr->next; 235 light_source **prev, *curr; local 247 for (prev = &light_base; (curr = *prev) != 0; ) { 267 *prev = curr->next; 270 prev [all...] |
/seL4-refos-master/libs/libsel4platsupport/src/ |
H A D | io.c | 42 struct io_mapping *next, *prev; member in struct:io_mapping 104 node->prev = NULL; 107 io_mapper->head->prev = node; 125 if (node->prev) { 126 node->prev->next = node->next; 132 node->next->prev = node->prev;
|