Home
last modified time | relevance | path

Searched refs:mas_next (Results 1 – 6 of 6) sorted by relevance

/openbmc/linux/lib/
H A Dtest_maple_tree.c1330 entry = mas_next(&mas, limit); in check_next_entry()
1443 ptr = mas_next(&mas, ULONG_MAX); in check_root_expand()
1461 ptr = mas_next(&mas, ULONG_MAX); in check_root_expand()
1542 mas_next(&mas, ULONG_MAX); in check_gap_combining()
2055 mas_next(&mas, 1000); in next_prev_test()
2085 val = mas_next(&mas, 1000); in next_prev_test()
2095 val = mas_next(&mas, 1000); in next_prev_test()
2100 val = mas_next(&mas, 1000); in next_prev_test()
2112 val = mas_next(&mas, 1000); in next_prev_test()
2127 val = mas_next(&mas, level2[1]); in next_prev_test()
[all …]
H A Dmaple_tree.c5714 void *mas_next(struct ma_state *mas, unsigned long max) in mas_next() function
5724 EXPORT_SYMBOL_GPL(mas_next);
5767 entry = mas_next(&mas, max); in mt_next()
/openbmc/linux/Documentation/core-api/
H A Dmaple_tree.rst169 Using a maple state allows mas_next() and mas_prev() to function as if the
171 performance penalty is outweighed by cache optimization. mas_next() will
/openbmc/linux/include/linux/
H A Dmaple_tree.h482 void *mas_next(struct ma_state *mas, unsigned long max);
/openbmc/linux/mm/
H A Dmmap.c1593 tmp = mas_next(&mas, ULONG_MAX); in unmapped_area()
1645 tmp = mas_next(&mas, ULONG_MAX); in unmapped_area_topdown()
1911 vma = mas_next(&mas, ULONG_MAX); in find_vma_prev()
2552 vma_test = mas_next(&test, count - 1); in do_vmi_align_munmap()
/openbmc/linux/tools/testing/radix-tree/
H A Dmaple.c759 entry = mas_next(&tmp, mas_end->last); in mas_ce2_over_count()
768 entry = mas_next(&tmp, mas_end->last); in mas_ce2_over_count()
35206 MT_BUG_ON(mt, mas_next(&mas_reader, ULONG_MAX) != xa_mk_value(val)); in check_rcu_simulated()
35221 mas_next(&mas_reader, ULONG_MAX); in check_rcu_simulated()