| /linux-6.6.21/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.6.21/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.6.21/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.6.21/arch/s390/boot/ |
| D | pgm_check_info.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.6.21/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.6.21/fs/xfs/scrub/ |
| D | xfarray.c | 697 void *pivot = xfarray_sortinfo_pivot(si); in xfarray_qsort_pivot() local
759 memcpy(pivot, recp, si->array->obj_size); in xfarray_qsort_pivot()
782 error = xfarray_sort_store(si, lo, pivot); in xfarray_qsort_pivot()
937 void *pivot; in xfarray_sort() local
952 pivot = xfarray_sortinfo_pivot(si); in xfarray_sort()
1005 while (xfarray_sort_cmp(si, scratch, pivot) >= 0 && in xfarray_sort()
1034 while (xfarray_sort_cmp(si, scratch, pivot) <= 0 && in xfarray_sort()
1066 error = xfarray_sort_store(si, lo, pivot); in xfarray_sort()
|
| /linux-6.6.21/lib/ |
| D | maple_tree.c | 122 unsigned long pivot[MAPLE_BIG_NODE_SLOTS - 1]; member
651 return node->ma64.pivot; in ma_pivots()
654 return node->mr64.pivot; in ma_pivots()
701 return node->ma64.pivot[piv]; in mas_pivot()
704 return node->mr64.pivot[piv]; in mas_pivot()
765 node->mr64.pivot[piv] = val; in mte_set_pivot()
768 node->ma64.pivot[piv] = val; in mte_set_pivot()
920 pivots = mn->mr64.pivot; in mt_clear_meta()
1810 memmove(b_node->pivot + shift, b_node->pivot, size); in mab_shift_right()
1919 ((bn->pivot[split] - min) < slot_count - 1) && in mab_calc_split()
[all …]
|
| /linux-6.6.21/arch/x86/net/ |
| D | bpf_jit_comp.c | 2614 int pivot, err, jg_bytes = 1; in emit_bpf_dispatcher() local
2641 pivot = (b - a) / 2; in emit_bpf_dispatcher()
2643 if (!is_simm32(progs[a + pivot])) in emit_bpf_dispatcher()
2645 EMIT2_off32(0x81, add_1reg(0xF8, BPF_REG_3), progs[a + pivot]); in emit_bpf_dispatcher()
2647 if (pivot > 2) { /* jg upper_part */ in emit_bpf_dispatcher()
2656 err = emit_bpf_dispatcher(&prog, a, a + pivot, /* emit lower_part */ in emit_bpf_dispatcher()
2670 err = emit_bpf_dispatcher(&prog, a + pivot + 1, /* emit upper_part */ in emit_bpf_dispatcher()
|
| /linux-6.6.21/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.6.21/Documentation/admin-guide/cgroup-v1/ |
| D | blkio-controller.rst | 77 pivot
|
| /linux-6.6.21/Documentation/filesystems/ |
| D | xfs-online-fsck-design.rst | 2122 Choosing a quicksort pivot is a tricky business.
2123 A good pivot splits the set to sort in half, leading to the divide and conquer
2125 A poor pivot barely splits the subset at all, leading to O(n\ :sup:`2`)
2127 The xfarray sort routine tries to avoid picking a bad pivot by sampling nine
2132 pivot from a classic C array.
2139 the 4th element of that buffer as the pivot.
2146 subset around the pivot, then set up the current and next stack frames to
2147 sort with the larger and the smaller halves of the pivot, respectively.
|
| /linux-6.6.21/tools/testing/radix-tree/ |
| D | maple.c | 35876 node->mr64.pivot[0] = 0; in farmer_tests()
35877 node->mr64.pivot[1] = 1; in farmer_tests()
35878 node->mr64.pivot[2] = 0; in farmer_tests()
|