Home
last modified time | relevance | path

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

/linux/Documentation/locking/
H A 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 …
H A Dlocktorture.rst137 (B): Number of writer lock acquisitions. If dealing with a read/write
H A Dlockdep-design.rst514 Lock dependencies record the orders of the acquisitions of a pair of locks, and
/linux/Documentation/litmus-tests/
H A DREADME46 the obvious lock acquisitions and releases.
51 obvious lock acquisitions and releases.
/linux/tools/memory-model/litmus-tests/
H A DMP+porevlocks.litmus6 * This litmus test demonstrates how lock acquisitions and releases can
H A DMP+polocks.litmus6 * This litmus test demonstrates how lock acquisitions and releases can
/linux/Documentation/translations/it_IT/locking/
H A Dlockstat.rst80 acquisitions
129 …ime-min waittime-max waittime-total waittime-avg acq-bounces acquisitions holdtime-min …
/linux/fs/nfsd/
H A Dfilecache.c1307 unsigned long hits = 0, acquisitions = 0; in nfsd_file_cache_stats_show() local
1330 acquisitions += per_cpu(nfsd_file_acquisitions, i); in nfsd_file_cache_stats_show()
1341 seq_printf(m, "acquisitions: %lu\n", acquisitions); in nfsd_file_cache_stats_show()
/linux/Documentation/ABI/testing/
H A Ddebugfs-driver-qat_telemetry48 sample_cnt number of acquisitions of telemetry data
125 sample_cnt number of acquisitions of telemetry data
/linux/tools/memory-model/Documentation/
H A Dlocking.txt82 locking basic rule extend across multiple acquisitions of a given lock
H A Drecipes.txt122 locking basic rule extend across multiple acquisitions of a given lock
H A Dlitmus-tests.txt587 to handle failed spinlock acquisitions, like the kernel does? The key
/linux/Documentation/process/
H A Dmaintainer-soc.rst43 including acquisitions/different business units in a company, things vary
/linux/Documentation/RCU/Design/Memory-Ordering/
H A DTree-RCU-Memory-Ordering.rst118 | But the chain of rcu_node-structure lock acquisitions guarantees |
/linux/Documentation/kernel-hacking/
H A Dlocking.rst1042 example), but this increases the number of lock acquisitions, and the
/linux/Documentation/
H A Dmemory-barriers.txt2575 a spinlock will arrive in an order consistent with acquisitions of
/linux/Documentation/RCU/Design/Requirements/
H A DRequirements.rst2274 frequent acquisitions of global locks or frequent atomic operations on