44  * - For reports, just use a binary tree as we aggregate data, instead of having
236     /* make sure this file's path in the tree is up to date with QSP_REL_PATH */  in qsp_do_init()
523     GTree *tree = userp;  in qsp_sort()  local
525     g_tree_insert(tree, e, NULL);  in qsp_sort()
599 static void qsp_mktree(GTree *tree, bool callsite_coalesce)  in qsp_mktree()  argument
638     /* sort the hash table elements by using a tree */  in qsp_mktree()
639     qht_iter(htp, qsp_sort, tree);  in qsp_mktree()
641     /* free the hash table, but keep the elements (those are in the tree now) */  in qsp_mktree()
771     GTree *tree = g_tree_new_full(qsp_tree_cmp, &sort_by, g_free, NULL);  in qsp_report()  local
780     qsp_mktree(tree, callsite_coalesce);  in qsp_report()
781     g_tree_foreach(tree, qsp_tree_report, &rep);  in qsp_report()
782     g_tree_destroy(tree);  in qsp_report()