Lines Matching defs:b_end
130 unsigned char b_end;
1801 * old data or set b_node->b_end.
1808 unsigned long size = b_node->b_end * sizeof(unsigned long);
1828 unsigned char size = b_node->b_end;
1856 (b_node->b_end - split) > (mt_min_slots[b_node->type]))
1875 unsigned char b_end = bn->b_end;
1876 int split = b_end / 2; /* Assume equal split. */
1887 split = b_end - mt_min_slots[bn->type];
1907 split = b_end / 3;
1916 * NOTE: mt_min_slots is 1 based, b_end and split are zero.
1920 (b_end - split > slot_min))
1935 * and set @b_node->b_end to the next free slot.
1977 b_node->b_end = ++j;
2105 unsigned char b_end;
2111 b_end = 0;
2116 b_end = b_node->b_end;
2117 piv = b_node->pivot[b_end - 1];
2123 b_node->slot[b_end] = wr_mas->content;
2125 b_node->gap[b_end] = mas->index - 1 - piv;
2126 b_node->pivot[b_end++] = mas->index - 1;
2130 mas->offset = b_end;
2131 b_node->slot[b_end] = wr_mas->entry;
2132 b_node->pivot[b_end] = mas->last;
2136 goto b_end;
2142 mas_bulk_rebalance(mas, b_node->b_end, wr_mas->type);
2148 b_node->slot[++b_end] = wr_mas->content;
2150 b_node->gap[b_end] = piv - mas->last + 1;
2151 b_node->pivot[b_end] = piv;
2156 goto b_end;
2159 mas_mab_cp(mas, slot, wr_mas->node_end + 1, b_node, ++b_end);
2160 b_node->b_end--;
2163 b_end:
2164 b_node->b_end = b_end;
2267 unsigned char b_end = mast->bn->b_end;
2270 mast->bn, b_end);
2282 unsigned char b_end = mast->bn->b_end;
2288 mast->bn->b_end = end + b_end;
2413 if (b_node->b_end < slot_count) {
2414 split = b_node->b_end;
2428 * mab_set_b_end() - Add entry to b_node at b_node->b_end and increment the end
2441 b_node->slot[b_node->b_end] = entry;
2443 b_node->gap[b_node->b_end] = mas_max_gap(mas);
2444 b_node->pivot[b_node->b_end++] = mas->max;
2706 if (split == mast->bn->b_end) {
2721 mab_mas_cp(mast->bn, 1 + split, mast->bn->b_end, mast->r, false);
2748 if (mast->bn->pivot[mast->bn->b_end - 1] >= mast->orig_r->max)
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--;
2925 l_mas.offset = mast->bn->b_end;
2979 return mast->bn->b_end;
2997 unsigned char shift, b_end = ++b_node->b_end;
3025 mas_mab_cp(&r_mas, 0, mt_slot_count(r_mas.node), b_node, b_end);
3033 b_node->b_end = shift + b_end;
3193 mas->offset = mast->bn->b_end - 1;
3213 mast->bn->b_end = 0;
3225 split = mast->bn->b_end;
3227 mast->r->offset = mast->bn->b_end;
3229 if (mast->bn->pivot[mast->bn->b_end - 1] == mas->max)
3234 mast->bn, mast->bn->b_end);
3236 mast->bn->b_end--;
3254 mab_mas_cp(mast->bn, split + 1, mast->bn->b_end, mast->r, false);
3283 unsigned char slot_total = mast->bn->b_end;
3309 mast->bn->b_end++;
3313 mast->bn->b_end = slot_total + 1;
3315 mas_mab_cp(&tmp_mas, 0, end, mast->bn, mast->bn->b_end);
3391 if (mt_slots[b_node->type] > b_node->b_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);
3472 unsigned char b_end = b_node->b_end;
3476 if ((b_end < mt_min_slots[b_type]) &&
3481 if (b_end >= mt_slots[b_type])
3494 mab_mas_cp(b_node, 0, b_end, wr_mas->mas, false);
3898 &b_node, b_node.b_end + 1);
3900 b_node.b_end++;