Searched refs:mas_end (Results 1 – 2 of 2) sorted by relevance
| /linux-6.1.9/lib/ |
| D | maple_tree.c | 1902 unsigned char mas_end, struct maple_big_node *b_node, in mas_mab_cp() argument
1917 if (unlikely(i > mas_end)) in mas_mab_cp()
1922 piv_end = min(mas_end, mt_pivots[mt]); in mas_mab_cp()
1932 if (likely(i <= mas_end)) in mas_mab_cp()
|
| /linux-6.1.9/tools/testing/radix-tree/ |
| D | maple.c | 701 int mas_ce2_over_count(struct ma_state *mas_start, struct ma_state *mas_end, in mas_ce2_over_count() argument
714 entry = mas_next(&tmp, mas_end->last); in mas_ce2_over_count()
723 entry = mas_next(&tmp, mas_end->last); in mas_ce2_over_count()
728 if (e_entry && (e_max > mas_end->last)) in mas_ce2_over_count()
735 bool esplit = e_max > mas_end->last; in mas_ce2_over_count()
951 MA_STATE(mas_end, mt, set[i+2], set[i+2]); in check_erase2_testset()
959 e_entry = mas_range_load(&mas_end, &e_min, &e_max); in check_erase2_testset()
968 } else if ((mas_start.node != mas_end.node) || in check_erase2_testset()
969 (mas_start.offset != mas_end.offset)) { in check_erase2_testset()
971 mas_ce2_over_count(&mas_start, &mas_end, in check_erase2_testset()
[all …]
|