Lines Matching refs:code
24 is the dynamic NMI code in the Linux 2.6 kernel, at least on
38 1. Does the update code have proper mutual exclusion?
63 under your read-side code, which can greatly increase the
74 Please note that you *cannot* rely on code known to be built
75 only in non-preemptible kernels. Such code can and will break,
84 3. Does the update code tolerate concurrent accesses?
124 through the code, making it difficult to understand and
136 reordered to precede earlier stores. RCU code must take all of
147 code know exactly which pointers are protected by RCU.
148 Please note that compilers can also reorder code, and
159 perfectly legal (if redundant) for update-side code to
161 primitives. This is particularly useful in code that
201 If you need the callback to block, run that code in a workqueue
222 Restructure your code so that it batches the updates, allowing
274 it usually results in simpler code. So, unless update
279 in even simpler code than does synchronize_rcu() without
288 code using call_rcu() should explicitly limit update rate in
351 can be quite helpful in reducing code bloat when common code is
365 will break Alpha, cause aggressive compilers to generate bad code,
366 and confuse people trying to understand your code.
376 the callback code simply wrappers around kfree(), so that this
469 and the compiler to freely reorder code into and out of RCU
477 __rcu sparse checks to validate your RCU code. These can help