Searched refs:mas_start (Results 1 – 2 of 2) sorted by relevance
| /linux/lib/ |
| H A D | maple_tree.c | 1930 int i = mas_start, j = mab_start; in mas_mab_cp()
3671 entry = mas_start(mas); in mas_state_walk()
4259 wr_mas.content = mas_start(mas); in mas_insert()
5059 mas_start(mas); in mas_empty_area()
5113 mas_start(mas); in mas_empty_area_rev()
5511 wr_mas.content = mas_start(mas); in mas_preallocate()
5592 mas_start(mas); in mas_destroy()
6325 entry = mas_start(&mas); in mtree_load()
6735 root = mas_start(mas); in mas_dup_build()
7536 mas_start(&mas); in mt_validate_nulls()
[all …]
|
| /linux/tools/testing/radix-tree/ |
| H A D | maple.c | 762 memcpy(&tmp, mas_start, sizeof(tmp)); in mas_ce2_over_count()
781 if (s_entry && (s_min == mas_start->index)) in mas_ce2_over_count()
785 bool ssplit = s_min != mas_start->index; in mas_ce2_over_count()
934 mas_start(mas); in mas_tree_walk()
1002 MA_STATE(mas_start, mt, set[i+1], set[i+1]); in check_erase2_testset()
1021 (mas_start.offset != mas_end.offset)) { in check_erase2_testset()
1023 mas_ce2_over_count(&mas_start, &mas_end, in check_erase2_testset()
1034 if (mas_start.offset > mt_slot_count(mas_start.node)) { in check_erase2_testset()
1044 if (s_min < mas_start.index) in check_erase2_testset()
1052 mas_ce2_over_count(&mas_start, &mas_end, in check_erase2_testset()
[all …]
|