| /linux-master/include/linux/ |
| H A D | bsearch.h | 10 const char *pivot; local
14 pivot = base + (num >> 1) * size;
15 result = cmp(key, pivot);
18 return (void *)pivot;
21 base = pivot + size;
|
| H A D | maple_tree.h | 96 * In regular B-Tree terms, pivots are called keys. The term pivot is used to
105 unsigned long pivot[MAPLE_RANGE64_SLOTS - 1]; member in struct:maple_range_64
126 unsigned long pivot[MAPLE_ARANGE64_SLOTS - 1]; member in struct:maple_arange_64
141 struct maple_enode *next; /* Overlaps the pivot */
412 * every time a node is walked down or up. The offset is the slot/pivot of
431 unsigned long min; /* The minimum index of this node - implied pivot min */
432 unsigned long max; /* The maximum index of this node - implied pivot max */
449 unsigned long end_piv; /* The pivot at the offset end */
|
| /linux-master/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-master/drivers/infiniband/hw/usnic/ |
| H A D | usnic_uiom_interval_tree.c | 127 long int pivot = start; local
136 if (pivot < interval->start) {
137 MAKE_NODE_AND_APPEND(tmp, pivot, interval->start - 1,
140 pivot = interval->start;
144 * Invariant: Set [start, pivot] is either in diff_set or root,
148 if (pivot > interval->last) {
150 } else if (pivot <= interval->last &&
153 pivot = interval->last + 1;
157 if (pivot <= last)
158 MAKE_NODE_AND_APPEND(tmp, pivot, las
[all...] |
| /linux-master/arch/s390/boot/ |
| H A D | pgm_check_info.c | 39 char *pivot; local
43 pivot = symstart(a + (b - a) / 2);
44 start = simple_strtoull(pivot, &endp, 16);
47 b = pivot;
51 a = pivot + strlen(pivot) + 1;
|
| H A D | physmem_info.c | 145 unsigned long pivot; local
149 pivot = offset + range;
150 if (!tprot(pivot << 20))
151 offset = pivot;
|
| /linux-master/drivers/gpu/drm/tegra/ |
| H A D | dp.c | 76 unsigned int i, pivot; local
81 for (pivot = 0; pivot < link->num_rates; pivot++)
82 if (rate <= link->rates[pivot])
85 if (pivot != link->num_rates && rate == link->rates[pivot])
88 for (i = link->num_rates; i > pivot; i--)
91 link->rates[pivot] = rate;
|
| /linux-master/fs/xfs/scrub/ |
| H A D | xfarray.c | 430 /* Size of each element in the quicksort pivot array. */
452 * The median-of-nine pivot algorithm doesn't work if a subset has
472 /* Scratchpad for in-memory sort, or finding the pivot */
604 /* Return a pointer to the xfarray pivot record within the sortinfo struct. */
610 /* Return a pointer to the start of the pivot array. */
618 /* The xfarray record is stored at the start of each pivot array element. */
628 /* The xfarray index is stored at the end of each pivot array element. */
640 * Find a pivot value for quicksort partitioning, swap it with a[lo], and save
641 * the cached pivot record for the next step.
644 * and choose the pivot fro
654 void *pivot = xfarray_sortinfo_pivot(si); local
909 void *pivot; local
[all...] |
| /linux-master/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
124 unsigned long pivot[MAPLE_BIG_NODE_SLOTS - 1]; member in struct:maple_big_node
656 return node->ma64.pivot;
659 return node->mr64.pivot;
688 * mas_safe_pivot() - get the pivot at @piv or mas->max.
691 * @piv: The pivot to fetch
694 * Return: The pivot at @piv within the limit of the @pivots array, @mas->max
711 * @offset: The offset into the pivot array
725 * mte_set_pivot() - Set a pivot t
4456 unsigned long pivot; local
4630 unsigned long pivot; local
4832 unsigned long pivot, min, gap = 0; local
[all...] |
| /linux-master/drivers/platform/chrome/ |
| H A D | cros_ec_sensorhub_ring.c | 163 int pivot, i; local
172 pivot = array[hi];
176 if (array[j] < pivot)
179 /* The pivot's index corresponds to i+1. */
|
| /linux-master/arch/x86/net/ |
| H A D | bpf_jit_comp.c | 3068 int pivot, err, jg_bytes = 1; local
3092 /* Not a leaf node, so we pivot, and recursively descend into
3095 pivot = (b - a) / 2;
3097 if (!is_simm32(progs[a + pivot]))
3099 EMIT2_off32(0x81, add_1reg(0xF8, BPF_REG_3), progs[a + pivot]);
3101 if (pivot > 2) { /* jg upper_part */
3110 err = emit_bpf_dispatcher(&prog, a, a + pivot, /* emit lower_part */
3124 err = emit_bpf_dispatcher(&prog, a + pivot + 1, /* emit upper_part */
|
| /linux-master/lib/zstd/compress/ |
| H A D | huf_compress.c | 499 /* Simply select rightmost element as pivot. "Better" selectors like
502 U32 const pivot = arr[high].count; local
506 if (arr[j].count > pivot) {
|
| /linux-master/tools/testing/radix-tree/ |
| H A D | maple.c | [all...] |