Searched refs:next (Results 1 - 25 of 160) sorted by relevance

1234567

/seL4-refos-master/libs/libmuslc/src/process/
H A Dposix_spawn_file_actions_destroy.c7 struct fdop *op = fa->__actions, *next; local
9 next = op->next;
11 op = next;
H A Dfdop.h6 struct fdop *next, *prev; member in struct:fdop
H A Dposix_spawn_file_actions_addclose.c12 if ((op->next = fa->__actions)) op->next->prev = op;
H A Dposix_spawn_file_actions_adddup2.c13 if ((op->next = fa->__actions)) op->next->prev = op;
/seL4-refos-master/libs/libmuslc/src/search/
H A Dinsque.c4 struct node *next; member in struct:node
14 e->next = e->prev = 0;
17 e->next = p->next;
19 p->next = e;
20 if (e->next)
21 e->next->prev = e;
28 if (e->next)
29 e->next->prev = e->prev;
31 e->prev->next
[all...]
/seL4-refos-master/projects/util_libs/libethdrivers/src/plat/imx6/uboot/
H A Dlist.h22 * sometimes we already know the next/prev entries and we can
28 struct list_head *next, *prev; member in struct:list_head
33 list->next = list;
41 * the prev/next entries already!
45 struct list_head *next)
47 next->prev = new;
48 new->next = next;
50 prev->next = new;
63 __list_add(new, head, head->next);
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
196 struct list_head *next = head->next; local
249 __list_splice(const struct list_head *list, struct list_head *prev, struct list_head *next) argument
537 struct hlist_node *next, **pprev; member in struct:hlist_node
561 struct hlist_node *next = n->next; local
594 hlist_add_before(struct hlist_node *n, struct hlist_node *next) argument
603 hlist_add_after(struct hlist_node *n, struct hlist_node *next) argument
[all...]
/seL4-refos-master/projects/util_libs/libethdrivers/src/plat/zynq7000/uboot/
H A Dlist.h19 * sometimes we already know the next/prev entries and we can
25 struct list_head *next, *prev; member in struct:list_head
35 list->next = list;
43 * the prev/next entries already!
47 struct list_head *next)
49 next->prev = new;
50 new->next = next;
52 prev->next = new;
65 __list_add(new, head, head->next);
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
198 struct list_head *next = head->next; local
251 __list_splice(const struct list_head *list, struct list_head *prev, struct list_head *next) argument
539 struct hlist_node *next, **pprev; member in struct:hlist_node
563 struct hlist_node *next = n->next; local
596 hlist_add_before(struct hlist_node *n, struct hlist_node *next) argument
605 hlist_add_after(struct hlist_node *n, struct hlist_node *next) argument
[all...]
/seL4-refos-master/projects/util_libs/libethdrivers/src/plat/tx2/uboot/
H A Dlist.h19 * sometimes we already know the next/prev entries and we can
25 struct list_head *next, *prev; member in struct:list_head
35 list->next = list;
43 * the prev/next entries already!
47 struct list_head *next)
49 next->prev = new;
50 new->next = next;
52 prev->next = new;
65 __list_add(new, head, head->next);
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
198 struct list_head *next = head->next; local
254 __list_splice(const struct list_head *list, struct list_head *prev, struct list_head *next) argument
544 struct hlist_node *next, * *pprev; member in struct:hlist_node
568 struct hlist_node *next = n->next; local
603 hlist_add_before(struct hlist_node *n, struct hlist_node *next) argument
612 hlist_add_after(struct hlist_node *n, struct hlist_node *next) argument
[all...]
/seL4-refos-master/libs/libplatsupport/plat_include/pc99/platsupport/plat/acpi/tables/
H A Drsdt.h38 /* Retrieve the location of the next item in the list */
42 char* next = (char*)(cur + 1); local
44 if (next < end) {
45 return (uint32_t*)next;
H A Dxsdt.h38 /* Retrieve the location of the next item in the list */
42 char* next = (char*)(cur + 1); local
44 if (next < end) {
45 return (uint64_t*)next;
H A Derst.h42 /* Retrieve the location of the next item in the list */
46 char* next = (char*)(cur + 1); local
48 if (next < end) {
49 return (acpi_erst_entry_t*)next;
H A Dmcfg.h42 char* next = (char*)(cur + 1); local
44 if (next < end) {
45 return (acpi_mcfg_desc_t*)next;
H A Ddmar.h128 /* Retrieve the next DMAR sub header */
133 void* next = (uint8_t*)hdr + hdr->length; local
135 if (next < end) {
136 return (acpi_dmar_remap_hdr_t*)next;
146 acpi_dmar_remap_hdr_t* next = acpi_dmar_first_remap(tbl); local
147 while (next != NULL && index-- > 0) {
148 next = acpi_dmar_next_remap(tbl, next);
150 return next;
153 /* Retrieve the next DMA
232 void* next = (uint8_t*)scope + scope->length; local
245 acpi_dmar_dscope_t* next = acpi_dmar_first_dscope(sh); local
[all...]
/seL4-refos-master/projects/util_libs/libplatsupport/plat_include/pc99/platsupport/plat/acpi/tables/
H A Drsdt.h38 /* Retrieve the location of the next item in the list */
42 char* next = (char*)(cur + 1); local
44 if (next < end) {
45 return (uint32_t*)next;
H A Dxsdt.h38 /* Retrieve the location of the next item in the list */
42 char* next = (char*)(cur + 1); local
44 if (next < end) {
45 return (uint64_t*)next;
H A Derst.h42 /* Retrieve the location of the next item in the list */
46 char* next = (char*)(cur + 1); local
48 if (next < end) {
49 return (acpi_erst_entry_t*)next;
H A Dmcfg.h42 char* next = (char*)(cur + 1); local
44 if (next < end) {
45 return (acpi_mcfg_desc_t*)next;
H A Ddmar.h128 /* Retrieve the next DMAR sub header */
133 void* next = (uint8_t*)hdr + hdr->length; local
135 if (next < end) {
136 return (acpi_dmar_remap_hdr_t*)next;
146 acpi_dmar_remap_hdr_t* next = acpi_dmar_first_remap(tbl); local
147 while (next != NULL && index-- > 0) {
148 next = acpi_dmar_next_remap(tbl, next);
150 return next;
153 /* Retrieve the next DMA
232 void* next = (uint8_t*)scope + scope->length; local
245 acpi_dmar_dscope_t* next = acpi_dmar_first_dscope(sh); local
[all...]
/seL4-refos-master/libs/libmuslc/src/stdio/
H A Dfclose.c18 if (f->prev) f->prev->next = f->next;
19 if (f->next) f->next->prev = f->prev;
20 if (*head == f) *head = f->next;
H A Dofl_add.c6 f->next = *head;
/seL4-refos-master/projects/refos/impl/apps/nethack/src/nethack-3.4.3/include/
H A Dlev.h20 struct container *next; member in struct:container
35 struct bubble *prev, *next; /* need to traverse the list up and down */ member in struct:bubble
41 struct ls_t *next; member in struct:ls_t
/seL4-refos-master/apps/nethack/src/nethack-3.4.3/include/
H A Dlev.h20 struct container *next; member in struct:container
35 struct bubble *prev, *next; /* need to traverse the list up and down */ member in struct:bubble
41 struct ls_t *next; member in struct:ls_t
/seL4-refos-master/libs/libmuslc/src/thread/
H A Dpthread_mutex_unlock.c22 volatile void *next = m->_m_next; local
23 *(volatile void *volatile *)prev = next;
24 if (next != &self->robust_list.head) *(volatile void *volatile *)
25 ((char *)next - sizeof(void *)) = prev;
/seL4-refos-master/libs/libutils/src/
H A Dlist.c32 n->next = NULL;
64 for (node_t *n = l->head; n != NULL; n = n->next) {
76 for (node_t *n = l->head; n != NULL; n = n->next) {
86 for (node_t *n = l->head; n != NULL; n = n->next, i++) {
97 for (node_t *n = l->head; n != NULL; n = n->next) {
110 for (node_t *prev = NULL, *n = l->head; n != NULL; prev = n, n = n->next) {
114 l->head = n->next;
116 prev->next = n->next;
136 node_t *temp = n->next;
[all...]
/seL4-refos-master/projects/util_libs/libutils/src/
H A Dlist.c32 n->next = NULL;
64 for (node_t *n = l->head; n != NULL; n = n->next) {
76 for (node_t *n = l->head; n != NULL; n = n->next) {
86 for (node_t *n = l->head; n != NULL; n = n->next, i++) {
97 for (node_t *n = l->head; n != NULL; n = n->next) {
110 for (node_t *prev = NULL, *n = l->head; n != NULL; prev = n, n = n->next) {
114 l->head = n->next;
116 prev->next = n->next;
136 node_t *temp = n->next;
[all...]

Completed in 72 milliseconds

1234567