Searched refs:mas_start (Results 1 – 2 of 2) sorted by relevance
| /Linux-v6.6/lib/ |
| D | maple_tree.c | 1375 static inline struct maple_enode *mas_start(struct ma_state *mas) in mas_start() function
1942 static inline void mas_mab_cp(struct ma_state *mas, unsigned char mas_start, in mas_mab_cp() argument
1950 int i = mas_start, j = mab_start; in mas_mab_cp()
1980 memcpy(b_node->slot + mab_start, slots + mas_start, sizeof(void *) * j); in mas_mab_cp()
1983 memcpy(b_node->gap + mab_start, gaps + mas_start, in mas_mab_cp()
3705 entry = mas_start(mas); in mas_state_walk()
4250 wr_mas->content = mas_start(mas); in mas_wr_store_entry()
4299 wr_mas.content = mas_start(mas); in mas_insert()
5037 mas_start(mas); in mas_empty_area()
5089 mas_start(mas); in mas_empty_area_rev()
[all …]
|
| /Linux-v6.6/tools/testing/radix-tree/ |
| D | maple.c | 746 int mas_ce2_over_count(struct ma_state *mas_start, struct ma_state *mas_end, in mas_ce2_over_count() argument
758 memcpy(&tmp, mas_start, sizeof(tmp)); in mas_ce2_over_count()
777 if (s_entry && (s_min == mas_start->index)) in mas_ce2_over_count()
781 bool ssplit = s_min != mas_start->index; in mas_ce2_over_count()
930 mas_start(mas); in mas_tree_walk()
995 MA_STATE(mas_start, mt, set[i+1], set[i+1]); in check_erase2_testset()
1003 s_entry = mas_range_load(&mas_start, &s_min, &s_max); in check_erase2_testset()
1013 } else if ((mas_start.node != mas_end.node) || in check_erase2_testset()
1014 (mas_start.offset != mas_end.offset)) { in check_erase2_testset()
1016 mas_ce2_over_count(&mas_start, &mas_end, in check_erase2_testset()
[all …]
|
