Lines Matching defs:pivot
16 * In regular B-Tree terms, pivots are called keys. The term pivot is used to
43 * a slot, but the last offset has an implied pivot from the node above (or
122 unsigned long pivot[MAPLE_BIG_NODE_SLOTS - 1];
651 return node->ma64.pivot;
654 return node->mr64.pivot;
683 * mas_pivot() - Get the pivot at @piv of the maple encoded node.
685 * @piv: The pivot.
687 * Return: the pivot at @piv of @mn.
701 return node->ma64.pivot[piv];
704 return node->mr64.pivot[piv];
712 * mas_safe_pivot() - get the pivot at @piv or mas->max.
715 * @piv: The pivot to fetch
718 * Return: The pivot at @piv within the limit of the @pivots array, @mas->max
735 * @offset: The offset into the pivot array
749 * mte_set_pivot() - Set a pivot to a value in an encoded maple node.
751 * @piv: The pivot offset
752 * @val: The value of the pivot
765 node->mr64.pivot[piv] = val;
768 node->ma64.pivot[piv] = val;
920 pivots = mn->mr64.pivot;
1523 * Check the first implied pivot optimizes the loop below and slot 1 may
1537 * Check end implied pivot which can only be a gap on the right most
1810 memmove(b_node->pivot + shift, b_node->pivot, size);
1919 ((bn->pivot[split] - min) < slot_count - 1) &&
1957 b_node->pivot[j] = pivots[i++];
1965 b_node->pivot[j] = pivots[i];
1966 if (unlikely(!b_node->pivot[j]))
1969 if (unlikely(mas->max == b_node->pivot[j]))
1974 b_node->pivot[j] = mas_safe_pivot(mas, pivots, i, mt);
2042 pivots[j++] = b_node->pivot[i++];
2043 } while (i <= mab_end && likely(b_node->pivot[i]));
2049 mas->max = b_node->pivot[i - 1];
2117 piv = b_node->pivot[b_end - 1];
2126 b_node->pivot[b_end++] = mas->index - 1;
2132 b_node->pivot[b_end] = mas->last;
2151 b_node->pivot[b_end] = piv;
2431 * @mas - the maple state to get the pivot (mas->max)
2444 b_node->pivot[b_node->b_end++] = mas->max;
2715 mast->m->min = mast->bn->pivot[split] + 1;
2722 mast->r->min = mast->bn->pivot[split] + 1;
2748 if (mast->bn->pivot[mast->bn->b_end - 1] >= mast->orig_r->max)
3212 memset(mast->bn->pivot, 0, sizeof(unsigned long) * ARRAY_SIZE(mast->bn->pivot));
3229 if (mast->bn->pivot[mast->bn->b_end - 1] == mas->max)
3256 mast->l->max = mast->bn->pivot[split];
3564 * @piv: The pivot value being written
3580 /* Contained in this pivot, fast path */
4290 * single pivot needs to be inserted (as well as writing the entry). If
4444 unsigned long pivot;
4458 pivot = mas_safe_min(mas, pivots, mas->offset);
4463 if (pivot <= min)
4514 * @max: The maximum pivot value to check.
4608 unsigned long pivot;
4625 pivot = pivots[mas->offset];
4632 if (pivot >= max)
4811 unsigned long pivot, min, gap = 0;
4831 pivot = mas_safe_pivot(mas, pivots, offset, type);
4834 if (mas->index > pivot)
4840 gap = min(pivot, mas->last) - max(mas->index, min) + 1;
4849 if (mas->index <= pivot) {
4852 mas->max = pivot;
4858 min = pivot + 1;
4859 if (mas->last <= pivot) {
6770 pr_cont("%p %lX ", node->slot[i], node->pivot[i]);
6774 pr_cont("%p %lu ", node->slot[i], node->pivot[i]);
6782 last = node->pivot[i];
6799 pr_err("node %p last (%lx) > max (%lx) at pivot %d!\n",
6804 pr_err("node %p last (%lu) > max (%lu) at pivot %d!\n",
6836 pr_cont("%p %lX ", node->slot[i], node->pivot[i]);
6840 pr_cont("%p %lu ", node->slot[i], node->pivot[i]);
6848 last = node->pivot[i];
6863 pr_err("node %p last (%lu) > max (%lu) at pivot %d!\n",
7107 pr_err("Missing node limit pivot at %p[%u]",