Lines Matching defs:middle
49 * the entire data set, or one half of the tree, or the middle half of the tree.
143 struct ma_state *m; /* New middle of subtree (rare) */
1817 * mab_middle_node() - Check if a middle node is needed (unlikely)
1823 * Return: true if a middle node is required.
1870 * Return: The first split location. The middle split is set in @mid_split.
2389 * mas_mab_to_node() - Set up right and middle nodes
2395 * @middle: the pointer which may have the middle node (rare)
2396 * @mid_split: the split location for the middle node
2402 struct maple_enode **right, struct maple_enode **middle,
2410 *middle = NULL;
2421 *middle = mas_new_ma_node(mas, b_node);
2476 * @**m: Pointer to middle encoded maple node.
2480 * @mid_split: The middle split.
2510 struct maple_enode *middle,
2522 if (middle)
2523 r = middle;
2690 * @middle: The middle encoded maple node
2692 * @split: The location to split between left and (middle ? middle : right)
2693 * @mid_split: The location to split between middle and right.
2696 struct maple_enode *left, struct maple_enode *middle,
2702 mast->m->node = mte_node_or_none(middle);
2713 if (middle) {
2868 struct maple_enode *left = NULL, *middle = NULL, *right = NULL;
2905 split = mas_mab_to_node(mas, mast->bn, &left, &right, &middle,
2907 mast_set_split_parents(mast, left, middle, right, split,
2909 mast_cp_to_nodes(mast, left, middle, right, split, mid_split);
2927 mab_set_b_end(mast->bn, &m_mas, middle);
2956 if (middle)
2957 mas_set_parent(mas, middle, l_mas.node, ++slot);