/usr/share/doc/liburcu-dev/examples/list/cds_list_replace_rcu.c is in liburcu-dev 0.9.1-3.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 | /*
* 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 replace a node within a linked-list safely
* against concurrent RCU traversals.
*/
#include <stdio.h>
#include <urcu.h> /* Userspace RCU flavor */
#include <urcu/rculist.h> /* RCU list */
#include <urcu/compiler.h> /* For CAA_ARRAY_SIZE */
/*
* Nodes populated into the list.
*/
struct mynode {
int value; /* Node content */
struct cds_list_head node; /* Linked-list chaining */
struct rcu_head rcu_head; /* For call_rcu() */
};
static
void free_node_rcu(struct rcu_head *head)
{
struct mynode *node = caa_container_of(head, struct mynode, rcu_head);
free(node);
}
int main(int argc, char **argv)
{
int values[] = { -5, 42, 36, 24, };
CDS_LIST_HEAD(mylist); /* Defines an empty list head */
unsigned int i;
int ret = 0;
struct mynode *node, *n;
/*
* Adding nodes to the linked-list. Safe against concurrent
* RCU traversals, require mutual exclusion with list updates.
*/
for (i = 0; i < CAA_ARRAY_SIZE(values); i++) {
node = malloc(sizeof(*node));
if (!node) {
ret = -1;
goto end;
}
node->value = values[i];
cds_list_add_tail_rcu(&node->node, &mylist);
}
/*
* Replacing all values by their negated value. Safe against
* concurrent RCU traversals, require mutual exclusion with list
* updates. Notice the "safe" iteration: it is safe against
* removal (and thus replacement) of nodes as we iterate on the
* list.
*/
cds_list_for_each_entry_safe(node, n, &mylist, node) {
struct mynode *new_node;
new_node = malloc(sizeof(*node));
if (!new_node) {
ret = -1;
goto end;
}
/* Replacement node value is negated original value. */
new_node->value = -node->value;
cds_list_replace_rcu(&node->node, &new_node->node);
call_rcu(&node->rcu_head, free_node_rcu);
}
/*
* Just show the list content. This is _not_ an RCU-safe
* iteration on the list.
*/
printf("mylist content:");
cds_list_for_each_entry(node, &mylist, node) {
printf(" %d", node->value);
}
printf("\n");
end:
return ret;
}
|