Lines Matching defs:mid_split
1868 * @mid_split: The second split, if required. 0 otherwise.
1870 * Return: The first split location. The middle split is set in @mid_split.
1873 struct maple_big_node *bn, unsigned char *mid_split, unsigned long min)
1886 *mid_split = 0;
1908 *mid_split = split * 2;
1912 *mid_split = 0;
1927 if (unlikely(*mid_split))
1928 *mid_split = mab_no_null_split(bn, *mid_split, slot_count);
2396 * @mid_split: the split location for the middle node
2403 unsigned char *mid_split, unsigned long min)
2411 *mid_split = 0;
2416 split = mab_calc_split(mas, b_node, mid_split, min);
2420 if (*mid_split)
2480 * @mid_split: The middle split.
2487 unsigned char mid_split)
2492 if (slot < mid_split)
2497 *split = mid_split;
2513 unsigned char mid_split)
2527 mte_mid_split_check(&l, &r, right, slot, &split, mid_split);
2530 mte_mid_split_check(&l, &r, right, slot, &split, mid_split);
2533 mte_mid_split_check(&l, &r, right, slot, &split, mid_split);
2693 * @mid_split: The location to split between middle and right.
2697 struct maple_enode *right, unsigned char split, unsigned char mid_split)
2714 mab_mas_cp(mast->bn, 1 + split, mid_split, mast->m, true);
2716 split = mid_split;
2866 unsigned char split, mid_split;
2906 &mid_split, mast->orig_l->min);
2908 mid_split);
2909 mast_cp_to_nodes(mast, left, middle, right, split, mid_split);
3352 unsigned char mid_split, split = 0;
3414 split = mab_calc_split(mas, b_node, &mid_split, prev_l_mas.min);