+// SPDX-FileCopyrightText: 2013 Mathieu Desnoyers <mathieu.desnoyers@efficios.com>
+//
+// SPDX-License-Identifier: MIT
+
/*
- * Copyright (C) 2013 Mathieu Desnoyers <mathieu.desnoyers@efficios.com>
- *
- * THIS MATERIAL IS PROVIDED AS IS, WITH ABSOLUTELY NO WARRANTY EXPRESSED
- * OR IMPLIED. ANY USE IS AT YOUR OWN RISK.
- *
- * Permission is hereby granted to use or copy this program for any
- * purpose, provided the above notices are retained on all copies.
- * Permission to modify the code and to distribute modified code is
- * granted, provided the above notices are retained, and a notice that
- * the code was modified is included with the above copyright notice.
- *
* This example shows how to enqueue nodes into a wfcqueue.
*/
struct cds_wfcq_node node; /* Chaining in queue */
};
-int main(int argc, char **argv)
+int main(void)
{
int values[] = { -5, 42, 36, 24, };
struct cds_wfcq_head myqueue_head; /* Queue head */
cds_wfcq_init(&myqueue_head, &myqueue_tail);
/*
- * Adding nodes to the linked-list. Safe against concurrent
- * RCU traversals, require mutual exclusion with list updates.
+ * Enqueue nodes.
*/
for (i = 0; i < CAA_ARRAY_SIZE(values); i++) {
struct mynode *node;
}
/*
- * Show the queue content.
+ * Show the queue content, iterate in the same order nodes were
+ * enqueued, from oldest to newest.
*/
printf("myqueue content:");
__cds_wfcq_for_each_blocking(&myqueue_head, &myqueue_tail, qnode) {
}
printf("\n");
end:
+ cds_wfcq_destroy(&myqueue_head, &myqueue_tail);
return ret;
}