| /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
182 unsigned long pivot[3]; 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/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/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/arch/s390/boot/ |
| 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/lib/ |
| H A D | maple_tree.c | 18 * In regular B-Tree terms, pivots are called keys. The term pivot is used to
45 * a slot, but the last offset has an implied pivot from the node above (or
576 return node->ma64.pivot; in ma_pivots()
579 return node->mr64.pivot; in ma_pivots()
581 return node->cp.pivot; in ma_pivots()
612 * mas_safe_pivot() - get the pivot at @piv or mas->max.
615 * @piv: The pivot to fetch
618 * Return: The pivot at @piv within the limit of the @pivots array, @mas->max
635 * @offset: The offset into the pivot array
649 * mte_set_pivot() - Set a pivot t
3944 unsigned long pivot; mas_prev_slot() local
4114 unsigned long pivot; mas_next_slot() local
4293 unsigned long pivot, min, gap = 0; mas_anode_descend() local
[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/arch/x86/net/ |
| H A D | bpf_jit_comp.c | 3725 int pivot, err, jg_bytes = 1; in bpf_int_jit_compile()
3749 /* Not a leaf node, so we pivot, and recursively descend into in bpf_int_jit_compile()
3752 pivot = (b - a) / 2; in bpf_int_jit_compile()
3754 if (!is_simm32(progs[a + pivot])) in bpf_int_jit_compile()
3756 EMIT2_off32(0x81, add_1reg(0xF8, BPF_REG_3), progs[a + pivot]); in bpf_int_jit_compile()
3758 if (pivot > 2) { /* jg upper_part */ in bpf_int_jit_compile()
3767 err = emit_bpf_dispatcher(&prog, a, a + pivot, /* emit lower_part */ in bpf_int_jit_compile()
3781 err = emit_bpf_dispatcher(&prog, a + pivot + 1, /* emit upper_part */ in bpf_int_jit_compile()
3592 int pivot, err, jg_bytes = 1; emit_bpf_dispatcher() local
|
| /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/admin-guide/cgroup-v1/ |
| H A D | blkio-controller.rst | 77 pivot
|
| /linux/kernel/trace/ |
| H A D | trace.c | 4810 static int cmp_mod_entry(const void *key, const void *pivot)
4813 const struct trace_mod_entry *ent = pivot; in cmp_mod_entry() argument
|
| /linux/tools/testing/radix-tree/ |
| H A D | maple.c | 36337 node->mr64.pivot[0] = 0; in farmer_tests()
36338 node->mr64.pivot[1] = 1; in farmer_tests()
36339 node->mr64.pivot[2] = 0; in farmer_tests()
|