Home
last modified time | relevance | path

Searched refs:wr_mas (Results 1 – 3 of 3) sorted by relevance

/linux/lib/
H A Dmaple_tree.c1281 void wr_mas_setup(struct ma_wr_state *wr_mas, struct ma_state *mas) in wr_mas_setup() argument
1283 wr_mas->node = mas_mn(mas); in wr_mas_setup()
1284 wr_mas->type = mte_node_type(mas->node); in wr_mas_setup()
1285 wr_mas->pivots = ma_pivots(wr_mas->node, wr_mas->type); in wr_mas_setup()
1286 wr_mas->slots = ma_slots(wr_mas->node, wr_mas->type); in wr_mas_setup()
1287 wr_mas->r_min = mas_safe_min(mas, wr_mas->pivots, mas->offset); in wr_mas_setup()
1288 wr_mas->r_max = mas_safe_pivot(mas, wr_mas->pivots, mas->offset, in wr_mas_setup()
1289 wr_mas->type); in wr_mas_setup()
1293 void wr_mas_ascend(struct ma_wr_state *wr_mas) in wr_mas_ascend() argument
1295 struct ma_state *mas = wr_mas->mas; in wr_mas_ascend()
[all …]
/linux/include/linux/
H A Dmaple_tree.h664 void mas_wr_dump(const struct ma_wr_state *wr_mas);
/linux/tools/testing/radix-tree/
H A Dmaple.c35070 static unsigned char get_vacant_height(struct ma_wr_state *wr_mas, void *entry) in get_vacant_height() argument
35072 struct ma_state *mas = wr_mas->mas; in get_vacant_height()
35087 wr_mas->type = type; in get_vacant_height()
35100 wr_mas->r_max = offset < mas->end ? pivots[offset] : mas->max; in get_vacant_height()
35103 if (mas_is_span_wr(wr_mas)) in get_vacant_height()
35139 MA_WR_STATE(wr_mas, &mas, ptr); in check_prealloc()
35148 mas_wr_preallocate(&wr_mas, ptr); in check_prealloc()
35153 vacant_height = get_vacant_height(&wr_mas, ptr); in check_prealloc()
35160 mas_wr_preallocate(&wr_mas, ptr); in check_prealloc()
35164 vacant_height = get_vacant_height(&wr_mas, ptr); in check_prealloc()
[all …]