Lines Matching refs:bn
147 struct maple_big_node *bn;
1867 * @bn: The maple_big_node with the data
1873 struct maple_big_node *bn, unsigned char *mid_split, unsigned long min)
1875 unsigned char b_end = bn->b_end;
1877 unsigned char slot_min, slot_count = mt_slots[bn->type];
1887 split = b_end - mt_min_slots[bn->type];
1889 if (!ma_is_leaf(bn->type))
1893 if (!bn->slot[split])
1906 if (unlikely(mab_middle_node(bn, split, slot_count))) {
1910 slot_min = mt_min_slots[bn->type];
1919 ((bn->pivot[split] - min) < slot_count - 1) &&
1925 split = mab_no_null_split(bn, split, slot_count);
1928 *mid_split = mab_no_null_split(bn, *mid_split, slot_count);
2267 unsigned char b_end = mast->bn->b_end;
2270 mast->bn, b_end);
2282 unsigned char b_end = mast->bn->b_end;
2284 mab_shift_right(mast->bn, end);
2285 mas_mab_cp(mast->orig_l, 0, end - 1, mast->bn, 0);
2288 mast->bn->b_end = end + b_end;
2296 * Data is copied into the @mast->bn.
2369 mast->bn->type = wr_mas.type;
2706 if (split == mast->bn->b_end) {
2711 mab_mas_cp(mast->bn, 0, split, mast->l, new_lmax);
2714 mab_mas_cp(mast->bn, 1 + split, mid_split, mast->m, true);
2715 mast->m->min = mast->bn->pivot[split] + 1;
2721 mab_mas_cp(mast->bn, 1 + split, mast->bn->b_end, mast->r, false);
2722 mast->r->min = mast->bn->pivot[split] + 1;
2738 mas_mab_cp(mast->orig_l, 0, l_slot - 1, mast->bn, 0);
2748 if (mast->bn->pivot[mast->bn->b_end - 1] >= mast->orig_r->max)
2752 mt_slot_count(mast->orig_r->node), mast->bn,
2753 mast->bn->b_end);
2764 if (mast->bn->b_end > mt_min_slot_count(mast->orig_l->node))
2777 if (mast->bn->b_end >= mt_slot_count(mast->orig_l->node))
2886 unlikely(mast->bn->b_end <= mt_min_slots[mast->bn->type]))
2903 mast->bn->b_end--;
2904 mast->bn->type = mte_node_type(mast->orig_l->node);
2905 split = mas_mab_to_node(mas, mast->bn, &left, &right, &middle,
2912 * Copy data from next level in the tree to mast->bn from next
2915 memset(mast->bn, 0, sizeof(struct maple_big_node));
2916 mast->bn->type = mte_node_type(left);
2925 l_mas.offset = mast->bn->b_end;
2926 mab_set_b_end(mast->bn, &l_mas, left);
2927 mab_set_b_end(mast->bn, &m_mas, middle);
2928 mab_set_b_end(mast->bn, &r_mas, right);
2940 /* May be a new root stored in mast->bn */
2954 mab_mas_cp(mast->bn, 0, mt_slots[mast->bn->type] - 1, &l_mas, true);
2979 return mast->bn->b_end;
3019 mast.bn = b_node;
3020 mast.bn->type = mte_node_type(mas->node);
3177 mast->bn->type = maple_arange_64;
3179 mast->bn->type = maple_range_64;
3186 ancestor = mas_new_ma_node(mas, mast->bn);
3192 mab_mas_cp(mast->bn, 0, mt_slots[mast->bn->type] - 1, mast->l, true);
3193 mas->offset = mast->bn->b_end - 1;
3210 memset(mast->bn->gap, 0, sizeof(unsigned long) * ARRAY_SIZE(mast->bn->gap));
3211 memset(mast->bn->slot, 0, sizeof(unsigned long) * ARRAY_SIZE(mast->bn->slot));
3212 memset(mast->bn->pivot, 0, sizeof(unsigned long) * ARRAY_SIZE(mast->bn->pivot));
3213 mast->bn->b_end = 0;
3223 mas_mab_cp(mas, 0, mast->l->offset - 1, mast->bn, 0);
3225 split = mast->bn->b_end;
3226 mab_set_b_end(mast->bn, mast->l, mast->l->node);
3227 mast->r->offset = mast->bn->b_end;
3228 mab_set_b_end(mast->bn, mast->r, mast->r->node);
3229 if (mast->bn->pivot[mast->bn->b_end - 1] == mas->max)
3234 mast->bn, mast->bn->b_end);
3236 mast->bn->b_end--;
3237 mast->bn->type = mte_node_type(mas->node);
3252 mab_mas_cp(mast->bn, 0, split, mast->l, true);
3254 mab_mas_cp(mast->bn, split + 1, mast->bn->b_end, mast->r, false);
3256 mast->l->max = mast->bn->pivot[split];
3283 unsigned char slot_total = mast->bn->b_end;
3299 if (ma_is_leaf(mast->bn->type))
3308 /* Get the data; Fill mast->bn */
3309 mast->bn->b_end++;
3311 mab_shift_right(mast->bn, end + 1);
3312 mas_mab_cp(&tmp_mas, 0, end, mast->bn, 0);
3313 mast->bn->b_end = slot_total + 1;
3315 mas_mab_cp(&tmp_mas, 0, end, mast->bn, mast->bn->b_end);
3318 /* Configure mast for splitting of mast->bn */
3319 split = mt_slots[mast->bn->type] - 2;
3331 split = mab_no_null_split(mast->bn, split, mt_slots[mast->bn->type]);
3388 mast.bn = b_node;
3437 * @bn: The maple big node
3445 struct maple_big_node *bn, unsigned char end)
3451 if (end > bn->b_end) {
3452 int clear = mt_slots[wr_mas->type] - bn->b_end;
3454 memset(wr_mas->slots + bn->b_end, 0, sizeof(void *) * clear--);
3455 memset(wr_mas->pivots + bn->b_end, 0, sizeof(void *) * clear);
3457 mab_mas_cp(bn, 0, bn->b_end, wr_mas->mas, false);
3905 mast.bn = &b_node;