81     size_t *keys = g_malloc_n(n_elems, sizeof(*keys));  in init_empty_tree_and_keys()  local
83         keys[i] = i;  in init_empty_tree_and_keys()
99     *ret_keys = keys;  in init_empty_tree_and_keys()
126     size_t *keys;  in run_benchmark()  local
128     init_empty_tree_and_keys(impl, &tree, &keys, n_elems);  in run_benchmark()
133                 g_tree_insert(tree, &keys[i], &keys[i]);  in run_benchmark()
136                 q_tree_insert(tree, &keys[i], &keys[i]);  in run_benchmark()
151                 value = g_tree_lookup(tree, &keys[i]);  in run_benchmark()
154                 value = q_tree_lookup(tree, &keys[i]);  in run_benchmark()
166                 g_tree_insert(tree, &keys[i], &keys[i]);  in run_benchmark()
169                 q_tree_insert(tree, &keys[i], &keys[i]);  in run_benchmark()
180                 g_tree_remove(tree, &keys[i]);  in run_benchmark()
183                 q_tree_remove(tree, &keys[i]);  in run_benchmark()
213     g_free(keys);  in run_benchmark()