| /linux-6.12.1/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-6.12.1/drivers/gpu/drm/nouveau/ |
| D | nouveau_backlight.c | 130 goto deadlock; in nv50_edp_get_brightness()
140 goto deadlock; in nv50_edp_get_brightness()
152 deadlock: in nv50_edp_get_brightness()
173 goto deadlock; in nv50_edp_set_brightness()
183 goto deadlock; in nv50_edp_set_brightness()
194 deadlock: in nv50_edp_set_brightness()
|
| /linux-6.12.1/Documentation/locking/ |
| D | lockdep-design.rst | 129 deadlock may happen. For example, in the scenario that after this lock
131 lock will be attempted to acquire twice, which creates a deadlock,
132 referred to as lock recursion deadlock.
148 because this could lead to a deadlock - referred to as lock inversion
149 deadlock - as attempts to acquire the two locks form a circle which
164 thus could result in a lock inversion deadlock. Likewise, a softirq-safe
189 could lead to a lock inversion deadlock - even if that lock scenario did
289 lock related deadlock. [1]_
292 occur in practice to prove a deadlock: only the simple 'component'
402 to deadlock possibility.
[all …]
|
| 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-6.12.1/tools/memory-model/scripts/ |
| D | judgelitmus.sh | 131 echo " !!! Unexpected non-$outcome deadlock" $litmus
134 echo " !!! Unexpected non-$outcome deadlock" $litmus >> $LKMM_DESTDIR/$litmusout 2>&1
|
| /linux-6.12.1/scripts/coccinelle/api/ |
| D | stream_open.cocci | 6 // its read and write. Rationale for the conversion is to avoid deadlock in
231 …"ERROR: %s: .read() can deadlock .write(); change nonseekable_open -> stream_open to fix." % (fops…
247 + nonseekable_open /* read & write (was deadlock) */
258 + nonseekable_open /* read & write (no direct deadlock) */
|
| /linux-6.12.1/Documentation/filesystems/ |
| D | directory-locking.rst | 133 If no directory is its own ancestor, the scheme above is deadlock-free.
168 contended locks in the minimal deadlock will be of the same rank,
196 so they would all hold simultaneously at the deadlock time and
207 D1,...,Dn all hold simultaneously at the deadlock time. Moreover,
237 properties required for a minimal deadlock can not exist.
240 rename is crucial - without it a deadlock would be possible. Indeed,
248 the locks) and voila - we have a deadlock.
|
| D | fuse.rst | 184 c) Accidental deadlock
186 d) Malicious deadlock
364 There are a couple of ways in which to deadlock a FUSE filesystem.
368 **Scenario 1 - Simple deadlock**::
385 **Scenario 2 - Tricky deadlock**
|
| D | locks.rst | 50 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 jbd2_journal_start() so you can deadlock here just as
|
| /linux-6.12.1/drivers/gpu/drm/ci/xfails/ |
| D | amdgpu-stoney-skips.txt | 24 amdgpu/amd_deadlock@amdgpu-deadlock-sdma
|
| /linux-6.12.1/kernel/rcu/ |
| D | rcutorture.c | 3606 int cyclelen, int deadlock) in srcu_lockdep_next() argument
3611 j = deadlock ? 0 : -1; in srcu_lockdep_next()
3623 int deadlock; in rcu_torture_init_srcu_lockdep() local
3639 deadlock = test_srcu_lockdep / 1000; in rcu_torture_init_srcu_lockdep()
3643 if (WARN_ONCE(deadlock != !!deadlock, in rcu_torture_init_srcu_lockdep()
3645 __func__, test_srcu_lockdep, deadlock)) in rcu_torture_init_srcu_lockdep()
3656 __func__, test_srcu_lockdep, cyclelen, deadlock ? "" : "non-"); in rcu_torture_init_srcu_lockdep()
3657 if (deadlock && cyclelen == 1) in rcu_torture_init_srcu_lockdep()
3661 "srcu_read_unlock", i, cyclelen, deadlock); in rcu_torture_init_srcu_lockdep()
3672 __func__, test_srcu_lockdep, cyclelen, deadlock ? "" : "non-"); in rcu_torture_init_srcu_lockdep()
[all …]
|
| /linux-6.12.1/Documentation/arch/arm/ |
| D | swp_emulation.rst | 26 cause programs that perform SWP operations to uncached memory to deadlock, as
|
| /linux-6.12.1/Documentation/RCU/ |
| D | UP.rst | 62 be self-deadlock *even if* this invocation occurred from a later
95 the deadlock-avoidance benefits called out above.
137 self-deadlock.
|
| D | whatisRCU.rst | 656 you allow nested rcu_read_lock() calls, you can deadlock.
712 from deadlock (an important property of RCU). The reason for this is
715 so there can be no deadlock cycle.
720 Why is this argument naive? How could a deadlock
722 kernel? How could this deadlock be avoided?
751 participate in a deadlock cycle!
1204 Why is this argument naive? How could a deadlock
1227 One way to avoid this deadlock is to use an approach like
1232 release rcu_gp_mutex, avoiding the deadlock.
1234 Even in the absence of deadlock, this RCU implementation
|
| D | rcu.rst | 27 acquire locks can also greatly simplify deadlock-avoidance code.
|
| /linux-6.12.1/Documentation/ABI/removed/ |
| D | sysfs-mce | 22 risk of deadlock. Higher tolerant values trade potentially
|
| /linux-6.12.1/drivers/gpu/drm/nouveau/dispnv50/ |
| D | crc.c | 587 goto deadlock; in nv50_crc_set_source()
597 goto deadlock; in nv50_crc_set_source()
621 deadlock: in nv50_crc_set_source()
|
| /linux-6.12.1/tools/memory-model/ |
| D | lock.cat | 53 * inside a critical section (for the same lock) always deadlock.
81 (* Allow up to one unmatched LKW per location; more must deadlock *)
|
| /linux-6.12.1/arch/arm/ |
| D | Kconfig | 572 bool "ARM errata: Processor deadlock when a false hazard is created"
580 hazard might then cause a processor deadlock. The workaround enables
750 bool "ARM errata: A data cache maintenance operation which aborts, might lead to deadlock"
756 to deadlock. This workaround puts DSB before executing ISB if
779 bool "ARM errata: A12: some seqs of opposed cond code instrs => deadlock or corruption"
784 instruction might deadlock. Fixed in r0p1.
786 lead to either a data corruption or a CPU deadlock. Not fixed in
800 deadlock when the VMOV instructions are issued out-of-order.
803 bool "ARM errata: A12: DMB NSHST/ISHST mixed ... might cause deadlock"
809 and Device/Strongly-Ordered loads and stores might cause deadlock
[all …]
|
| /linux-6.12.1/Documentation/networking/ |
| D | driver.rst | 122 This error can deadlock sockets waiting for send buffer room
|
| /linux-6.12.1/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-6.12.1/Documentation/i2c/ |
| D | i2c-topology.rst | 132 __i2c_transfer), or a deadlock will follow.
156 that they do not deadlock the root adapter.
158 unlocked I2C transfer, so that it does not deadlock the parent
|
| /linux-6.12.1/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-6.12.1/Documentation/infiniband/ |
| D | core_locking.rst | 108 semaphores that could cause deadlock if a consumer calls back into
|