diff options
author | Eric Blake <eblake@redhat.com> | 2016-05-31 10:41:29 -0600 |
---|---|---|
committer | Markus Armbruster <armbru@redhat.com> | 2016-06-30 15:28:51 +0200 |
commit | 7c47959d0cb05db43014141a156ada0b6d53a750 (patch) | |
tree | 923c450c9678eadd343182c698e64ebdf6b272db /util | |
parent | fec0fc0a13ac7f1a1130433a6740cd850c3db34a (diff) | |
download | qemu-7c47959d0cb05db43014141a156ada0b6d53a750.zip qemu-7c47959d0cb05db43014141a156ada0b6d53a750.tar.gz qemu-7c47959d0cb05db43014141a156ada0b6d53a750.tar.bz2 |
qapi: Simplify use of range.h
Calling our function g_list_insert_sorted_merged is a misnomer,
since we are NOT writing a glib function. Furthermore, we are
making every caller pass the same comparator function of
range_merge(): any caller that would try otherwise would break
in weird ways since our internal call to ranges_can_merge() is
hard-coded to operate only on ranges, rather than paying
attention to the caller's comparator.
Better is to fix things so that callers don't have to care about
our internal comparator, by picking a function name and updating
the parameter type away from a gratuitous use of void*, to make
it obvious that we are operating specifically on a list of ranges
and not a generic list. Plus, refactoring the code here will
make it easier to plug a memory leak in the next patch.
range_compare() is now internal only, and moves to the .c file.
Signed-off-by: Eric Blake <eblake@redhat.com>
Message-Id: <1464712890-14262-3-git-send-email-eblake@redhat.com>
Signed-off-by: Markus Armbruster <armbru@redhat.com>
Diffstat (limited to 'util')
-rw-r--r-- | util/range.c | 20 |
1 files changed, 16 insertions, 4 deletions
diff --git a/util/range.c b/util/range.c index f775f2e..dd46092 100644 --- a/util/range.c +++ b/util/range.c @@ -44,14 +44,26 @@ static void range_merge(Range *range1, Range *range2) } } -GList *g_list_insert_sorted_merged(GList *list, gpointer data, - GCompareFunc func) +static gint range_compare(gconstpointer a, gconstpointer b) +{ + Range *ra = (Range *)a, *rb = (Range *)b; + if (ra->begin == rb->begin && ra->end == rb->end) { + return 0; + } else if (range_get_last(ra->begin, ra->end) < + range_get_last(rb->begin, rb->end)) { + return -1; + } else { + return 1; + } +} + +GList *range_list_insert(GList *list, Range *data) { GList *l, *next = NULL; Range *r, *nextr; if (!list) { - list = g_list_insert_sorted(list, data, func); + list = g_list_insert_sorted(list, data, range_compare); return list; } @@ -74,7 +86,7 @@ GList *g_list_insert_sorted_merged(GList *list, gpointer data, } if (!l) { - list = g_list_insert_sorted(list, data, func); + list = g_list_insert_sorted(list, data, range_compare); } return list; |