Searched refs:mas_prev (Results 1 – 7 of 7) sorted by relevance
/openbmc/linux/lib/ |
H A D | test_maple_tree.c | 565 entry = mas_prev(&mas, 0); in check_find() 1448 ptr = mas_prev(&mas, 0); in check_root_expand() 1466 ptr = mas_prev(&mas, 0); in check_root_expand() 2090 val = mas_prev(&mas, 0); in next_prev_test() 2117 val = mas_prev(&mas, 70); in next_prev_test() 2139 val = mas_prev(&mas, 0); in next_prev_test() 2156 val = mas_prev(&mas, 0); in next_prev_test() 2169 val = mas_prev(&mas, 0); in next_prev_test() 2174 val = mas_prev(&mas, 0); in next_prev_test() 2187 val = mas_prev(&mas, 0); in next_prev_test() [all …]
|
H A D | maple_tree.c | 5838 void *mas_prev(struct ma_state *mas, unsigned long min) in mas_prev() function 5847 EXPORT_SYMBOL_GPL(mas_prev); 5890 entry = mas_prev(&mas, min); in mt_prev()
|
/openbmc/linux/mm/ |
H A D | mmap.c | 153 return mas_prev(&vmi->mas, min); in vma_prev_limit() 1125 prev = mas_prev(&mas, 0); in find_mergeable_anon_vma() 1127 prev = mas_prev(&mas, 0); in find_mergeable_anon_vma() 1601 tmp = mas_prev(&mas, 0); in unmapped_area() 1653 tmp = mas_prev(&mas, 0); in unmapped_area_topdown() 1909 *pprev = mas_prev(&mas, 0); in find_vma_prev() 2074 prev = mas_prev(&mas, 0); in expand_downwards()
|
/openbmc/linux/Documentation/core-api/ |
H A D | maple_tree.rst | 169 Using a maple state allows mas_next() and mas_prev() to function as if the 172 return the next entry which occurs after the entry at index. mas_prev()
|
/openbmc/linux/include/linux/ |
H A D | maple_tree.h | 480 void *mas_prev(struct ma_state *mas, unsigned long min);
|
H A D | mm.h | 968 return mas_prev(&vmi->mas, 0); in vma_prev()
|
/openbmc/linux/tools/testing/radix-tree/ |
H A D | maple.c | 34057 entry = mas_prev(&mas, 0); in check_erase2_sets() 34479 entry = mas_prev(&mas, test->index[index]); in rcu_reader_rev() 35202 mas_prev(&mas_reader, 0); in check_rcu_simulated() 35225 MT_BUG_ON(mt, mas_prev(&mas_reader, 0) != xa_mk_value(val)); in check_rcu_simulated()
|