Home
last modified time | relevance | path

Searched refs:results (Results 1 – 4 of 4) sorted by relevance

/lib/
Dinterval_tree_test.c21 unsigned long results = 0; in search() local
25 results++; in search()
26 return results; in search()
50 unsigned long results; in interval_tree_test_init() local
80 results = 0; in interval_tree_test_init()
83 results += search(queries[j], &root); in interval_tree_test_init()
89 results = div_u64(results, SEARCH_LOOPS); in interval_tree_test_init()
91 (unsigned long long)time, results); in interval_tree_test_init()
Dradix-tree.c1006 radix_tree_gang_lookup(struct radix_tree_root *root, void **results, in radix_tree_gang_lookup() argument
1017 results[ret] = rcu_dereference_raw(*slot); in radix_tree_gang_lookup()
1018 if (!results[ret]) in radix_tree_gang_lookup()
1020 if (radix_tree_is_indirect_ptr(results[ret])) { in radix_tree_gang_lookup()
1052 void ***results, unsigned long *indices, in radix_tree_gang_lookup_slot() argument
1063 results[ret] = slot; in radix_tree_gang_lookup_slot()
1088 radix_tree_gang_lookup_tag(struct radix_tree_root *root, void **results, in radix_tree_gang_lookup_tag() argument
1100 results[ret] = rcu_dereference_raw(*slot); in radix_tree_gang_lookup_tag()
1101 if (!results[ret]) in radix_tree_gang_lookup_tag()
1103 if (radix_tree_is_indirect_ptr(results[ret])) { in radix_tree_gang_lookup_tag()
[all …]
Ddma-debug.c564 void **results = (void **) &ents; in debug_dma_assert_idle() local
574 nents = radix_tree_gang_lookup(&dma_active_cacheline, results, cln, in debug_dma_assert_idle()
DKconfig.debug266 which results in the code/data being placed in specific sections.