53 			     unsigned long size, unsigned long step)  in benchmark_insert()  argument
61 	for (index = 0 ; index < size ; index += step)  in benchmark_insert()
69 	printv(2, "Size: %8ld, step: %8ld, insertion: %15lld ns\n",  in benchmark_insert()
70 		size, step, nsec);  in benchmark_insert()
74 			     unsigned long size, unsigned long step)  in benchmark_tagging()  argument
82 	for (index = 0 ; index < size ; index += step)  in benchmark_tagging()
90 	printv(2, "Size: %8ld, step: %8ld, tagging: %17lld ns\n",  in benchmark_tagging()
91 		size, step, nsec);  in benchmark_tagging()
95 			     unsigned long size, unsigned long step)  in benchmark_delete()  argument
103 	for (index = 0 ; index < size ; index += step)  in benchmark_delete()
111 	printv(2, "Size: %8ld, step: %8ld, deletion: %16lld ns\n",  in benchmark_delete()
112 		size, step, nsec);  in benchmark_delete()
115 static void benchmark_size(unsigned long size, unsigned long step)  in benchmark_size()  argument
120 	benchmark_insert(&tree, size, step);  in benchmark_size()
121 	benchmark_tagging(&tree, size, step);  in benchmark_size()
126 	printv(2, "Size: %8ld, step: %8ld, tagged iteration: %8lld ns\n",  in benchmark_size()
127 		size, step, tagged);  in benchmark_size()
128 	printv(2, "Size: %8ld, step: %8ld, normal iteration: %8lld ns\n",  in benchmark_size()
129 		size, step, normal);  in benchmark_size()
131 	benchmark_delete(&tree, size, step);  in benchmark_size()
140 	unsigned long step[] = {1, 2, 7, 15, 63, 64, 65,  in benchmark()  local
148 		for (s = 0; step[s]; s++)  in benchmark()
149 			benchmark_size(size[c], step[s]);  in benchmark()