| /openbmc/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
|
| /openbmc/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()
|
| /openbmc/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
|
| /openbmc/linux/arch/s390/boot/ |
| H A 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()
|
| H A 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()
|
| /openbmc/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()
|
| /openbmc/openbmc/poky/meta/recipes-devtools/python/python3/ |
| H A D | get_module_deps3.py | 31 pivot = 'recipe-sysroot-native'
32 dep_path = dep_path[dep_path.find(pivot)+len(pivot):]
|
| H A D | create_manifest3.py | 57 pivot = 'recipe-sysroot-native' variable
59 if pivot in p:
60 nativelibfolder = p[:p.find(pivot)+len(pivot)]
|
| /openbmc/linux/fs/xfs/scrub/ |
| H A 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()
|
| /openbmc/linux/lib/ |
| H A D | maple_tree.c | 651 return node->ma64.pivot; in ma_pivots()
654 return node->mr64.pivot; in ma_pivots()
920 pivots = mn->mr64.pivot; in mt_clear_meta()
1810 memmove(b_node->pivot + shift, b_node->pivot, size); in mab_shift_right()
4444 unsigned long pivot; in mas_prev_slot() local
4463 if (pivot <= min) in mas_prev_slot()
4608 unsigned long pivot; in mas_next_slot() local
4632 if (pivot >= max) in mas_next_slot()
4834 if (mas->index > pivot) in mas_anode_descend()
4852 mas->max = pivot; in mas_anode_descend()
[all …]
|
| /openbmc/linux/arch/x86/net/ |
| H A D | bpf_jit_comp.c | 2607 int pivot, err, jg_bytes = 1; in emit_bpf_dispatcher() local
2634 pivot = (b - a) / 2; in emit_bpf_dispatcher()
2636 if (!is_simm32(progs[a + pivot])) in emit_bpf_dispatcher()
2638 EMIT2_off32(0x81, add_1reg(0xF8, BPF_REG_3), progs[a + pivot]); in emit_bpf_dispatcher()
2640 if (pivot > 2) { /* jg upper_part */ in emit_bpf_dispatcher()
2649 err = emit_bpf_dispatcher(&prog, a, a + pivot, /* emit lower_part */ in emit_bpf_dispatcher()
2663 err = emit_bpf_dispatcher(&prog, a + pivot + 1, /* emit upper_part */ in emit_bpf_dispatcher()
|
| /openbmc/linux/lib/zstd/compress/ |
| H A D | huf_compress.c | 502 U32 const pivot = arr[high].count; in HUF_quickSortPartition() local
506 if (arr[j].count > pivot) { in HUF_quickSortPartition()
|
| /openbmc/linux/Documentation/admin-guide/cgroup-v1/ |
| H A D | blkio-controller.rst | 77 pivot
|
| /openbmc/openbmc/poky/documentation/migration-guides/ |
| H A D | release-notes-5.0.rst | 54 pivot to it.
|
| /openbmc/linux/Documentation/filesystems/ |
| H A 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.
|
| /openbmc/qemu/docs/interop/ |
| H A D | live-block-operations.rst | 640 (b) Or, complete the operation and pivot the live QEMU to the target
|
| /openbmc/linux/tools/testing/radix-tree/ |
| H A 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()
|