86     void *tree;  in init_empty_tree_and_keys()  local
89         tree = g_tree_new(compare_func);  in init_empty_tree_and_keys()
92         tree = q_tree_new(compare_func);  in init_empty_tree_and_keys()
98     *ret_tree = tree;  in init_empty_tree_and_keys()
107 static inline void remove_all(void *tree, enum impl_type impl)  in remove_all()  argument
111         g_tree_destroy(tree);  in remove_all()
114         q_tree_destroy(tree);  in remove_all()
125     void *tree;  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()
191         remove_all(tree, impl);  in run_benchmark()
196             g_tree_foreach(tree, traverse_func, NULL);  in run_benchmark()
199             q_tree_foreach(tree, traverse_func, NULL);  in run_benchmark()
211         remove_all(tree, impl);  in run_benchmark()
253     printf("# Results' breakdown: Tree, Op and #Elements. Units: Mops/s\n");  in main()
254     printf("%5s %10s ", "Tree", "Op");  in main()