82     for (size_t i = 0; i < n_elems; i++) {  in init_empty_tree_and_keys()  local
83         keys[i] = i;  in init_empty_tree_and_keys()
130         for (size_t i = 0; i < n_elems; i++) {  in run_benchmark()  local
133                 g_tree_insert(tree, &keys[i], &keys[i]);  in run_benchmark()
136                 q_tree_insert(tree, &keys[i], &keys[i]);  in run_benchmark()
147         for (size_t i = 0; i < n_elems; i++) {  in run_benchmark()  local
151                 value = g_tree_lookup(tree, &keys[i]);  in run_benchmark()
154                 value = q_tree_lookup(tree, &keys[i]);  in run_benchmark()
163         for (size_t i = 0; i < n_elems; i++) {  in run_benchmark()  local
166                 g_tree_insert(tree, &keys[i], &keys[i]);  in run_benchmark()
169                 q_tree_insert(tree, &keys[i], &keys[i]);  in run_benchmark()
177         for (size_t i = 0; i < n_elems; i++) {  in run_benchmark()  local
180                 g_tree_remove(tree, &keys[i]);  in run_benchmark()
183                 q_tree_remove(tree, &keys[i]);  in run_benchmark()
229     for (int i = 0; i < ARRAY_SIZE(sizes); i++) {  in main()  local
230         size_t size = sizes[i];  in main()
248                 res[k][j][i] = size / ns_per_run * 1e3;  in main()
255     for (int i = 0; i < ARRAY_SIZE(sizes); i++) {  in main()  local
256         printf("%7zu         ", sizes[i]);  in main()
260     for (int i = 0; i < ARRAY_SIZE(separator) - 1; i++) {  in main()  local
261         separator[i] = '-';  in main()
265     for (int i = 0; i < ARRAY_SIZE(benchmarks); i++) {  in main()  local
267             printf("%5s %10s ", impls[j].name, benchmarks[i].name);  in main()
269                 printf("%7.2f ", res[i][j][k]);  in main()
273                     if (res[i][0][k] != 0) {  in main()
274                         double speedup = res[i][j][k] / res[i][0][k];  in main()