Searched refs:mas_start (Results 1 – 2 of 2) sorted by relevance
| /linux/lib/ |
| H A D | maple_tree.c | 1239 static inline struct maple_enode *mas_start(struct ma_state *mas) in mas_start() function
3006 entry = mas_start(mas); in mas_state_walk()
3668 wr_mas->content = mas_start(mas); in mas_wr_prealloc_setup()
3835 wr_mas.content = mas_start(mas); in mas_insert()
4608 mas_start(mas); in mas_empty_area()
4659 mas_start(mas); in mas_empty_area_rev()
5811 entry = mas_start(&mas); in mtree_load()
6231 root = mas_start(mas); in mas_dup_build()
7051 mas_start(&mas); in mt_validate_nulls()
7092 mas_start(&mas); in mt_validate()
|
| /linux/tools/testing/radix-tree/ |
| H A D | maple.c | 345 int mas_ce2_over_count(struct ma_state *mas_start, struct ma_state *mas_end, in mas_ce2_over_count() argument
357 memcpy(&tmp, mas_start, sizeof(tmp)); in mas_ce2_over_count()
376 if (s_entry && (s_min == mas_start->index)) in mas_ce2_over_count()
380 bool ssplit = s_min != mas_start->index; in mas_ce2_over_count()
529 mas_start(mas); in mas_tree_walk()
597 MA_STATE(mas_start, mt, set[i+1], set[i+1]); in check_erase2_testset()
605 s_entry = mas_range_load(&mas_start, &s_min, &s_max); in check_erase2_testset()
615 } else if ((mas_start.node != mas_end.node) || in check_erase2_testset()
616 (mas_start.offset != mas_end.offset)) { in check_erase2_testset()
618 mas_ce2_over_count(&mas_start, &mas_end, in check_erase2_testset()
[all …]
|