/barrelfish-2018-10-04/lib/phoenix/ |
H A D | mcs.c | 36 struct mcs_lock_priv *next; member in struct:mcs_lock_priv 61 priv->next = NULL; 87 set_and_flush(priv->next, NULL); 97 /* NOTE: this ordering is important-- if locked after next assignment, 100 set_and_flush(prev->next, priv); 113 if (priv->next == NULL) { 121 /* wait for next to get thrown on */ 122 while (((void*)atomic_read(&(priv->next))) == NULL) { 127 set_and_flush(priv->next->locked, 0);
|
/barrelfish-2018-10-04/usr/block_server/ |
H A D | block_storage_cache.c | 95 bl= list->next; 105 prev->next = list->next; 107 bl = list->next; 113 list = list->next; 133 list->next = NULL; 138 list->next = bl;
|
/barrelfish-2018-10-04/usr/eclipseclp/CPViz/viz/src/ie/ucc/cccc/viz/ |
H A D | Extent.java | 108 li.next().shift(move);
126 DPair p1=li1.next();
127 DPair p2=li2.next();
134 res.add(li1.next());
138 res.add(li2.next());
159 DPair p1=li1.next();
160 DPair p2=li2.next();
|
H A D | VizDVar.java | 66 String next = s.next();
67 if (next.equals("..")) {
|
/barrelfish-2018-10-04/lib/lwip/src/core/ |
H A D | mem.c | 157 /** index (-> ram[next]) of the next struct */ 158 mem_size_t next; member in struct:mem 159 /** index (-> ram[next]) of the next struct */ 242 LWIP_ASSERT("plug_holes: mem->next <= MEM_SIZE_ALIGNED", 243 mem->next <= MEM_SIZE_ALIGNED); 245 nmem = (struct mem *) &ram[mem->next]; 247 /* if mem->next is unused and not end of ram, combine mem and mem->next */ 439 mem_size_t next; local [all...] |
H A D | raw.c | 110 found faster next time */ 111 prev->next = pcb->next; 112 pcb->next = raw_pcbs; 122 pcb = pcb->next; 312 raw_pcbs = raw_pcbs->next; 315 for (pcb2 = raw_pcbs; pcb2 != NULL; pcb2 = pcb2->next) { 317 if (pcb2->next != NULL && pcb2->next == pcb) { 319 pcb2->next [all...] |
/barrelfish-2018-10-04/lib/lwip2/src/core/ |
H A D | mem.c | 265 /** index (-> ram[next]) of the next struct */ 266 mem_size_t next; member in struct:mem 354 LWIP_ASSERT("plug_holes: mem->next <= MEM_SIZE_ALIGNED", mem->next <= MEM_SIZE_ALIGNED); 356 nmem = (struct mem *)(void *)&ram[mem->next]; 358 /* if mem->next is unused and not end of ram, combine mem and mem->next */ 362 mem->next = nmem->next; 534 mem_size_t next; local [all...] |
H A D | timeouts.c | 224 timeout->next = NULL; 241 timeout->next = next_timeout; 244 for (t = next_timeout; t != NULL; t = t->next) { 246 if (t->next == NULL || t->next->time > timeout->time) { 247 if (t->next != NULL) { 248 t->next->time -= timeout->time; 256 timeout->next = t->next; 257 t->next [all...] |
H A D | tcp_in.c | 174 /* TCP header fits into first pbuf, options don't - data is in the next pbuf */ 175 /* there must be a next pbuf, due to hdrlen_bytes sanity check above */ 176 LWIP_ASSERT("p->next != NULL", p->next != NULL); 185 /* options continue in the next pbuf: set p to zero length and hide the 186 options in the next pbuf (adjusting p->tot_len) */ 190 if (opt2len > p->next->len) { 192 LWIP_DEBUGF(TCP_INPUT_DEBUG, ("tcp_input: options overflow second pbuf (%"U16_F" bytes)\n", p->next->len)); 198 tcphdr_opt2 = (u8_t*)p->next->payload; 200 /* advance p->next t 951 tcp_oos_insert_segment(struct tcp_seg *cseg, struct tcp_seg *next) argument 999 struct tcp_seg *next; local [all...] |
/barrelfish-2018-10-04/lib/mdb/ |
H A D | mdb.c | 59 for (struct cte *next = mdb_successor(cte); 60 next && is_copy(&next->cap, &cte->cap); 61 next = mdb_successor(next)) 64 if (!(next->mdbnode.remote_copies == old_copies 65 && next->mdbnode.remote_ancs == old_ancs 66 && next->mdbnode.remote_descs == old_descs)) 70 next, next 101 struct cte *next = mdb_find_greater(&cte->cap, false); local 170 struct cte *next = mdb_successor(cte); local [all...] |
/barrelfish-2018-10-04/kernel/include/ |
H A D | kcb.h | 40 /// These fields point to the next and previous kcb that should be 42 /// invariant: next == NULL --> prev == NULL 43 /// invariant: next is the next kcb in the ring and prev is the previous 45 struct kcb *next, *prev; member in struct:kcb 82 printk(LOG_DEBUG, " next = %p, prev = %p\n", 83 kcb_current->next, kcb_current->prev); 96 static inline void switch_kcb(struct kcb *next) argument 98 assert (next != NULL); 99 kcb_current = next; [all...] |
/barrelfish-2018-10-04/usr/boot_perfmon/ |
H A D | relations.c | 20 struct list *next; member in struct:list 57 list->next = r->head; 72 walk = walk->next; 89 walk = walk->next; 102 walk = walk->next;
|
/barrelfish-2018-10-04/usr/drivers/ioat_dma/ |
H A D | ioat_mgr_service.c | 18 struct ioat_dev_handle *next; member in struct:ioat_dev_handle 43 dev->next = avail_devices; 60 avail_devices = dev->next; 62 dev->next = used_devices; 78 handle->next = avail_devices;
|
/barrelfish-2018-10-04/lib/libc/rpc/ |
H A D | pmap_prot2.c | 102 struct pmaplist **next = NULL; /* pacify gcc */ local 117 * the case of freeing we must remember the next object 121 next = &((*rp)->pml_next); 125 rp = (freeing) ? next : &((*rp)->pml_next);
|
/barrelfish-2018-10-04/usr/eclipseclp/Visualisation/src/com/parctechnologies/eclipse/visualisation/ |
H A D | ViewletSelectionImpl.java | 54 firstViewlet = (Viewlet) (iterator().next()); 61 currentAction = (ViewletAction) firstViewletsActionsIterator.next(); 67 currentViewlet = (Viewlet) viewletsIterator.next();
|
/barrelfish-2018-10-04/lib/octopus/server/ |
H A D | queue.c | 39 for (; *walk != NULL; walk = &(*walk)->next) { 43 st->next = NULL; 49 b->st = head->next;
|
/barrelfish-2018-10-04/usr/kaluga/ |
H A D | queue.c | 23 for(; *walk != NULL; walk = &(*walk)->next) { 27 st->next = NULL; 33 b->st = head->next;
|
/barrelfish-2018-10-04/lib/ahci/ |
H A D | ahci_dma_pool.c | 49 // pointers to previous and next free chunks 50 struct free *next, *prev; member in struct:free 201 last_free->next = f; 203 f->next = NULL; 232 // we were first free, f->next != NULL, make f->next first_free 233 first_free = f->next; 238 last_free->next = NULL; 241 f->prev->next = f->next; [all...] |
/barrelfish-2018-10-04/lib/barrelfish/ |
H A D | notificator.c | 11 // if (element->next == element) { 16 // element->prev->next = element->next; 17 // element->next->prev = element->prev; 19 // *queue = element->next; 22 // element->prev = element->next = NULL; 31 element->next = element->prev = element; 33 element->next = *queue; 35 element->next->prev = element; 36 element->prev->next [all...] |
H A D | bulk_transfer.c | 29 tmp = bt->free_list->next; 36 tmp = bt->alloc_list->next; 75 current_pbuf->next = tmp; 84 current_pbuf->next = NULL; 136 bt->free_list = bt->free_list->next; 137 head->next = bt->alloc_list; 170 i != NULL; prev = i, i = i->next) { 174 bt->alloc_list = i->next; 177 prev->next = i->next; [all...] |
/barrelfish-2018-10-04/lib/dma/include/ |
H A D | dma_request_internal.h | 30 struct dma_request *next; ///< member in struct:dma_request 61 * \brief sets the next DMA request of the given request 64 * \param next DMA request 67 struct dma_request *next);
|
/barrelfish-2018-10-04/usr/acpi/ |
H A D | vtd_domains.h | 28 struct vtd_domain * next; member in struct:vtd_domain 67 new_domain->next = NULL; 76 newd->next = lst->head; 84 lst->tail->next = newd; 92 newd->next = nextd; 94 prevd->next = newd; 117 lst->head->next->prev = NULL; 118 lst->head = lst->head->next; 126 lst->tail->prev->next = NULL; 135 prevd->next [all...] |
/barrelfish-2018-10-04/usr/drivers/usb/usb_manager/ |
H A D | usb_memory.c | 80 free_pages = free_pages->next; 81 ret->next = NULL; 122 mem->next = free_pages; 124 mem->next = NULL; 146 prev->next = ret->next; 149 free_dma_buffers = ret->next; 150 ret->next = NULL; 156 ret = ret->next; 192 page->next [all...] |
/barrelfish-2018-10-04/usr/replay/ |
H A D | hash.c | 32 for (curr = hash->table[i]; curr != NULL; curr = curr->next) 45 curr = curr->next; 67 curr = curr->next; 76 new_entry->next = hash->table[bucket]; 96 curr = curr->next; 121 curr = curr->next; 127 hash->table[bucket] = curr->next; 129 prev->next = curr->next; 152 entry1 = entry1->next; [all...] |
/barrelfish-2018-10-04/usr/eclipseclp/Kernel/src/ |
H A D | sch_types.h | 59 struct st_edge_ds * next; /* double links of branches */ member in struct:st_edge_ds 98 struct st_susp_ds * next; member in struct:st_susp_ds 105 st_susp_t *next; member in struct:susp_buffer_ds 119 struct install_req_ds *next; member in struct:install_req_ds
|