Home
last modified time | relevance | path

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

/lib/
Dinterval_tree_test_main.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.c1007 radix_tree_gang_lookup(struct radix_tree_root *root, void **results, in radix_tree_gang_lookup() argument
1018 results[ret] = indirect_to_ptr(rcu_dereference_raw(*slot)); in radix_tree_gang_lookup()
1019 if (!results[ret]) in radix_tree_gang_lookup()
1049 void ***results, unsigned long *indices, in radix_tree_gang_lookup_slot() argument
1060 results[ret] = slot; in radix_tree_gang_lookup_slot()
1085 radix_tree_gang_lookup_tag(struct radix_tree_root *root, void **results, in radix_tree_gang_lookup_tag() argument
1097 results[ret] = indirect_to_ptr(rcu_dereference_raw(*slot)); in radix_tree_gang_lookup_tag()
1098 if (!results[ret]) in radix_tree_gang_lookup_tag()
1122 radix_tree_gang_lookup_tag_slot(struct radix_tree_root *root, void ***results, in radix_tree_gang_lookup_tag_slot() argument
1134 results[ret] = slot; in radix_tree_gang_lookup_tag_slot()
DKconfig.debug138 which results in the code/data being placed in specific sections.