| /kernel/linux/linux-5.10/scripts/gcc-plugins/ |
| D | cyc_complexity_plugin.c | 9 * The complexity M is then defined as:
27 .help = "Cyclomatic Complexity\n",
32 int complexity; in cyc_complexity_execute() local
36 complexity = n_edges_for_fn(cfun) - n_basic_blocks_for_fn(cfun) + 2; in cyc_complexity_execute()
39 fprintf(stderr, "Cyclomatic Complexity %d %s:%s\n", complexity, in cyc_complexity_execute()
|
| D | Kconfig | 23 bool "Compute the cyclomatic complexity of a function" if EXPERT
26 The complexity M of a function's control flow graph is defined as:
34 Enabling this plugin reports the complexity to stderr during the
|
| /kernel/linux/linux-6.6/Documentation/mm/ |
| D | ksm.rst | 40 This way the stable tree lookup computational complexity is unaffected
47 walk has O(N) complexity where N is the number of rmap_items
50 O(N) computational complexity from rmap walk context over different
|
| D | multigen_lru.rst | 36 Fast paths reduce code complexity and runtime overhead. Unmapped pages
249 best-case complexity from O(n) to O(1) and does not affect the
250 worst-case complexity O(n). Therefore, on average, it has a sublinear
251 complexity.
|
| /kernel/linux/linux-5.10/Documentation/vm/ |
| D | ksm.rst | 42 This way the stable tree lookup computational complexity is unaffected
49 walk has O(N) complexity where N is the number of rmap_items
52 O(N) computational complexity from rmap walk context over different
|
| /kernel/linux/linux-6.6/drivers/gpu/drm/i915/ |
| D | TODO.txt | 12 - There's a lot of complexity added past few years to make relocations faster.
16 2. Any complexity added in this area past few years which can't be justified
|
| D | i915_vgpu.c | 36 * optimizations when running in a virtual machine, to reduce the complexity
47 * To reduce the complexity, Intel GVT-g introduces "address space ballooning",
51 * complexity of address translation.
|
| /kernel/linux/linux-6.6/drivers/media/platform/st/sti/hva/ |
| D | hva-h264.c | 188 * @encoder_complexity: encoder complexity control (IME).
189 * 0 = I_16x16, P_16x16, Full ME Complexity
190 * 1 = I_16x16, I_NxN, P_16x16, Full ME Complexity
191 * 2 = I_16x16, I_NXN, P_16x16, P_WxH, Full ME Complexity
192 * 4 = I_16x16, P_16x16, Reduced ME Complexity
193 * 5 = I_16x16, I_NxN, P_16x16, Reduced ME Complexity
194 * 6 = I_16x16, I_NXN, P_16x16, P_WxH, Reduced ME Complexity
748 /* encoder complexity fix to 2, ENCODE_I_16x16_I_NxN_P_16x16_P_WxH */ in hva_h264_prepare_task()
|
| /kernel/linux/linux-5.10/drivers/media/platform/sti/hva/ |
| D | hva-h264.c | 188 * @encoder_complexity: encoder complexity control (IME).
189 * 0 = I_16x16, P_16x16, Full ME Complexity
190 * 1 = I_16x16, I_NxN, P_16x16, Full ME Complexity
191 * 2 = I_16x16, I_NXN, P_16x16, P_WxH, Full ME Complexity
192 * 4 = I_16x16, P_16x16, Reduced ME Complexity
193 * 5 = I_16x16, I_NxN, P_16x16, Reduced ME Complexity
194 * 6 = I_16x16, I_NXN, P_16x16, P_WxH, Reduced ME Complexity
746 /* encoder complexity fix to 2, ENCODE_I_16x16_I_NxN_P_16x16_P_WxH */ in hva_h264_prepare_task()
|
| /kernel/linux/linux-6.6/arch/arm64/kvm/hyp/include/nvhe/ |
| D | fixed_config.h | 49 * AArch32 adds complexity in trap handling, emulation, condition codes,
149 * considerable state and complexity. Therefore, the reserved value of 0 is
|
| /kernel/linux/linux-6.6/tools/include/asm-generic/bitops/ |
| D | atomic.h | 10 * and optimizing compile-time constants on x86 isn't worth the complexity.
|
| /kernel/linux/linux-5.10/arch/powerpc/kernel/ |
| D | module_32.c | 100 * addend key. This is a stable O(n*log n) complexity in get_plt_size()
101 * alogrithm but it will reduce the complexity of in get_plt_size()
102 * count_relocs() to linear complexity O(n) in get_plt_size()
|
| /kernel/linux/linux-5.10/Documentation/scheduler/ |
| D | sched-energy.rst | 354 6.3 - Energy Model complexity
360 The energy-aware wake-up algorithm has a complexity of:
367 A complexity check is performed at the root domain level, when scheduling
372 If you really want to use EAS but the complexity of your platform's Energy
381 2. submit patches to reduce the complexity of the EAS wake-up algorithm,
|
| /kernel/linux/linux-6.6/Documentation/scheduler/ |
| D | sched-energy.rst | 359 6.3 - Energy Model complexity
365 The energy-aware wake-up algorithm has a complexity of:
372 A complexity check is performed at the root domain level, when scheduling
377 If you really want to use EAS but the complexity of your platform's Energy
386 2. submit patches to reduce the complexity of the EAS wake-up algorithm,
|
| /kernel/linux/linux-5.10/Documentation/locking/ |
| D | pi-futex.rst | 8 (or any other PI complexity) at all. No registration, no extra kernel
37 between 1:10 and 1:100. Lockless is hard, and the complexity of lockless
|
| /kernel/linux/linux-6.6/Documentation/locking/ |
| D | pi-futex.rst | 8 (or any other PI complexity) at all. No registration, no extra kernel
37 between 1:10 and 1:100. Lockless is hard, and the complexity of lockless
|
| /kernel/linux/linux-5.10/Documentation/scsi/ |
| D | hpsa.rst | 13 complexity and eliminating that complexity is one of the reasons
|
| /kernel/linux/linux-6.6/Documentation/scsi/ |
| D | hpsa.rst | 13 complexity and eliminating that complexity is one of the reasons
|
| /kernel/linux/linux-6.6/drivers/misc/echo/ |
| D | echo.h | 49 as computational complexity and patents favour the use of NLMS.
57 low complexity filter is adequate for this, so pre-whitening adds little to the
|
| /kernel/linux/linux-5.10/drivers/misc/echo/ |
| D | echo.h | 49 as computational complexity and patents favour the use of NLMS.
57 low complexity filter is adequate for this, so pre-whitening adds little to the
|
| /kernel/linux/linux-5.10/net/ieee802154/ |
| D | Kconfig | 6 complexity short range wireless personal area networks. It was
|
| /kernel/linux/linux-6.6/net/ieee802154/ |
| D | Kconfig | 6 complexity short range wireless personal area networks. It was
|
| /kernel/linux/linux-6.6/arch/powerpc/kernel/ |
| D | module_32.c | 101 * addend key. This is a stable O(n*log n) complexity in get_plt_size()
102 * algorithm but it will reduce the complexity of in get_plt_size()
103 * count_relocs() to linear complexity O(n) in get_plt_size()
|
| /kernel/linux/linux-6.6/Documentation/process/ |
| D | code-of-conduct-interpretation.rst | 63 and the technical complexity involved naturally require expertise and
67 is determined mainly by context and technical complexity and only
|
| /kernel/linux/linux-5.10/Documentation/process/ |
| D | code-of-conduct-interpretation.rst | 63 and the technical complexity involved naturally require expertise and
67 is determined mainly by context and technical complexity and only
|