Lines Matching defs:queue
39 ck_barrier_combining_queue_dequeue(struct ck_barrier_combining_queue *queue)
43 if (queue->head != NULL) {
44 front = queue->head;
45 queue->head = queue->head->next;
72 * into the barrier's tree. We use a queue to implement this
76 ck_barrier_combining_queue_enqueue(struct ck_barrier_combining_queue *queue,
81 if (queue->head == NULL) {
82 queue->head = queue->tail = node_value;
86 queue->tail->next = node_value;
87 queue->tail = node_value;
99 struct ck_barrier_combining_queue queue;
101 queue.head = queue.tail = NULL;
114 ck_barrier_combining_queue_enqueue(&queue, root->root);
115 while (queue.head != NULL) {
116 node = ck_barrier_combining_queue_dequeue(&queue);
134 ck_barrier_combining_queue_enqueue(&queue, node->left);
135 ck_barrier_combining_queue_enqueue(&queue, node->right);