Searched refs:results (Results 1 – 3 of 3) sorted by relevance
| /lib/ |
| D | interval_tree_test.c | 33 unsigned long results = 0; in search() local
37 results++; in search()
38 return results; in search()
65 unsigned long results; in interval_tree_test_init() local
106 results = 0; in interval_tree_test_init()
112 results += search(&root, start, last); in interval_tree_test_init()
119 results = div_u64(results, search_loops); in interval_tree_test_init()
121 (unsigned long long)time, results); in interval_tree_test_init()
|
| D | radix-tree.c | 1271 radix_tree_gang_lookup(const struct radix_tree_root *root, void **results, in radix_tree_gang_lookup() argument
1282 results[ret] = rcu_dereference_raw(*slot); in radix_tree_gang_lookup()
1283 if (!results[ret]) in radix_tree_gang_lookup()
1285 if (radix_tree_is_internal_node(results[ret])) { in radix_tree_gang_lookup()
1311 radix_tree_gang_lookup_tag(const struct radix_tree_root *root, void **results, in radix_tree_gang_lookup_tag() argument
1323 results[ret] = rcu_dereference_raw(*slot); in radix_tree_gang_lookup_tag()
1324 if (!results[ret]) in radix_tree_gang_lookup_tag()
1326 if (radix_tree_is_internal_node(results[ret])) { in radix_tree_gang_lookup_tag()
1353 void __rcu ***results, unsigned long first_index, in radix_tree_gang_lookup_tag_slot() argument
1364 results[ret] = slot; in radix_tree_gang_lookup_tag_slot()
|
| D | Kconfig.debug | 335 which results in the code/data being placed in specific sections.
|