The seqcount of Chapter 8 achieves lock-free reads with a sequence number and retries, but its summary left a loose end: it only works for reading values. As soon as the read side has to follow a pointer to an object, RCU has to be layered on top, because retrying guarantees that the values read are consistent with each other but cannot guarantee that the object the pointer refers to was not freed during the read. This chapter fills that gap. RCU (Read-Copy-Update) is the lock-free read mechanism built specifically for object lifetime: it makes readers nearly free and moves the entire cost to the updater side.
The RCU implementation is huge, so this chapter is only an overview, anchored on the semantics and key interfaces; the grace-period machinery is covered in depth in section 12.3 of the mmu-notifier column. The sources for this chapter are include/linux/rcupdate.h, kernel/rcu/tree.c, and kernel/rcu/srcutree.c.
Note: the main line is x86-64 with a non-
PREEMPT_RTconfiguration. The read-side overhead of RCU differs across preemption configurations; the text below describes the classic (preemptible) semantics.