Home
last modified time | relevance | path

Searched refs:mas_start (Results 1 – 2 of 2) sorted by relevance

/linux-6.15/lib/
H A Dmaple_tree.c1928 int i = mas_start, j = mab_start; in mas_mab_cp()
3598 entry = mas_start(mas); in mas_state_walk()
4137 wr_mas->content = mas_start(mas); in mas_wr_prealloc_setup()
4284 wr_mas.content = mas_start(mas); in mas_insert()
5055 mas_start(mas); in mas_empty_area()
5106 mas_start(mas); in mas_empty_area_rev()
5538 mas_start(mas); in mas_destroy()
6277 entry = mas_start(&mas); in mtree_load()
6685 root = mas_start(mas); in mas_dup_build()
7503 mas_start(&mas); in mt_validate_nulls()
[all …]
/linux-6.15/tools/testing/radix-tree/
H A Dmaple.c786 memcpy(&tmp, mas_start, sizeof(tmp)); in mas_ce2_over_count()
805 if (s_entry && (s_min == mas_start->index)) in mas_ce2_over_count()
809 bool ssplit = s_min != mas_start->index; in mas_ce2_over_count()
958 mas_start(mas); in mas_tree_walk()
1026 MA_STATE(mas_start, mt, set[i+1], set[i+1]); in check_erase2_testset()
1045 (mas_start.offset != mas_end.offset)) { in check_erase2_testset()
1047 mas_ce2_over_count(&mas_start, &mas_end, in check_erase2_testset()
1058 if (mas_start.offset > mt_slot_count(mas_start.node)) { in check_erase2_testset()
1068 if (s_min < mas_start.index) in check_erase2_testset()
35371 mas_start(mas); in mas_dfs_preorder()
[all …]