Home
last modified time | relevance | path

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

/linux-6.15/tools/testing/radix-tree/
H A Dmaple.c787 entry = mas_next(&tmp, mas_end->last); in mas_ce2_over_count()
796 entry = mas_next(&tmp, mas_end->last); in mas_ce2_over_count()
801 if (e_entry && (e_max > mas_end->last)) in mas_ce2_over_count()
808 bool esplit = e_max > mas_end->last; in mas_ce2_over_count()
1027 MA_STATE(mas_end, mt, set[i+2], set[i+2]); in check_erase2_testset()
1035 e_entry = mas_range_load(&mas_end, &e_min, &e_max); in check_erase2_testset()
1044 } else if ((mas_start.node != mas_end.node) || 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()
1065 if (e_max > mas_end.last) in check_erase2_testset()
[all …]
/linux-6.15/lib/
H A Dmaple_tree.c1921 unsigned char mas_end, struct maple_big_node *b_node, in mas_mab_cp() argument
1936 if (unlikely(i > mas_end)) in mas_mab_cp()
1941 piv_end = min(mas_end, mt_pivots[mt]); in mas_mab_cp()