Home
last modified time | relevance | path

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

/linux/lib/
H A Dtest_maple_tree.c957 MT_BUG_ON(mt, mas_empty_area(&mas, min >> 12, in check_alloc_range()
2862 MT_BUG_ON(mt, mas_empty_area(&mas, 0, 100, 9) != 0); in check_empty_area_window()
2867 MT_BUG_ON(mt, mas_empty_area(&mas, 0, 100, 4) != 0); in check_empty_area_window()
2872 MT_BUG_ON(mt, mas_empty_area(&mas, 0, 100, 11) != -EBUSY); in check_empty_area_window()
2875 MT_BUG_ON(mt, mas_empty_area(&mas, 5, 100, 6) != -EBUSY); in check_empty_area_window()
2878 MT_BUG_ON(mt, mas_empty_area(&mas, 0, 8, 10) != -EINVAL); in check_empty_area_window()
2881 mas_empty_area(&mas, 100, 165, 3); in check_empty_area_window()
2884 MT_BUG_ON(mt, mas_empty_area(&mas, 100, 163, 6) != -EBUSY); in check_empty_area_window()
2902 MT_BUG_ON(mt, mas_empty_area(&mas, 0, max, size) != 0); in check_empty_area_fill()
2913 MT_BUG_ON(mt, mas_empty_area(&mas, 0, max, size) != -EBUSY); in check_empty_area_fill()
[all …]
H A Dmaple_tree.c3889 ret = mas_empty_area(mas, range_lo, range_hi, 1); in mas_alloc_cyclic()
3892 ret = mas_empty_area(mas, min, range_hi, 1); in mas_alloc_cyclic()
4593 int mas_empty_area(struct ma_state *mas, unsigned long min, in mas_empty_area() function
4637 EXPORT_SYMBOL_GPL(mas_empty_area);
5956 ret = mas_empty_area(&mas, min, max, size); in mtree_alloc_range()
/linux/Documentation/core-api/
H A Dmaple_tree.rst205 If you wish to search for a gap within a range, then mas_empty_area()
206 or mas_empty_area_rev() can be used. mas_empty_area() searches for a gap
/linux/mm/
H A Dalloc_tag.c755 if (!mas_empty_area(mas, 0, section_size - 1, prepend + size)) { in find_aligned_area()
761 if (!mas_empty_area(mas, 0, section_size - 1, in find_aligned_area()
H A Dvma.h650 return mas_empty_area(&vmi->mas, min, max - 1, size); in vma_iter_area_lowest()
/linux/include/linux/
H A Dmaple_tree.h584 int mas_empty_area(struct ma_state *mas, unsigned long min, unsigned long max,