39 ck_barrier_combining_queue_dequeue(struct ck_barrier_combining_queue *queue)  in ck_barrier_combining_queue_dequeue()  argument
43 	if (queue->head != NULL) {  in ck_barrier_combining_queue_dequeue()
44 		front = queue->head;  in ck_barrier_combining_queue_dequeue()
45 		queue->head = queue->head->next;  in ck_barrier_combining_queue_dequeue()
76 ck_barrier_combining_queue_enqueue(struct ck_barrier_combining_queue *queue,  in ck_barrier_combining_queue_enqueue()  argument
81 	if (queue->head == NULL) {  in ck_barrier_combining_queue_enqueue()
82 		queue->head = queue->tail = node_value;  in ck_barrier_combining_queue_enqueue()
86 	queue->tail->next = node_value;  in ck_barrier_combining_queue_enqueue()
87 	queue->tail = node_value;  in ck_barrier_combining_queue_enqueue()
99 	struct ck_barrier_combining_queue queue;  in ck_barrier_combining_group_init()  local
101 	queue.head = queue.tail = NULL;  in ck_barrier_combining_group_init()
114 	ck_barrier_combining_queue_enqueue(&queue, root->root);  in ck_barrier_combining_group_init()
115 	while (queue.head != NULL) {  in ck_barrier_combining_group_init()
116 		node = ck_barrier_combining_queue_dequeue(&queue);  in ck_barrier_combining_group_init()
134 		ck_barrier_combining_queue_enqueue(&queue, node->left);  in ck_barrier_combining_group_init()
135 		ck_barrier_combining_queue_enqueue(&queue, node->right);  in ck_barrier_combining_group_init()