Signed-off-by: Akira Yokosawa <[email protected]>
---
 together/applyrcu.tex | 6 +++---
 1 file changed, 3 insertions(+), 3 deletions(-)

diff --git a/together/applyrcu.tex b/together/applyrcu.tex
index 48eaa685..ff462a3b 100644
--- a/together/applyrcu.tex
+++ b/together/applyrcu.tex
@@ -900,8 +900,8 @@ this code emulates freeing by storing the value zero.
        In this textbook example, no.
 
        
\begin{fcvref}[ln:formal:C-MP+o-xchg-rcusync-o+o-xchg-rcusync-o+rl-o-o-rul:whole]
-       This is because \clnref{init:p} initialized pointer \co{p} to point to
-       variable \co{a}, so that this pointer will never be \co{NULL}.
+       This is because \clnref{init:p} initialized pointer~\co{p} to point to
+       variable~\co{a}, so that this pointer will never be \co{NULL}.
        However, this is a very good question to ask because in most
        production-quality code, a \co{NULL} check would indeed be
        necessary.
@@ -922,7 +922,7 @@ Running this example
 through \co{herd}
 (see \cref{sec:formal:Axiomatic Approaches})
 verifies that this algorithm avoid use-after-free errors (\clnref{ex:1}) and 
that it
-emulates freeing of all but one of the objects \co{a}, \co{b}, and \co{c}
+emulates freeing of all but one of the objects~\co{a}, \co{b}, and~\co{c}
 (\clnref{ex:2}), thus also avoiding memory leaks.
 \end{fcvref}
 
-- 
2.43.0



Reply via email to