mergesort
int mergesort(void *, size_t, size_t, int (*)(const void *, const void *));
PROTO_DEPRECATED(mergesort);
mergesort(blacklists[idx].v4.addrs, nv4,
mergesort(blacklists[idx].v6.addrs, nv6,
if (mergesort(z, n, es, d->cmp) != 0) \
if (mergesort(z, n, es, d->cmp) != 0) \
if (mergesort(z, n, es, d->cmp) != 0) \
if (mergesort(z, n, es, d->cmp) != 0) \
if (mergesort(x, n, es, d->cmp) != 0) \
if (mergesort(z, n, es, d->cmp) != 0) \
if (mergesort(z, n, sizeof(z[0]), d->cmp) != 0) \
if (mergesort((void *)spp, npartitions, sizeof(spp[0]),
if (mergesort(sgp, i, sizeof(sgp[0]), gp_lba_start_cmp) == -1) {
if (mergesort(learning, ASR_MAXNS, sizeof(learning[0]), cmp) == -1) {
return mergesort(dst->types, dst->len, sizeof(dst->types[0]),
mergesort(list->list, list->count,
if (mergesort(sl->leaves, sl->leaves_num,
mergesort(sl->leaves, sl->leaves_num,
mergesort(sl->leaves, sl->leaves_num,
#define DEFAULT_SORT_FUNC_RADIXSORT mergesort
mergesort(types, num_types, sizeof(struct type_info), ordering->func);
mergesort(state_ord, num_states, sizeof(size_t), ordering->func);
mergesort(pools, num_pools, sizeof(struct pool_info), ordering->func);
mergesort(pool_caches, num_pool_caches, sizeof(*pool_caches), ordering->func);