solv_sort
solv_sort(q->str, q->nstr, sizeof(*q->str), strqueue_sort_cmp, 0);
solv_sort(plist->elements, plist->count, sizeof(Id), prune_to_best_version_sortcmp, pool);
solv_sort(plist->elements, plist->count, sizeof(Id), prune_to_best_version_sortcmp, pool);
solv_sort(sorted, n, sizeof(Id), pool_shrink_whatprovides_sortcmp, pool);
solv_sort(problem.elements, problem.count, sizeof(Id), problems_sortcmp, &solv->job);
solv_sort(a, r / es, es, cmp, thunk);
solv_sort(needid + 1, spool->nstrings - 1, sizeof(*needid), needid_cmp_need_s, spool);
solv_sort(needid + 2, spool->nstrings - 2, sizeof(*needid), needid_cmp_need_s, spool);
solv_sort(needid + reloff, pool->nrels, sizeof(*needid), needid_cmp_need, 0);
solv_sort(sids, i, sizeof(Id), cmp_ids, 0);
solv_sort(sids + i + 1, len - i - 1, sizeof(Id), cmp_ids, 0);
solv_sort(sids, i, sizeof(Id), cmp_ids, 0);
solv_sort(sids + i + 1, len - i - 1, sizeof(Id), cmp_ids, 0);
solv_sort(solv->rules + 1, solv->nrules - 1, sizeof(Rule), unifyrules_sortcmp, solv->pool);
solv_sort(rq->elements, rq->count / 4, 4 * sizeof(Id), solver_allruleinfos_cmp, 0);
solv_sort(pkgs->elements, pkgs->count, sizeof(Id), selection_solvables_sortcmp, NULL);
solv_sort(update_targets->elements, update_targets->count >> 1, 2 * sizeof(Id), transform_update_targets_sortfn, solv);
solv_sort(classes->elements, classes->count / 4, 4 * sizeof(Id), classify_cmp, trans);
solv_sort(pkgs->elements, pkgs->count, sizeof(Id), classify_cmp_pkgs, trans);
solv_sort(ti->elements, ti->count / 2, 2 * sizeof(Id), obsq_sortcmp, pool);
solv_sort(pkgs->elements, pkgs->count / 2, 2 * sizeof(Id), obsq_sortcmp, pool);
extern void solv_sort(void *base, size_t nmemb, size_t size, int (*compar)(const void *, const void *, void *), void *compard);