diff options
author | Eric Blake <eblake@redhat.com> | 2016-02-17 23:48:15 -0700 |
---|---|---|
committer | Timothy Pearson <tpearson@raptorengineering.com> | 2019-11-29 19:45:29 -0600 |
commit | f5c39f9c4210f444621965df2fb1304a39cadf77 (patch) | |
tree | 63e67d68f1b919c1439c2ed11cfda939904ebb58 /scripts/ordereddict.py | |
parent | 011b118064e6d1f779c206f9f05349bd64c4aa5d (diff) | |
download | hqemu-f5c39f9c4210f444621965df2fb1304a39cadf77.zip hqemu-f5c39f9c4210f444621965df2fb1304a39cadf77.tar.gz |
qapi: Simplify excess input reporting in input visitors
When reporting that an unvisited member remains at the end of an
input visit for a struct, we were using g_hash_table_find()
coupled with a callback function that always returns true, to
locate an arbitrary member of the hash table. But if all we
need is an arbitrary entry, we can get that from a single-use
iterator, without needing a tautological callback function.
Technically, our cast of &(GQueue *) to (void **) is not strict
C (while void * must be able to hold all other pointers, nothing
says a void ** has to be the same width or representation as a
GQueue **). The kosher way to write it would be the verbose:
void *tmp;
GQueue *any;
if (g_hash_table_iter_next(&iter, NULL, &tmp)) {
any = tmp;
But our code base (not to mention glib itself) already has other
cases of assuming that ALL pointers have the same width and
representation, where a compiler would have to go out of its way
to mis-compile our borderline behavior.
Suggested-by: Markus Armbruster <armbru@redhat.com>
Signed-off-by: Eric Blake <eblake@redhat.com>
Reviewed-by: Marc-André Lureau <marcandre.lureau@redhat.com>
Message-Id: <1455778109-6278-2-git-send-email-eblake@redhat.com>
Signed-off-by: Markus Armbruster <armbru@redhat.com>
Diffstat (limited to 'scripts/ordereddict.py')
0 files changed, 0 insertions, 0 deletions