X-Git-Url: http://git.liburcu.org/?p=urcu.git;a=blobdiff_plain;f=doc%2Fexamples%2Fwfcqueue%2Fcds_wfcq_dequeue.c;h=01a34a5f434738d86bb116a7ca08fadf9e1e6ef2;hp=6488d5363ad1a258126f0c049bd26492f2c49594;hb=HEAD;hpb=c83da169e62137d669d458a03fce1ed7b76fb0c2 diff --git a/doc/examples/wfcqueue/cds_wfcq_dequeue.c b/doc/examples/wfcqueue/cds_wfcq_dequeue.c index 6488d53..01a34a5 100644 --- a/doc/examples/wfcqueue/cds_wfcq_dequeue.c +++ b/doc/examples/wfcqueue/cds_wfcq_dequeue.c @@ -1,15 +1,8 @@ +// SPDX-FileCopyrightText: 2013 Mathieu Desnoyers +// +// SPDX-License-Identifier: MIT + /* - * Copyright (C) 2013 Mathieu Desnoyers - * - * 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 dequeue nodes from a wfcqueue. */ @@ -27,7 +20,7 @@ struct mynode { 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 */ @@ -38,8 +31,7 @@ int main(int argc, char **argv) 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; @@ -76,5 +68,6 @@ int main(int argc, char **argv) } printf("\n"); end: + cds_wfcq_destroy(&myqueue_head, &myqueue_tail); return ret; }