Lines Matching refs:code
6 (LKMM) is quite complex, with subtle differences in code often having
22 Single-threaded code
25 In single-threaded code, there is no reordering, at least assuming
27 it is generally a mistake to assume your code will only run in a single
28 threaded context as the kernel can enter the same code path on multiple
33 your code really is executed within a single thread that does not access
35 that you acquire at the beginning of your code and release at the end,
36 taking care to ensure that all references to your code's shared data are
38 this lock at a given time, your code will be executed single-threaded.
39 This approach is called "code locking".
42 should be used with caution, and only on code paths that execute rarely.
56 surprisingly hard to correctly code production-quality lock acquisition
59 from moving code in either direction across the locking function.
61 Despite the scalability limitations of single-threaded code, RCU
71 Packaged code
74 Even if performance and scalability concerns prevent your code from
89 With code locking, we use single-threaded code execution to guarantee
90 serialized access to the data that the code is accessing. However,
93 in the code execution that will execute as though it is single threaded.
142 in read-side code". Yes, you can do writes from within sequence-locking
149 currently necessary to open-code it in your litmus tests.)
158 keep-things-simple rules for RCU are "do not write in read-side code"
165 source code.
194 Reading code using these primitives is often also quite helpful.
207 or modifying the variable. This approach guarantees that code prior
209 happened before any code following any later access to that same variable.
247 Today's optimizing compilers can profoundly rewrite your code during the