Signed-off-by: SeongJae Park <sj38.park@xxxxxxxxx>
---
defer/rcuusage.tex | 2 +-
defer/seqlock.tex | 2 +-
2 files changed, 2 insertions(+), 2 deletions(-)
diff --git a/defer/rcuusage.tex b/defer/rcuusage.tex
index 7796a0d..8812c25 100644
--- a/defer/rcuusage.tex
+++ b/defer/rcuusage.tex
@@ -186,7 +186,7 @@ ideal synchronization-free workload, as desired.
The \co{rcu_dereference()} primitive does constrain the
compiler's optimizations somewhat, which can result in
slightly slower code.
- This would effect would normally be insignificant, but
+ This effect would normally be insignificant, but
each search is taking on average about 13~nanoseconds,
which is short enough for small differences in code
generation to make their presence felt.
diff --git a/defer/seqlock.tex b/defer/seqlock.tex
index 23e69fb..f379439 100644
--- a/defer/seqlock.tex
+++ b/defer/seqlock.tex
@@ -389,7 +389,7 @@ increment of the sequence number on line~44, then releases the lock.
So what happens when sequence locking is applied to the Pre-BSD
routing table?
Figure~\ref{fig:defer:Sequence-Locked Pre-BSD Routing Table Lookup}
-shows the data structures and \co{route_lookup()}, adn
+shows the data structures and \co{route_lookup()}, and
Figure~\ref{fig:defer:Sequence-Locked Pre-BSD Routing Table Add/Delete}
shows \co{route_add()} and \co{route_del()} (\path{route_seqlock.c}).
This implementation is once again similar to its counterparts in earlier
--
1.9.1
--
To unsubscribe from this list: send the line "unsubscribe perfbook" in
the body of a message to majordomo@xxxxxxxxxxxxxxx
More majordomo info at http://vger.kernel.org/majordomo-info.html
