Home
last modified time | relevance | path

Searched refs:acquisitions (Results 1 – 12 of 12) sorted by relevance

/linux-6.1.9/Documentation/locking/
Dlockstat.rst53 - number of lock acquisitions that had to wait
64 - number of lock acquisitions that involved x-cpu data
65 acquisitions
108 …ime-min waittime-max waittime-total waittime-avg acq-bounces acquisitions holdtime-min …
Dlocktorture.rst137 (B): Number of writer lock acquisitions. If dealing with a read/write
Dlockdep-design.rst514 Lock dependencies record the orders of the acquisitions of a pair of locks, and
/linux-6.1.9/tools/memory-model/litmus-tests/
DMP+polocks.litmus6 * This litmus test demonstrates how lock acquisitions and releases can
DMP+porevlocks.litmus6 * This litmus test demonstrates how lock acquisitions and releases can
/linux-6.1.9/fs/nfsd/
Dfilecache.c1255 unsigned long hits = 0, acquisitions = 0; in nfsd_file_cache_stats_show() local
1278 acquisitions += per_cpu(nfsd_file_acquisitions, i); in nfsd_file_cache_stats_show()
1288 seq_printf(m, "acquisitions: %lu\n", acquisitions); in nfsd_file_cache_stats_show()
/linux-6.1.9/tools/memory-model/Documentation/
Drecipes.txt122 locking basic rule extend across multiple acquisitions of a given lock
Dlitmus-tests.txt587 to handle failed spinlock acquisitions, like the kernel does? The key
/linux-6.1.9/Documentation/RCU/Design/Memory-Ordering/
DTree-RCU-Memory-Ordering.rst118 | But the chain of rcu_node-structure lock acquisitions guarantees |
/linux-6.1.9/Documentation/kernel-hacking/
Dlocking.rst1039 example), but this increases the number of lock acquisitions, and the
/linux-6.1.9/Documentation/
Dmemory-barriers.txt2568 a spinlock will arrive in an order consistent with acquisitions of
/linux-6.1.9/Documentation/RCU/Design/Requirements/
DRequirements.rst2308 frequent acquisitions of global locks or frequent atomic operations on