Searched refs:deadlock (Results 1 – 25 of 59) sorted by relevance
123
| /Linux-v5.4/Documentation/admin-guide/aoe/ |
| D | todo.rst | 4 There is a potential for deadlock when allocating a struct sk_buff for
7 there are no other pages available, then deadlock may occur when a
10 deadlock under memory pressure.
17 deadlock.
|
| /Linux-v5.4/scripts/coccinelle/api/ |
| D | stream_open.cocci | 6 // its read and write. Rationale for the conversion is to avoid deadlock in
232 …"ERROR: %s: .read() can deadlock .write(); change nonseekable_open -> stream_open to fix." % (fops…
248 + nonseekable_open /* read & write (was deadlock) */
259 + nonseekable_open /* read & write (no direct deadlock) */
|
| /Linux-v5.4/Documentation/locking/ |
| D | lockdep-design.rst | 126 deadlock may happen. For example, in the scenario that after this lock
128 lock will be attempted to acquire twice, which creates a deadlock,
129 referred to as lock recursion deadlock.
145 because this could lead to a deadlock - referred to as lock inversion
146 deadlock - as attempts to acquire the two locks form a circle which
161 thus could result in a lock inversion deadlock. Likewise, a softirq-safe
186 could lead to a lock inversion deadlock - even if that lock scenario did
286 lock related deadlock. [1]_
289 occur in practice to prove a deadlock: only the simple 'component'
|
| D | ww-mutex-design.rst | 20 makes. Which results in the potential for deadlock. The problem gets
30 from a global counter. In case of deadlock while locking all the buffers
37 and the deadlock handling approach is called Wait-Die. The name is based on
86 no deadlock potential and hence the ww_mutex_lock call will block and not
105 better to avoid grabbing a deadlock avoidance ticket).
327 Method 4: Only lock one single objects. In that case deadlock detection and
329 produce a deadlock within just one class. To simplify this case the w/w mutex
352 contention for a new lock and hence a true chance of deadlock. In that
|
| /Linux-v5.4/Documentation/filesystems/ |
| D | directory-locking.rst | 65 If no directory is its own ancestor, the scheme above is deadlock-free.
90 Now consider the minimal deadlock. Each process is blocked on
101 Thus link creation can't be a part of deadlock - it can't be
122 Contradiction. I.e. deadlock is impossible. Q.E.D.
|
| D | fuse.txt | 198 c) Accidental deadlock
200 d) Malicious deadlock
360 There are a couple of ways in which to deadlock a FUSE filesystem.
364 Scenario 1 - Simple deadlock
382 Scenario 2 - Tricky deadlock
|
| D | locks.txt | 46 race and deadlock conditions that the current solution was the only
|
| D | journalling.rst | 73 deadlock. The first thing to note is that each task can only have a
91 behaviour to :c:func:`jbd2_journal_start` so you can deadlock here just as
|
| /Linux-v5.4/Documentation/arm/ |
| D | swp_emulation.rst | 26 cause programs that perform SWP operations to uncached memory to deadlock, as
|
| /Linux-v5.4/tools/memory-model/ |
| D | lock.cat | 53 * inside a critical section (for the same lock) always deadlock.
75 (* Allow up to one unmatched LKW per location; more must deadlock *)
|
| /Linux-v5.4/Documentation/RCU/ |
| D | whatisRCU.txt | 581 you allow nested rcu_read_lock() calls, you can deadlock.
637 from deadlock (an important property of RCU). The reason for this is
640 so there can be no deadlock cycle.
642 Quick Quiz #1: Why is this argument naive? How could a deadlock
644 kernel? How could this deadlock be avoided?
671 participate in a deadlock cycle!
972 Quick Quiz #1: Why is this argument naive? How could a deadlock
994 One way to avoid this deadlock is to use an approach like
999 release rcu_gp_mutex, avoiding the deadlock.
1001 Even in the absence of deadlock, this RCU implementation
|
| D | UP.rst | 62 be self-deadlock.
128 self-deadlock.
|
| D | rcu.rst | 28 acquire locks can also greatly simplify deadlock-avoidance code.
|
| /Linux-v5.4/Documentation/networking/ |
| D | driver.txt | 72 This error can deadlock sockets waiting for send buffer room
|
| /Linux-v5.4/Documentation/core-api/ |
| D | gfp_mask-from-fs-io.rst | 19 The traditional way to avoid this deadlock problem is to clear __GFP_FS
|
| /Linux-v5.4/drivers/gpu/drm/i915/gt/ |
| D | intel_hangcheck.c | 36 int deadlock; member
|
| /Linux-v5.4/arch/arm/ |
| D | Kconfig | 868 bool "ARM errata: Processor deadlock when a false hazard is created"
876 hazard might then cause a processor deadlock. The workaround enables
1019 bool "ARM errata: A data cache maintenance operation which aborts, might lead to deadlock"
1025 to deadlock. This workaround puts DSB before executing ISB if
1048 bool "ARM errata: A12: some seqs of opposed cond code instrs => deadlock or corruption"
1053 instruction might deadlock. Fixed in r0p1.
1055 lead to either a data corruption or a CPU deadlock. Not fixed in
1069 deadlock when the VMOV instructions are issued out-of-order.
1072 bool "ARM errata: A12: DMB NSHST/ISHST mixed ... might cause deadlock"
1078 and Device/Strongly-Ordered loads and stores might cause deadlock
[all …]
|
| /Linux-v5.4/Documentation/i2c/ |
| D | i2c-topology.rst | 164 __i2c_transfer), or a deadlock will follow. There are a couple of
206 that they do not deadlock the root adapter.
208 unlocked i2c-transfer, so that it does not deadlock the parent
|
| /Linux-v5.4/Documentation/x86/x86_64/ |
| D | machinecheck.rst | 57 deadlock. Higher tolerant values trade potentially better uptime
|
| /Linux-v5.4/Documentation/infiniband/ |
| D | core_locking.rst | 110 semaphores that could cause deadlock if a consumer calls back into
|
| /Linux-v5.4/Documentation/admin-guide/device-mapper/ |
| D | dm-raid.rst | 411 1.12.1 Fix for MD deadlock between mddev_suspend() and md_write_start() available
413 1.13.1 Fix deadlock caused by early md_stop_writes(). Also fix size an
417 deadlock/potential data corruption. Update superblock when
|
| /Linux-v5.4/arch/arm/mach-omap2/ |
| D | Kconfig | 245 system to deadlock.
|
| /Linux-v5.4/Documentation/networking/device_drivers/toshiba/ |
| D | spider_net.txt | 131 deadlock condition, as the tail pointer will be pointing at this descr,
135 is a potential deadlock, with the OS waiting for one descr to fill,
|
| /Linux-v5.4/Documentation/kernel-hacking/ |
| D | locking.rst | 125 `Deadlock: Simple and Advanced <#deadlock>`__.
895 Both of these are called deadlock, and as shown above, it can occur even
914 object to the same chain, it will deadlock with itself as it tries to
936 will never get this kind of deadlock. Practice will tell you that this
944 deadlock, because it never tries to grab another lock while it has that
949 call these with the lock held, you risk simple deadlock, or a deadly
|
| /Linux-v5.4/arch/arm64/ |
| D | Kconfig | 325 …bool "Cortex-A53: 826319: System might deadlock if a write cannot complete until read data is acce…
336 system can deadlock.
414 bool "Cortex-A57: 832075: possible deadlock on mixing exclusive memory accesses with device loads"
420 Affected Cortex-A57 parts might deadlock when exclusive load/store
1241 with SWP emulation enabled, leading to deadlock of the user
1248 perform SWP operations to uncached memory to deadlock.
|
123
