| /linux/Documentation/admin-guide/aoe/ |
| H A 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/drivers/gpu/drm/nouveau/ |
| H A 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/Documentation/locking/ |
| H A 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 …]
|
| H A 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/tools/memory-model/scripts/ |
| H A D | judgelitmus.sh | 131 echo " !!! Unexpected non-$outcome deadlock" $litmus
134 echo " !!! Unexpected non-$outcome deadlock" $litmus >> $LKMM_DESTDIR/$litmusout 2>&1
|
| /linux/scripts/coccinelle/api/ |
| H A 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/Documentation/filesystems/ |
| H A 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.
|
| H A D | locks.rst | 50 race and deadlock conditions that the current solution was the only
|
| H A 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/Documentation/arch/arm/ |
| H A D | swp_emulation.rst | 26 cause programs that perform SWP operations to uncached memory to deadlock, as
|
| /linux/Documentation/RCU/ |
| H A 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.
|
| H A D | rcu.rst | 27 acquire locks can also greatly simplify deadlock-avoidance code.
|
| /linux/Documentation/ABI/removed/ |
| H A D | sysfs-mce | 22 risk of deadlock. Higher tolerant values trade potentially
|
| /linux/kernel/rcu/ |
| H A D | rcutorture.c | 4492 int cyclelen, int deadlock) in srcu_lockdep_next() argument
4497 j = deadlock ? 0 : -1; in srcu_lockdep_next()
4509 int deadlock; in rcu_torture_init_srcu_lockdep() local
4525 deadlock = test_srcu_lockdep / 1000; in rcu_torture_init_srcu_lockdep()
4529 if (WARN_ONCE(deadlock != !!deadlock, in rcu_torture_init_srcu_lockdep()
4531 __func__, test_srcu_lockdep, deadlock)) in rcu_torture_init_srcu_lockdep()
4542 __func__, test_srcu_lockdep, cyclelen, deadlock ? "" : "non-"); in rcu_torture_init_srcu_lockdep()
4543 if (deadlock && cyclelen == 1) in rcu_torture_init_srcu_lockdep()
4547 "srcu_read_unlock", i, cyclelen, deadlock); in rcu_torture_init_srcu_lockdep()
4558 __func__, test_srcu_lockdep, cyclelen, deadlock ? "" : "non-"); in rcu_torture_init_srcu_lockdep()
[all …]
|
| /linux/Documentation/filesystems/fuse/ |
| H A D | fuse.rst | 198 c) Accidental deadlock
200 d) Malicious deadlock
378 There are a couple of ways in which to deadlock a FUSE filesystem.
382 **Scenario 1 - Simple deadlock**::
399 **Scenario 2 - Tricky deadlock**
|
| /linux/tools/memory-model/ |
| H A 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 *)
|
| H A D | README | 214 and following releases and checking for self-deadlock.
|
| /linux/Documentation/i2c/ |
| H A 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/Documentation/infiniband/ |
| H A D | core_locking.rst | 108 semaphores that could cause deadlock if a consumer calls back into
|
| /linux/Documentation/devicetree/bindings/iommu/ |
| H A D | iommu.txt | 111 domain, leading to a deadlock.
|
| /linux/fs/jffs2/ |
| H A D | README.Locking | 55 lead to deadlock, unless we played games with unlocking the i_sem
|
| /linux/Documentation/kernel-hacking/ |
| H A D | locking.rst | 889 Both of these are called deadlock, and as shown above, it can occur even
908 object to the same chain, it will deadlock with itself as it tries to
930 will never get this kind of deadlock. Practice will tell you that this
938 deadlock, because it never tries to grab another lock while it has that
943 call these with the lock held, you risk simple deadlock, or a deadly
|
| /linux/Documentation/RCU/Design/Requirements/ |
| H A D | Requirements.rst | 1523 in deadlock or in RCU implicitly splitting the enclosing RCU read-side
1531 sections can be composed surprisingly freely, but only if deadlock is
1942 operation ends, which could also result in deadlock. Furthermore,
1944 which results in another type of deadlock when invoked from a CPU-hotplug
2618 Of course, one good way to block forever is to deadlock, which can
2621 period to elapse. For example, this results in a self-deadlock:
2633 synchronize_srcu() for domain ``ss``, deadlock would still be
2637 that was held across as ``ss``-domain synchronize_srcu(), deadlock
2638 would again be possible. Such a deadlock cycle could extend across an
2641 this sort of deadlock.
[all …]
|
| /linux/Documentation/virt/kvm/ |
| H A D | locking.rst | 316 :Comment: Exists because using kvm_lock leads to deadlock. kvm_lock is taken
|
| /linux/Documentation/gpu/ |
| H A D | drm-vm-bind-locking.rst | 53 allows deadlock-safe locking of multiple dma_resvs in arbitrary
154 pseudo-code. In particular, the dma_resv deadlock avoidance algorithm
|