/barrelfish-master/lib/concurrent/ |
H A D | linked_list.c | 20 struct ll_element *tail, struct ll_element **left_node, void* key) 23 assert(tail != NULL); 34 if ((current == head) && (next == tail)) { 36 return tail; 47 if (current != tail) { 51 && next != tail)) { 60 if ((right_node != tail) && is_marked_reference( 75 if ((right_node != tail) && is_marked_reference( 86 return tail; 89 bool ll_contains(struct ll_element *head, struct ll_element *tail, voi argument 19 search(struct ll_element *head, struct ll_element *tail, struct ll_element **left_node, void* key) argument 96 ll_create(struct ll_element **head, struct ll_element **tail) argument 105 ll_insert(struct ll_element *head, struct ll_element *tail, void* new_key, void* data) argument 132 ll_delete(struct ll_element *head, struct ll_element *tail, void* key) argument 161 ll_print(struct ll_element *head, struct ll_element *tail) argument [all...] |
/barrelfish-master/usr/drivers/e1000/ |
H A D | e1000n_devq.h | 80 size_t tail = q->receive_tail; local 83 if (tail >= head) { 84 return size - (tail - head) -1; 86 return size - (tail + size - head) -1; 96 size_t tail = q->transmit_tail; local 99 if (tail >= head) { 100 return size - (tail - head) - 1; 102 return size - (tail + size - head) - 1;
|
/barrelfish-master/include/concurrent/ |
H A D | linked_list.h | 30 void ll_create(struct ll_element **head, struct ll_element **tail); 35 bool ll_insert(struct ll_element *head, struct ll_element *tail, 41 bool ll_delete(struct ll_element *head, struct ll_element *tail, void* key); 46 bool ll_contains(struct ll_element *head, struct ll_element *tail, void* key); 51 void ll_print(struct ll_element *head, struct ll_element *tail);
|
/barrelfish-master/lib/contmng/ |
H A D | contmng.c | 42 64, q->name, q->head, q->tail, q->running); 81 uint64_t ntail = q->tail % MAX_QUEUE_SIZE; 96 if (((q->head + 1) % MAX_QUEUE_SIZE) > q->tail) { 98 (((q->head + 1) % MAX_QUEUE_SIZE) - q->tail) 101 return q->tail - ((q->head + 1) % MAX_QUEUE_SIZE); 118 if (((q->head + 1) % MAX_QUEUE_SIZE) == q->tail) { 129 if (((q->head + 1) % MAX_QUEUE_SIZE) == q->tail) 134 printf("ERROR: CQ: head [%d], tail [%d] qqqqqq\n", q->head, q->tail); 167 if (((q->tail [all...] |
/barrelfish-master/usr/acpi/ |
H A D | vtd_domains.h | 37 struct vtd_domain *tail; member in struct:vtd_domain_list 54 new_list->tail = NULL; 81 // Inserts newd as the new tail of lst, a domain list with a size > 1 84 lst->tail->next = newd; 85 newd->prev = lst->tail; 86 lst->tail = newd; 103 doms->tail = newd; 106 } else if (nextd == NULL) { // new tail 122 // Deletes the tail of lst, a domain list with a size > 1. 125 struct vtd_domain *old_tail = lst->tail; [all...] |
/barrelfish-master/usr/proc_mgmt/ |
H A D | spawnd_state.c | 35 spawnds[core_id]->sendq.tail = NULL; 37 spawnds[core_id]->recvq.tail = NULL; 73 if(q->tail != NULL) { 74 q->tail->next = m; 79 q->tail = m; 81 return q->head == q->tail ? true : false; 94 assert(q->head != NULL && q->tail != NULL); 99 q->tail = NULL; 116 if(q->tail == NULL) { 119 q->tail [all...] |
H A D | spawnd_state.h | 32 struct msg_queue_elem *head, *tail; member in struct:msg_queue
|
/barrelfish-master/lib/bulk_transfer/backends/net/ |
H A D | e10k_queue.h | 35 // FIXME: Look for appropriate type for the _head/tail/size fields 92 size_t tail = q->tx_tail; local 95 q->tx_isctx[tail] = true; 96 d = q->tx_ring[tail]; 108 q->tx_tail = (tail + 1) % q->tx_size; 118 size_t tail = q->tx_tail; local 121 q->tx_isctx[tail] = false; 122 q->tx_opaque[tail] = opaque; 123 d = q->tx_ring[tail]; 143 q->tx_tail = (tail 203 size_t tail = q->tx_tail; local 219 size_t tail = q->rx_tail; local 394 size_t tail = q->rx_tail; local [all...] |
/barrelfish-master/lib/phoenix/ |
H A D | queue.h | 64 queue_elem_t *tail; local 69 tail = list_remove_tail(q); 70 if (tail == NULL) 73 *qe = tail;
|
/barrelfish-master/lib/libc/include/isc/ |
H A D | list.h | 29 #define LIST(type) struct { type *head, *tail; } 31 do { (list).head = NULL; (list).tail = NULL; } while (0) 45 #define TAIL(list) ((list).tail) 54 (list).tail = (elt); \ 63 if ((list).tail != NULL) \ 64 (list).tail->link.next = (elt); \ 67 (elt)->link.prev = (list).tail; \ 69 (list).tail = (elt); \ 78 INSIST((list).tail == (elt)); \ 79 (list).tail [all...] |
/barrelfish-master/lib/devif/backends/loopback/ |
H A D | loopback_queue.c | 23 size_t tail; member in struct:loopback_queue 35 //debug_printf("enqueue: head=%lu tail=%lu full\n", lq->head, lq->tail); 39 //debug_printf("enqueue: head=%lu tail=%lu \n", lq->head, lq->tail); 61 //debug_printf("dequeue: head=%lu tail=%lu emtpy\n", lq->head, lq->tail); 65 //debug_printf("dequeue: head=%lu tail=%lu \n", lq->head, lq->tail); 67 *offset = lq->queue[lq->tail] [all...] |
/barrelfish-master/lib/barrelfish/ |
H A D | flounder_txqueue.c | 85 queue->tail = NULL; 174 q->tail = NULL; 177 TXQ_DEBUG("txq_sent_cb: st=%p, head=%p, tail=%p, count=%u\n", st, q->head, 178 q->tail, q->queue_count); 181 TXQ_DEBUG("txq_sent_cb: st=%p, register sending head=%p, tail=%p, count=%u\n", 182 st, q->head, q->tail, q->queue_count); 205 if (q->tail == NULL) { 209 q->tail->next = st; 212 q->tail = st; 215 TXQ_DEBUG("txq_send: st=%p, head=%p, tail [all...] |
H A D | event_queue.c | 49 q->head = q->tail = NULL; 66 assert(q->tail == qn); 67 q->head = q->tail = NULL; 124 assert(q->tail == NULL); 153 // enqueue at tail 154 if (q->tail == NULL) { 157 q->head = q->tail = qn; 175 assert(q->tail != qn); // don't re-enqueue the same node! 176 assert(q->tail->next == NULL); 177 q->tail [all...] |
/barrelfish-master/usr/monitor/ |
H A D | queue.c | 30 if(q->tail != NULL) { 31 q->tail->next = m; 36 q->tail = m; 38 return q->head == q->tail ? true : false; 52 if(q->tail == NULL) { 55 q->tail = m; 60 return q->head == q->tail ? true : false; 66 assert(q->head != NULL && q->tail != NULL); 71 q->tail = NULL;
|
/barrelfish-master/usr/eclipseclp/icparc_solvers/ilog/ |
H A D | scheduler.cc | 130 EC_word head, tail; local 131 if (p.is_list(head, tail) != EC_succeed) { return INSTANTIATION_FAULT; } 132 p = tail; size++; 140 EC_word head, tail; local 141 p.is_list(head, tail); // check already done 143 p = tail;
|
/barrelfish-master/lib/dma/ |
H A D | dma_channel.c | 51 chan->req_list.tail = NULL; 89 assert(chan->req_list.head == chan->req_list.tail); 91 chan->req_list.tail = NULL; 116 if (chan->req_list.tail == NULL) { 117 chan->req_list.tail = req; 141 dma_request_set_next(chan->req_list.tail, req); 144 chan->req_list.tail = req; 148 DMACHAN_DEBUG("request : enq tail [%016lx] count=%u\n", chan->id,
|
H A D | dma_ring.c | 30 uint16_t tail; ///< cleanup index member in struct:dma_ring 68 * \brief gets the next descriptor based on the tail pointer and increases the 69 * tail pointer index 78 struct dma_descriptor *desc = dma_ring_get_desc(ring, ring->tail++); 80 DMADESC_DEBUG("ring getting tail desc:%p @ [%016lx], new tail: %u\n", desc, 81 dma_desc_get_paddr(desc), (ring->tail & (ring->size - 1))); 244 return (ring->write_next - ring->tail) & (ring->size - 1); 290 * \brief returns the tail pointer index of the ring 294 * \returns tail elemen [all...] |
/barrelfish-master/usr/eclipseclp/Opium/demo/ |
H A D | collect.pl | 20 CORRECT: ListA = [liechtenstein, ... , germany, tail], \n \ 21 ListT = tail. \n \ 59 collect([germany|[tail]]-[tail],[tail]-[tail],ListA-ListT).
|
/barrelfish-master/lib/lwip/src/api/ |
H A D | netbuf.c | 159 * @param tail netbuf to chain after head, freed by this function, may not be reference after returning 161 void netbuf_chain(struct netbuf *head, struct netbuf *tail) argument 165 LWIP_ERROR("netbuf_chain: invalid tail", (tail != NULL), return; 167 pbuf_cat(head->p, tail->p); 169 memp_free(MEMP_NETBUF, tail);
|
/barrelfish-master/lib/lwip2/src/api/ |
H A D | netbuf.c | 169 * @param tail netbuf to chain after head, freed by this function, may not be reference after returning 172 netbuf_chain(struct netbuf *head, struct netbuf *tail) argument 175 LWIP_ERROR("netbuf_chain: invalid tail", (tail != NULL), return;); 176 pbuf_cat(head->p, tail->p); 178 memp_free(MEMP_NETBUF, tail);
|
/barrelfish-master/usr/drivers/enet/ |
H A D | enet_devq.c | 93 size_t tail = q->tail; local 96 if (tail >= head) { 97 return (tail - head); 99 return (tail + size - head); 131 if (q->head == q->tail) { 220 struct devq_buf* buf= &q->ring_bufs[q->tail]; 230 enet_bufdesc_t desc = q->ring[q->tail]; 235 __builtin___clear_cache(q->ring[q->tail], q->ring[q->tail [all...] |
/barrelfish-master/usr/drivers/solarflare/ |
H A D | hw_queue.h | 353 size_t tail = q->rx_tail; local 355 d = q->rx_ring.user[tail]; 356 buf = &q->rx_bufs[tail]; 383 size_t tail = q->rx_tail; local 384 buf = &q->rx_bufs[tail]; 399 d = q->rx_ring.ker[tail]; 516 size_t tail = q->rx_tail; local 519 if (tail >= head) { 520 return size - (tail - head) -1; 522 return size - (tail 531 size_t tail = q->tx_tail; local 671 size_t tail = q->tx_tail; local 727 size_t tail = q->tx_tail; local [all...] |
/barrelfish-master/usr/drivers/e10k/ |
H A D | e10k_queue.h | 110 // FIXME: Look for appropriate type for the _head/tail/size fields 199 size_t tail = q->tx_tail; local 201 memset(q->tx_ring[tail], 0, e10k_q_tdesc_adv_wb_size); 204 q->tx_isctx[tail] = true; 205 d = q->tx_ring[tail]; 219 q->tx_tail = (tail + 1) % q->tx_size; 235 size_t tail = q->tx_tail; local 237 memset(q->tx_ring[tail], 0, e10k_q_tdesc_adv_wb_size); 240 q->tx_isctx[tail] = false; 241 struct devq_buf* buf = &q->tx_bufs[tail]; 284 size_t tail = q->tx_tail; local 494 size_t tail = q->tx_tail; local 514 size_t tail = q->rx_tail; local 565 size_t tail = q->rx_tail; local 774 size_t tail = q->rx_tail; local [all...] |
/barrelfish-master/lib/virtio/ |
H A D | vbuffer.c | 332 * \brief appends a buffer to the tail of buffer list 345 bl->tail = buf; 349 bl->tail->next = buf; 350 buf->prev = bl->tail; 351 bl->tail = buf; 361 * \brief prepend a buffer to the tail of buffer list 375 bl->tail = buf; 405 bl->tail = NULL; 422 * \brief returns and removes the tail of the list 439 bl->tail [all...] |
/barrelfish-master/usr/eclipseclp/icparc_solvers/ |
H A D | eregex.c | 239 pword list, tail, newtail; local 250 list = tail = ec_newvar(); /* build list forward */ 271 (void) ec_unify(tail, ec_list( 275 tail = newtail; 282 (void) ec_unify(tail, ec_nil()); 296 pword list, tail, newtail; local 307 list = tail = ec_newvar(); /* build list forward */ 328 (void) ec_unify(tail, ec_list( 334 tail = newtail; 341 (void) ec_unify(tail, ec_lis [all...] |