Signed-off-by: Akira Yokosawa <akiyks@xxxxxxxxx>
---
datastruct/datastruct.tex | 12 ++++++------
1 file changed, 6 insertions(+), 6 deletions(-)
diff --git a/datastruct/datastruct.tex b/datastruct/datastruct.tex
index 7186b611..99da03bf 100644
--- a/datastruct/datastruct.tex
+++ b/datastruct/datastruct.tex
@@ -493,8 +493,8 @@ shows \co{hashtab_lookup()} for the RCU-protected per-bucket-locked
hash table.
This is identical to that in
\cref{lst:datastruct:Hash-Table Lookup}
-except that \co{cds_list_for_each_entry()} is replaced
-by \co{cds_list_for_each_entry_rcu()}.
+except that \apiur{cds_list_for_each_entry()} is replaced
+by \apiur{cds_list_for_each_entry_rcu()}.
Both of these primitives traverse the hash chain referenced
by \co{htb->htb_head} but \co{cds_list_for_each_entry_rcu()} also
correctly enforces memory ordering in case of concurrent insertion.
@@ -545,12 +545,12 @@ shows \co{hashtab_add()} and \co{hashtab_del()}, both of which
are quite similar to their counterparts in the non-RCU hash table
shown in
\cref{lst:datastruct:Hash-Table Modification}.
-The \co{hashtab_add()} function uses \co{cds_list_add_rcu()} instead
-of \co{cds_list_add()} in order to ensure proper ordering when
+The \co{hashtab_add()} function uses \apiur{cds_list_add_rcu()} instead
+of \apiur{cds_list_add()} in order to ensure proper ordering when
an element is added to the hash table at the same time that it is
being looked up.
-The \co{hashtab_del()} function uses \co{cds_list_del_rcu()} instead
-of \co{cds_list_del_init()} to allow for the case where an element is
+The \co{hashtab_del()} function uses \apiur{cds_list_del_rcu()} instead
+of \apiur{cds_list_del_init()} to allow for the case where an element is
looked up just before it is deleted.
Unlike \co{cds_list_del_init()}, \co{cds_list_del_rcu()} leaves the
forward pointer intact, so that \co{hashtab_lookup()} can traverse
--
2.17.1
