Commit | Line | Data |
---|---|---|
ad510be0 MD |
1 | /* |
2 | * Copyright (C) 2013 Mathieu Desnoyers <mathieu.desnoyers@efficios.com> | |
3 | * | |
4 | * This library is free software; you can redistribute it and/or | |
5 | * modify it under the terms of the GNU Lesser General Public | |
6 | * License as published by the Free Software Foundation; either | |
7 | * version 2.1 of the License, or (at your option) any later version. | |
8 | * | |
9 | * This library is distributed in the hope that it will be useful, | |
10 | * but WITHOUT ANY WARRANTY; without even the implied warranty of | |
11 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU | |
12 | * Lesser General Public License for more details. | |
13 | * | |
14 | * You should have received a copy of the GNU Lesser General Public | |
15 | * License along with this library; if not, write to the Free Software | |
16 | * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA | |
17 | */ | |
18 | ||
19 | #define _LGPL_SOURCE | |
20 | #include <urcu-qsbr.h> | |
21 | #include <urcu/rculist.h> | |
22 | #include <urcu/compiler.h> | |
23 | ||
24 | #include <stdlib.h> | |
25 | #include <stdio.h> | |
26 | #include <stdint.h> | |
27 | #include <inttypes.h> | |
28 | ||
29 | /* | |
30 | * This is a mock-up example where updates and RCU traversals are | |
31 | * performed by the same thread to keep things simple on purpose. | |
32 | */ | |
33 | ||
34 | static CDS_LIST_HEAD(mylist); | |
35 | ||
36 | struct mynode { | |
37 | uint64_t value; | |
38 | struct cds_list_head node; /* linked-list chaining */ | |
39 | struct rcu_head rcu_head; /* for call_rcu() */ | |
40 | }; | |
41 | ||
42 | static | |
43 | int add_node(uint64_t v) | |
44 | { | |
45 | struct mynode *node; | |
46 | ||
47 | node = calloc(sizeof(*node), 1); | |
48 | if (!node) | |
49 | return -1; | |
50 | node->value = v; | |
51 | cds_list_add_rcu(&node->node, &mylist); | |
52 | } | |
53 | ||
54 | static | |
55 | void rcu_free_node(struct rcu_head *rh) | |
56 | { | |
57 | struct mynode *node = caa_container_of(rh, struct mynode, rcu_head); | |
58 | ||
59 | free(node); | |
60 | } | |
61 | ||
62 | int main(int argc, char **argv) | |
63 | { | |
64 | uint64_t values[] = { 42, 36, 24, }; | |
65 | unsigned int i; | |
66 | int ret; | |
67 | struct mynode *node, *n; | |
68 | ||
69 | /* | |
70 | * Each thread need using RCU read-side need to be explicitely | |
71 | * registered. | |
72 | */ | |
73 | rcu_register_thread(); | |
74 | ||
75 | /* | |
76 | * Adding nodes to the linked-list. Safe against concurrent | |
77 | * RCU traversals, require mutual exclusion with list updates. | |
78 | */ | |
79 | for (i = 0; i < CAA_ARRAY_SIZE(values); i++) { | |
80 | ret = add_node(values[i]); | |
81 | if (ret) | |
82 | goto end; | |
83 | } | |
84 | ||
85 | /* | |
86 | * For all RCU flavors except QSBR, we need to explicitly mark | |
87 | * RCU read-side critical sections with rcu_read_lock() and | |
88 | * rcu_read_unlock(). They can be nested. Those are no-ops for | |
89 | * the QSBR flavor. | |
90 | */ | |
91 | rcu_read_lock(); | |
92 | ||
93 | /* | |
94 | * RCU traversal of the linked list. | |
95 | */ | |
96 | cds_list_for_each_entry_rcu(node, &mylist, node) { | |
97 | printf("Value: %" PRIu64 "\n", node->value); | |
98 | } | |
99 | rcu_read_unlock(); | |
100 | ||
101 | /* | |
102 | * Removing nodes from linked list. Safe against concurrent RCU | |
103 | * traversals, require mutual exclusion with list updates. | |
104 | */ | |
105 | cds_list_for_each_entry_safe(node, n, &mylist, node) { | |
106 | cds_list_del_rcu(&node->node); | |
107 | call_rcu(&node->rcu_head, rcu_free_node); | |
108 | } | |
109 | ||
110 | /* | |
111 | * For QSBR flavor, we need to explicitly announce quiescent | |
112 | * states. | |
113 | */ | |
114 | rcu_quiescent_state(); | |
115 | ||
116 | /* | |
117 | * For QSBR flavor, when a thread needs to be in a quiescent | |
118 | * state for a long period of time, we use rcu_thread_offline() | |
119 | * and rcu_thread_online(). | |
120 | */ | |
121 | rcu_thread_offline(); | |
122 | ||
123 | sleep(1); | |
124 | ||
125 | rcu_thread_online(); | |
126 | ||
127 | /* | |
128 | * Waiting for previously called call_rcu handlers to complete | |
129 | * before program exits is a good practice. | |
130 | */ | |
131 | rcu_barrier(); | |
132 | ||
133 | end: | |
134 | rcu_unregister_thread(); | |
135 | return ret; | |
136 | } |