Home
last modified time | relevance | path

Searched refs:lockless (Results 1 – 21 of 21) sorted by relevance

/linux-6.15/Documentation/locking/
H A Dpi-futex.rst33 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 Dseqlock.rst9 lockless readers (read-only retry loops), and no writer starvation. They
217 3. Conditional lockless reader (as in 1), or locking reader (as in 2),
218 according to a passed marker. This is used to avoid lockless readers
220 activity. First, a lockless read is tried (even marker passed). If
222 the next iteration marker), the lockless read is transformed to a
H A Drobust-futexes.rst106 so it can be accessed by the kernel in a lockless way.
/linux-6.15/tools/memory-model/Documentation/
H A Dsimple.txt135 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 Daccess-marking.txt305 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-6.15/Documentation/networking/
H A Dpage_pool.rst54 This lockless guarantee naturally comes from running under a NAPI softirq.
/linux-6.15/Documentation/driver-api/usb/
H A Dusb3-debug-port.rst41 Other uses include simpler, lockless logging instead of a full-
/linux-6.15/Documentation/RCU/
H A Drculist_nulls.rst103 before the move, 'next' pointer is NULL, and lockless reader can not
H A Dchecklist.rst32 for lockless updates. This does result in the mildly
36 of lockless algorithms that garbage collectors do.
H A DRTFP.txt192 2011 marked the inclusion of Nick Piggin's fully lockless dentry search
1462 ,Title="[patch 3/3] radix-tree: {RCU} lockless readside"
1517 Uses RCU-protected radix tree for a lockless page cache.
1765 ,Title="{[PATCH]} {QRCU} with lockless fastpath"
1912 ,Title="Performance of memory reclamation for lockless synchronization"
H A DlistRCU.rst24 A widely used usecase for RCU lists in the kernel is lockless iteration over
/linux-6.15/virt/kvm/
H A Dkvm_main.c528 bool lockless; member
584 if (WARN_ON_ONCE(range->lockless && !IS_KVM_NULL_FN(range->on_lock))) in kvm_handle_hva_range()
623 gfn_range.lockless = range->lockless; in kvm_handle_hva_range()
627 if (!range->lockless) { in kvm_handle_hva_range()
644 if (r.found_memslot && !range->lockless) in kvm_handle_hva_range()
666 .lockless = IS_ENABLED(CONFIG_KVM_MMU_LOCKLESS_AGING), in kvm_age_hva_range()
/linux-6.15/Documentation/trace/
H A Ddebugging.rst30 written to the tracing ring buffer in a lockless way. To make it even
H A Dring-buffer-design.rst420 The main idea behind the lockless algorithm is to combine the moving
/linux-6.15/kernel/rcu/
H A DKconfig.debug168 containing only lockless code. After all, it is quite possible
/linux-6.15/arch/x86/
H A DKconfig.debug49 initialized. Other uses include simpler, lockless logging instead of
/linux-6.15/Documentation/bpf/
H A Dringbuf.rst180 completely lockless and independent. All records become available to consumer
/linux-6.15/Documentation/target/
H A Dtcmu-design.rst104 (mailbox); a lockless producer/consumer circular buffer for commands
/linux-6.15/Documentation/scsi/
H A Dscsi_eh.rst285 keep queue manipulation lockless
/linux-6.15/include/linux/
H A Dkvm_host.h270 bool lockless; member
/linux-6.15/Documentation/mm/
H A Dprocess_addrs.rst305 establishes this suffices for traversal (there are also lockless variants