X-Git-Url: https://git.liburcu.org/?a=blobdiff_plain;f=doc%2Fexamples%2Flist%2Fcds_list_add_tail_rcu.c;h=f7490aff4b3edfcb6ffa2c7d43557cb31b763af6;hb=HEAD;hp=53784c9a167071ee0d9333b3984ee9ed22b5ae5f;hpb=05796604aee3ce40f4170b691b6126c89c2d09e6;p=urcu.git diff --git a/doc/examples/list/cds_list_add_tail_rcu.c b/doc/examples/list/cds_list_add_tail_rcu.c index 53784c9..475cf66 100644 --- a/doc/examples/list/cds_list_add_tail_rcu.c +++ b/doc/examples/list/cds_list_add_tail_rcu.c @@ -1,22 +1,15 @@ +// 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 add into tail of a linked-list safely * against concurrent RCU traversals. */ #include -#include /* Userspace RCU flavor */ +#include /* Userspace RCU flavor */ #include /* RCU list */ #include /* For CAA_ARRAY_SIZE */ @@ -28,7 +21,7 @@ struct mynode { struct cds_list_head node; /* Linked-list chaining */ }; -int main(int argc, char **argv) +int main(void) { int values[] = { -5, 42, 36, 24, }; CDS_LIST_HEAD(mylist); /* Defines an empty list head */