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

1234567891011>>

/barrelfish-2018-10-04/lib/libc/stdlib/
H A Dremque.c19 struct que_elem *prev, *next, *elem; local
24 next = elem->next;
27 prev->next = next;
28 if (next != NULL)
29 next->prev = prev;
H A Dinsque.c23 struct que_elem *prev, *next, *elem; local
29 elem->prev = elem->next = NULL;
33 next = prev->next;
34 if (next != NULL) {
36 if (next->prev != prev) {
38 " next(%p)->prev(%p) != prev(%p)\n",
39 next, next->prev, prev);
42 next
[all...]
H A Dquick_exit.c38 struct quick_exit_handler *next; member in struct:quick_exit_handler
62 h->next = handlers;
77 for (h = handlers; NULL != h; h = h->next)
/barrelfish-2018-10-04/lib/devif/backends/net/mlx4/include/linux/
H A Dlist.h79 struct list_head *next; member in struct:list_head
84 list->next = list->prev = list;
89 return (head->next == head);
94 entry->next->prev = entry->prev;
95 entry->prev->next = entry->next;
99 struct list_head *next) {
100 next->prev = new;
101 new->next = next;
98 _list_add(struct list_head *new, struct list_head *prev, struct list_head *next) argument
220 struct hlist_node *next, **pprev; member in struct:hlist_node
266 hlist_add_before(struct hlist_node *n, struct hlist_node *next) argument
275 hlist_add_after(struct hlist_node *n, struct hlist_node *next) argument
[all...]
/barrelfish-2018-10-04/kernel/
H A Dkcb.c25 if (kcb_current->next) {
29 new_kcb->next = kcb_current->next;
31 new_kcb->next->prev = new_kcb;
32 new_kcb->prev->next = new_kcb;
35 kcb_current->next = kcb_current->prev = new_kcb;
36 new_kcb->next = new_kcb->prev = kcb_current;
43 if (to_remove->next->next == to_remove) {
44 assert(to_remove->next
[all...]
H A Dschedule_rr.c33 assert(kcb_current->ring_current->next != NULL);
36 kcb_current->ring_current = kcb_current->ring_current->next;
46 if(dcb->prev == NULL || dcb->next == NULL) {
47 assert(dcb->prev == NULL && dcb->next == NULL);
52 dcb->next = dcb;
57 dcb->next = kcb_current->ring_current->next;
58 kcb_current->ring_current->next->prev = dcb;
59 kcb_current->ring_current->next = dcb;
75 if(dcb->prev == NULL || dcb->next
80 struct dcb *next = kcb_current->ring_current->next; local
[all...]
H A Dpaging_generic.c29 struct cte *next = cap; local
30 while ((next = mdb_successor(next)) && get_address(&next->cap) == faddr)
32 if (next->cap.type == get_mapping_type(cap->cap.type) &&
33 next->cap.u.frame_mapping.cap == &cap->cap)
35 *mapping = next;
43 static inline errval_t find_next_ptable(struct cte *mapping_cte, struct cte **next) argument
50 local_phys_to_gen_phys(mapping->pte), next);
68 *next
183 struct cte *next, *mapping = NULL; local
230 struct cte *next = mem; local
[all...]
H A Dcap_delete.c110 assert(cte->delete_node.next == NULL || delete_head == cte);
111 cte->delete_node.next = NULL;
148 assert(cte->delete_node.next == NULL || delete_head == cte);
149 cte->delete_node.next = NULL;
369 cte->delete_node.next = NULL;
373 assert(!delete_tail->delete_node.next);
374 delete_tail->delete_node.next = cte;
376 cte->delete_node.next = NULL;
399 struct cte *next; local
415 next
493 struct cte *prev = mdb_find_greater(base, true), *next = NULL; local
603 struct cte *cte = delete_head, *next = cte->delete_node.next; local
[all...]
/barrelfish-2018-10-04/lib/libc/stdio/
H A Dglue.h41 struct glue *next; member in struct:glue
/barrelfish-2018-10-04/lib/openssl-1.0.0d/crypto/pqueue/
H A Dpqueue.c79 item->next = NULL;
113 pitem *curr, *next; local
121 for(curr = NULL, next = pq->items;
122 next != NULL;
123 curr = next, next = next->next)
127 int cmp = memcmp(next->priority, item->priority,8);
128 if (cmp > 0) /* next > ite
170 pitem *next; local
[all...]
/barrelfish-2018-10-04/usr/drivers/usb/usb_manager/controller/ehci/
H A Dusb_ehci_queue.c68 sitd->next = last->next;
70 last->next = sitd;
93 sitd->prev->next = sitd->next;
100 if (sitd->next) {
101 sitd->next->prev = sitd->prev;
118 std->next = last->next;
120 last->next
[all...]
/barrelfish-2018-10-04/lib/lwip/src/core/
H A Dsys.c75 if (!timeouts || !timeouts->next) {
80 if (timeouts->next->time > 0) {
82 time_needed = sys_arch_mbox_fetch(mbox, msg, timeouts->next->time);
92 tmptimeout = timeouts->next;
93 timeouts->next = tmptimeout->next;
109 if (time_needed < timeouts->next->time) {
110 timeouts->next->time -= time_needed;
112 timeouts->next->time = 0;
136 if (!timeouts || !timeouts->next) {
[all...]
/barrelfish-2018-10-04/usr/drivers/usb/usb_manager/controller/ohci/
H A Dusb_ohci_queue.c25 ed->prev->next = ed->next;
29 if (ed->next) {
30 ed->next->prev = ed->prev;
35 // TODO: needs page cache flush ed->next->page_cache
53 ed->next = last->next;
61 last->next = ed;
/barrelfish-2018-10-04/lib/concurrent/
H A Dlinked_list.c30 struct ll_element *current = head, *next = head->next; local
34 if ((current == head) && (next == tail)) {
40 if (!is_marked_reference((uintptr_t) next)) {
42 left_node_next = next;
45 (uintptr_t) current->next);
48 next = current->next;
50 if (is_marked_reference((uintptr_t) next) || (current->key < key
51 && next !
169 struct ll_element *next; local
[all...]
/barrelfish-2018-10-04/lib/barrelfish/slot_alloc/
H A Dsingle_slot_alloc.c50 sca->head = walk->next;
73 sca->head->next = NULL;
89 new->next = sca->head;
99 // check if we can merge walk to next
100 struct cnode_meta *next = walk->next; local
101 if (next && next->slot == walk->slot + walk->space) {
102 walk->space += next->space;
103 walk->next
[all...]
H A Drange_slot_alloc.c45 walk = walk->next;
53 alloc = alloc->next;
72 prev->next = walk->next;
74 alloc->meta = walk->next;
94 assert(walk->next == NULL);
102 walk->next = slab_alloc(&alloc->slab);
103 if (walk->next == NULL) {
106 walk->next->slot = slot;
107 walk->next
[all...]
/barrelfish-2018-10-04/lib/libc/include/isc/
H A Dlist.h33 #define LINK(type) struct { type *prev, *next; }
37 (elt)->link.next = (type *)(-1); \
42 (void *)((elt)->link.next) != (void *)(-1))
56 (elt)->link.next = (list).head; \
64 (list).tail->link.next = (elt); \
68 (elt)->link.next = NULL; \
75 if ((elt)->link.next != NULL) \
76 (elt)->link.next->link.prev = (elt)->link.prev; \
82 (elt)->link.prev->link.next = (elt)->link.next; \
[all...]
/barrelfish-2018-10-04/lib/bulk_transfer/backends/sm/
H A Dpending_msg.c35 node = node->next;
59 p->next = NULL;
83 if (node->next){
84 node = node->next;
87 node->next = p;
95 p->next = node;
101 p->previous->next = p;
149 p = p->next;
158 if (p->next){
159 p->next
[all...]
/barrelfish-2018-10-04/lib/timer/
H A Dtimer.c217 assert(q->next == NULL);
223 for(struct timer *i = timer_queue; i != NULL; i = i->next) {
231 q->next = i;
233 i->prev->next = q;
252 if(i->next == NULL) {
253 i->next = q;
255 q->next = NULL;
267 q->next = NULL;
282 q->prev->next = q->next;
[all...]
/barrelfish-2018-10-04/lib/collections/
H A Dlist.c28 insert->next = existing->next;
30 existing->next = insert;
31 insert->next->prev = insert;
37 n->next->prev = n->prev;
38 n->prev->next = n->next;
39 n->next = n->prev = NULL;
84 t->next = t->prev = t;
102 collections_listnode *cur = start->next;
[all...]
/barrelfish-2018-10-04/lib/lwip2/src/apps/httpd/
H A Dfsdata.h39 const struct fsdata_file *next; member in struct:fsdata_file
/barrelfish-2018-10-04/usr/drivers/lpc_timer/
H A Dmain.c48 with the next timeout after me */
49 struct timer_client *next; /**< Service response closure of the client member in struct:timer_client
70 * the next timeout.
92 return (timers == client || client->prev != NULL || client->next != NULL);
103 timers = client->next;
108 // program HW for next timer
109 if (client->next != NULL) {
110 lpc_timer_set(client->expiry + client->next->expiry);
118 client->prev->next = client->next;
440 struct timer_client *client = timers, *next; local
[all...]
/barrelfish-2018-10-04/usr/eclipseclp/CPViz/viz/src/ie/ucc/cccc/viz/
H A DFullDomain.java47 int res = li.next();
49 res = Math.min(res,li.next());
59 int res = li.next();
61 res = Math.max(res,li.next());
/barrelfish-2018-10-04/lib/devif/backends/debug/
H A Ddevif_backend_debug.c64 struct memory_ele* next; member in struct:memory_ele
74 struct memory_list* next; // next in list of lists member in struct:memory_list
109 ele = ele->next;
119 while (ele->next != NULL) {
120 if (ele->offset + ele->length == ele->next->offset) {
125 ele = ele->next;
159 ele = ele->next;
194 que->regions->next = NULL;
202 que->regions->buffers->next
295 struct memory_list* next = ele->next; local
481 struct memory_ele* next = buffer->next; local
[all...]
/barrelfish-2018-10-04/lib/barrelfish/vspace/
H A Dvspace.c87 region->next = NULL;
104 region->next = vspace->head;
107 prev->next = region;
108 region->next = walk;
114 walk = walk->next;
122 prev->next = region;
123 region->next = NULL;
144 assert(prev->next == walk);
145 prev->next = walk->next;
[all...]

Completed in 131 milliseconds

1234567891011>>