Lines Matching refs:code

132 | code does run concurrently with readers, whether pre-existing or not. |
201 reader's code later, but in the meantime, just think of the reader as
225 their rights to reorder this code as follows:
325 CPUs like the DEC Alpha) can trip this code up. For but one example, if
427    read-side critical section or in a code segment where the pointer
428    cannot change, for example, in code protected by the corresponding
531 | code, why does it matter how it relates to a grace period?” The       |
533 | itself that is important, but rather the relationship of the code     |
534 | within the enclosed RCU read-side critical section to the code        |
602 | absolutely no code in some kernel builds. This means that the         |
612 | absolutely no code, RCU infers quiescent states only at special       |
614 | schedule() had better prevent calling-code accesses to shared         |
618 | sections, no matter how aggressively the compiler scrambles the code. |
619 | Again, this all assumes that the compiler cannot scramble code across |
621 | loop, into user-mode code, and so on. But if your kernel build allows |
674 This guarantee allows lookup code to be shared between read-side and
675 update-side code, and was premeditated, appearing in the earliest
742 | Can't the compiler also reorder this code?                            |
805 | synchronize_rcu() completed. Therefore, the code following            |
1285 be legal, including within preempt-disable code, local_bh_disable()
1286 code, interrupt-disable code, and interrupt handlers. However, even
1373 But what if the updater must wait for the completion of code to be
1501 rcu_read_unlock() generate no code, such as Linux-kernel RCU when
1562 RCU callbacks in the call_rcu() code path. Finally, high update
1572 motivated addition of some RCU code to react to high update rates, for
1590    critical section. Update-side code can use
1823 code, as are invocations of call_rcu().
1831 way during a rewrite of RCU's dyntick-idle code.
1846 normal interrupts. One way that this can happen is for code that
1849 code structure, which has ct_irq_enter() invoking
1874 the underlying module-unload code could invoke rcu_barrier()
1971 code, and the FQS loop, all of which refer to or modify this bookkeeping.
1994 nesting.  The fact that interrupt-disabled regions of code act as RCU
2001 It is possible to use tracing on RCU code, but tracing itself uses RCU.
2020 For example, suppose that the source code looked like this:
2031 The compiler must not be permitted to transform this source code into
2084 clean-sheet rewrites of RCU's energy-efficiency code, the last of which
2168    ``CONFIG_PROVE_RCU=y``, just in case one of your code paths was in
2178 #. If a CPU is executing in the kernel, the kernel code path is passing
2210 Although small-memory non-realtime systems can simply use Tiny RCU, code
2264 hot code paths in performance-critical portions of the Linux kernel's
2265 networking, security, virtualization, and scheduling code paths. RCU
2395 overhead should be associated with the code following the RCU-bh
2428 not have this property, given that any point in the code outside of an
2478 That said, one consequence of these domains is that read-side code must
2595 anywhere in the code, it is not possible to use read-side markers such
2618 states.  After all, in preemptible kernels, a task executing code in a
2638 of code running on any online CPU, including those executed when RCU is
2717 utilization by RCU's kthreads and softirq handlers to the code that