| /linux/Documentation/core-api/ |
| H A D | union_find.rst | 34 Space Complexity: O(n), where n is the number of nodes.
36 Time Complexity: Using path compression can reduce the time complexity of
37 the find operation, and using union by rank can reduce the time complexity
39 complexity of each find and union operation to O(α(n)), where α(n) is the
41 complexity for practical purposes.
|
| /linux/Documentation/mm/ |
| H A 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
|
| H A 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.
|
| /linux/drivers/gpu/drm/i915/ |
| H A 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
|
| /linux/drivers/media/platform/st/sti/hva/ |
| H A 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()
|
| /linux/Documentation/locking/ |
| H A 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
|
| /linux/Documentation/scsi/ |
| H A D | hpsa.rst | 13 complexity and eliminating that complexity is one of the reasons
|
| /linux/tools/include/asm-generic/bitops/ |
| H A D | atomic.h | 10 * and optimizing compile-time constants on x86 isn't worth the complexity.
|
| /linux/net/ieee802154/ |
| H A D | Kconfig | 6 complexity short range wireless personal area networks. It was
|
| /linux/Documentation/gpu/rfc/ |
| H A D | i915_scheduler.rst | 38 * Lots of complexity of the GuC backend can be pulled out once
48 * Fully integrating would add lots of complexity to DRM
|
| /linux/drivers/md/dm-vdo/ |
| H A D | priority-table.h | 16 * and re-enqueuing it with a different priority. All operations have O(1) complexity.
|
| /linux/arch/powerpc/kernel/ |
| H A D | module_64.c | 224 * addend key. This is a stable O(n*log n) complexity in get_stubs_size()
225 * algorithm but it will reduce the complexity of in get_stubs_size()
226 * count_relocs() to linear complexity O(n) in get_stubs_size()
322 * addend key. This is a stable O(n*log n) complexity in get_got_size()
323 * algorithm but it will reduce the complexity of in get_got_size()
324 * count_relocs() to linear complexity O(n) in get_got_size()
|
| /linux/tools/thermal/tmon/ |
| H A D | README | 11 complexity of the thermal relationship can grow exponentially among cooling
|
| /linux/Documentation/devicetree/bindings/net/ |
| H A D | adi,adin1110.yaml | 18 The ADIN2111 is a low power, low complexity, two-Ethernet ports
|
| /linux/kernel/sched/ |
| H A D | cpupri.c | 20 * restrictions can find a suitable CPU with O(1) complexity (e.g. two bit
22 * worst case complexity of O(min(101, nr_domcpus)), though the scenario that
|
| /linux/tools/perf/pmu-events/arch/s390/cf_z15/ |
| H A D | transaction.json | 53 "BriefDescription": "Estimated Instruction Complexity CPI infinite Level 1",
|
| /linux/scripts/package/ |
| H A D | gen-diff-patch | 31 # introduce additional complexity. Instead, print a warning message here if
|
| /linux/tools/perf/pmu-events/arch/s390/cf_z14/ |
| H A D | transaction.json | 53 "BriefDescription": "Estimated Instruction Complexity CPI infinite Level 1",
|
| /linux/include/linux/ |
| H A D | kcsan.h | 58 * barriers; only keep 1 to keep fast-path complexity manageable.
|
| /linux/Documentation/driver-api/ |
| H A D | ioctl.rst | 224 * The complexity of user space access and data structure layout is done
253 user interface but adds a lot of complexity to the implementation.
|
| /linux/tools/perf/pmu-events/arch/s390/cf_z13/ |
| H A D | transaction.json | 53 "BriefDescription": "Estimated Instruction Complexity CPI infinite Level 1",
|
| /linux/Documentation/arch/riscv/ |
| H A D | patch-acceptance.rst | 50 Foundation. To avoid the maintenance complexity and potential
|
| /linux/tools/perf/pmu-events/arch/s390/cf_z17/ |
| H A D | transaction.json | 53 "BriefDescription": "Estimated Instruction Complexity CPI infinite Level 1",
|
| /linux/tools/perf/pmu-events/arch/s390/cf_z16/ |
| H A D | transaction.json | 53 "BriefDescription": "Estimated Instruction Complexity CPI infinite Level 1",
|
| /linux/Documentation/driver-api/media/ |
| H A D | v4l2-intro.rst | 6 The V4L2 drivers tend to be very complex due to the complexity of the
|