Searched refs:mas_find (Results 1 - 10 of 10) sorted by relevance
/linux-master/drivers/base/regmap/ |
H A D | regcache-maple.c | 62 lower = mas_find(&mas, reg - 1); 68 upper = mas_find(&mas, reg + 1);
|
/linux-master/lib/ |
H A D | test_maple_tree.c | 426 while ((entry = mas_find(&mas, 268435456)) != NULL) { 555 entry = mas_find(&mas, 1048576); 570 entry = mas_find(&mas, ULONG_MAX); 1358 value = mas_find(&mas, ULONG_MAX); 1545 entry = mas_find(&mas, ULONG_MAX); 1576 entry = mas_find(&mas, ULONG_MAX); 1925 /* Ensure mas_find() gets the next value */ 1926 val = mas_find(&mas, ULONG_MAX); 1943 val = mas_find(&mas, ULONG_MAX); 1960 val = mas_find( [all...] |
H A D | maple_tree.c | 5942 * mas_pause() - Pause a mas_find/mas_for_each to drop the lock. 5962 * mas_find_setup() - Internal function to set up mas_find*(). 6049 * mas_find() - On the first call, find the entry at or after mas->index up to 6060 void *mas_find(struct ma_state *mas, unsigned long max) function 6073 EXPORT_SYMBOL_GPL(mas_find); variable
|
/linux-master/include/linux/ |
H A D | maple_tree.h | 501 void *mas_find(struct ma_state *mas, unsigned long max); 579 while (((__entry) = mas_find((__mas), (__max))) != NULL)
|
H A D | mm.h | 971 return mas_find(&vmi->mas, max - 1); 977 * Uses mas_find() to get the first VMA when the iterator starts. 980 return mas_find(&vmi->mas, ULONG_MAX);
|
/linux-master/mm/ |
H A D | mmap.c | 2594 vma_test = mas_find(&test, count - 1); 3254 vma = mas_find(&mas, ULONG_MAX); 3294 vma = mas_find(&mas, ULONG_MAX);
|
H A D | memory.c | 374 next = mas_find(mas, ceiling - 1); 397 next = mas_find(mas, ceiling - 1); 1886 vma = mas_find(mas, tree_end - 1);
|
/linux-master/fs/ |
H A D | libfs.c | 446 child = mas_find(&mas, LONG_MAX);
|
/linux-master/drivers/gpu/drm/nouveau/ |
H A D | nouveau_uvmm.c | 364 return mas_find(&mas, addr + range - 1);
|
/linux-master/tools/testing/radix-tree/ |
H A D | maple.c | [all...] |
Completed in 436 milliseconds