/linux-6.12.1/scripts/kconfig/tests/err_recursive_dep/ |
D | expected_stderr | 1 error: recursive dependency detected! 4 subsection "Kconfig recursive dependency limitations" 6 error: recursive dependency detected! 9 subsection "Kconfig recursive dependency limitations" 11 error: recursive dependency detected! 15 subsection "Kconfig recursive dependency limitations" 17 error: recursive dependency detected! 21 subsection "Kconfig recursive dependency limitations" 23 error: recursive dependency detected! 27 subsection "Kconfig recursive dependency limitations" [all …]
|
/linux-6.12.1/drivers/gpu/drm/amd/amdgpu/ |
D | amdgpu_vm_tlb_fence.c | 34 struct dma_fence *dependency; member 56 if (f->dependency) { in amdgpu_tlb_fence_work() 57 dma_fence_wait(f->dependency, false); in amdgpu_tlb_fence_work() 58 dma_fence_put(f->dependency); in amdgpu_tlb_fence_work() 59 f->dependency = NULL; in amdgpu_tlb_fence_work() 99 f->dependency = *fence; in amdgpu_vm_tlb_fence_create()
|
/linux-6.12.1/drivers/gpu/drm/scheduler/ |
D | sched_entity.c | 161 if (READ_ONCE(entity->dependency)) in drm_sched_entity_is_ready() 338 if (entity->dependency) { in drm_sched_entity_fini() 339 dma_fence_remove_callback(entity->dependency, &entity->cb); in drm_sched_entity_fini() 340 dma_fence_put(entity->dependency); in drm_sched_entity_fini() 341 entity->dependency = NULL; in drm_sched_entity_fini() 370 entity->dependency = NULL; in drm_sched_entity_clear_dep() 412 struct dma_fence *fence = entity->dependency; in drm_sched_entity_add_dependency_cb() 422 dma_fence_put(entity->dependency); in drm_sched_entity_add_dependency_cb() 435 dma_fence_put(entity->dependency); in drm_sched_entity_add_dependency_cb() 436 entity->dependency = fence; in drm_sched_entity_add_dependency_cb() [all …]
|
/linux-6.12.1/Documentation/kbuild/ |
D | Kconfig.recursion-issue-01 | 8 # This Kconfig file has a simple recursive dependency issue. In order to 9 # understand why this recursive dependency issue occurs lets consider what 34 # the "recursive dependency detected" error. 39 # since CORE_BELL_A depends on CORE. Recursive dependency issues are not always 42 # easy to understand. Note that matching semantics on the dependency on 45 mainmenu "Simple example to demo kconfig recursive dependency issue"
|
D | kconfig-language.rst | 123 This defines a dependency for this menu entry. If multiple 167 from a direct dependency or with a visible prompt. 208 FOO should imply not only BAZ, but also its dependency BAR:: 310 the menu entry, e.g. this means the dependency "NET" is added to the 311 dependency list of the config option NETDEVICES. 316 be part of the dependency list and then one of these two conditions 389 dependency, but will not appear under menuconfig M anymore, because 446 This defines an if block. The dependency expression <expr> is appended 517 to describe the dependency on the compiler feature is to use "depends on" 543 If a config symbol has a dependency, but the code controlled by the config [all …]
|
D | Kconfig.select-break | 1 # Select broken dependency issue 21 mainmenu "Simple example to demo kconfig select broken dependency issue"
|
/linux-6.12.1/include/trace/events/ |
D | timer.h | 428 TP_PROTO(int success, int dependency), 430 TP_ARGS(success, dependency), 434 __field( int , dependency ) 439 __entry->dependency = dependency; 443 show_tick_dep_name(__entry->dependency))
|
/linux-6.12.1/tools/memory-model/litmus-tests/ |
D | LB+fencembonceonce+ctrlonceonce.litmus | 9 * combination of a control dependency and a full memory barrier are enough 11 * another control dependency and order would still be maintained.)
|
D | dep+plain.litmus | 10 * conditional of P0()'s if-statement creates a control dependency
|
/linux-6.12.1/tools/memory-model/Documentation/ |
D | control-dependencies.txt | 12 Therefore, a load-load control dependency will not preserve ordering 46 the control dependency. 103 Without explicit memory ordering, control-dependency-based ordering is 161 "if" statement, destroying the control dependency's ordering properties. 172 destroying the control dependency's ordering: 210 ordered CPU would have no dependency of any sort between the load from 232 destroy the control dependency while respecting the letter of the 243 dependency into nonexistence. Careful use of READ_ONCE() or 244 atomic{,64}_read() can help to preserve your control dependency. 247 of the "if" statement containing the control dependency, including
|
D | glossary.txt | 9 dependency" extends from that load extending to the later access. 20 address dependency extends from that rcu_dereference() to that 56 a "control dependency" extends from that load to that store. 62 Here, the control dependency extends from the READ_ONCE() on 89 on the value returned by an earlier load, a "data dependency" 95 In this case, the data dependency extends from the READ_ONCE() 100 especially true in cases where the dependency is carried through
|
D | cheatsheet.txt | 31 DR: Dependent read (address dependency) 32 DW: Dependent write (address, data, or control dependency)
|
D | recipes.txt | 274 against later accesses that depend on the value loaded. A dependency 276 (address dependency, as shown above), the value written by a later store 277 (data dependency), or whether or not a later store is executed in the 278 first place (control dependency). Note that the term "data dependency" 361 control dependency paired with a full memory barrier: 378 This pairing of a control dependency in CPU0() with a full memory 384 control dependency on the kernel side and a full memory barrier on 398 The kernel's control dependency between the load from ->data_tail 555 the LB litmus test, a control dependency was enough to do the
|
/linux-6.12.1/Documentation/locking/ |
D | lockdep-design.rst | 22 dependency can be understood as lock order, where L1 -> L2 suggests that 25 dependency just means the order ever happened. The validator maintains a 137 Multi-lock dependency rules: 151 validator will find such dependency circle in arbitrary complexity, 173 dependency rules are enforced: 375 likely to be linked into the lock-dependency graph. This turns out to 512 Dependency types and strong dependency paths: 519 For each lock dependency:: 531 With the above combination for simplification, there are 4 types of dependency edges 535 exclusive writer to recursive reader dependency, "X -(ER)-> Y" means [all …]
|
/linux-6.12.1/Documentation/core-api/ |
D | refcount-vs-atomic.rst | 64 A control dependency (on success) for refcounters guarantees that 68 Control dependency on stores are not implemented using any explicit 123 * fully ordered --> control dependency on success for stores 152 * fully ordered --> RELEASE ordering + control dependency 167 * fully ordered --> RELEASE ordering + control dependency + hold
|
/linux-6.12.1/scripts/ |
D | dev-needs.sh | 14 /sys/devices and then lists the probe dependency chain (suppliers and 15 parents) of these devices. It does a breadth first search of the dependency 17 dependency chain.
|
/linux-6.12.1/Documentation/ |
D | memory-barriers.txt | 55 - Address-dependency barriers (historical). 189 There is an obvious address dependency here, as the value loaded into D depends 394 address-dependency barriers; see the "SMP barrier pairing" subsection. 397 (2) Address-dependency barriers (historical). 404 An address-dependency barrier is a weaker form of read barrier. In the 407 the second load will be directed), an address-dependency barrier would 411 An address-dependency barrier is a partial ordering on interdependent 417 considered can then perceive. An address-dependency barrier issued by 422 the address-dependency barrier. 427 [!] Note that the first load really has to have an _address_ dependency and [all …]
|
/linux-6.12.1/Documentation/driver-api/ |
D | device_link.rst | 21 Often these two dependency types come together, so a device depends on 27 In its standard or *managed* form, a device link combines *both* dependency 60 represents a driver presence dependency, yet is added from the consumer's 82 driver presence dependency is needed (but only correct suspend/resume and 109 Driver authors should be aware that a driver presence dependency for managed 178 (supplier). A driver presence dependency is not necessary for this 194 * In some SoCs a functional dependency exists from display, video codec and 208 ordering or a driver presence dependency. 235 To prevent introduction of dependency loops into the graph, it is 246 such a device link only makes sense if a driver presence dependency is
|
/linux-6.12.1/Documentation/driver-api/memory-devices/ |
D | ti-gpmc.rst | 28 dependency for certain gpmc timings on gpmc clock frequency. Hence a 54 gpmc timing dependency on peripheral timings: 175 indirect dependency of peripheral timings to gpmc timings other than
|
/linux-6.12.1/drivers/clk/zynqmp/ |
D | Kconfig | 9 It has a dependency on the PMU firmware.
|
/linux-6.12.1/Documentation/networking/ |
D | tcp-thin.rst | 15 dependency on the arrival of new data from the application to trigger 22 lifespan. The combination of time-dependency and the fact that the
|
/linux-6.12.1/kernel/bpf/preload/ |
D | Kconfig | 10 # The dependency on !COMPILE_TEST prevents it from being enabled
|
/linux-6.12.1/drivers/mtd/lpddr/ |
D | Kconfig | 23 # ARM dependency is only for writel_relaxed()
|
/linux-6.12.1/Documentation/crypto/ |
D | async-tx-api.rst | 53 2. cross channel dependency chains: the API allows a chain of dependent 99 before the dependency is submitted. This requires that all descriptors be 105 2. submitting an unacknowledged descriptor as a dependency to another 128 it polls for the completion of the operation. It handles dependency
|
/linux-6.12.1/tools/build/ |
D | Build.include | 59 # Copy dependency data into .cmd file 60 # - gcc -M dependency info
|