Design/Requirements/Requirements.rst

27 This document therefore summarizes RCU's requirements, and can be
110 started after the ``synchronize_rcu()`` started, and must therefore also
111 load a value of one from ``x``. Therefore, the outcome:
249 optimizations could cause trouble. Therefore, we clearly need some way
569 | Therefore, there absolutely must be a full memory barrier between the |
645 guarantee. Therefore, the justification for adding a conditional
682 therefore all too easy to assume that RCU is guaranteeing more than it
804 | ``synchronize_rcu()`` completed. Therefore, the code following        |
987 | Therefore, even in practice, RCU users must abide by the theoretical  |
995 RCU implementation must abide by them. They therefore bear repeating:
1014    dramatic slowdowns. RCU is therefore obligated to use algorithms that
1019    must therefore use scalable locking designs.
1021    counters must therefore tolerate counter wrap, or be designed such
1032    kernel in a single shared-memory environment. RCU must therefore pay
1170 Linux-kernel RCU implementations must therefore avoid unnecessarily
1213 throughput. It may therefore incur several milliseconds of latency in
1307 | protect against. Therefore, any insertions will be delayed until      |
1416 difficult to distinguish from system hangs. Therefore, RCU must provide
1444    defeats the above ``need_resched()`` strategem. RCU will therefore
1552 Therefore, RCU priority boosting is provided to help deal with this
1641    panics. RCU therefore supplies the ``rcu_sysrq_start()`` and
1661    error-prone. Therefore, RCU-protected `linked
1736 RCU must therefore wait for a given CPU to actually come online before
1859 functions must therefore cancel any delayed calls to loadable-module
1870 RCU therefore provides ``rcu_barrier()``, which waits until all
1872 ``call_rcu()``, its exit function should therefore prevent any future
1887    to wait for RCU callbacks that have already been posted. Therefore, if
1898 | callback to be invoked. Doesn't ``rcu_barrier()`` therefore need to   |
1959 Therefore, it is now perfectly legal to execute ``rcu_read_lock()``
2027 Therefore, the Linux-kernel definitions of ``rcu_read_lock()`` and
2036 by people with battery-powered embedded systems. RCU therefore conserves
2081 running in userspace. RCU must therefore track ``nohz_full`` userspace
2082 execution. RCU must therefore be able to sample state at two points in
2249 will result in a splat. It is therefore necessary to exercise caution
2270 must therefore use efficient implementations, especially in its
2280 implementation. RCU therefore makes heavy use of a combining tree based
2295 is inappropriate. Kernels built with ``CONFIG_PREEMPT=y`` therefore use
2308 therefore be sufficient for these sorts of configurations. To my
2372 section is therefore strictly historical in nature.
2426 this section is therefore strictly historical in nature.
2432 RCU read-side critical section can be a quiescent state. Therefore,
2606 three APIs are therefore implemented by separate functions that check