Searched refs:__param (Results 1 - 5 of 5) sorted by relevance

/linux-master/lib/
H A Dinterval_tree_test.c9 #define __param(type, name, init, msg) \ macro
14 __param(int, nnodes, 100, "Number of nodes in the interval tree");
15 __param(int, perf_loops, 1000, "Number of iterations modifying the tree");
17 __param(int, nsearches, 100, "Number of searches to the interval tree");
18 __param(int, search_loops, 1000, "Number of iterations searching the tree");
19 __param(bool, search_all, false, "Searches will iterate all nodes in the tree");
21 __param(uint, max_endpoint, ~0, "Largest value for the interval's endpoint");
H A Dtest_vmalloc.c21 #define __param(type, name, init, msg) \ macro
26 __param(int, nr_threads, 0,
29 __param(bool, sequential_test_order, false,
32 __param(int, test_repeat_count, 1,
35 __param(int, test_loop_count, 1000000,
38 __param(int, nr_pages, 0,
41 __param(bool, use_huge, false,
44 __param(int, run_test_mask, INT_MAX,
H A Drbtree_test.c9 #define __param(type, name, init, msg) \ macro
14 __param(int, nnodes, 100, "Number of nodes in the rb-tree");
15 __param(int, perf_loops, 1000, "Number of iterations modifying the rb-tree");
16 __param(int, check_loops, 100, "Number of iterations modifying and verifying the rb-tree");
/linux-master/lib/reed_solomon/
H A Dtest_rslib.c27 #define __param(type, name, init, msg) \ macro
32 __param(int, v, V_PROGRESS, "Verbosity level");
33 __param(int, ewsc, 1, "Erasures without symbol corruption");
34 __param(int, bc, 1, "Test for correct behaviour beyond error correction capacity");
/linux-master/include/asm-generic/
H A Dvmlinux.lds.h527 __param : AT(ADDR(__param) - LOAD_OFFSET) { \
528 BOUNDED_SECTION_BY(__param, ___param) \

Completed in 135 milliseconds