X-Git-Url: https://git.liburcu.org/?a=blobdiff_plain;f=doc%2Fexamples%2Frculfqueue%2Fcds_lfq_enqueue.c;h=b0ea03053772362bdc849de2994cf07bb780f0d2;hb=HEAD;hp=1e78f1694295280fb5c7891e9c52f92e8bd40669;hpb=b9050d917ab84db192b5609ba6dd9973a82d215a;p=urcu.git diff --git a/doc/examples/rculfqueue/cds_lfq_enqueue.c b/doc/examples/rculfqueue/cds_lfq_enqueue.c index 1e78f16..b0ea030 100644 --- a/doc/examples/rculfqueue/cds_lfq_enqueue.c +++ b/doc/examples/rculfqueue/cds_lfq_enqueue.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 enqueue nodes into a RCU lock-free queue. * This queue requires using a RCU scheme. */ @@ -29,7 +22,7 @@ struct mynode { struct cds_lfq_node_rcu node; /* Chaining in queue */ }; -int main(int argc, char **argv) +int main(void) { int values[] = { -5, 42, 36, 24, }; struct cds_lfq_queue_rcu myqueue; /* Queue */