1 // SPDX-License-Identifier: GPL-2.0
34 		for (j = i - 1; j > 0 && i > 0; j--) {  in gen_test_ips()
36 				i--; /* collision */  in gen_test_ips()
52 		if (err && err != -EEXIST)  in test_add_routes()
64 		if (test_add_key(lsk, DEFAULT_TEST_PASSWORD, *p, -1, 100, 100))  in server_apply_keys()
106 	nsec = (end.tv_sec - start.tv_sec) * NSEC_PER_SEC;  in measure_call()
108 		nsec += end.tv_nsec - start.tv_nsec;  in measure_call()
110 		nsec -= start.tv_nsec - end.tv_nsec;  in measure_call()
112 	if (st->nr == 0) {  in measure_call()
113 		st->min = st->max = nsec;  in measure_call()
115 		if (st->min > nsec)  in measure_call()
116 			st->min = nsec;  in measure_call()
117 		if (st->max < nsec)  in measure_call()
118 			st->max = nsec;  in measure_call()
121 	/* Welford-Knuth algorithm */  in measure_call()
122 	st->nr++;  in measure_call()
123 	delta = (double)nsec - st->mean;  in measure_call()
124 	st->mean += delta / st->nr;  in measure_call()
125 	st->s2 += delta * ((double)nsec - st->mean);  in measure_call()
140 	if (test_add_key(sk, DEFAULT_TEST_PASSWORD, *p, -1, 100, 100))  in add_back_mkt()
147 			 bool rand_order, bool async)  in bench_delete()  argument
155 	ao_del.del_async = !!async;  in bench_delete()
156 	ao_del.prefix = DEFAULT_TEST_PREFIX;  in bench_delete()
169 		 * Slowest for FILO-linked-list:  in bench_delete()
171 		 * added to the list back - it becomes first to fetch, so  in bench_delete()
204 	test_ok("%-20s\t%zu keys: min=%" PRIu64 "ms max=%" PRIu64 "ms mean=%gms stddev=%g",  in test_print_stats()
205 		desc, nr, bs->min / 1000000, bs->max / 1000000,  in test_print_stats()
206 		bs->mean / 1000000, sqrt((bs->mean / 1000000) / bs->nr));  in test_print_stats()
232 		/* The worst case for FILO-list */  in server_fn()
233 		bench_delete(lsk, &bt->add_key, &bt->delete_last_key,  in server_fn()
236 				nr_keys[i], &bt->add_key);  in server_fn()
238 				nr_keys[i], &bt->delete_last_key);  in server_fn()
240 		bench_delete(lsk, &bt->add_key, &bt->delete_rand_key,  in server_fn()
242 		test_print_stats("Delete: random-search",  in server_fn()
243 				nr_keys[i], &bt->delete_rand_key);  in server_fn()
245 		bench_delete(lsk, &bt->add_key, &bt->delete_async,  in server_fn()
247 		test_print_stats("Delete: async", nr_keys[i], &bt->delete_async);  in server_fn()
282 	if (ret && ret != -EEXIST)  in client_addr_setup()
285 	if (ret && ret != -EEXIST)  in client_addr_setup()
300 		con = &bt->connect_rand_key;  in bench_connect_client()
302 		con = &bt->connect_last_key;  in bench_connect_client()
314 				 -1, 100, 100))  in bench_connect_client()
324 		 * Slowest for FILO-linked-list:  in bench_connect_client()
326 		 * added to the list back - it becomes first to fetch, so  in bench_connect_client()
346 				nr_keys[i], &bt->connect_last_key);  in client_fn()
349 		test_print_stats("Connect: random-search",  in client_fn()
350 				nr_keys[i], &bt->connect_last_key);  in client_fn()