1 // SPDX-FileCopyrightText: 2013 Mathieu Desnoyers <mathieu.desnoyers@efficios.com>
3 // SPDX-License-Identifier: MIT
6 * This example shows how to enqueue nodes into 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 */
30 struct cds_wfcq_node
*qnode
;
32 cds_wfcq_init(&myqueue_head
, &myqueue_tail
);
37 for (i
= 0; i
< CAA_ARRAY_SIZE(values
); i
++) {
40 node
= malloc(sizeof(*node
));
46 cds_wfcq_node_init(&node
->node
);
47 node
->value
= values
[i
];
48 cds_wfcq_enqueue(&myqueue_head
, &myqueue_tail
,
53 * Show the queue content, iterate in the same order nodes were
54 * enqueued, from oldest to newest.
56 printf("myqueue content:");
57 __cds_wfcq_for_each_blocking(&myqueue_head
, &myqueue_tail
, qnode
) {
59 caa_container_of(qnode
, struct mynode
, node
);
60 printf(" %d", node
->value
);
64 cds_wfcq_destroy(&myqueue_head
, &myqueue_tail
);