Lines Matching defs:middle
51 * the entire data set, or one half of the tree, or the middle half of the tree.
145 struct ma_state *m; /* New middle of subtree (rare) */
1797 * mab_middle_node() - Check if a middle node is needed (unlikely)
1803 * Return: true if a middle node is required.
1850 * Return: The first split location. The middle split is set in @mid_split.
2355 * mas_mab_to_node() - Set up right and middle nodes
2361 * @middle: the pointer which may have the middle node (rare)
2362 * @mid_split: the split location for the middle node
2368 struct maple_enode **right, struct maple_enode **middle,
2376 *middle = NULL;
2387 *middle = mas_new_ma_node(mas, b_node);
2442 * @**m: Pointer to middle encoded maple node.
2446 * @mid_split: The middle split.
2476 struct maple_enode *middle,
2488 if (middle)
2489 r = middle;
2658 * @middle: The middle encoded maple node
2660 * @split: The location to split between left and (middle ? middle : right)
2661 * @mid_split: The location to split between middle and right.
2664 struct maple_enode *left, struct maple_enode *middle,
2670 mas_node_or_none(mast->m, middle);
2681 if (middle) {
2834 struct maple_enode *left = NULL, *middle = NULL, *right = NULL;
2871 split = mas_mab_to_node(mas, mast->bn, &left, &right, &middle,
2873 mast_set_split_parents(mast, left, middle, right, split,
2875 mast_cp_to_nodes(mast, left, middle, right, split, mid_split);
2893 mab_set_b_end(mast->bn, &m_mas, middle);
2922 if (middle)
2923 mas_set_parent(mas, middle, l_mas.node, ++slot);