Home
last modified time | relevance | path

Searched refs:mas_prev (Results 1 – 7 of 7) sorted by relevance

/linux/lib/
H A Dtest_maple_tree.c571 entry = mas_prev(&mas, 0); in check_find()
583 entry2 = mas_prev(&mas, 0); in check_find()
594 entry2 = mas_prev(&mas, 0); in check_find()
598 MT_BUG_ON(mt, mas_prev(&mas, 0) != NULL); in check_find()
1395 value = mas_prev(&mas, 0); in check_prev_entry()
1412 value = mas_prev(&mas, 19); in check_prev_entry()
1419 value = mas_prev(&mas, 76); in check_prev_entry()
1575 ptr = mas_prev(&mas, 0); in check_root_expand()
1593 ptr = mas_prev(&mas, 0); in check_root_expand()
1991 while ((entry = mas_prev(&mas, 0)) != NULL) { in bench_mas_prev()
[all …]
H A Dmaple_tree.c5204 void *mas_prev(struct ma_state *mas, unsigned long min) in mas_prev() function
5213 EXPORT_SYMBOL_GPL(mas_prev);
5256 entry = mas_prev(&mas, min); in mt_prev()
/linux/Documentation/core-api/
H A Dmaple_tree.rst173 Using a maple state allows mas_next() and mas_prev() to function as if the
176 return the next entry which occurs after the entry at index. mas_prev()
/linux/include/linux/
H A Dmaple_tree.h574 void *mas_prev(struct ma_state *mas, unsigned long min);
H A Dmm.h1608 return mas_prev(&vmi->mas, 0); in vma_prev()
/linux/tools/testing/vma/include/
H A Ddup.h1379 return mas_prev(&vmi->mas, 0); in vma_prev()
/linux/tools/testing/radix-tree/
H A Dmaple.c33659 entry = mas_prev(&mas, 0); in check_erase2_sets()
34101 entry = mas_prev(&mas, test->index[index]); in rcu_reader_rev()
34834 mas_prev(&mas_reader, 0); in check_rcu_simulated()
34857 MT_BUG_ON(mt, mas_prev(&mas_reader, 0) != xa_mk_value(val)); in check_rcu_simulated()
35971 mas_prev(&mas, 0); in check_erase_rebalance()
36214 } while (mas_prev(&mas, 0) != NULL); in check_collapsing_rebalance()