| /openbmc/linux/tools/perf/util/ |
| H A D | sharded_mutex.h | 18 struct mutex mutexes[]; member
26 return &sm->mutexes[hash_bits(hash, sm->cap_bits)]; in sharded_mutex__get_mutex()
|
| H A D | sharded_mutex.c | 22 mutex_init(&result->mutexes[i]); in sharded_mutex__new()
30 mutex_destroy(&sm->mutexes[i]); in sharded_mutex__delete()
|
| /openbmc/linux/Documentation/locking/ |
| H A D | rt-mutex.rst | 5 RT-mutexes with priority inheritance are used to support PI-futexes,
16 RT-mutexes extend the semantics of simple mutexes by the priority
27 mutexes which protect shared resources. Priority inheritance is not a
40 RT-mutexes are optimized for fastpath operations and have no internal
|
| H A D | mutex-design.rst | 9 What are mutexes?
12 In the Linux kernel, mutexes refer to a particular locking primitive
69 While formally kernel mutexes are sleepable locks, it is path (ii) that
87 - Held mutexes must not be reinitialized.
95 - Uses symbolic names of mutexes, whenever they are printed
147 When to use mutexes
150 Unless the strict semantics of mutexes are unsuitable and/or the critical
|
| H A D | ww-mutex-design.rst | 5 Please read mutex-design.rst first, as it applies to wait/wound mutexes too.
60 Compared to normal mutexes two additional concepts/objects show up in the lock
61 interface for w/w mutexes:
70 W/w class: In contrast to normal mutexes the lock class needs to be explicit for
71 w/w mutexes, since it is required to initialize the acquire context. The lock
238 mutexes are a natural fit for such a case for two reasons:
340 increase in code size if wait/wound mutexes are not used.
373 - Attempting to lock more mutexes after ww_acquire_done.
375 unlocking all mutexes.
377 before unlocking all mutexes.
[all …]
|
| H A D | pi-futex.rst | 64 locks (such as futex-based pthread mutexes) is priority inheritance:
79 mutexes involves no kernel work at all - they behave quite similarly to
82 futexes.) Userspace uses atomic ops to lock/unlock these mutexes without
115 possible anyway, due to existing ABI properties of pthread mutexes.]
|
| H A D | robust-futexes.rst | 42 There is a big conceptual problem with futex based mutexes though: it is
122 mechanism, which fully enables robust mutexes.
133 - no registration of individual locks is needed: robust mutexes don't
134 need any extra per-lock syscalls. Robust mutexes thus become a very
137 mutexes are just as fast.
158 [which it currently does for !pshared robust mutexes], and that took 256
|
| H A D | rt-mutex-design.rst | 120 - The highest priority process waiting on one of the mutexes
131 The PI chain is a list of processes and mutexes that may cause priority
177 have multiple chains merge at mutexes. If we add another process G that is
209 a tree of all top waiters of the mutexes that are owned by the process.
211 blocked on mutexes owned by the process.
229 the nesting of mutexes. Let's look at the example where we have 3 mutexes,
294 type of application that nests large amounts of mutexes to create a large
318 mutexes short.
336 The macro rt_mutex_cmpxchg is used to try to lock and unlock mutexes. If
357 priority process that is waiting any of mutexes owned by the task. Since
[all …]
|
| H A D | locktypes.rst | 101 RT-mutexes are mutexes with support for priority inheritance (PI).
110 and rwlock_t to be implemented via RT-mutexes.
120 as mutexes and completions.
|
| /openbmc/qemu/tests/tsan/ |
| H A D | suppressions.tsan | 5 # TSan reports a double lock on RECURSIVE mutexes.
|
| /openbmc/linux/Documentation/devicetree/bindings/hwlock/ |
| H A D | qcom-hwspinlock.yaml | 13 The hardware block provides mutexes utilized between different processors on
|
| /openbmc/openbmc/poky/meta/recipes-support/apr/apr/ |
| H A D | 0001-configure-Remove-runtime-test-for-mmap-that-can-map-.patch | 9 mutexes
|
| /openbmc/linux/kernel/configs/ |
| H A D | debug.config | 89 # Lock Debugging (spinlocks, mutexes, etc...)
|
| /openbmc/openbmc/meta-openembedded/meta-networking/recipes-protocols/vsomeip/vsomeip/ |
| H A D | 0004-Do-not-specify-PIE-flag-explicitly.patch | 44 # instead of static initialization so mutexes can be hooked to enable PI as needed
|
| /openbmc/qemu/docs/spin/ |
| H A D | tcg-exclusive.promela | 114 // Simple version using mutexes
|
| /openbmc/linux/Documentation/userspace-api/ |
| H A D | futex2.rst | 10 performant synchronization mechanisms, such as mutexes, semaphores and
|
| /openbmc/linux/Documentation/driver-api/media/ |
| H A D | dtv-demux.rst | 39 addressed, e.g. by protecting parts of code with mutexes.
|
| /openbmc/linux/Documentation/livepatch/ |
| H A D | callbacks.rst | 18 mutexes/spinlocks, or even stop_machine(), to avoid concurrency issues.
|
| /openbmc/linux/Documentation/process/ |
| H A D | volatile-considered-harmful.rst | 22 safe (spinlocks, mutexes, memory barriers, etc.) are designed to prevent
|
| /openbmc/linux/fs/jffs2/ |
| H A D | README.Locking | 66 2. Never attempt to lock two file mutexes in one thread.
|
| /openbmc/linux/Documentation/virt/kvm/ |
| H A D | locking.rst | 10 The acquisition orders for mutexes are as follows:
|
| /openbmc/openbmc/poky/documentation/migration-guides/ |
| H A D | release-notes-4.2.2.rst | 139 - ptest-runner: Pull in "runner: Remove threads and mutexes" fix
|
| /openbmc/linux/Documentation/scheduler/ |
| H A D | completion.rst | 182 most cases you probably don't want to call this with held mutexes.
|
| /openbmc/linux/Documentation/kernel-hacking/ |
| H A D | locking.rst | 879 (spinlocks, rwlocks and mutexes are not recursive in Linux). This is
1052 Both spinlocks and mutexes have read/write variants: ``rwlock_t`` and
|
| /openbmc/linux/Documentation/RCU/Design/Expedited-Grace-Periods/ |
| H A D | Expedited-Grace-Periods.rst | 513 expedited grace period are awakened. A pair of mutexes are used to allow
|