Home
last modified time | relevance | path

Searched refs:mt_find (Results 1 – 10 of 10) sorted by relevance

/linux/include/linux/
H A Dmaple_tree.h876 void *mt_find(struct maple_tree *mt, unsigned long *index, unsigned long max);
893 for (__entry = mt_find(__tree, &(__index), __max); \
/linux/Documentation/core-api/
H A Dmaple_tree.rst72 You can search for an entry from an index upwards by using mt_find().
107 * mt_find()
/linux/arch/arm64/kvm/
H A Dhypercalls.c222 * mt_find() returns NULL if no entry was found, which just so happens in kvm_smccc_filter_get_action()
225 val = mt_find(&kvm->arch.smccc_filter, &idx, idx); in kvm_smccc_filter_get_action()
/linux/mm/
H A Dmmap.c892 return mt_find(&mm->mm_mt, &index, end_addr - 1); in find_vma_intersection()
909 return mt_find(&mm->mm_mt, &index, ULONG_MAX); in find_vma()
H A Dnommu.c631 return mt_find(&mm->mm_mt, &index, end_addr - 1); in find_vma_intersection()
/linux/kernel/irq/
H A Dirqdesc.c189 desc = mt_find(&sparse_irqs, &index, nr_irqs); in irq_find_at_or_after()
/linux/tools/testing/vma/
H A Dvma_internal.h767 return mt_find(&mm->mm_mt, &index, end_addr - 1); in find_vma_intersection()
/linux/lib/
H A Dmaple_tree.c6903 * mt_find() - Search from the start up until an entry is found.
6918 void *mt_find(struct maple_tree *mt, unsigned long *index, unsigned long max) in mt_find() function
6964 EXPORT_SYMBOL(mt_find);
6972 * Same as mt_find() except that it checks @index for 0 before
6984 return mt_find(mt, index, max); in mt_find_after()
H A Dtest_maple_tree.c514 entry = mt_find(mt, &index, 512); in check_find()
519 entry = mt_find(mt, &index, 20); in check_find()
/linux/tools/testing/radix-tree/
H A Dmaple.c[all...]