uatomic/x86: Remove redundant memory barriers

[urcu.git] / doc / cds-api.md

diff --git a/doc/cds-api.md b/doc/cds-api.md
index 5bc615ea42ff9ce8deea1e4e0d65b8abea07e942..9940a366bbe9e42f68ecc0406aeb210026b2ee3d 100644 (file)
--- a/doc/cds-api.md
+++ b/doc/cds-api.md
@@ -1,3 +1,9 @@
+<!--
+SPDX-FileCopyrightText: 2023 EfficiOS Inc.
+
+SPDX-License-Identifier: CC-BY-4.0
+-->
+
 Userspace RCU Concurrent Data Structures (CDS) API
 ==================================================
 
@@ -33,12 +39,12 @@ Downside over `list.h`: lookup of tail in O(n).
 
 Doubly-linked list, with single pointer list head.
 Requires mutual exclusion on updates, allows RCU read traversals. Useful
-for implementing hash tables. Downside over rculist.h: lookup of tail in O(n).
+for implementing hash tables. Downside over `rculist.h`: lookup of tail in O(n).
 
 
 ### `urcu/wfstack.h`
 
-Stack with wait-free push and wait-free pop_all. Both
+Stack with wait-free push and wait-free pop\_all. Both
 blocking and non-blocking pop and traversal operations are provided. This
 stack does _not_ specifically rely on RCU. Various synchronization techniques
 can be used to deal with pop ABA. Those are detailed in the API.
@@ -59,7 +65,7 @@ traversal (see API for details).
 
 ### `urcu/lfstack.h`
 
-Stack with lock-free push, lock-free pop, wait-free pop_all,
+Stack with lock-free push, lock-free pop, wait-free pop\_all,
 wait-free traversal. Various synchronization techniques can be
 used to deal with pop ABA. Those are detailed in the API.
 This stack does _not_ specifically rely on RCU.