Searched refs:lockless (Results 1 – 18 of 18) sorted by relevance
| /linux/Documentation/locking/ |
| H A D | pi-futex.rst | 33 technique that often cannot be replaced with lockless algorithms. As we
35 lockless structures are rather the exception than the norm - the current
36 ratio of lockless vs. locky code for shared data structures is somewhere
37 between 1:10 and 1:100. Lockless is hard, and the complexity of lockless
40 data structures, instead of lockless algorithms. Furthermore, there are
41 cases (like shared hardware, or other resource limits) where lockless
|
| H A D | robust-futexes.rst | 106 so it can be accessed by the kernel in a lockless way.
|
| /linux/tools/memory-model/Documentation/ |
| H A D | simple.txt | 135 lock-based programming, but there are a few lockless design patterns that
144 lockless and should be idempotent.
156 Another lockless design pattern that has been baked into an API
214 If the lockless accesses are frequently executed reads that are used
240 It can be quite tempting to use plain C-language accesses for lockless
|
| H A D | access-marking.txt | 305 plain C-language accesses is that KCSAN can detect any erroneous lockless
312 buggy lockless writes, read_foo_diagnostic() can be updated as follows:
327 However, in order for KCSAN to detect buggy lockless writes, your kernel
489 there really can be concurrent lockless writers. KCSAN would
|
| /linux/Documentation/networking/ |
| H A D | page_pool.rst | 54 This lockless guarantee naturally comes from running under a NAPI softirq.
|
| /linux/Documentation/RCU/ |
| H A D | rculist_nulls.rst | 103 before the move, 'next' pointer is NULL, and lockless reader can not
|
| H A D | checklist.rst | 32 for lockless updates. This does result in the mildly
36 of lockless algorithms that garbage collectors do.
|
| /linux/Documentation/driver-api/usb/ |
| H A D | usb3-debug-port.rst | 41 Other uses include simpler, lockless logging instead of a full-
|
| /linux/kernel/time/ |
| H A D | Kconfig | 220 provide e.g. lockless time accessors to independent PTP clocks
|
| /linux/virt/kvm/ |
| H A D | kvm_main.c | 527 bool lockless; member
583 if (WARN_ON_ONCE(range->lockless && !IS_KVM_NULL_FN(range->on_lock))) in kvm_handle_hva_range()
622 gfn_range.lockless = range->lockless; in kvm_handle_hva_range()
626 if (!range->lockless) { in kvm_handle_hva_range()
643 if (r.found_memslot && !range->lockless) in kvm_handle_hva_range()
665 .lockless = IS_ENABLED(CONFIG_KVM_MMU_LOCKLESS_AGING), in kvm_age_hva_range()
|
| /linux/kernel/rcu/ |
| H A D | Kconfig.debug | 168 containing only lockless code. After all, it is quite possible
|
| /linux/drivers/md/ |
| H A D | Kconfig | 56 bool "MD RAID lockless bitmap support"
59 If you say Y here, support for the lockless write intent bitmap will
|
| /linux/Documentation/bpf/ |
| H A D | ringbuf.rst | 180 completely lockless and independent. All records become available to consumer
|
| /linux/Documentation/target/ |
| H A D | tcmu-design.rst | 104 (mailbox); a lockless producer/consumer circular buffer for commands
|
| /linux/Documentation/scsi/ |
| H A D | scsi_eh.rst | 285 keep queue manipulation lockless
|
| /linux/Documentation/trace/ |
| H A D | ring-buffer-design.rst | 420 The main idea behind the lockless algorithm is to combine the moving
|
| /linux/include/linux/ |
| H A D | kvm_host.h | 273 bool lockless; member
|
| /linux/Documentation/mm/ |
| H A D | process_addrs.rst | 306 establishes this suffices for traversal (there are also lockless variants
|