| /linux-6.12.1/include/linux/ |
| D | bsearch.h | 10 const char *pivot; in __inline_bsearch() local
14 pivot = base + (num >> 1) * size; in __inline_bsearch()
15 result = cmp(key, pivot); in __inline_bsearch()
18 return (void *)pivot; in __inline_bsearch()
21 base = pivot + size; in __inline_bsearch()
|
| D | maple_tree.h | 105 unsigned long pivot[MAPLE_RANGE64_SLOTS - 1]; member
126 unsigned long pivot[MAPLE_ARANGE64_SLOTS - 1]; member
|
| /linux-6.12.1/arch/s390/boot/ |
| D | printk.c | 39 char *pivot; in findsym() local
43 pivot = symstart(a + (b - a) / 2); in findsym()
44 start = simple_strtoull(pivot, &endp, 16); in findsym()
47 b = pivot; in findsym()
51 a = pivot + strlen(pivot) + 1; in findsym()
|
| D | physmem_info.c | 145 unsigned long pivot; in search_mem_end() local
149 pivot = offset + range; in search_mem_end()
150 if (!tprot(pivot << 20)) in search_mem_end()
151 offset = pivot; in search_mem_end()
|
| /linux-6.12.1/drivers/infiniband/hw/usnic/ |
| D | usnic_uiom_interval_tree.c | 127 long int pivot = start; in usnic_uiom_get_intervals_diff() local
136 if (pivot < interval->start) { in usnic_uiom_get_intervals_diff()
137 MAKE_NODE_AND_APPEND(tmp, pivot, interval->start - 1, in usnic_uiom_get_intervals_diff()
140 pivot = interval->start; in usnic_uiom_get_intervals_diff()
148 if (pivot > interval->last) { in usnic_uiom_get_intervals_diff()
150 } else if (pivot <= interval->last && in usnic_uiom_get_intervals_diff()
153 pivot = interval->last + 1; in usnic_uiom_get_intervals_diff()
157 if (pivot <= last) in usnic_uiom_get_intervals_diff()
158 MAKE_NODE_AND_APPEND(tmp, pivot, last, 1, flags, err, err_out, in usnic_uiom_get_intervals_diff()
|
| /linux-6.12.1/tools/perf/scripts/python/ |
| D | net_dropmonitor.py | 40 pivot = (start + end) // 2
41 if loc < kallsyms[pivot][0]:
42 end = pivot
44 start = pivot
|
| /linux-6.12.1/drivers/gpu/drm/tegra/ |
| D | dp.c | 76 unsigned int i, pivot; in drm_dp_link_add_rate() local
81 for (pivot = 0; pivot < link->num_rates; pivot++) in drm_dp_link_add_rate()
82 if (rate <= link->rates[pivot]) in drm_dp_link_add_rate()
85 if (pivot != link->num_rates && rate == link->rates[pivot]) in drm_dp_link_add_rate()
88 for (i = link->num_rates; i > pivot; i--) in drm_dp_link_add_rate()
91 link->rates[pivot] = rate; in drm_dp_link_add_rate()
|
| /linux-6.12.1/fs/xfs/scrub/ |
| D | xfarray.c | 654 void *pivot = xfarray_sortinfo_pivot(si); in xfarray_qsort_pivot() local
716 memcpy(pivot, recp, si->array->obj_size); in xfarray_qsort_pivot()
739 error = xfarray_sort_store(si, lo, pivot); in xfarray_qsort_pivot()
911 void *pivot; in xfarray_sort() local
926 pivot = xfarray_sortinfo_pivot(si); in xfarray_sort()
983 while (xfarray_sort_cmp(si, p, pivot) >= 0 && lo < hi) { in xfarray_sort()
1009 while (xfarray_sort_cmp(si, p, pivot) <= 0 && lo < hi) { in xfarray_sort()
1038 error = xfarray_sort_store(si, lo, pivot); in xfarray_sort()
|
| /linux-6.12.1/lib/ |
| D | maple_tree.c | 124 unsigned long pivot[MAPLE_BIG_NODE_SLOTS - 1]; member
657 return node->ma64.pivot; in ma_pivots()
660 return node->mr64.pivot; in ma_pivots()
741 node->mr64.pivot[piv] = val; in mte_set_pivot()
744 node->ma64.pivot[piv] = val; in mte_set_pivot()
895 pivots = mn->mr64.pivot; in mt_clear_meta()
1789 memmove(b_node->pivot + shift, b_node->pivot, size); in mab_shift_right()
1898 ((bn->pivot[split] - min) < slot_count - 1) && in mab_calc_split()
1936 b_node->pivot[j] = pivots[i++]; in mas_mab_cp()
1944 b_node->pivot[j] = pivots[i]; in mas_mab_cp()
[all …]
|
| /linux-6.12.1/drivers/platform/chrome/ |
| D | cros_ec_sensorhub_ring.c | 163 int pivot, i; in cros_ec_sensor_ring_median() local
172 pivot = array[hi]; in cros_ec_sensor_ring_median()
176 if (array[j] < pivot) in cros_ec_sensor_ring_median()
|
| /linux-6.12.1/drivers/pinctrl/sophgo/ |
| D | pinctrl-cv18xx.c | 69 static int cv1800_cmp_pin(const void *key, const void *pivot) in cv1800_cmp_pin() argument
71 const struct cv1800_pin *pin = pivot; in cv1800_cmp_pin()
|
| /linux-6.12.1/arch/x86/net/ |
| D | bpf_jit_comp.c | 3221 int pivot, err, jg_bytes = 1; in emit_bpf_dispatcher() local
3248 pivot = (b - a) / 2; in emit_bpf_dispatcher()
3250 if (!is_simm32(progs[a + pivot])) in emit_bpf_dispatcher()
3252 EMIT2_off32(0x81, add_1reg(0xF8, BPF_REG_3), progs[a + pivot]); in emit_bpf_dispatcher()
3254 if (pivot > 2) { /* jg upper_part */ in emit_bpf_dispatcher()
3263 err = emit_bpf_dispatcher(&prog, a, a + pivot, /* emit lower_part */ in emit_bpf_dispatcher()
3277 err = emit_bpf_dispatcher(&prog, a + pivot + 1, /* emit upper_part */ in emit_bpf_dispatcher()
|
| /linux-6.12.1/lib/zstd/compress/ |
| D | huf_compress.c | 502 U32 const pivot = arr[high].count; in HUF_quickSortPartition() local
506 if (arr[j].count > pivot) { in HUF_quickSortPartition()
|
| /linux-6.12.1/Documentation/admin-guide/cgroup-v1/ |
| D | blkio-controller.rst | 77 pivot
|
| /linux-6.12.1/Documentation/filesystems/xfs/ |
| D | xfs-online-fsck-design.rst | 2115 Choosing a quicksort pivot is a tricky business.
2116 A good pivot splits the set to sort in half, leading to the divide and conquer
2118 A poor pivot barely splits the subset at all, leading to O(n\ :sup:`2`)
2120 The xfarray sort routine tries to avoid picking a bad pivot by sampling nine
2125 pivot from a classic C array.
2132 the 4th element of that buffer as the pivot.
2139 subset around the pivot, then set up the current and next stack frames to
2140 sort with the larger and the smaller halves of the pivot, respectively.
|
| /linux-6.12.1/tools/testing/radix-tree/ |
| D | maple.c | 36364 node->mr64.pivot[0] = 0; in farmer_tests()
36365 node->mr64.pivot[1] = 1; in farmer_tests()
36366 node->mr64.pivot[2] = 0; in farmer_tests()
|