Searched refs:mt_find (Results 1 - 8 of 8) sorted by relevance
/kernel/linux/linux-6.6/include/linux/ |
H A D | maple_tree.h | 689 void *mt_find(struct maple_tree *mt, unsigned long *index, unsigned long max); 706 for (__entry = mt_find(__tree, &(__index), __max); \
|
/kernel/linux/linux-6.6/arch/arm64/kvm/ |
H A D | hypercalls.c | 210 * mt_find() returns NULL if no entry was found, which just so happens in kvm_smccc_filter_get_action() 213 val = mt_find(&kvm->arch.smccc_filter, &idx, idx); in kvm_smccc_filter_get_action()
|
/kernel/linux/linux-6.6/kernel/irq/ |
H A D | irqdesc.c | 151 struct irq_desc *desc = mt_find(&sparse_irqs, &index, nr_irqs); in irq_find_at_or_after()
|
/kernel/linux/linux-6.6/mm/ |
H A D | nommu.c | 618 return mt_find(&mm->mm_mt, &index, end_addr - 1); in find_vma_intersection()
|
H A D | mmap.c | 1880 return mt_find(&mm->mm_mt, &index, end_addr - 1); in find_vma_intersection() 1897 return mt_find(&mm->mm_mt, &index, ULONG_MAX); in find_vma()
|
/kernel/linux/linux-6.6/lib/ |
H A D | maple_tree.c | 6512 * mt_find() - Search from the start up until an entry is found. 6527 void *mt_find(struct maple_tree *mt, unsigned long *index, unsigned long max) in mt_find() function 6573 EXPORT_SYMBOL(mt_find); variable 6581 * Same as mt_find() except that it checks @index for 0 before 6593 return mt_find(mt, index, max); in mt_find_after()
|
H A D | test_maple_tree.c | 508 entry = mt_find(mt, &index, 512); in check_find() 513 entry = mt_find(mt, &index, 20); in check_find()
|
/kernel/linux/linux-6.6/tools/testing/radix-tree/ |
H A D | maple.c | [all...] |
Completed in 42 milliseconds