| /kernel/linux/linux-5.10/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 | 2 Wound/Wait Deadlock-Proof Mutex Design
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
|
| /kernel/linux/linux-6.6/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 | 2 Wound/Wait Deadlock-Proof Mutex Design
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
|
| /kernel/linux/linux-6.6/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.
|
| /kernel/linux/linux-5.10/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.
|
| /kernel/linux/linux-6.6/kernel/locking/ |
| D | rtmutex.c | 556 * Deadlock detection is conditional:
558 * If CONFIG_DEBUG_RT_MUTEXES=n, deadlock detection is only conducted
561 * If CONFIG_DEBUG_RT_MUTEXES=y, deadlock detection is always
565 * deadlock detection is disabled independent of the detect argument
583 * Adjust the priority chain. Also used for deadlock detection.
588 * @chwalk: do we have to carry out deadlock detection?
761 * Even when we start with ww_mutex we can disable deadlock detection, in rt_mutex_adjust_prio_chain()
762 * since we would supress a ww_mutex induced deadlock at [6] anyway. in rt_mutex_adjust_prio_chain()
766 * NOTE: if someone were to create a deadlock between 2 ww_classes we'd in rt_mutex_adjust_prio_chain()
781 * If deadlock detection is off, we stop here if we in rt_mutex_adjust_prio_chain()
[all …]
|
| /kernel/linux/linux-5.10/lib/ |
| D | locking-selftest.c | 283 * AA deadlock:
407 * detecting a read-lock/lock-write deadlock: if the chain cache doesn't differ
416 * { Not a deadlock, B -> A is added in the chain cache }
422 * { B->A found in chain cache, not reported as a deadlock }
509 * ABBA deadlock:
541 * AB BC CA deadlock:
574 * AB CA BC deadlock:
607 * AB BC CD DA deadlock:
641 * AB CD BD DA deadlock:
674 * AB CD BC DA deadlock:
[all …]
|
| /kernel/linux/linux-5.10/kernel/locking/ |
| D | rtmutex.c | 349 * Deadlock detection is conditional:
351 * If CONFIG_DEBUG_RT_MUTEXES=n, deadlock detection is only conducted
354 * If CONFIG_DEBUG_RT_MUTEXES=y, deadlock detection is always
358 * deadlock detection is disabled independent of the detect argument
385 * Adjust the priority chain. Also used for deadlock detection.
390 * @chwalk: do we have to carry out deadlock detection?
548 * If deadlock detection is off, we stop here if we in rt_mutex_adjust_prio_chain()
549 * are not the top pi waiter of the task. If deadlock in rt_mutex_adjust_prio_chain()
564 * deadlock detection is off, we stop the chain walk. If its in rt_mutex_adjust_prio_chain()
594 * Deadlock detection. If the lock is the same as the original in rt_mutex_adjust_prio_chain()
[all …]
|
| D | rtmutex-debug.c | 68 * the deadlock. We print when we return. act_waiter can be NULL in
108 pr_warn("WARNING: circular locking deadlock detected!\n"); in debug_rt_mutex_print_deadlock()
135 printk("[ turning off deadlock detection." in debug_rt_mutex_print_deadlock()
|
| /kernel/linux/linux-5.10/Documentation/filesystems/ |
| D | fuse.rst | 184 c) Accidental deadlock
186 d) Malicious deadlock
345 There are a couple of ways in which to deadlock a FUSE filesystem.
349 **Scenario 1 - Simple deadlock**::
362 | | *DEADLOCK*
366 **Scenario 2 - Tricky deadlock**
395 | | * DEADLOCK *
|
| D | directory-locking.rst | 66 If no directory is its own ancestor, the scheme above is deadlock-free.
93 Now consider the minimal deadlock. Each process is blocked on
104 Thus link creation can't be a part of deadlock - it can't be
125 Contradiction. I.e. deadlock is impossible. Q.E.D.
|
| /kernel/linux/linux-6.6/Documentation/filesystems/ |
| D | directory-locking.rst | 66 If no directory is its own ancestor, the scheme above is deadlock-free.
93 Now consider the minimal deadlock. Each process is blocked on
104 Thus link creation can't be a part of deadlock - it can't be
125 Contradiction. I.e. deadlock is impossible. Q.E.D.
|
| 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**::
381 | | *DEADLOCK*
385 **Scenario 2 - Tricky deadlock**
414 | | * DEADLOCK *
|
| /kernel/linux/linux-6.6/Documentation/RCU/ |
| D | UP.rst | 56 Example 3: Death by Deadlock
62 be self-deadlock *even if* this invocation occurred from a later
95 the deadlock-avoidance benefits called out above.
137 self-deadlock.
|
| /kernel/linux/linux-6.6/lib/ |
| D | locking-selftest.c | 298 * AA deadlock:
422 * detecting a read-lock/lock-write deadlock: if the chain cache doesn't differ
431 * { Not a deadlock, B -> A is added in the chain cache }
437 * { B->A found in chain cache, not reported as a deadlock }
524 * ABBA deadlock:
556 * AB BC CA deadlock:
589 * AB CA BC deadlock:
622 * AB BC CD DA deadlock:
656 * AB CD BD DA deadlock:
689 * AB CD BC DA deadlock:
[all …]
|
| /kernel/linux/linux-6.6/drivers/gpu/drm/nouveau/ |
| D | nouveau_backlight.c | 166 goto deadlock; in nv50_edp_get_brightness()
176 goto deadlock; in nv50_edp_get_brightness()
188 deadlock: in nv50_edp_get_brightness()
209 goto deadlock; in nv50_edp_set_brightness()
219 goto deadlock; in nv50_edp_set_brightness()
230 deadlock: in nv50_edp_set_brightness()
|
| /kernel/linux/linux-5.10/fs/ocfs2/dlm/ |
| D | dlmapi.h | 50 DLM_DEADLOCK, /* 30: deadlock recovery refused this request */
125 #define LKM_NODLCKWT 0x00000800 /* this lock wont deadlock (U) */
132 #define LKM_SNGLDLCK 0x00040000 /* request can self-deadlock (U) */
135 #define LKM_XID 0x00200000 /* use transaction id for deadlock (U) */
|
| /kernel/linux/linux-6.6/fs/ocfs2/dlm/ |
| D | dlmapi.h | 48 DLM_DEADLOCK, /* 30: deadlock recovery refused this request */
123 #define LKM_NODLCKWT 0x00000800 /* this lock wont deadlock (U) */
130 #define LKM_SNGLDLCK 0x00040000 /* request can self-deadlock (U) */
133 #define LKM_XID 0x00200000 /* use transaction id for deadlock (U) */
|
| /kernel/linux/linux-5.10/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) */
|
| /kernel/linux/linux-6.6/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) */
|
| /kernel/linux/linux-6.6/tools/memory-model/scripts/ |
| D | judgelitmus.sh | 116 if test "$outcome" = DEADLOCK
131 echo " !!! Unexpected non-$outcome deadlock" $litmus
134 echo " !!! Unexpected non-$outcome deadlock" $litmus >> $LKMM_DESTDIR/$litmusout 2>&1
|
| D | checkghlitmus.sh | 39 xargs -r grep -E -l '^ \* Result: (Never|Sometimes|Always|DEADLOCK)' |
45 xargs < $T/list-C -r grep -E -l '^ \* Result: (Never|Sometimes|Always|DEADLOCK)' > $T/list-C-result
|
| /kernel/linux/linux-5.10/Documentation/RCU/ |
| D | UP.rst | 56 Example 3: Death by Deadlock
62 be self-deadlock.
128 self-deadlock.
|
| /kernel/linux/linux-5.10/tools/testing/selftests/timers/ |
| D | leapcrash.c | 1 /* Demo leapsecond deadlock
7 * This test demonstrates leapsecond deadlock that is possibe
|