Home
last modified time | relevance | path

Searched refs:rnd (Results 1 – 5 of 5) sorted by relevance

/lib/
Dinterval_tree_test.c27 static struct rnd_state rnd; variable
46 u32 b = (prandom_u32_state(&rnd) >> 4) % max_endpoint; in init()
47 u32 a = (prandom_u32_state(&rnd) >> 4) % b; in init()
59 queries[i] = (prandom_u32_state(&rnd) >> 4) % max_endpoint; in init()
81 prandom_seed_state(&rnd, 3141592653589793238ULL); in interval_tree_test_init()
Dtest_vmalloc.c77 unsigned long size, align, rnd; in random_size_align_alloc_test() local
82 get_random_bytes(&rnd, sizeof(rnd)); in random_size_align_alloc_test()
87 align = 1 << (rnd % 23); in random_size_align_alloc_test()
92 size = ((rnd % 10) + 1) * PAGE_SIZE; in random_size_align_alloc_test()
367 unsigned int rnd; in shuffle_array() local
371 get_random_bytes(&rnd, sizeof(rnd)); in shuffle_array()
374 j = rnd % i; in shuffle_array()
Dtest_parman.c83 struct rnd_state rnd; member
134 prandom_seed_state(&test_parman->rnd, 3141592653589793238ULL); in test_parman_rnd_init()
139 return prandom_u32_state(&test_parman->rnd); in test_parman_rnd_get()
Drbtree_test.c30 static struct rnd_state rnd; variable
153 nodes[i].key = prandom_u32_state(&rnd); in init()
154 nodes[i].val = prandom_u32_state(&rnd); in init()
254 prandom_seed_state(&rnd, 3141592653589793238ULL); in rbtree_test_init()
Dtest_bpf.c130 struct rnd_state rnd; in bpf_fill_maxinsns3() local
137 prandom_seed_state(&rnd, 3141592653589793238ULL); in bpf_fill_maxinsns3()
140 __u32 k = prandom_u32_state(&rnd); in bpf_fill_maxinsns3()