Searched refs:mt_find (Results 1 – 7 of 7) sorted by relevance
/linux-6.1.9/include/linux/ |
D | maple_tree.h | 647 void *mt_find(struct maple_tree *mt, unsigned long *index, unsigned long max); 663 for (__entry = mt_find(__tree, &(__index), __max); \
|
/linux-6.1.9/Documentation/core-api/ |
D | maple_tree.rst | 72 You can search for an entry from an index upwards by using mt_find(). 104 * mt_find()
|
/linux-6.1.9/lib/ |
D | test_maple_tree.c | 484 entry = mt_find(mt, &index, 512); in check_find() 489 entry = mt_find(mt, &index, 20); in check_find()
|
D | maple_tree.c | 6422 void *mt_find(struct maple_tree *mt, unsigned long *index, unsigned long max) in mt_find() function 6469 EXPORT_SYMBOL(mt_find); 6487 return mt_find(mt, index, max); in mt_find_after()
|
/linux-6.1.9/mm/ |
D | nommu.c | 668 return mt_find(&mm->mm_mt, &index, end_addr - 1); in find_vma_intersection()
|
D | mmap.c | 1818 return mt_find(&mm->mm_mt, &index, end_addr - 1); in find_vma_intersection() 1835 return mt_find(&mm->mm_mt, &index, ULONG_MAX); in find_vma()
|
/linux-6.1.9/tools/testing/radix-tree/ |
D | maple.c | 33861 MT_BUG_ON(mt, !!mt_find(mt, &start, 140735933906943UL)); in check_erase2_sets()
|