lib: Replace qsort() with g_qsort_with_data()

While glibc provides qsort(), which usually is just a mergesort,
until sorting arrays so huge that temporary array used by
mergesort would not fit into physical memory (which in our case
is never), we are not guaranteed it'll use mergesort. The
advantage of mergesort is clear - it's stable. IOW, if we have an
array of values parsed from XML, qsort() it and produce some
output based on those values, we can then compare the output with
some expected output, line by line.

But with newer glibc this is all history. After [1], qsort() is
no longer mergesort but introsort instead, which is not stable.
This is suboptimal, because in some cases we want to preserve
order of equal items. For instance, in ebiptablesApplyNewRules(),
nwfilter rules are sorted by their priority. But if two rules
have the same priority, we want to keep them in the order they
appear in the XML. Since it's hard/needless work to identify
places where stable or unstable sorting is needed, let's just
play it safe and use stable sorting everywhere.

Fortunately, glib provides g_qsort_with_data() which indeed
implement mergesort and it's a drop in replacement for qsort(),
almost. It accepts fifth argument (pointer to opaque data), that
is passed to comparator function, which then accepts three
arguments.

We have to keep one occurance of qsort() though - in NSS module
which deliberately does not link with glib.

1: https://sourceware.org/git/?p=glibc.git;a=commitdiff;h=03bf8357e8291857a435afcc3048e0b697b6cc04
Signed-off-by: Michal Privoznik <mprivozn@redhat.com>
Reviewed-by: Martin Kletzander <mkletzan@redhat.com>
This commit is contained in:
Michal Privoznik 2023-11-22 14:58:49 +01:00
parent 97457cdf65
commit cfcbba4c2b
30 changed files with 196 additions and 111 deletions

View File

@ -20,11 +20,10 @@
# nm -D --defined-only --without-symbol-versions /lib64/libc.so.6 \ # nm -D --defined-only --without-symbol-versions /lib64/libc.so.6 \
# | grep '_r$' \ # | grep '_r$' \
# | awk '{print $3}' \ # | awk '{print $3}' \
# | grep -v -e '^_' -e 'qsort' -e 'readdir' \ # | grep -v -e '^_' -e 'readdir' \
# | sort -u \ # | sort -u \
# | sed -s 's/_r$//' # | sed -s 's/_r$//'
# #
# qsort() is safe because we don't need to pass extra args to qsort comparator,
# readdir*() is safe as long as each DIR * instance is only used by one thread. # readdir*() is safe as long as each DIR * instance is only used by one thread.
# #
# Also manually add in all inet_* functions some of which # Also manually add in all inet_* functions some of which

View File

@ -380,7 +380,7 @@ sc_prohibit_unsigned_pid:
# Many of the function names below came from this filter: # Many of the function names below came from this filter:
# git grep -B2 '\<_('|grep -E '\.c- *[[:alpha:]_][[:alnum:]_]* ?\(.*[,;]$' \ # git grep -B2 '\<_('|grep -E '\.c- *[[:alpha:]_][[:alnum:]_]* ?\(.*[,;]$' \
# |sed 's/.*\.c- *//'|perl -pe 's/ ?\(.*//'|sort -u \ # |sed 's/.*\.c- *//'|perl -pe 's/ ?\(.*//'|sort -u \
# |grep -vE '^(qsort|if|close|assert|fputc|free|N_|vir.*GetName|.*Unlock|virNodeListDevices|virHashRemoveEntry|freeaddrinfo|.*[fF]ree|xdrmem_create|xmlXPathFreeObject|virUUIDFormat|openvzSetProgramSentinal|polkit_action_unref)$' # |grep -vE '^(if|close|assert|fputc|free|N_|vir.*GetName|.*Unlock|virNodeListDevices|virHashRemoveEntry|freeaddrinfo|.*[fF]ree|xdrmem_create|xmlXPathFreeObject|virUUIDFormat|openvzSetProgramSentinal|polkit_action_unref)$'
msg_gen_function = msg_gen_function =
msg_gen_function += VIR_ERROR msg_gen_function += VIR_ERROR

View File

@ -2073,7 +2073,8 @@ virCapsHostCacheBankFree(virCapsHostCacheBank *ptr)
static int static int
virCapsHostCacheBankSorter(const void *a, virCapsHostCacheBankSorter(const void *a,
const void *b) const void *b,
void *opaque G_GNUC_UNUSED)
{ {
virCapsHostCacheBank *ca = *(virCapsHostCacheBank **)a; virCapsHostCacheBank *ca = *(virCapsHostCacheBank **)a;
virCapsHostCacheBank *cb = *(virCapsHostCacheBank **)b; virCapsHostCacheBank *cb = *(virCapsHostCacheBank **)b;
@ -2273,8 +2274,9 @@ virCapabilitiesInitCaches(virCaps *caps)
* still traverse the directory instead of guessing names (in case there is * still traverse the directory instead of guessing names (in case there is
* 'index1' and 'index3' but no 'index2'). */ * 'index1' and 'index3' but no 'index2'). */
if (caps->host.cache.banks) { if (caps->host.cache.banks) {
qsort(caps->host.cache.banks, caps->host.cache.nbanks, g_qsort_with_data(caps->host.cache.banks, caps->host.cache.nbanks,
sizeof(*caps->host.cache.banks), virCapsHostCacheBankSorter); sizeof(*caps->host.cache.banks),
virCapsHostCacheBankSorter, NULL);
} }
if (virCapabilitiesInitResctrlMemory(caps) < 0) if (virCapabilitiesInitResctrlMemory(caps) < 0)

View File

@ -15703,7 +15703,9 @@ virDomainDefParseBootXML(xmlXPathContextPtr ctxt,
} }
static int virDomainIdMapEntrySort(const void *a, const void *b) static int virDomainIdMapEntrySort(const void *a,
const void *b,
void *opaque G_GNUC_UNUSED)
{ {
const virDomainIdMapEntry *entrya = a; const virDomainIdMapEntry *entrya = a;
const virDomainIdMapEntry *entryb = b; const virDomainIdMapEntry *entryb = b;
@ -15746,7 +15748,7 @@ virDomainIdmapDefParseXML(xmlXPathContextPtr ctxt,
} }
} }
qsort(idmap, num, sizeof(idmap[0]), virDomainIdMapEntrySort); g_qsort_with_data(idmap, num, sizeof(idmap[0]), virDomainIdMapEntrySort, NULL);
return idmap; return idmap;
} }

View File

@ -1045,7 +1045,8 @@ virCPUConvertLegacy(virArch arch,
static int static int
virCPUFeatureCompare(const void *p1, virCPUFeatureCompare(const void *p1,
const void *p2) const void *p2,
void *opaque G_GNUC_UNUSED)
{ {
const virCPUFeatureDef *f1 = p1; const virCPUFeatureDef *f1 = p1;
const virCPUFeatureDef *f2 = p2; const virCPUFeatureDef *f2 = p2;
@ -1085,8 +1086,8 @@ virCPUExpandFeatures(virArch arch,
driver->expandFeatures(cpu) < 0) driver->expandFeatures(cpu) < 0)
return -1; return -1;
qsort(cpu->features, cpu->nfeatures, sizeof(*cpu->features), g_qsort_with_data(cpu->features, cpu->nfeatures, sizeof(*cpu->features),
virCPUFeatureCompare); virCPUFeatureCompare, NULL);
VIR_DEBUG("nfeatures=%zu", cpu->nfeatures); VIR_DEBUG("nfeatures=%zu", cpu->nfeatures);
return 0; return 0;

View File

@ -393,7 +393,9 @@ x86FeatureFindInternal(const char *name)
static int static int
virCPUx86DataSorter(const void *a, const void *b) virCPUx86DataSorter(const void *a,
const void *b,
void *opaque G_GNUC_UNUSED)
{ {
virCPUx86DataItem *da = (virCPUx86DataItem *) a; virCPUx86DataItem *da = (virCPUx86DataItem *) a;
virCPUx86DataItem *db = (virCPUx86DataItem *) b; virCPUx86DataItem *db = (virCPUx86DataItem *) b;
@ -437,7 +439,7 @@ static int
virCPUx86DataItemCmp(const virCPUx86DataItem *item1, virCPUx86DataItemCmp(const virCPUx86DataItem *item1,
const virCPUx86DataItem *item2) const virCPUx86DataItem *item2)
{ {
return virCPUx86DataSorter(item1, item2); return virCPUx86DataSorter(item1, item2, NULL);
} }
@ -541,8 +543,9 @@ virCPUx86DataAddItem(virCPUx86Data *data,
VIR_APPEND_ELEMENT_COPY(data->items, data->len, VIR_APPEND_ELEMENT_COPY(data->items, data->len,
*((virCPUx86DataItem *)item)); *((virCPUx86DataItem *)item));
qsort(data->items, data->len, g_qsort_with_data(data->items, data->len,
sizeof(virCPUx86DataItem), virCPUx86DataSorter); sizeof(virCPUx86DataItem),
virCPUx86DataSorter, NULL);
} }
return 0; return 0;
@ -3465,8 +3468,8 @@ virCPUx86DataGetHost(void)
} }
/* the rest of the code expects the function to be in order */ /* the rest of the code expects the function to be in order */
qsort(cpuid->data.x86.items, cpuid->data.x86.len, g_qsort_with_data(cpuid->data.x86.items, cpuid->data.x86.len,
sizeof(virCPUx86DataItem), virCPUx86DataSorter); sizeof(virCPUx86DataItem), virCPUx86DataSorter, NULL);
return cpuid; return cpuid;
} }

View File

@ -791,7 +791,8 @@ static int lxcContainerSetReadOnly(void)
if (!mounts) if (!mounts)
return 0; return 0;
qsort(mounts, nmounts, sizeof(mounts[0]), virStringSortRevCompare); g_qsort_with_data(mounts, nmounts,
sizeof(mounts[0]), virStringSortRevCompare, NULL);
/* turn 'mounts' into a proper GStrv */ /* turn 'mounts' into a proper GStrv */
VIR_EXPAND_N(mounts, nmounts, 1); VIR_EXPAND_N(mounts, nmounts, 1);

View File

@ -3087,7 +3087,9 @@ virNWFilterRuleInstSort(const void *a, const void *b)
static int static int
virNWFilterRuleInstSortPtr(const void *a, const void *b) virNWFilterRuleInstSortPtr(const void *a,
const void *b,
void *opaque G_GNUC_UNUSED)
{ {
virNWFilterRuleInst * const *insta = a; virNWFilterRuleInst * const *insta = a;
virNWFilterRuleInst * const *instb = b; virNWFilterRuleInst * const *instb = b;
@ -3097,7 +3099,8 @@ virNWFilterRuleInstSortPtr(const void *a, const void *b)
static int static int
ebiptablesFilterOrderSort(const void *va, ebiptablesFilterOrderSort(const void *va,
const void *vb) const void *vb,
void *opaque G_GNUC_UNUSED)
{ {
const virHashKeyValuePair *a = va; const virHashKeyValuePair *a = va;
const virHashKeyValuePair *b = vb; const virHashKeyValuePair *b = vb;
@ -3244,7 +3247,9 @@ struct _ebtablesSubChainInst {
static int static int
ebtablesSubChainInstSort(const void *a, const void *b) ebtablesSubChainInstSort(const void *a,
const void *b,
void *opaque G_GNUC_UNUSED)
{ {
const ebtablesSubChainInst **insta = (const ebtablesSubChainInst **)a; const ebtablesSubChainInst **insta = (const ebtablesSubChainInst **)a;
const ebtablesSubChainInst **instb = (const ebtablesSubChainInst **)b; const ebtablesSubChainInst **instb = (const ebtablesSubChainInst **)b;
@ -3268,7 +3273,8 @@ ebtablesGetSubChainInsts(GHashTable *chains,
if (filter_names == NULL) if (filter_names == NULL)
return -1; return -1;
qsort(filter_names, nfilter_names, sizeof(*filter_names), ebiptablesFilterOrderSort); g_qsort_with_data(filter_names, nfilter_names,
sizeof(*filter_names), ebiptablesFilterOrderSort, NULL);
for (i = 0; filter_names[i].key; i++) { for (i = 0; filter_names[i].key; i++) {
g_autofree ebtablesSubChainInst *inst = NULL; g_autofree ebtablesSubChainInst *inst = NULL;
@ -3306,9 +3312,10 @@ ebiptablesApplyNewRules(const char *ifname,
size_t nsubchains = 0; size_t nsubchains = 0;
int ret = -1; int ret = -1;
if (nrules) if (nrules) {
qsort(rules, nrules, sizeof(rules[0]), g_qsort_with_data(rules, nrules, sizeof(rules[0]),
virNWFilterRuleInstSortPtr); virNWFilterRuleInstSortPtr, NULL);
}
/* cleanup whatever may exist */ /* cleanup whatever may exist */
virFirewallStartTransaction(fw, VIR_FIREWALL_TRANSACTION_IGNORE_ERRORS); virFirewallStartTransaction(fw, VIR_FIREWALL_TRANSACTION_IGNORE_ERRORS);
@ -3388,9 +3395,11 @@ ebiptablesApplyNewRules(const char *ifname,
goto cleanup; goto cleanup;
} }
if (nsubchains > 0) if (nsubchains > 0) {
qsort(subchains, nsubchains, sizeof(subchains[0]), g_qsort_with_data(subchains, nsubchains,
ebtablesSubChainInstSort); sizeof(subchains[0]),
ebtablesSubChainInstSort, NULL);
}
for (i = 0, j = 0; i < nrules; i++) { for (i = 0, j = 0; i < nrules; i++) {
if (virNWFilterRuleIsProtocolEthernet(rules[i]->def)) { if (virNWFilterRuleIsProtocolEthernet(rules[i]->def)) {

View File

@ -7607,7 +7607,8 @@ qemuMonitorJSONProcessHotpluggableCpusReply(virJSONValue *vcpu,
static int static int
qemuMonitorQueryHotpluggableCpusEntrySort(const void *p1, qemuMonitorQueryHotpluggableCpusEntrySort(const void *p1,
const void *p2) const void *p2,
void *opaque G_GNUC_UNUSED)
{ {
const struct qemuMonitorQueryHotpluggableCpusEntry *a = p1; const struct qemuMonitorQueryHotpluggableCpusEntry *a = p1;
const struct qemuMonitorQueryHotpluggableCpusEntry *b = p2; const struct qemuMonitorQueryHotpluggableCpusEntry *b = p2;
@ -7659,7 +7660,8 @@ qemuMonitorJSONGetHotpluggableCPUs(qemuMonitor *mon,
goto cleanup; goto cleanup;
} }
qsort(info, ninfo, sizeof(*info), qemuMonitorQueryHotpluggableCpusEntrySort); g_qsort_with_data(info, ninfo, sizeof(*info),
qemuMonitorQueryHotpluggableCpusEntrySort, NULL);
*entries = g_steal_pointer(&info); *entries = g_steal_pointer(&info);
*nentries = ninfo; *nentries = ninfo;

View File

@ -6093,7 +6093,8 @@ qemuDomainHasHotpluggableStartupVcpus(virDomainDef *def)
static int static int
qemuProcessVcpusSortOrder(const void *a, qemuProcessVcpusSortOrder(const void *a,
const void *b) const void *b,
void *opaque G_GNUC_UNUSED)
{ {
virDomainVcpuDef *vcpua = *((virDomainVcpuDef **)a); virDomainVcpuDef *vcpua = *((virDomainVcpuDef **)a);
virDomainVcpuDef *vcpub = *((virDomainVcpuDef **)b); virDomainVcpuDef *vcpub = *((virDomainVcpuDef **)b);
@ -6133,8 +6134,8 @@ qemuProcessSetupHotpluggableVcpus(virDomainObj *vm,
if (nbootHotplug == 0) if (nbootHotplug == 0)
return 0; return 0;
qsort(bootHotplug, nbootHotplug, sizeof(*bootHotplug), g_qsort_with_data(bootHotplug, nbootHotplug,
qemuProcessVcpusSortOrder); sizeof(*bootHotplug), qemuProcessVcpusSortOrder, NULL);
if (virDomainCgroupEmulatorAllNodesAllow(priv->cgroup, &emulatorCgroup) < 0) if (virDomainCgroupEmulatorAllNodesAllow(priv->cgroup, &emulatorCgroup) < 0)
goto cleanup; goto cleanup;

View File

@ -1247,7 +1247,9 @@ virSecurityManagerRestoreNetdevLabel(virSecurityManager *mgr,
static int static int
cmpstringp(const void *p1, const void *p2) cmpstringp(const void *p1,
const void *p2,
void *opaque G_GNUC_UNUSED)
{ {
const char *s1 = *(char * const *) p1; const char *s1 = *(char * const *) p1;
const char *s2 = *(char * const *) p2; const char *s2 = *(char * const *) p2;
@ -1303,8 +1305,9 @@ virSecurityManagerMetadataLock(virSecurityManager *mgr G_GNUC_UNUSED,
* paths in the same order and thus no deadlock can occur. * paths in the same order and thus no deadlock can occur.
* Lastly, it makes searching for duplicate paths below * Lastly, it makes searching for duplicate paths below
* simpler. */ * simpler. */
if (paths) if (paths) {
qsort(paths, npaths, sizeof(*paths), cmpstringp); g_qsort_with_data(paths, npaths, sizeof(*paths), cmpstringp, NULL);
}
for (i = 0; i < npaths; i++) { for (i = 0; i < npaths; i++) {
const char *p = paths[i]; const char *p = paths[i];

View File

@ -2193,9 +2193,11 @@ virFileGetMountSubtreeImpl(const char *mtabpath,
mounts[nmounts - 2] = g_strdup(mntent.mnt_dir); mounts[nmounts - 2] = g_strdup(mntent.mnt_dir);
} }
if (mounts) if (mounts) {
qsort(mounts, nmounts - 1, sizeof(mounts[0]), g_qsort_with_data(mounts, nmounts - 1, sizeof(mounts[0]),
reverse ? virStringSortRevCompare : virStringSortCompare); reverse ? virStringSortRevCompare : virStringSortCompare,
NULL);
}
*mountsret = mounts; *mountsret = mounts;
*nmountsret = nmounts ? nmounts - 1 : 0; *nmountsret = nmounts ? nmounts - 1 : 0;

View File

@ -514,7 +514,8 @@ void *virHashSearch(GHashTable *table,
static int static int
virHashGetItemsKeySorter(const void *va, virHashGetItemsKeySorter(const void *va,
const void *vb) const void *vb,
void *opaque G_GNUC_UNUSED)
{ {
const virHashKeyValuePair *a = va; const virHashKeyValuePair *a = va;
const virHashKeyValuePair *b = vb; const virHashKeyValuePair *b = vb;
@ -552,8 +553,10 @@ virHashGetItems(GHashTable *table,
i++; i++;
} }
if (sortKeys) if (sortKeys) {
qsort(items, *nitems, sizeof(*items), virHashGetItemsKeySorter); g_qsort_with_data(items, *nitems,
sizeof(*items), virHashGetItemsKeySorter, NULL);
}
return items; return items;
} }

View File

@ -2522,7 +2522,8 @@ virResctrlMonitorRemove(virResctrlMonitor *monitor)
static int static int
virResctrlMonitorStatsSorter(const void *a, virResctrlMonitorStatsSorter(const void *a,
const void *b) const void *b,
void *opaque G_GNUC_UNUSED)
{ {
return (*(virResctrlMonitorStats **)a)->id return (*(virResctrlMonitorStats **)a)->id
- (*(virResctrlMonitorStats **)b)->id; - (*(virResctrlMonitorStats **)b)->id;
@ -2625,8 +2626,10 @@ virResctrlMonitorGetStats(virResctrlMonitor *monitor,
} }
/* Sort in id's ascending order */ /* Sort in id's ascending order */
if (*nstats) if (*nstats) {
qsort(*stats, *nstats, sizeof(**stats), virResctrlMonitorStatsSorter); g_qsort_with_data(*stats, *nstats, sizeof(**stats),
virResctrlMonitorStatsSorter, NULL);
}
ret = 0; ret = 0;
cleanup: cleanup:

View File

@ -518,9 +518,11 @@ virStringIsEmpty(const char *str)
* virStringSortCompare: * virStringSortCompare:
* *
* A comparator function for sorting strings in * A comparator function for sorting strings in
* normal order with qsort(). * normal order with g_qsort_with_data().
*/ */
int virStringSortCompare(const void *a, const void *b) int virStringSortCompare(const void *a,
const void *b,
void *opaque G_GNUC_UNUSED)
{ {
const char **sa = (const char**)a; const char **sa = (const char**)a;
const char **sb = (const char**)b; const char **sb = (const char**)b;
@ -532,9 +534,11 @@ int virStringSortCompare(const void *a, const void *b)
* virStringSortRevCompare: * virStringSortRevCompare:
* *
* A comparator function for sorting strings in * A comparator function for sorting strings in
* reverse order with qsort(). * reverse order with g_qsort_with_data().
*/ */
int virStringSortRevCompare(const void *a, const void *b) int virStringSortRevCompare(const void *a,
const void *b,
void *opaque G_GNUC_UNUSED)
{ {
const char **sa = (const char**)a; const char **sa = (const char**)a;
const char **sb = (const char**)b; const char **sb = (const char**)b;

View File

@ -83,8 +83,12 @@ bool virStringIsEmpty(const char *str);
int virStrcpy(char *dest, const char *src, size_t destbytes); int virStrcpy(char *dest, const char *src, size_t destbytes);
#define virStrcpyStatic(dest, src) virStrcpy((dest), (src), sizeof(dest)) #define virStrcpyStatic(dest, src) virStrcpy((dest), (src), sizeof(dest))
int virStringSortCompare(const void *a, const void *b); int virStringSortCompare(const void *a,
int virStringSortRevCompare(const void *a, const void *b); const void *b,
void *opaque);
int virStringSortRevCompare(const void *a,
const void *b,
void *opaque);
int virStringToUpper(char **dst, const char *src); int virStringToUpper(char **dst, const char *src);
ssize_t virStringSearch(const char *str, ssize_t virStringSearch(const char *str,

View File

@ -43,7 +43,9 @@ VIR_ENUM_IMPL(virTypedParameter,
); );
static int static int
virTypedParamsSortName(const void *left, const void *right) virTypedParamsSortName(const void *left,
const void *right,
void *opaque G_GNUC_UNUSED)
{ {
const virTypedParameter *param_left = left, *param_right = right; const virTypedParameter *param_left = left, *param_right = right;
return strcmp(param_left->field, param_right->field); return strcmp(param_left->field, param_right->field);
@ -78,7 +80,8 @@ virTypedParamsValidate(virTypedParameterPtr params, int nparams, ...)
/* Here we intentionally don't copy values */ /* Here we intentionally don't copy values */
memcpy(sorted, params, sizeof(*params) * nparams); memcpy(sorted, params, sizeof(*params) * nparams);
qsort(sorted, nparams, sizeof(*sorted), virTypedParamsSortName); g_qsort_with_data(sorted, nparams,
sizeof(*sorted), virTypedParamsSortName, NULL);
name = va_arg(ap, const char *); name = va_arg(ap, const char *);
while (name) { while (name) {
@ -102,7 +105,7 @@ virTypedParamsValidate(virTypedParameterPtr params, int nparams, ...)
va_end(ap); va_end(ap);
qsort(keys, nkeys, sizeof(*keys), virTypedParamsSortName); g_qsort_with_data(keys, nkeys, sizeof(*keys), virTypedParamsSortName, NULL);
for (i = 0, j = 0; i < nparams && j < nkeys;) { for (i = 0, j = 0; i < nparams && j < nkeys;) {
if (STRNEQ(sorted[i].field, keys[j].field)) { if (STRNEQ(sorted[i].field, keys[j].field)) {

View File

@ -129,7 +129,9 @@ static void printArguments(FILE *log, int argc, char** argv)
} }
} }
static int envsort(const void *a, const void *b) static int envsort(const void *a,
const void *b,
void *opaque G_GNUC_UNUSED)
{ {
const char *astr = *(const char**)a; const char *astr = *(const char**)a;
const char *bstr = *(const char**)b; const char *bstr = *(const char**)b;
@ -165,7 +167,7 @@ static int printEnvironment(FILE *log)
newenv[i] = environ[i]; newenv[i] = environ[i];
} }
qsort(newenv, length, sizeof(newenv[0]), envsort); g_qsort_with_data(newenv, length, sizeof(newenv[0]), envsort, NULL);
for (i = 0; i < length; i++) { for (i = 0; i < length; i++) {
/* Ignore the variables used to instruct the loader into /* Ignore the variables used to instruct the loader into

View File

@ -89,10 +89,10 @@ testStringSortCompare(const void *opaque G_GNUC_UNUSED)
}; };
size_t i; size_t i;
qsort(randlist, G_N_ELEMENTS(randlist), sizeof(randlist[0]), g_qsort_with_data(randlist, G_N_ELEMENTS(randlist),
virStringSortCompare); sizeof(randlist[0]), virStringSortCompare, NULL);
qsort(randrlist, G_N_ELEMENTS(randrlist), sizeof(randrlist[0]), g_qsort_with_data(randrlist, G_N_ELEMENTS(randrlist),
virStringSortRevCompare); sizeof(randrlist[0]), virStringSortRevCompare, NULL);
for (i = 0; i < G_N_ELEMENTS(randlist); i++) { for (i = 0; i < G_N_ELEMENTS(randlist); i++) {
if (STRNEQ(randlist[i], sortlist[i])) { if (STRNEQ(randlist[i], sortlist[i])) {

View File

@ -526,7 +526,8 @@ virshCheckpointListFree(struct virshCheckpointList *checkpointlist)
static int static int
virshChkSorter(const void *a, virshChkSorter(const void *a,
const void *b) const void *b,
void *opaque G_GNUC_UNUSED)
{ {
const struct virshChk *sa = a; const struct virshChk *sa = a;
const struct virshChk *sb = b; const struct virshChk *sb = b;
@ -594,9 +595,10 @@ virshCheckpointListCollect(vshControl *ctl,
} }
if (!(orig_flags & VIR_DOMAIN_CHECKPOINT_LIST_TOPOLOGICAL) && if (!(orig_flags & VIR_DOMAIN_CHECKPOINT_LIST_TOPOLOGICAL) &&
checkpointlist->chks) checkpointlist->chks) {
qsort(checkpointlist->chks, checkpointlist->nchks, g_qsort_with_data(checkpointlist->chks, checkpointlist->nchks,
sizeof(*checkpointlist->chks), virshChkSorter); sizeof(*checkpointlist->chks), virshChkSorter, NULL);
}
ret = g_steal_pointer(&checkpointlist); ret = g_steal_pointer(&checkpointlist);

View File

@ -1483,7 +1483,9 @@ static const vshCmdInfo info_list[] = {
/* compare domains, pack NULLed ones at the end */ /* compare domains, pack NULLed ones at the end */
static int static int
virshDomainSorter(const void *a, const void *b) virshDomainSorter(const void *a,
const void *b,
void *opaque G_GNUC_UNUSED)
{ {
virDomainPtr *da = (virDomainPtr *) a; virDomainPtr *da = (virDomainPtr *) a;
virDomainPtr *db = (virDomainPtr *) b; virDomainPtr *db = (virDomainPtr *) b;
@ -1741,9 +1743,10 @@ virshDomainListCollect(vshControl *ctl, unsigned int flags)
finished: finished:
/* sort the list */ /* sort the list */
if (list->domains && list->ndomains) if (list->domains && list->ndomains) {
qsort(list->domains, list->ndomains, sizeof(*list->domains), g_qsort_with_data(list->domains, list->ndomains,
virshDomainSorter); sizeof(*list->domains), virshDomainSorter, NULL);
}
/* truncate the list if filter simulation deleted entries */ /* truncate the list if filter simulation deleted entries */
if (deleted) if (deleted)

View File

@ -300,7 +300,9 @@ static const vshCmdOptDef opts_freepages[] = {
}; };
static int static int
vshPageSizeSorter(const void *a, const void *b) vshPageSizeSorter(const void *a,
const void *b,
void *opaque G_GNUC_UNUSED)
{ {
unsigned int pa = *(unsigned int *)a; unsigned int pa = *(unsigned int *)a;
unsigned int pb = *(unsigned int *)b; unsigned int pb = *(unsigned int *)b;
@ -377,7 +379,8 @@ cmdFreepages(vshControl *ctl, const vshCmd *cmd)
* @pagesize array will contain duplicates. We should * @pagesize array will contain duplicates. We should
* remove them otherwise not very nice output will be * remove them otherwise not very nice output will be
* produced. */ * produced. */
qsort(pagesize, nodes_cnt, sizeof(*pagesize), vshPageSizeSorter); g_qsort_with_data(pagesize, nodes_cnt,
sizeof(*pagesize), vshPageSizeSorter, NULL);
for (i = 0; i < nodes_cnt - 1;) { for (i = 0; i < nodes_cnt - 1;) {
if (pagesize[i] == pagesize[i + 1]) { if (pagesize[i] == pagesize[i + 1]) {

View File

@ -141,7 +141,9 @@ cmdInterfaceEdit(vshControl *ctl, const vshCmd *cmd)
} }
static int static int
virshInterfaceSorter(const void *a, const void *b) virshInterfaceSorter(const void *a,
const void *b,
void *opaque G_GNUC_UNUSED)
{ {
virInterfacePtr *ia = (virInterfacePtr *) a; virInterfacePtr *ia = (virInterfacePtr *) a;
virInterfacePtr *ib = (virInterfacePtr *) b; virInterfacePtr *ib = (virInterfacePtr *) b;
@ -281,9 +283,10 @@ virshInterfaceListCollect(vshControl *ctl,
finished: finished:
/* sort the list */ /* sort the list */
if (list->ifaces && list->nifaces) if (list->ifaces && list->nifaces) {
qsort(list->ifaces, list->nifaces, g_qsort_with_data(list->ifaces, list->nifaces,
sizeof(*list->ifaces), virshInterfaceSorter); sizeof(*list->ifaces), virshInterfaceSorter, NULL);
}
/* truncate the list if filter simulation deleted entries */ /* truncate the list if filter simulation deleted entries */
if (deleted) if (deleted)

View File

@ -791,7 +791,9 @@ cmdNetworkInfo(vshControl *ctl, const vshCmd *cmd)
} }
static int static int
virshNetworkSorter(const void *a, const void *b) virshNetworkSorter(const void *a,
const void *b,
void *opaque G_GNUC_UNUSED)
{ {
virNetworkPtr *na = (virNetworkPtr *) a; virNetworkPtr *na = (virNetworkPtr *) a;
virNetworkPtr *nb = (virNetworkPtr *) b; virNetworkPtr *nb = (virNetworkPtr *) b;
@ -982,9 +984,10 @@ virshNetworkListCollect(vshControl *ctl,
finished: finished:
/* sort the list */ /* sort the list */
if (list->nets && list->nnets) if (list->nets && list->nnets) {
qsort(list->nets, list->nnets, g_qsort_with_data(list->nets, list->nnets,
sizeof(*list->nets), virshNetworkSorter); sizeof(*list->nets), virshNetworkSorter, NULL);
}
/* truncate the list if filter simulation deleted entries */ /* truncate the list if filter simulation deleted entries */
if (deleted) if (deleted)
@ -1801,7 +1804,9 @@ static const vshCmdOptDef opts_network_dhcp_leases[] = {
}; };
static int static int
virshNetworkDHCPLeaseSorter(const void *a, const void *b) virshNetworkDHCPLeaseSorter(const void *a,
const void *b,
void *opaque G_GNUC_UNUSED)
{ {
virNetworkDHCPLeasePtr *lease1 = (virNetworkDHCPLeasePtr *) a; virNetworkDHCPLeasePtr *lease1 = (virNetworkDHCPLeasePtr *) a;
virNetworkDHCPLeasePtr *lease2 = (virNetworkDHCPLeasePtr *) b; virNetworkDHCPLeasePtr *lease2 = (virNetworkDHCPLeasePtr *) b;
@ -1840,7 +1845,8 @@ cmdNetworkDHCPLeases(vshControl *ctl, const vshCmd *cmd)
} }
/* Sort the list according to MAC Address/IAID */ /* Sort the list according to MAC Address/IAID */
qsort(leases, nleases, sizeof(*leases), virshNetworkDHCPLeaseSorter); g_qsort_with_data(leases, nleases,
sizeof(*leases), virshNetworkDHCPLeaseSorter, NULL);
table = vshTableNew(_("Expiry Time"), _("MAC address"), _("Protocol"), table = vshTableNew(_("Expiry Time"), _("MAC address"), _("Protocol"),
_("IP address"), _("Hostname"), _("Client ID or DUID"), _("IP address"), _("Hostname"), _("Client ID or DUID"),
@ -2068,7 +2074,9 @@ cmdNetworkPortDelete(vshControl *ctl, const vshCmd *cmd)
static int static int
virshNetworkPortSorter(const void *a, const void *b) virshNetworkPortSorter(const void *a,
const void *b,
void *opaque G_GNUC_UNUSED)
{ {
virNetworkPortPtr *na = (virNetworkPortPtr *) a; virNetworkPortPtr *na = (virNetworkPortPtr *) a;
virNetworkPortPtr *nb = (virNetworkPortPtr *) b; virNetworkPortPtr *nb = (virNetworkPortPtr *) b;
@ -2129,9 +2137,10 @@ virshNetworkPortListCollect(vshControl *ctl,
list->nports = ret; list->nports = ret;
/* sort the list */ /* sort the list */
if (list->ports && list->nports) if (list->ports && list->nports) {
qsort(list->ports, list->nports, g_qsort_with_data(list->ports, list->nports,
sizeof(*list->ports), virshNetworkPortSorter); sizeof(*list->ports), virshNetworkPortSorter, NULL);
}
success = true; success = true;

View File

@ -183,7 +183,9 @@ virshNodeListLookup(int devid, bool parent, void *opaque)
} }
static int static int
virshNodeDeviceSorter(const void *a, const void *b) virshNodeDeviceSorter(const void *a,
const void *b,
void *opaque G_GNUC_UNUSED)
{ {
virNodeDevicePtr *na = (virNodeDevicePtr *) a; virNodeDevicePtr *na = (virNodeDevicePtr *) a;
virNodeDevicePtr *nb = (virNodeDevicePtr *) b; virNodeDevicePtr *nb = (virNodeDevicePtr *) b;
@ -334,9 +336,10 @@ virshNodeDeviceListCollect(vshControl *ctl,
finished: finished:
/* sort the list */ /* sort the list */
if (list->devices && list->ndevices) if (list->devices && list->ndevices) {
qsort(list->devices, list->ndevices, g_qsort_with_data(list->devices, list->ndevices,
sizeof(*list->devices), virshNodeDeviceSorter); sizeof(*list->devices), virshNodeDeviceSorter, NULL);
}
/* truncate the list if filter simulation deleted entries */ /* truncate the list if filter simulation deleted entries */
if (deleted) if (deleted)

View File

@ -220,7 +220,9 @@ cmdNWFilterDumpXML(vshControl *ctl, const vshCmd *cmd)
} }
static int static int
virshNWFilterSorter(const void *a, const void *b) virshNWFilterSorter(const void *a,
const void *b,
void *opaque G_GNUC_UNUSED)
{ {
virNWFilterPtr *fa = (virNWFilterPtr *) a; virNWFilterPtr *fa = (virNWFilterPtr *) a;
virNWFilterPtr *fb = (virNWFilterPtr *) b; virNWFilterPtr *fb = (virNWFilterPtr *) b;
@ -323,9 +325,10 @@ virshNWFilterListCollect(vshControl *ctl,
finished: finished:
/* sort the list */ /* sort the list */
if (list->filters && list->nfilters) if (list->filters && list->nfilters) {
qsort(list->filters, list->nfilters, g_qsort_with_data(list->filters, list->nfilters,
sizeof(*list->filters), virshNWFilterSorter); sizeof(*list->filters), virshNWFilterSorter, NULL);
}
/* truncate the list for not found filter objects */ /* truncate the list for not found filter objects */
if (deleted) if (deleted)
@ -644,7 +647,9 @@ cmdNWFilterBindingDumpXML(vshControl *ctl, const vshCmd *cmd)
static int static int
virshNWFilterBindingSorter(const void *a, const void *b) virshNWFilterBindingSorter(const void *a,
const void *b,
void *opaque G_GNUC_UNUSED)
{ {
virNWFilterBindingPtr *fa = (virNWFilterBindingPtr *) a; virNWFilterBindingPtr *fa = (virNWFilterBindingPtr *) a;
virNWFilterBindingPtr *fb = (virNWFilterBindingPtr *) b; virNWFilterBindingPtr *fb = (virNWFilterBindingPtr *) b;
@ -702,9 +707,10 @@ virshNWFilterBindingListCollect(vshControl *ctl,
list->nbindings = ret; list->nbindings = ret;
/* sort the list */ /* sort the list */
if (list->bindings && list->nbindings > 1) if (list->bindings && list->nbindings > 1) {
qsort(list->bindings, list->nbindings, g_qsort_with_data(list->bindings, list->nbindings,
sizeof(*list->bindings), virshNWFilterBindingSorter); sizeof(*list->bindings), virshNWFilterBindingSorter, NULL);
}
success = true; success = true;

View File

@ -814,7 +814,9 @@ cmdPoolDumpXML(vshControl *ctl, const vshCmd *cmd)
} }
static int static int
virshStoragePoolSorter(const void *a, const void *b) virshStoragePoolSorter(const void *a,
const void *b,
void *opaque G_GNUC_UNUSED)
{ {
virStoragePoolPtr *pa = (virStoragePoolPtr *) a; virStoragePoolPtr *pa = (virStoragePoolPtr *) a;
virStoragePoolPtr *pb = (virStoragePoolPtr *) b; virStoragePoolPtr *pb = (virStoragePoolPtr *) b;
@ -1005,9 +1007,10 @@ virshStoragePoolListCollect(vshControl *ctl,
finished: finished:
/* sort the list */ /* sort the list */
if (list->pools && list->npools) if (list->pools && list->npools) {
qsort(list->pools, list->npools, g_qsort_with_data(list->pools, list->npools,
sizeof(*list->pools), virshStoragePoolSorter); sizeof(*list->pools), virshStoragePoolSorter, NULL);
}
/* truncate the list if filter simulation deleted entries */ /* truncate the list if filter simulation deleted entries */
if (deleted) if (deleted)

View File

@ -399,7 +399,9 @@ cmdSecretUndefine(vshControl *ctl, const vshCmd *cmd)
} }
static int static int
virshSecretSorter(const void *a, const void *b) virshSecretSorter(const void *a,
const void *b,
void *opaque G_GNUC_UNUSED)
{ {
virSecretPtr *sa = (virSecretPtr *) a; virSecretPtr *sa = (virSecretPtr *) a;
virSecretPtr *sb = (virSecretPtr *) b; virSecretPtr *sb = (virSecretPtr *) b;
@ -509,9 +511,10 @@ virshSecretListCollect(vshControl *ctl,
finished: finished:
/* sort the list */ /* sort the list */
if (list->secrets && list->nsecrets) if (list->secrets && list->nsecrets) {
qsort(list->secrets, list->nsecrets, g_qsort_with_data(list->secrets, list->nsecrets,
sizeof(*list->secrets), virshSecretSorter); sizeof(*list->secrets), virshSecretSorter, NULL);
}
/* truncate the list for not found secret objects */ /* truncate the list for not found secret objects */
if (deleted) if (deleted)

View File

@ -982,7 +982,9 @@ virshSnapshotListFree(struct virshSnapshotList *snaplist)
} }
static int static int
virshSnapSorter(const void *a, const void *b) virshSnapSorter(const void *a,
const void *b,
void *opaque G_GNUC_UNUSED)
{ {
const struct virshSnap *sa = a; const struct virshSnap *sa = a;
const struct virshSnap *sb = b; const struct virshSnap *sb = b;
@ -1232,7 +1234,7 @@ virshSnapshotListCollect(vshControl *ctl, virDomainPtr dom,
* still in list. We mark known descendants by clearing * still in list. We mark known descendants by clearing
* snaps[i].parents. Sorry, this is O(n^3) - hope your * snaps[i].parents. Sorry, this is O(n^3) - hope your
* hierarchy isn't huge. XXX Is it worth making O(n^2 log n) * hierarchy isn't huge. XXX Is it worth making O(n^2 log n)
* by using qsort and bsearch? */ * by using g_qsort_with_data and bsearch? */
if (start_index < 0) { if (start_index < 0) {
vshError(ctl, _("snapshot %1$s disappeared from list"), fromname); vshError(ctl, _("snapshot %1$s disappeared from list"), fromname);
goto cleanup; goto cleanup;
@ -1312,8 +1314,8 @@ virshSnapshotListCollect(vshControl *ctl, virDomainPtr dom,
} }
if (!(orig_flags & VIR_DOMAIN_SNAPSHOT_LIST_TOPOLOGICAL) && if (!(orig_flags & VIR_DOMAIN_SNAPSHOT_LIST_TOPOLOGICAL) &&
snaplist->snaps && snaplist->nsnaps) { snaplist->snaps && snaplist->nsnaps) {
qsort(snaplist->snaps, snaplist->nsnaps, sizeof(*snaplist->snaps), g_qsort_with_data(snaplist->snaps, snaplist->nsnaps,
virshSnapSorter); sizeof(*snaplist->snaps), virshSnapSorter, NULL);
} }
snaplist->nsnaps -= deleted; snaplist->nsnaps -= deleted;

View File

@ -1200,7 +1200,9 @@ cmdVolDumpXML(vshControl *ctl, const vshCmd *cmd)
} }
static int static int
virshStorageVolSorter(const void *a, const void *b) virshStorageVolSorter(const void *a,
const void *b,
void *opaque G_GNUC_UNUSED)
{ {
virStorageVolPtr *va = (virStorageVolPtr *) a; virStorageVolPtr *va = (virStorageVolPtr *) a;
virStorageVolPtr *vb = (virStorageVolPtr *) b; virStorageVolPtr *vb = (virStorageVolPtr *) b;
@ -1299,8 +1301,10 @@ virshStorageVolListCollect(vshControl *ctl,
finished: finished:
/* sort the list */ /* sort the list */
if (list->vols && list->nvols) if (list->vols && list->nvols) {
qsort(list->vols, list->nvols, sizeof(*list->vols), virshStorageVolSorter); g_qsort_with_data(list->vols, list->nvols,
sizeof(*list->vols), virshStorageVolSorter, NULL);
}
if (deleted) if (deleted)
VIR_SHRINK_N(list->vols, list->nvols, deleted); VIR_SHRINK_N(list->vols, list->nvols, deleted);