/barrelfish-master/usr/drivers/megaraid/ |
H A D | queue.h | 45 * added to the list after an existing element or at the head of the list. 46 * Elements being removed from the head of the list should use the explicit 53 * head of the list and the other to the tail of the list. The elements are 56 * to the list after an existing element, at the head of the list, or at the 57 * end of the list. Elements being removed from the head of the tail queue 67 * or after an existing element or at the head of the list. A list 70 * A tail queue is headed by a pair of pointers, one to the head of the 74 * after an existing element, at the head of the list, or at the end of 106 /* Store the last 2 places the queue element or head was altered */ 118 #define QMD_TRACE_HEAD(head) d [all...] |
/barrelfish-master/usr/eclipseclp/Alog/src/ |
H A D | alog.c | 24 void xx_write(head,pid,event,data1,data2) 25 struct head_trace_buf *head; 36 if (head == NULL) return; 37 if (head->next_entry == head->max_size +99) 41 if (head->next_entry >= head->max_size) { 43 head->next_entry = 0; 44 if (head->cbuf->next_buf == NULL) 45 xx_i = xx_getbuf(head); [all...] |
/barrelfish-master/lib/cxx/cxxabi/ |
H A D | cxa_thread_atexit.cpp | 77 while (auto head = dtors) { 78 dtors = head->next; 79 head->dtor(head->obj); 80 std::free(head); 129 auto head = static_cast<DtorList*>(std::malloc(sizeof(DtorList))); 130 if (!head) { 134 head->dtor = dtor; 135 head->obj = obj; 136 head [all...] |
/barrelfish-master/include/sys/ |
H A D | queue.h | 45 * added to the list after an existing element or at the head of the list. 46 * Elements being removed from the head of the list should use the explicit 53 * head of the list and the other to the tail of the list. The elements are 56 * to the list after an existing element, at the head of the list, or at the 57 * end of the list. Elements being removed from the head of the tail queue 67 * or after an existing element or at the head of the list. A list 70 * A tail queue is headed by a pair of pointers, one to the head of the 74 * after an existing element, at the head of the list, or at the end of 116 /* Store the last 2 places the queue element or head was altered */ 129 #define QMD_TRACE_HEAD(head) d [all...] |
H A D | tree.h | 82 #define SPLAY_ROOT(head) (head)->sph_root 83 #define SPLAY_EMPTY(head) (SPLAY_ROOT(head) == NULL) 86 #define SPLAY_ROTATE_RIGHT(head, tmp, field) do { \ 87 SPLAY_LEFT((head)->sph_root, field) = SPLAY_RIGHT(tmp, field); \ 88 SPLAY_RIGHT(tmp, field) = (head)->sph_root; \ 89 (head)->sph_root = tmp; \ 92 #define SPLAY_ROTATE_LEFT(head, tmp, field) do { \ 93 SPLAY_RIGHT((head) [all...] |
/barrelfish-master/lib/libc/iconv/ |
H A D | citrus_hash.h | 38 #define _CITRUS_HASH_INIT(head, hashsize) \ 43 LIST_INIT(&(head)->chh_table[_ch_loop]); \ 46 #define _CITRUS_HASH_INSERT(head, elm, field, hashval) \ 47 LIST_INSERT_HEAD(&(head)->chh_table[hashval], elm, field) 48 #define _CITRUS_HASH_SEARCH(head, elm, field, matchfunc, key, hashval) \ 50 LIST_FOREACH((elm), &(head)->chh_table[hashval], field) \
|
/barrelfish-master/lib/concurrent/ |
H A D | linked_list.c | 19 static struct ll_element *search(struct ll_element *head, argument 22 assert(head != NULL); 30 struct ll_element *current = head, *next = head->next; 34 if ((current == head) && (next == tail)) { 35 (*left_node) = head; 63 current = head; 78 current = head; 89 bool ll_contains(struct ll_element *head, struct ll_element *tail, void* key) argument 92 struct ll_element *node = search(head, tai 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 | 79 size_t head = q->receive_head; local 83 if (tail >= head) { 84 return size - (tail - head) -1; 86 return size - (tail + size - head) -1; 95 size_t head = q->transmit_head; 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); 80 uint64_t nhead = q->head % 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); 154 q->qelist[q->head] [all...] |
/barrelfish-master/lib/elf/ |
H A D | elf64.c | 66 * \param shdr Pointer to head of ELF section header table. 104 struct Elf64_Ehdr *head = (struct Elf64_Ehdr *)elf_lbase; local 106 if (elf_bytes < sizeof(struct Elf64_Ehdr) || !IS_ELF(*head) || 107 head->e_ident[EI_CLASS] != ELFCLASS64) { 112 (struct Elf64_Shdr *)(elf_lbase + (uintptr_t)head->e_shoff); 114 assert(head->e_shstrndx < head->e_shnum); 116 ((void *)shead) + head->e_shstrndx * head->e_shentsize; 123 for (uint32_t i = 0; i < head 159 struct Elf64_Ehdr *head = (struct Elf64_Ehdr *)elfbase; local 229 struct Elf64_Ehdr *head = (struct Elf64_Ehdr *)elfbase; local 278 elf64_get_symbolname(struct Elf64_Ehdr *head, struct Elf64_Sym *sym) argument 323 struct Elf64_Ehdr *head = (struct Elf64_Ehdr *)elfbase; local 475 struct Elf64_Ehdr *head = (struct Elf64_Ehdr *)base; local [all...] |
H A D | elf32.c | 56 * \param shdr Pointer to head of ELF section header table. 93 struct Elf32_Ehdr *head = (struct Elf32_Ehdr *)elf_lbase; local 95 if (elf_bytes < sizeof(struct Elf32_Ehdr) || !IS_ELF(*head) || 96 head->e_ident[EI_CLASS] != ELFCLASS32) { 101 (struct Elf32_Shdr *)(elf_lbase + (uintptr_t)head->e_shoff); 103 assert(head->e_shstrndx < head->e_shnum); 105 ((void *)shead) + head->e_shstrndx * head->e_shentsize; 112 for (uint32_t i = 0; i < head 177 struct Elf32_Ehdr *head = (struct Elf32_Ehdr *)elfbase; local 244 struct Elf32_Ehdr *head = (struct Elf32_Ehdr *)elfbase; local 316 struct Elf32_Ehdr *head = (struct Elf32_Ehdr *)elfbase; local 351 elf32_get_symbolname(struct Elf32_Ehdr *head, struct Elf32_Sym *sym) argument 460 struct Elf32_Ehdr *head = (struct Elf32_Ehdr *)base; local [all...] |
/barrelfish-master/usr/boot_perfmon/ |
H A D | relations.c | 24 struct list *head; member in struct:relations 36 r->head = NULL; 56 // Add to the head of list 57 list->next = r->head; 58 r->head = list; 66 struct list *walk = r->head; 83 struct list *walk = r->head; 99 struct list *walk = r->head;
|
/barrelfish-master/lib/libc/tests/sys/ |
H A D | queue_test.c | 45 SLIST_HEAD(stailhead, entry) head = SLIST_HEAD_INITIALIZER(head); 52 SLIST_INIT(&head); 56 ATF_REQUIRE(SLIST_EMPTY(&head)); 60 SLIST_FOREACH(np, &head, entries) { 71 SLIST_INSERT_HEAD(&head, n1, entries); 74 ATF_REQUIRE_EQ(SLIST_FIRST(&head), n1); 77 SLIST_FOREACH(np, &head, entries) { 100 SLIST_FOREACH(np, &head, entries) { 111 ATF_REQUIRE_EQ(SLIST_FIRST(&head), n [all...] |
/barrelfish-master/lib/barrelfish/slot_alloc/ |
H A D | single_slot_alloc.c | 34 ret->slot = sca->head->slot; 43 sca->head->space--; 44 sca->head->slot++; 47 // Check to free head 48 if (sca->head->space == 0) { 49 struct cnode_meta *walk = sca->head; 50 sca->head = walk->next; 65 struct cnode_meta *walk = sca->head; 69 if (!sca->head) { 70 sca->head [all...] |
/barrelfish-master/usr/acpi/ |
H A D | vtd_domains.h | 36 struct vtd_domain *head; member in struct:vtd_domain_list 45 return (lst->head == NULL); 53 new_list->head = NULL; 73 // Inserts newd as the new head of lst, a domain list with a size > 1 76 newd->next = lst->head; 77 lst->head->prev = newd; 78 lst->head = newd; 102 doms->head = newd; 104 } else if (newd->did == doms->min_did) { // new head 113 // Deletes the head o [all...] |
/barrelfish-master/usr/proc_mgmt/ |
H A D | spawnd_state.c | 34 spawnds[core_id]->sendq.head = NULL; 36 spawnds[core_id]->recvq.head = NULL; 76 assert(q->head == NULL); 77 q->head = m; 81 return q->head == q->tail ? true : false; 94 assert(q->head != NULL && q->tail != NULL); 96 struct msg_queue_elem *e = q->head; 97 q->head = e->next; 98 if(q->head == NULL) { 117 assert(q->head [all...] |
/barrelfish-master/lib/bulk_transfer/backends/net/ |
H A D | e10k_queue.h | 157 size_t head = q->tx_head; local 160 if (q->tx_hwb && *q->tx_hwb == head) { 164 d = q->tx_ring[head]; 169 if (!q->tx_isctx[head]) { 174 q->tx_head = (head + 1) % q->tx_size; 181 size_t head = q->tx_head; local 187 d = q->tx_ring[head]; 188 *opaque = q->tx_opaque[head]; 191 q->tx_head = (head + 1) % q->tx_size; 202 size_t head local 279 size_t head; local 330 size_t head; local 393 size_t head = q->rx_head; local [all...] |
/barrelfish-master/tools/weever/ |
H A D | elf64.c | 106 * \param shdr Pointer to head of ELF section header table. 144 struct Elf64_Ehdr *head = (struct Elf64_Ehdr *)elf_lbase; local 146 if (elf_bytes < sizeof(struct Elf64_Ehdr) || !IS_ELF(*head) || 147 head->e_ident[EI_CLASS] != ELFCLASS64) { 152 (struct Elf64_Shdr *)(elf_lbase + (uintptr_t)head->e_shoff); 155 elf64_find_section_header_type(shead, head->e_shnum, SHT_STRTAB); 162 for (uint32_t i = 0; i < head->e_shnum; i++) 179 * \param shdr Pointer to head of ELF section header table. 288 struct Elf64_Ehdr *head = (struct Elf64_Ehdr *)base; local 298 if (!IS_ELF(*head) [all...] |
/barrelfish-master/lib/barrelfish/ |
H A D | flounder_txqueue.c | 29 assert(q->head == st); 42 MKCONT(send_cont, q->head)); 84 queue->head = NULL; 164 assert(q->head == st); 171 q->head = q->head->next; 173 if (q->head == NULL) { 177 TXQ_DEBUG("txq_sent_cb: st=%p, head=%p, tail=%p, count=%u\n", st, q->head, 181 TXQ_DEBUG("txq_sent_cb: st=%p, register sending head [all...] |
/barrelfish-master/lib/devif/backends/net/mlx4/include/linux/ |
H A D | list.h | 87 static inline int list_empty(const struct list_head *head) { argument 89 return (head->next == head); 120 #define list_for_each(p, head) \ 121 for (p = (head)->next; p != (head); p = p->next) 123 #define list_for_each_safe(p, n, head) \ 124 for (p = (head)->next, n = p->next; p != (head); p = n, n = p->next) 141 static inline void list_add(struct list_head *new, struct list_head *head) { argument 145 list_add_tail(struct list_head *new, struct list_head *head) argument 158 list_move_tail(struct list_head *entry, struct list_head *head) argument [all...] |
/barrelfish-master/usr/kaluga/ |
H A D | queue.c | 32 struct mon_msg_state *head = b->st; local 33 b->st = head->next; 42 return head;
|
/barrelfish-master/lib/barrelfish/vspace/ |
H A D | vspace.c | 40 vspace->head = NULL; 85 if (vspace->head == NULL) { 86 vspace->head = region; 92 struct vregion *walk = vspace->head; 104 region->next = vspace->head; 105 vspace->head = region; 138 struct vregion *walk = vspace->head; 147 assert(walk == vspace->head); 148 vspace->head = walk->next; 172 vspace->head [all...] |
/barrelfish-master/lib/octopus/server/ |
H A D | queue.c | 48 struct oct_reply_state* head = b->st; local 49 b->st = head->next; 58 return head;
|
/barrelfish-master/usr/monitor/ |
H A D | queue.c | 33 assert(q->head == NULL); 34 q->head = m; 38 return q->head == q->tail ? true : false; 53 assert(q->head == NULL); 54 q->head = m; 57 m->next = q->head; 58 q->head = m; 60 return q->head == q->tail ? true : false; 66 assert(q->head != NULL && q->tail != NULL); 68 struct msg_queue_elem *e = q->head; [all...] |