Searched refs:mas_prev (Results 1 – 7 of 7) sorted by relevance
/linux/lib/ |
H A D | test_maple_tree.c | 571 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() 1360 value = mas_prev(&mas, 0); in check_prev_entry() 1377 value = mas_prev(&mas, 19); in check_prev_entry() 1384 value = mas_prev(&mas, 76); in check_prev_entry() 1540 ptr = mas_prev(&mas, 0); in check_gap_combining() 1558 ptr = mas_prev(&mas, 0); in check_gap_combining() 1932 while ((entry = mas_prev( in check_iteration() [all...] |
H A D | maple_tree.c | 5873 void *mas_prev(struct ma_state *mas, unsigned long min) in mas_prev() function 5882 EXPORT_SYMBOL_GPL(mas_prev); 5925 entry = mas_prev(&mas, min); in mt_prev()
|
/linux/Documentation/core-api/ |
H A D | maple_tree.rst | 173 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/mm/ |
H A D | vma.h | 273 return mas_prev(&vmi->mas, min);
|
/linux/tools/testing/vma/ |
H A D | vma_internal.h | 566 return mas_prev(&vmi->mas, 0); in vma_is_anonymous()
|
/linux/include/linux/ |
H A D | mm.h | 1032 return mas_prev(&vmi->mas, 0); in vma_prev()
|
/linux/tools/testing/radix-tree/ |
H A D | maple.c | 34088 entry = mas_prev(&mas, 0); in check_erase2_sets() 34510 entry = mas_prev(&mas, test->index[index]); in rcu_reader_rev() 35233 mas_prev(&mas_reader, 0); in check_rcu_simulated() 35256 MT_BUG_ON(mt, mas_prev(&mas_reader, 0) != xa_mk_value(val)); in check_rcu_simulated() 36359 } while (mas_prev(&mas, 0) != NULL); in check_bulk_rebalance()
|