X-Git-Url: https://git.lttng.org/?p=urcu.git;a=blobdiff_plain;f=doc%2Fexamples%2Furcu-flavors%2Fbp.c;h=1875a860b781a9f91ff80beb25d302f6a6dd44fb;hp=64978fcef2f8f305e3c4f72078f99b415d98fc25;hb=b9050d917ab84db192b5609ba6dd9973a82d215a;hpb=042e8cfe9b352b325a7350f345a3f2923606a2be diff --git a/doc/examples/urcu-flavors/bp.c b/doc/examples/urcu-flavors/bp.c index 64978fc..1875a86 100644 --- a/doc/examples/urcu-flavors/bp.c +++ b/doc/examples/urcu-flavors/bp.c @@ -22,7 +22,7 @@ #include #include -#include /* Bulletproof RCU flavor */ +#include /* Bulletproof RCU flavor */ #include /* List example */ #include /* For CAA_ARRAY_SIZE */ @@ -81,7 +81,7 @@ int main(int argc, char **argv) * with rcu_read_lock() and rcu_read_unlock(). They can be * nested. Those are no-ops for the QSBR flavor. */ - rcu_read_lock(); + urcu_bp_read_lock(); /* * RCU traversal of the linked list. @@ -89,7 +89,7 @@ int main(int argc, char **argv) cds_list_for_each_entry_rcu(node, &mylist, node) { printf("Value: %" PRIu64 "\n", node->value); } - rcu_read_unlock(); + urcu_bp_read_unlock(); /* * Removing nodes from linked list. Safe against concurrent RCU @@ -104,7 +104,7 @@ int main(int argc, char **argv) * spawning any call_rcu() thread. It is slower though, * since there is no batching. */ - synchronize_rcu(); + urcu_bp_synchronize_rcu(); free(node); }