Searched refs:wr_mas (Results 1 – 3 of 3) sorted by relevance
| /linux/lib/ |
| H A D | maple_tree.c | 1281 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 in wr_mas_setup()
1293 wr_mas_ascend(struct ma_wr_state * wr_mas) wr_mas_ascend() argument
1698 mas_wr_node_walk(struct ma_wr_state * wr_mas) mas_wr_node_walk() argument
2236 rebalance_data(struct maple_copy * cp,struct ma_wr_state * wr_mas,struct ma_state * sib,struct ma_state * parent) rebalance_data() argument
2377 append_wr_mas_cp(struct maple_copy * cp,struct ma_wr_state * wr_mas,unsigned char start,unsigned char end) append_wr_mas_cp() argument
2694 rebalance_ascend(struct maple_copy * cp,struct ma_wr_state * wr_mas,struct ma_state * sib,struct ma_state * parent) rebalance_ascend() argument
2803 mas_is_span_wr(struct ma_wr_state * wr_mas) mas_is_span_wr() argument
2833 mas_wr_walk_descend(struct ma_wr_state * wr_mas) mas_wr_walk_descend() argument
2840 mas_wr_walk_traverse(struct ma_wr_state * wr_mas) mas_wr_walk_traverse() argument
2856 mas_wr_walk(struct ma_wr_state * wr_mas) mas_wr_walk() argument
2886 mas_wr_walk_index(struct ma_wr_state * wr_mas) mas_wr_walk_index() argument
3047 mas_wr_spanning_store(struct ma_wr_state * wr_mas) mas_wr_spanning_store() argument
3125 mas_wr_node_store(struct ma_wr_state * wr_mas) mas_wr_node_store() argument
3214 mas_wr_slot_store(struct ma_wr_state * wr_mas) mas_wr_slot_store() argument
3257 mas_wr_extend_null(struct ma_wr_state * wr_mas) mas_wr_extend_null() argument
3293 mas_wr_end_piv(struct ma_wr_state * wr_mas) mas_wr_end_piv() argument
3305 mas_wr_new_end(struct ma_wr_state * wr_mas) mas_wr_new_end() argument
3328 mas_wr_append(struct ma_wr_state * wr_mas) mas_wr_append() argument
3379 split_ascend(struct maple_copy * cp,struct ma_wr_state * wr_mas,struct ma_state * sib,struct ma_state * parent) split_ascend() argument
3424 split_data(struct maple_copy * cp,struct ma_wr_state * wr_mas,struct ma_state * sib,struct ma_state * parent) split_data() argument
3442 mas_wr_split(struct ma_wr_state * wr_mas) mas_wr_split() argument
3475 mas_wr_rebalance(struct ma_wr_state * wr_mas) mas_wr_rebalance() argument
3514 mas_wr_store_entry(struct ma_wr_state * wr_mas) mas_wr_store_entry() argument
3553 mas_wr_prealloc_setup(struct ma_wr_state * wr_mas) mas_wr_prealloc_setup() argument
3604 mas_prealloc_calc(struct ma_wr_state * wr_mas,void * entry) mas_prealloc_calc() argument
3660 mas_wr_store_type(struct ma_wr_state * wr_mas) mas_wr_store_type() argument
3709 mas_wr_preallocate(struct ma_wr_state * wr_mas,void * entry) mas_wr_preallocate() argument
7032 mas_wr_dump(const struct ma_wr_state * wr_mas) mas_wr_dump() argument
[all...] |
| /linux/include/linux/ |
| H A D | maple_tree.h | 664 void mas_wr_dump(const struct ma_wr_state *wr_mas);
|
| /linux/tools/testing/radix-tree/ |
| H A D | maple.c | 35070 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 …]
|