Lines Matching full:step
64 unsigned long size, unsigned long step, int order) in benchmark_insert() argument
72 for (index = 0 ; index < size ; index += step) in benchmark_insert()
80 printv(2, "Size: %8ld, step: %8ld, order: %d, insertion: %15lld ns\n", in benchmark_insert()
81 size, step, order, nsec); in benchmark_insert()
85 unsigned long size, unsigned long step, int order) in benchmark_tagging() argument
93 for (index = 0 ; index < size ; index += step) in benchmark_tagging()
101 printv(2, "Size: %8ld, step: %8ld, order: %d, tagging: %17lld ns\n", in benchmark_tagging()
102 size, step, order, nsec); in benchmark_tagging()
106 unsigned long size, unsigned long step, int order) in benchmark_delete() argument
114 for (index = 0 ; index < size ; index += step) in benchmark_delete()
123 printv(2, "Size: %8ld, step: %8ld, order: %d, deletion: %16lld ns\n", in benchmark_delete()
124 size, step, order, nsec); in benchmark_delete()
127 static void benchmark_size(unsigned long size, unsigned long step, int order) in benchmark_size() argument
132 benchmark_insert(&tree, size, step, order); in benchmark_size()
133 benchmark_tagging(&tree, size, step, order); in benchmark_size()
138 printv(2, "Size: %8ld, step: %8ld, order: %d, tagged iteration: %8lld ns\n", in benchmark_size()
139 size, step, order, tagged); in benchmark_size()
140 printv(2, "Size: %8ld, step: %8ld, order: %d, normal iteration: %8lld ns\n", in benchmark_size()
141 size, step, order, normal); in benchmark_size()
143 benchmark_delete(&tree, size, step, order); in benchmark_size()
170 static void benchmark_split(unsigned long size, unsigned long step) in benchmark_split() argument
176 for (idx = 0; idx < size; idx += step) { in benchmark_split()
184 printv(2, "Size %8ld, step %8ld, split time %10lld ns\n", in benchmark_split()
185 size, step, nsec); in benchmark_split()
216 static void benchmark_join(unsigned long step) in benchmark_join() argument
221 for (idx = 0; idx < 1 << 10; idx += step) { in benchmark_join()
229 printv(2, "Size %8d, step %8ld, join time %10lld ns\n", in benchmark_join()
230 1 << 10, step, nsec); in benchmark_join()
236 unsigned long step[] = {1, 2, 7, 15, 63, 64, 65, in benchmark() local
244 for (s = 0; step[s]; s++) in benchmark()
245 benchmark_size(size[c], step[s], 0); in benchmark()
248 for (s = 0; step[s]; s++) in benchmark()
249 benchmark_size(size[c], step[s] << 9, 9); in benchmark()
252 for (s = 0; step[s]; s++) in benchmark()
253 benchmark_split(size[c], step[s]); in benchmark()
255 for (s = 0; step[s]; s++) in benchmark()
256 benchmark_join(step[s]); in benchmark()