unsigned char end;
unsigned char insert_off;
unsigned char offset; /* Operating position */
- bool alloc;
+ bool is_alloc;
};
struct ma_node_state {
mni->slots = ma_slots(node, type);
mni->pivots = ma_pivots(node, type);
mni->gaps = ma_gaps(node, type);
- mni->alloc = false;
+ mni->is_alloc = false;
}
static inline
unsigned long *pivs;
void **slots;
- if (!p->alloc)
+ if (!p->is_alloc)
goto finalise_leaf;
i = 0;
offset = p->offset - 2;
mni_node_init(&right, mas_pop_node(mas), wr_mas->type);
if (mt_is_alloc(mas->tree))
- right.alloc = left.alloc = true;
+ right.is_alloc = left.is_alloc = true;
mns_node_part_leaf_init(&part, wr_mas, &src);
sd.new_end = mas->end + part.size; /* - skip + 1 */