| /linux-4.1.27/Documentation/aoe/ |
| D | todo.txt | 1 There is a potential for deadlock when allocating a struct sk_buff for
4 there are no other pages available, then deadlock may occur when a
7 deadlock under memory pressure.
14 deadlock.
|
| /linux-4.1.27/arch/ia64/sn/kernel/sn2/ |
| D | sn2_smp.c | 174 int active, max_active, deadlock, flush_opt = sn2_flush_opt; in sn2_global_tlb_purge() local
271 deadlock = 0; in sn2_global_tlb_purge()
286 if ((deadlock = wait_piowc())) { in sn2_global_tlb_purge()
313 if (flush_opt == 1 && deadlock) { in sn2_global_tlb_purge()
|
| /linux-4.1.27/Documentation/locking/ |
| D | 00-INDEX | 16 - Intro to Mutex wait/would deadlock handling.s
|
| D | ww-mutex-design.txt | 19 makes. Which results in the potential for deadlock. The problem gets
29 from a global counter. In case of deadlock while locking all the buffers
35 In the RDBMS literature this deadlock handling approach is called wait/wound:
67 no deadlock potential and hence the ww_mutex_lock call will block and not
85 better to avoid grabbing a deadlock avoidance ticket).
299 Method 4: Only lock one single objects. In that case deadlock detection and
301 produce a deadlock within just one class. To simplify this case the w/w mutex
|
| D | lglock.txt | 63 On -RT this deadlock scenario is resolved by the arch_spin_locks in the
64 lglocks being replaced by rt_mutexes which resolve the above deadlock
138 The deadlock noted for non-RT above is resolved due to rt_mutexes
|
| D | lockdep-design.txt | 102 thus could result in a lock inversion deadlock. Likewise, a softirq-safe
127 could lead to a lock inversion deadlock - even if that lock scenario did
180 lock related deadlock. [*]
183 occur in practice to prove a deadlock: only the simple 'component'
|
| D | rt-mutex-design.txt | 419 For this explanation, I will not mention deadlock detection. This explanation
680 (or deadlock checking is on), we unlock the wait_lock of the mutex and go ahead
|
| /linux-4.1.27/Documentation/filesystems/ |
| D | directory-locking | 48 If no directory is its own ancestor, the scheme above is deadlock-free.
72 Now consider the minimal deadlock. Each process is blocked on
83 Thus link creation can't be a part of deadlock - it can't be
104 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 | tmpfs.txt | 61 oversize your tmpfs instances the machine will deadlock
|
| D | overlayfs.txt | 214 a crash or deadlock.
|
| D | Locking | 376 associated with either file_lock argument! This is the case with deadlock
379 For deadlock detection however, the blocked_lock_lock is also held. The
|
| D | hpfs.txt | 264 1.98 Fixed a deadlock when using old_readdir
|
| D | xfs-delayed-logging-design.txt | 173 to be an unsolvable deadlock condition, and it was solving this problem that
|
| /linux-4.1.27/Documentation/arm/ |
| D | swp_emulation | 25 cause programs that perform SWP operations to uncached memory to deadlock, as
|
| /linux-4.1.27/scripts/rt-tester/ |
| D | t2-l2-2rt-deadlock.tst | 73 # Make deadlock go away
|
| /linux-4.1.27/arch/arm64/ |
| D | Kconfig | 293 …bool "Cortex-A53: 826319: System might deadlock if a write cannot complete until read data is acce…
303 system can deadlock.
378 bool "Cortex-A57: 832075: possible deadlock on mixing exclusive memory accesses with device loads"
384 Affected Cortex-A57 parts might deadlock when exclusive load/store
636 with SWP emulation enabled, leading to deadlock of the user
643 perform SWP operations to uncached memory to deadlock.
|
| /linux-4.1.27/Documentation/RCU/ |
| D | UP.txt | 58 be self-deadlock.
120 self-deadlock.
|
| D | whatisRCU.txt | 612 from deadlock (an important property of RCU). The reason for this is
615 so there can be no deadlock cycle.
617 Quick Quiz #1: Why is this argument naive? How could a deadlock
619 kernel? How could this deadlock be avoided?
646 participate in a deadlock cycle!
932 Quick Quiz #1: Why is this argument naive? How could a deadlock
954 One way to avoid this deadlock is to use an approach like
959 release rcu_gp_mutex, avoiding the deadlock.
961 Even in the absence of deadlock, this RCU implementation
|
| D | rcu.txt | 25 acquire locks can also greatly simplify deadlock-avoidance code.
|
| D | checklist.txt | 199 will result in deadlock.
339 acquisition of that lock will result in deadlock as soon as
392 requiring SRCU's read-side deadlock immunity or low read-side
|
| D | rcubarrier.txt | 7 very low-overhead readers that are immune to deadlock, priority inversion,
|
| D | trace.txt | 437 deadlock.
|
| /linux-4.1.27/Documentation/networking/ |
| D | driver.txt | 72 This error can deadlock sockets waiting for send buffer room
|
| 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-4.1.27/Documentation/video4linux/bttv/ |
| D | README.freeze | 29 If you run into some kind of deadlock, you can try to dump a call trace
|
| /linux-4.1.27/Documentation/x86/x86_64/ |
| D | machinecheck | 55 deadlock. Higher tolerant values trade potentially better uptime
|
| /linux-4.1.27/Documentation/infiniband/ |
| D | core_locking.txt | 106 semaphores that could cause deadlock if a consumer calls back into
|
| /linux-4.1.27/drivers/gpu/drm/i915/ |
| D | intel_ringbuffer.h | 93 int deadlock; member
|
| D | i915_irq.c | 2762 ring->hangcheck.deadlock++; in semaphore_passed()
2769 if (signaller->hangcheck.deadlock >= I915_NUM_RINGS) in semaphore_passed()
2789 ring->hangcheck.deadlock = 0; in semaphore_clear_deadlocks()
|
| D | i915_gem.c | 3310 goto deadlock; in i915_find_fence_reg()
3320 deadlock: in i915_find_fence_reg()
|
| /linux-4.1.27/Documentation/dmaengine/ |
| D | client.txt | 135 deadlock.
|
| /linux-4.1.27/fs/jffs2/ |
| D | README.Locking | 55 lead to deadlock, unless we played games with unlocking the i_sem
|
| /linux-4.1.27/lib/ |
| D | Kconfig.debug | 908 bool "RT Mutex debugging, deadlock detection"
984 deadlock.
990 deadlock scenario would be to trigger: how many
993 timing: if a race and a resulting deadlock is possible
997 makes the deadlock theoretically possible).
999 If a deadlock is impossible (i.e. the locking rules, as
|
| /linux-4.1.27/Documentation/scheduler/ |
| D | sched-design-CFS.txt | 129 inversion problems which would deadlock the machine.
|
| /linux-4.1.27/Documentation/ |
| D | robust-futex-ABI.txt | 31 probably causing deadlock or other such failure of the other threads
|
| D | memory-barriers.txt | 1860 It might appear that this reordering could introduce a deadlock.
1861 However, this cannot happen because if such a deadlock threatened,
1862 the RELEASE would simply complete, thereby avoiding the deadlock.
1868 that matter, the developer) switched the operations, deadlock
1874 If there is a deadlock, this lock operation will simply spin (or
1877 in the assembly code), which will unravel the potential deadlock,
1883 to complete, again unraveling the deadlock. There might be
|
| D | cpu-hotplug.txt | 343 because it is prone to an ABBA deadlock between the cpu_add_remove_lock
|
| D | kernel-docs.txt | 305 Keywords: HOWTO, kernel contexts, deadlock, locking, modules,
|
| /linux-4.1.27/Documentation/cpu-freq/ |
| D | governors.txt | 264 no need to lock it again (in fact, this would cause a deadlock). So
|
| /linux-4.1.27/Documentation/ia64/ |
| D | mca.txt | 9 asking for deadlock. Also the state of structures that are protected
|
| /linux-4.1.27/Documentation/ioctl/ |
| D | botching-up-ioctls.txt | 117 - it's way too easy to create a deadlock between your hangcheck code and
|
| /linux-4.1.27/Documentation/video4linux/ |
| D | v4l2-controls.txt | 377 will result in a deadlock since these helpers lock the handler as well.
693 attempting to find another control from the same handler will deadlock.
|
| /linux-4.1.27/arch/arm/mm/ |
| D | Kconfig | 687 with SWP emulation enabled, leading to deadlock of the user
694 perform SWP operations to uncached memory to deadlock.
|
| /linux-4.1.27/arch/arm/ |
| D | Kconfig | 1054 bool "ARM errata: Processor deadlock when a false hazard is created"
1062 hazard might then cause a processor deadlock. The workaround enables
1205 bool "ARM errata: A data cache maintenance operation which aborts, might lead to deadlock"
1211 to deadlock. This workaround puts DSB before executing ISB if
|
| /linux-4.1.27/Documentation/scsi/ |
| D | aic7xxx.txt | 177 pool fragmentation and SCSI mid-layer deadlock.
|
| D | aic79xx.txt | 72 - Fix several deadlock issues.
|
| D | ChangeLog.1992-1997 | 635 kicking things loose when we deadlock.
662 deadlock situations that are created when we allow the user
|
| D | ChangeLog.lpfc | 1279 lpfc_tasklet deadlock.
1660 causing a deadlock on insmod in some environments.
|
| /linux-4.1.27/Documentation/s390/ |
| D | cds.txt | 343 deadlock situation!
|
| /linux-4.1.27/Documentation/development-process/ |
| D | 4.Coding | 262 occasion, deadlock. This kind of problem can be painful (for both
|
| /linux-4.1.27/Documentation/PCI/ |
| D | MSI-HOWTO.txt | 503 a different interrupt, the driver will deadlock trying to recursively
|
| /linux-4.1.27/Documentation/block/ |
| D | biodoc.txt | 205 deadlock possibilities.
592 deadlock-free allocations during extreme VM load. For example, the VM
|
| /linux-4.1.27/Documentation/sysctl/ |
| D | vm.txt | 434 become subtly broken, and prone to deadlock under high loads.
|
| /linux-4.1.27/Documentation/filesystems/cifs/ |
| D | CHANGES | 552 rename deadlock when writing out dirty pages at same time.
|
| /linux-4.1.27/Documentation/security/ |
| D | keys.txt | 1284 a deadlock against the key semaphore.
|