| /linux/include/linux/ |
| H A 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()
|
| H A D | maple_tree.h | 105 unsigned long pivot[MAPLE_RANGE64_SLOTS - 1]; member
126 unsigned long pivot[MAPLE_ARANGE64_SLOTS - 1]; member
|
| /linux/drivers/infiniband/hw/usnic/ |
| H A 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/drivers/gpio/ |
| H A D | gpio-macsmc.c | 121 int pivot = start + ((count - 1) >> 1); in macsmc_gpio_find_first_gpio_index() local
123 ret = apple_smc_get_key_by_index(smc, pivot, &pkey); in macsmc_gpio_find_first_gpio_index()
128 return pivot; in macsmc_gpio_find_first_gpio_index()
130 pivot++; in macsmc_gpio_find_first_gpio_index()
133 count -= pivot - start; in macsmc_gpio_find_first_gpio_index()
134 start = pivot; in macsmc_gpio_find_first_gpio_index()
136 count = pivot - start; in macsmc_gpio_find_first_gpio_index()
|
| /linux/tools/perf/scripts/python/ |
| H A D | net_dropmonitor.py | 40 pivot = (start + end) // 2
41 if loc < kallsyms[pivot][0]:
42 end = pivot
44 start = pivot
|
| /linux/arch/s390/boot/ |
| H A D | printk.c | 131 char *pivot; in findsym() local
135 pivot = symstart(a + (b - a) / 2); in findsym()
136 start = simple_strtoull(pivot, &endp, 16); in findsym()
139 b = pivot; in findsym()
143 a = pivot + strlen(pivot) + 1; in findsym()
|
| H A D | physmem_info.c | 146 unsigned long pivot; in search_mem_end() local
150 pivot = offset + range; in search_mem_end()
151 if (!tprot(pivot << 20)) in search_mem_end()
152 offset = pivot; in search_mem_end()
|
| /linux/fs/smb/client/ |
| H A D | smb2maperror.c | 29 const struct status_to_posix_error *pivot = _pivot; in cmp_smb2_status() local
31 if (key < pivot->smb2_status) in cmp_smb2_status()
33 if (key > pivot->smb2_status) in cmp_smb2_status()
|
| /linux/drivers/gpu/drm/tegra/ |
| H A 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/fs/xfs/scrub/ |
| H A 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/lib/ |
| H A D | maple_tree.c | 136 unsigned long pivot[MAPLE_BIG_NODE_SLOTS - 1]; member
604 return node->ma64.pivot; in ma_pivots()
607 return node->mr64.pivot; in ma_pivots()
688 node->mr64.pivot[piv] = val; in mte_set_pivot()
691 node->ma64.pivot[piv] = val; in mte_set_pivot()
842 pivots = mn->mr64.pivot; in mt_clear_meta()
1630 memmove(b_node->pivot + shift, b_node->pivot, size); in mab_shift_right()
1752 b_node->pivot[j] = pivots[i++]; in mas_mab_cp()
1760 b_node->pivot[j] = pivots[i]; in mas_mab_cp()
1761 if (unlikely(!b_node->pivot[j])) in mas_mab_cp()
[all …]
|
| /linux/drivers/pinctrl/sophgo/ |
| H A D | pinctrl-sophgo-common.c | 33 static int sophgo_cmp_pin(const void *key, const void *pivot) in sophgo_cmp_pin() argument
35 const struct sophgo_pin *pin = pivot; in sophgo_cmp_pin()
|
| /linux/drivers/platform/chrome/ |
| H A D | cros_ec_sensorhub_ring.c | 174 int pivot, i; in cros_ec_sensor_ring_median() local
183 pivot = array[hi]; in cros_ec_sensor_ring_median()
187 if (array[j] < pivot) in cros_ec_sensor_ring_median()
|
| /linux/arch/x86/net/ |
| H A D | bpf_jit_comp.c | 3590 int pivot, err, jg_bytes = 1; in emit_bpf_dispatcher() local
3617 pivot = (b - a) / 2; in emit_bpf_dispatcher()
3619 if (!is_simm32(progs[a + pivot])) in emit_bpf_dispatcher()
3621 EMIT2_off32(0x81, add_1reg(0xF8, BPF_REG_3), progs[a + pivot]); in emit_bpf_dispatcher()
3623 if (pivot > 2) { /* jg upper_part */ in emit_bpf_dispatcher()
3632 err = emit_bpf_dispatcher(&prog, a, a + pivot, /* emit lower_part */ in emit_bpf_dispatcher()
3646 err = emit_bpf_dispatcher(&prog, a + pivot + 1, /* emit upper_part */ in emit_bpf_dispatcher()
|
| /linux/lib/zstd/compress/ |
| H A D | huf_compress.c | 573 U32 const pivot = arr[high].count; in HUF_quickSortPartition() local
577 if (arr[j].count > pivot) { in HUF_quickSortPartition()
|
| /linux/Documentation/arch/riscv/ |
| H A D | zicfiss.rst | 152 pivot to any shadow stack. Shadow stack tokens can help mitigate this
|
| /linux/Documentation/admin-guide/cgroup-v1/ |
| H A D | blkio-controller.rst | 77 pivot
|
| /linux/Documentation/filesystems/xfs/ |
| H A D | xfs-online-fsck-design.rst | 2070 Choosing a quicksort pivot is a tricky business.
2071 A good pivot splits the set to sort in half, leading to the divide and conquer
2073 A poor pivot barely splits the subset at all, leading to O(n\ :sup:`2`)
2075 The xfarray sort routine tries to avoid picking a bad pivot by sampling nine
2080 pivot from a classic C array.
2087 the 4th element of that buffer as the pivot.
2094 subset around the pivot, then set up the current and next stack frames to
2095 sort with the larger and the smaller halves of the pivot, respectively.
|
| /linux/kernel/trace/ |
| H A D | trace.c | 5361 static int cmp_mod_entry(const void *key, const void *pivot) in cmp_mod_entry() argument
5364 const struct trace_mod_entry *ent = pivot; in cmp_mod_entry()
|
| /linux/tools/testing/radix-tree/ |
| H A D | maple.c | 36051 node->mr64.pivot[0] = 0; in farmer_tests()
36052 node->mr64.pivot[1] = 1; in farmer_tests()
36053 node->mr64.pivot[2] = 0; in farmer_tests()
|