2 * Copyright (C) 2013 Mathieu Desnoyers <mathieu.desnoyers@efficios.com>
4 * THIS MATERIAL IS PROVIDED AS IS, WITH ABSOLUTELY NO WARRANTY EXPRESSED
5 * OR IMPLIED. ANY USE IS AT YOUR OWN RISK.
7 * Permission is hereby granted to use or copy this program for any
8 * purpose, provided the above notices are retained on all copies.
9 * Permission to modify the code and to distribute modified code is
10 * granted, provided the above notices are retained, and a notice that
11 * the code was modified is included with the above copyright notice.
13 * This example shows how to enqueue nodes into a wfcqueue.
19 #include <urcu/wfcqueue.h> /* Wait-free concurrent queue */
20 #include <urcu/compiler.h> /* For CAA_ARRAY_SIZE */
23 * Nodes populated into the queue.
26 int value
; /* Node content */
27 struct cds_wfcq_node node
; /* Chaining in queue */
30 int main(int argc
, char **argv
)
32 int values
[] = { -5, 42, 36, 24, };
33 struct cds_wfcq_head myqueue_head
; /* Queue head */
34 struct cds_wfcq_tail myqueue_tail
; /* Queue tail */
37 struct cds_wfcq_node
*qnode
;
39 cds_wfcq_init(&myqueue_head
, &myqueue_tail
);
44 for (i
= 0; i
< CAA_ARRAY_SIZE(values
); i
++) {
47 node
= malloc(sizeof(*node
));
53 cds_wfcq_node_init(&node
->node
);
54 node
->value
= values
[i
];
55 cds_wfcq_enqueue(&myqueue_head
, &myqueue_tail
,
60 * Show the queue content, iterate in the same order nodes were
61 * enqueued, from oldest to newest.
63 printf("myqueue content:");
64 __cds_wfcq_for_each_blocking(&myqueue_head
, &myqueue_tail
, qnode
) {
66 caa_container_of(qnode
, struct mynode
, node
);
67 printf(" %d", node
->value
);
71 cds_wfcq_destroy(&myqueue_head
, &myqueue_tail
);