1 // SPDX-FileCopyrightText: 2013 Mathieu Desnoyers <mathieu.desnoyers@efficios.com>
3 // SPDX-License-Identifier: MIT
6 * This example shows how to dequeue nodes from a wfcqueue.
12 #include <urcu/wfcqueue.h> /* Wait-free concurrent queue */
13 #include <urcu/compiler.h> /* For CAA_ARRAY_SIZE */
16 * Nodes populated into the queue.
19 int value
; /* Node content */
20 struct cds_wfcq_node node
; /* Chaining in queue */
25 int values
[] = { -5, 42, 36, 24, };
26 struct cds_wfcq_head myqueue_head
; /* Queue head */
27 struct cds_wfcq_tail myqueue_tail
; /* Queue tail */
31 cds_wfcq_init(&myqueue_head
, &myqueue_tail
);
36 for (i
= 0; i
< CAA_ARRAY_SIZE(values
); i
++) {
39 node
= malloc(sizeof(*node
));
45 cds_wfcq_node_init(&node
->node
);
46 node
->value
= values
[i
];
47 cds_wfcq_enqueue(&myqueue_head
, &myqueue_tail
,
52 * Dequeue each node from the queue. Those will be dequeued from
53 * the oldest (first enqueued) to the newest (last enqueued).
55 printf("dequeued content:");
57 struct cds_wfcq_node
*qnode
;
60 qnode
= cds_wfcq_dequeue_blocking(&myqueue_head
, &myqueue_tail
);
62 break; /* Queue is empty. */
64 /* Getting the container structure from the node */
65 node
= caa_container_of(qnode
, struct mynode
, node
);
66 printf(" %d", node
->value
);
71 cds_wfcq_destroy(&myqueue_head
, &myqueue_tail
);