| /linux/tools/memory-model/Documentation/ |
| H A D | simple.txt | 39 This approach is called "code locking".
41 Code locking can severely limit both performance and scalability, so it
47 One of the advantages of locking is that, in happy contrast with the
48 year 1981, almost all kernel developers are very familiar with locking.
52 Please use the standard locking primitives provided by the kernel rather
58 locking functions must carefully prevent both the CPU and the compiler
59 from moving code in either direction across the locking function.
86 Data locking
89 With code locking, we use single-threaded code execution to guarantee
104 As the number of buckets increases, data locking scales naturally.
[all …]
|
| H A D | locking.txt | 16 The basic rule of locking is worth repeating:
82 locking basic rule extend across multiple acquisitions of a given lock
90 double-checked locking work correctly, This litmus test illustrates
93 /* See Documentation/litmus-tests/locking/DCL-broken.litmus. */
118 /* See Documentation/litmus-tests/locking/DCL-fixed.litmus. */
151 It is not necessarily the case that accesses ordered by locking will be
232 /* See Documentation/litmus-tests/locking/RM-fixed.litmus. */
269 /* See Documentation/litmus-tests/locking/RM-broken.litmus. */
|
| /linux/fs/gfs2/ |
| H A D | Kconfig | 22 the locking module below. Documentation and utilities for GFS2 can
29 bool "GFS2 DLM locking"
33 Multiple node locking module for GFS2
35 Most users of GFS2 will require this. It provides the locking
|
| /linux/Documentation/litmus-tests/ |
| H A D | README | 41 locking (/locking directory)
45 Demonstrates that double-checked locking needs more than just
49 Demonstrates corrected double-checked locking that uses
54 Demonstrates problems with "roach motel" locking, where code is
|
| /linux/Documentation/locking/ |
| H A D | lockdep-design.rst | 1 Runtime locking correctness validator
14 respect to locking rules, even if the locks may have multiple (possibly
51 where the n STATEs are coded in kernel/locking/lockdep_states.h and as of
61 When locking rules are violated, these usage bits are presented in the
62 locking error messages, inside curlies, with a total of 2 * n STATEs bits.
152 i.e., there can be any other locking sequence between the acquire-lock
168 The above rules are enforced for any locking sequence that occurs in the
192 Exception: Nested data dependencies leading to nested locking
202 An example of such an object hierarchy that results in "nested locking"
207 automatically detect this natural ordering, as the locking rule behind
[all …]
|
| H A D | preempt-locking.rst | 12 A preemptible kernel creates new locking issues. The issues are the same as
14 kernel model leverages existing SMP locking mechanisms. Thus, the kernel
15 requires explicit additional locking for very few additional situations.
32 First, since the data is per-CPU, it may not have explicit SMP locking, but
132 in doubt, rely on locking or explicit preemption disabling.
|
| H A D | pi-futex.rst | 18 recursive locking, etc.
26 improve the statistical distribution of locking related application
54 to think about how to offer the option of a deterministic locking
62 problems as other user-space locking constructs). Fact is, pretty much
122 Documentation/locking/rt-mutex.rst.
|
| H A D | locktorture.rst | 9 that runs torture tests on core kernel locking primitives. The kernel
76 Torture-framework (RCU + locking)
145 -only- be positive if there is a bug in the locking primitive's
167 were no locking failures, CPU-hotplug problems were detected.
|
| H A D | rt-mutex.rst | 7 (PTHREAD_PRIO_INHERIT). [See Documentation/locking/pi-futex.rst for more details
41 locking overhead when locking an uncontended mutex or unlocking a mutex
|
| /linux/Documentation/translations/zh_CN/locking/ |
| H A D | index.rst | 4 :Original: Documentation/locking/index.rst
30 * preempt-locking
|
| H A D | mutex-design.rst | 4 :Original: Documentation/locking/mutex-design.rst
37 kernel/locking/mutex.c中实现。这些锁使用一个原子变量（->owner）来跟踪
|
| /linux/Documentation/litmus-tests/locking/ |
| H A D | DCL-broken.litmus | 6 * This litmus test demonstrates more than just locking is required to
7 * correctly implement double-checked locking.
|
| H A D | DCL-fixed.litmus | 6 * This litmus test demonstrates that double-checked locking can be
8 * in addition to the locking.
|
| /linux/Documentation/filesystems/ |
| H A D | locking.rst | 5 The text below describes the locking rules for VFS-related methods.
7 prototypes or locking protocols - update this file. And update the relevant
37 locking rules:
95 locking rules:
135 See Documentation/filesystems/directory-locking.rst for more detailed discussion
136 of the locking scheme for directory operations.
152 locking rules:
186 locking rules:
221 writes to quota files with quotas on). For other details about locking
233 locking rules:
[all …]
|
| H A D | gfs2.rst | 15 GFS2 uses interchangeable inter-node locking mechanisms, the currently
22 - uses the distributed lock manager (dlm) for inter-node locking.
|
| /linux/Documentation/gpu/ |
| H A D | drm-vm-bind-locking.rst | 4 VM_BIND locking
7 This document attempts to describe what's needed to get VM_BIND locking right,
8 including the userptr mmu_notifier locking. It also discusses some
11 implementation. In addition, there is a section describing the VM_BIND locking
18 set of helpers implements much, but not all of the locking described
53 allows deadlock-safe locking of multiple dma_resvs in arbitrary
69 Locks and locking order
77 The following locks and locking orders are used:
111 lists are manipulated. However, to avoid locking order violations
128 over the gpu_vm_bo and gpu_vma lists to avoid locking-order violations.
[all …]
|
| H A D | implementation_guidelines.rst | 10 drm-vm-bind-locking
|
| /linux/Documentation/sound/cards/ |
| H A D | img-spdif-in.rst | 43 This control is used to modify the locking/jitter rejection characteristics
44 of the block. Larger values increase the locking range, but reduce jitter
|
| /linux/Documentation/kernel-hacking/ |
| H A D | index.rst | 11 locking
|
| /linux/Documentation/process/ |
| H A D | volatile-considered-harmful.rst | 35 If all the code follows the locking rules, the value of shared_data cannot
45 If shared_data were declared volatile, the locking would still be
49 volatile. When dealing with shared data, proper locking makes volatile
87 locking. So jiffies can be volatile, but the addition of other
|
| /linux/Documentation/driver-api/soundwire/ |
| H A D | index.rst | 11 locking
|
| /linux/Documentation/pcmcia/ |
| H A D | index.rst | 12 locking
|
| /linux/Documentation/translations/zh_CN/kernel-hacking/ |
| H A D | index.rst | 22 - locking
|
| /linux/Documentation/virt/kvm/ |
| H A D | index.rst | 19 locking
|
| /linux/Documentation/translations/it_IT/kernel-hacking/ |
| H A D | index.rst | 16 locking
|