2009-08-28 20:27:32 +02:00
|
|
|
/*
|
|
|
|
* QDict unit-tests.
|
|
|
|
*
|
|
|
|
* Copyright (C) 2009 Red Hat Inc.
|
|
|
|
*
|
|
|
|
* Authors:
|
|
|
|
* Luiz Capitulino <lcapitulino@redhat.com>
|
2010-05-12 21:34:42 +02:00
|
|
|
*
|
|
|
|
* This work is licensed under the terms of the GNU LGPL, version 2.1 or later.
|
|
|
|
* See the COPYING.LIB file in the top-level directory.
|
2009-08-28 20:27:32 +02:00
|
|
|
*/
|
2016-02-08 19:08:51 +01:00
|
|
|
#include "qemu/osdep.h"
|
2009-08-28 20:27:32 +02:00
|
|
|
|
2012-12-17 18:19:43 +01:00
|
|
|
#include "qapi/qmp/qint.h"
|
|
|
|
#include "qapi/qmp/qdict.h"
|
|
|
|
#include "qapi/qmp/qstring.h"
|
qdict: implement a qdict_crumple method for un-flattening a dict
The qdict_flatten() method will take a dict whose elements are
further nested dicts/lists and flatten them by concatenating
keys.
The qdict_crumple() method aims to do the reverse, taking a flat
qdict, and turning it into a set of nested dicts/lists. It will
apply nesting based on the key name, with a '.' indicating a
new level in the hierarchy. If the keys in the nested structure
are all numeric, it will create a list, otherwise it will create
a dict.
If the keys are a mixture of numeric and non-numeric, or the
numeric keys are not in strictly ascending order, an error will
be reported.
As an example, a flat dict containing
{
'foo.0.bar': 'one',
'foo.0.wizz': '1',
'foo.1.bar': 'two',
'foo.1.wizz': '2'
}
will get turned into a dict with one element 'foo' whose
value is a list. The list elements will each in turn be
dicts.
{
'foo': [
{ 'bar': 'one', 'wizz': '1' },
{ 'bar': 'two', 'wizz': '2' }
],
}
If the key is intended to contain a literal '.', then it must
be escaped as '..'. ie a flat dict
{
'foo..bar': 'wizz',
'bar.foo..bar': 'eek',
'bar.hello': 'world'
}
Will end up as
{
'foo.bar': 'wizz',
'bar': {
'foo.bar': 'eek',
'hello': 'world'
}
}
The intent of this function is that it allows a set of QemuOpts
to be turned into a nested data structure that mirrors the nesting
used when the same object is defined over QMP.
Reviewed-by: Eric Blake <eblake@redhat.com>
Reviewed-by: Kevin Wolf <kwolf@redhat.com>
Reviewed-by: Marc-André Lureau <marcandre.lureau@redhat.com>
Signed-off-by: Daniel P. Berrange <berrange@redhat.com>
Message-Id: <1475246744-29302-3-git-send-email-berrange@redhat.com>
Reviewed-by: Markus Armbruster <armbru@redhat.com>
[Parameter recursive dropped along with its tests; whitespace style
touched up]
Signed-off-by: Markus Armbruster <armbru@redhat.com>
2016-09-30 16:45:25 +02:00
|
|
|
#include "qapi/error.h"
|
2009-08-28 20:27:32 +02:00
|
|
|
#include "qemu-common.h"
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Public Interface test-cases
|
|
|
|
*
|
|
|
|
* (with some violations to access 'private' data)
|
|
|
|
*/
|
|
|
|
|
2012-01-10 20:10:44 +01:00
|
|
|
static void qdict_new_test(void)
|
2009-08-28 20:27:32 +02:00
|
|
|
{
|
|
|
|
QDict *qdict;
|
|
|
|
|
|
|
|
qdict = qdict_new();
|
2012-01-10 20:10:44 +01:00
|
|
|
g_assert(qdict != NULL);
|
|
|
|
g_assert(qdict_size(qdict) == 0);
|
|
|
|
g_assert(qdict->base.refcnt == 1);
|
|
|
|
g_assert(qobject_type(QOBJECT(qdict)) == QTYPE_QDICT);
|
2009-08-28 20:27:32 +02:00
|
|
|
|
|
|
|
// destroy doesn't exit yet
|
2012-01-10 20:10:44 +01:00
|
|
|
g_free(qdict);
|
2009-08-28 20:27:32 +02:00
|
|
|
}
|
|
|
|
|
2012-01-10 20:10:44 +01:00
|
|
|
static void qdict_put_obj_test(void)
|
2009-08-28 20:27:32 +02:00
|
|
|
{
|
|
|
|
QInt *qi;
|
|
|
|
QDict *qdict;
|
|
|
|
QDictEntry *ent;
|
|
|
|
const int num = 42;
|
|
|
|
|
|
|
|
qdict = qdict_new();
|
|
|
|
|
|
|
|
// key "" will have tdb hash 12345
|
|
|
|
qdict_put_obj(qdict, "", QOBJECT(qint_from_int(num)));
|
|
|
|
|
2012-01-10 20:10:44 +01:00
|
|
|
g_assert(qdict_size(qdict) == 1);
|
2010-06-07 20:45:22 +02:00
|
|
|
ent = QLIST_FIRST(&qdict->table[12345 % QDICT_BUCKET_MAX]);
|
2009-08-28 20:27:32 +02:00
|
|
|
qi = qobject_to_qint(ent->value);
|
2012-01-10 20:10:44 +01:00
|
|
|
g_assert(qint_get_int(qi) == num);
|
2009-08-28 20:27:32 +02:00
|
|
|
|
|
|
|
// destroy doesn't exit yet
|
|
|
|
QDECREF(qi);
|
2011-08-21 05:09:37 +02:00
|
|
|
g_free(ent->key);
|
|
|
|
g_free(ent);
|
|
|
|
g_free(qdict);
|
2009-08-28 20:27:32 +02:00
|
|
|
}
|
|
|
|
|
2012-01-10 20:10:44 +01:00
|
|
|
static void qdict_destroy_simple_test(void)
|
2009-08-28 20:27:32 +02:00
|
|
|
{
|
|
|
|
QDict *qdict;
|
|
|
|
|
|
|
|
qdict = qdict_new();
|
|
|
|
qdict_put_obj(qdict, "num", QOBJECT(qint_from_int(0)));
|
|
|
|
qdict_put_obj(qdict, "str", QOBJECT(qstring_from_str("foo")));
|
|
|
|
|
|
|
|
QDECREF(qdict);
|
|
|
|
}
|
|
|
|
|
2012-01-10 20:10:44 +01:00
|
|
|
static void qdict_get_test(void)
|
2009-08-28 20:27:32 +02:00
|
|
|
{
|
|
|
|
QInt *qi;
|
|
|
|
QObject *obj;
|
|
|
|
const int value = -42;
|
|
|
|
const char *key = "test";
|
2012-01-10 20:10:44 +01:00
|
|
|
QDict *tests_dict = qdict_new();
|
2009-08-28 20:27:32 +02:00
|
|
|
|
|
|
|
qdict_put(tests_dict, key, qint_from_int(value));
|
|
|
|
|
|
|
|
obj = qdict_get(tests_dict, key);
|
2012-01-10 20:10:44 +01:00
|
|
|
g_assert(obj != NULL);
|
2009-08-28 20:27:32 +02:00
|
|
|
|
|
|
|
qi = qobject_to_qint(obj);
|
2012-01-10 20:10:44 +01:00
|
|
|
g_assert(qint_get_int(qi) == value);
|
|
|
|
|
|
|
|
QDECREF(tests_dict);
|
2009-08-28 20:27:32 +02:00
|
|
|
}
|
|
|
|
|
2012-01-10 20:10:44 +01:00
|
|
|
static void qdict_get_int_test(void)
|
2009-08-28 20:27:32 +02:00
|
|
|
{
|
|
|
|
int ret;
|
|
|
|
const int value = 100;
|
|
|
|
const char *key = "int";
|
2012-01-10 20:10:44 +01:00
|
|
|
QDict *tests_dict = qdict_new();
|
2009-08-28 20:27:32 +02:00
|
|
|
|
|
|
|
qdict_put(tests_dict, key, qint_from_int(value));
|
|
|
|
|
|
|
|
ret = qdict_get_int(tests_dict, key);
|
2012-01-10 20:10:44 +01:00
|
|
|
g_assert(ret == value);
|
|
|
|
|
|
|
|
QDECREF(tests_dict);
|
2009-08-28 20:27:32 +02:00
|
|
|
}
|
|
|
|
|
2012-01-10 20:10:44 +01:00
|
|
|
static void qdict_get_try_int_test(void)
|
2009-08-28 20:27:32 +02:00
|
|
|
{
|
|
|
|
int ret;
|
|
|
|
const int value = 100;
|
|
|
|
const char *key = "int";
|
2012-01-10 20:10:44 +01:00
|
|
|
QDict *tests_dict = qdict_new();
|
2009-08-28 20:27:32 +02:00
|
|
|
|
|
|
|
qdict_put(tests_dict, key, qint_from_int(value));
|
|
|
|
|
|
|
|
ret = qdict_get_try_int(tests_dict, key, 0);
|
2012-01-10 20:10:44 +01:00
|
|
|
g_assert(ret == value);
|
|
|
|
|
|
|
|
QDECREF(tests_dict);
|
2009-08-28 20:27:32 +02:00
|
|
|
}
|
|
|
|
|
2012-01-10 20:10:44 +01:00
|
|
|
static void qdict_get_str_test(void)
|
2009-08-28 20:27:32 +02:00
|
|
|
{
|
|
|
|
const char *p;
|
|
|
|
const char *key = "key";
|
|
|
|
const char *str = "string";
|
2012-01-10 20:10:44 +01:00
|
|
|
QDict *tests_dict = qdict_new();
|
2009-08-28 20:27:32 +02:00
|
|
|
|
|
|
|
qdict_put(tests_dict, key, qstring_from_str(str));
|
|
|
|
|
|
|
|
p = qdict_get_str(tests_dict, key);
|
2012-01-10 20:10:44 +01:00
|
|
|
g_assert(p != NULL);
|
|
|
|
g_assert(strcmp(p, str) == 0);
|
|
|
|
|
|
|
|
QDECREF(tests_dict);
|
2009-08-28 20:27:32 +02:00
|
|
|
}
|
|
|
|
|
2012-01-10 20:10:44 +01:00
|
|
|
static void qdict_get_try_str_test(void)
|
2009-08-28 20:27:32 +02:00
|
|
|
{
|
|
|
|
const char *p;
|
|
|
|
const char *key = "key";
|
|
|
|
const char *str = "string";
|
2012-01-10 20:10:44 +01:00
|
|
|
QDict *tests_dict = qdict_new();
|
2009-08-28 20:27:32 +02:00
|
|
|
|
|
|
|
qdict_put(tests_dict, key, qstring_from_str(str));
|
|
|
|
|
|
|
|
p = qdict_get_try_str(tests_dict, key);
|
2012-01-10 20:10:44 +01:00
|
|
|
g_assert(p != NULL);
|
|
|
|
g_assert(strcmp(p, str) == 0);
|
|
|
|
|
|
|
|
QDECREF(tests_dict);
|
2009-08-28 20:27:32 +02:00
|
|
|
}
|
|
|
|
|
2015-05-28 17:37:55 +02:00
|
|
|
static void qdict_defaults_test(void)
|
|
|
|
{
|
|
|
|
QDict *dict, *copy;
|
|
|
|
|
|
|
|
dict = qdict_new();
|
|
|
|
copy = qdict_new();
|
|
|
|
|
|
|
|
qdict_set_default_str(dict, "foo", "abc");
|
|
|
|
qdict_set_default_str(dict, "foo", "def");
|
|
|
|
g_assert_cmpstr(qdict_get_str(dict, "foo"), ==, "abc");
|
|
|
|
qdict_set_default_str(dict, "bar", "ghi");
|
|
|
|
|
|
|
|
qdict_copy_default(copy, dict, "foo");
|
|
|
|
g_assert_cmpstr(qdict_get_str(copy, "foo"), ==, "abc");
|
|
|
|
qdict_set_default_str(copy, "bar", "xyz");
|
|
|
|
qdict_copy_default(copy, dict, "bar");
|
|
|
|
g_assert_cmpstr(qdict_get_str(copy, "bar"), ==, "xyz");
|
|
|
|
|
|
|
|
QDECREF(copy);
|
|
|
|
QDECREF(dict);
|
|
|
|
}
|
|
|
|
|
2012-01-10 20:10:44 +01:00
|
|
|
static void qdict_haskey_not_test(void)
|
2009-08-28 20:27:32 +02:00
|
|
|
{
|
2012-01-10 20:10:44 +01:00
|
|
|
QDict *tests_dict = qdict_new();
|
|
|
|
g_assert(qdict_haskey(tests_dict, "test") == 0);
|
|
|
|
|
|
|
|
QDECREF(tests_dict);
|
2009-08-28 20:27:32 +02:00
|
|
|
}
|
|
|
|
|
2012-01-10 20:10:44 +01:00
|
|
|
static void qdict_haskey_test(void)
|
2009-08-28 20:27:32 +02:00
|
|
|
{
|
|
|
|
const char *key = "test";
|
2012-01-10 20:10:44 +01:00
|
|
|
QDict *tests_dict = qdict_new();
|
2009-08-28 20:27:32 +02:00
|
|
|
|
|
|
|
qdict_put(tests_dict, key, qint_from_int(0));
|
2012-01-10 20:10:44 +01:00
|
|
|
g_assert(qdict_haskey(tests_dict, key) == 1);
|
|
|
|
|
|
|
|
QDECREF(tests_dict);
|
2009-08-28 20:27:32 +02:00
|
|
|
}
|
|
|
|
|
2012-01-10 20:10:44 +01:00
|
|
|
static void qdict_del_test(void)
|
2009-08-28 20:27:32 +02:00
|
|
|
{
|
|
|
|
const char *key = "key test";
|
2012-01-10 20:10:44 +01:00
|
|
|
QDict *tests_dict = qdict_new();
|
2009-08-28 20:27:32 +02:00
|
|
|
|
|
|
|
qdict_put(tests_dict, key, qstring_from_str("foo"));
|
2012-01-10 20:10:44 +01:00
|
|
|
g_assert(qdict_size(tests_dict) == 1);
|
2009-08-28 20:27:32 +02:00
|
|
|
|
|
|
|
qdict_del(tests_dict, key);
|
|
|
|
|
2012-01-10 20:10:44 +01:00
|
|
|
g_assert(qdict_size(tests_dict) == 0);
|
|
|
|
g_assert(qdict_haskey(tests_dict, key) == 0);
|
|
|
|
|
|
|
|
QDECREF(tests_dict);
|
2009-08-28 20:27:32 +02:00
|
|
|
}
|
|
|
|
|
2012-01-10 20:10:44 +01:00
|
|
|
static void qobject_to_qdict_test(void)
|
2009-08-28 20:27:32 +02:00
|
|
|
{
|
2012-01-10 20:10:44 +01:00
|
|
|
QDict *tests_dict = qdict_new();
|
|
|
|
g_assert(qobject_to_qdict(QOBJECT(tests_dict)) == tests_dict);
|
|
|
|
|
|
|
|
QDECREF(tests_dict);
|
2009-08-28 20:27:32 +02:00
|
|
|
}
|
|
|
|
|
2012-01-10 20:10:44 +01:00
|
|
|
static void qdict_iterapi_test(void)
|
2010-06-07 20:29:58 +02:00
|
|
|
{
|
|
|
|
int count;
|
|
|
|
const QDictEntry *ent;
|
2012-01-10 20:10:44 +01:00
|
|
|
QDict *tests_dict = qdict_new();
|
2010-06-07 20:29:58 +02:00
|
|
|
|
2012-01-10 20:10:44 +01:00
|
|
|
g_assert(qdict_first(tests_dict) == NULL);
|
2010-06-07 20:29:58 +02:00
|
|
|
|
|
|
|
qdict_put(tests_dict, "key1", qint_from_int(1));
|
|
|
|
qdict_put(tests_dict, "key2", qint_from_int(2));
|
|
|
|
qdict_put(tests_dict, "key3", qint_from_int(3));
|
|
|
|
|
|
|
|
count = 0;
|
|
|
|
for (ent = qdict_first(tests_dict); ent; ent = qdict_next(tests_dict, ent)){
|
2012-01-10 20:10:44 +01:00
|
|
|
g_assert(qdict_haskey(tests_dict, qdict_entry_key(ent)) == 1);
|
2010-06-07 20:29:58 +02:00
|
|
|
count++;
|
|
|
|
}
|
|
|
|
|
2012-01-10 20:10:44 +01:00
|
|
|
g_assert(count == qdict_size(tests_dict));
|
2010-06-07 20:29:58 +02:00
|
|
|
|
|
|
|
/* Do it again to test restarting */
|
|
|
|
count = 0;
|
|
|
|
for (ent = qdict_first(tests_dict); ent; ent = qdict_next(tests_dict, ent)){
|
2012-01-10 20:10:44 +01:00
|
|
|
g_assert(qdict_haskey(tests_dict, qdict_entry_key(ent)) == 1);
|
2010-06-07 20:29:58 +02:00
|
|
|
count++;
|
|
|
|
}
|
|
|
|
|
2012-01-10 20:10:44 +01:00
|
|
|
g_assert(count == qdict_size(tests_dict));
|
|
|
|
|
|
|
|
QDECREF(tests_dict);
|
2010-06-07 20:29:58 +02:00
|
|
|
}
|
|
|
|
|
2013-12-20 19:28:22 +01:00
|
|
|
static void qdict_flatten_test(void)
|
|
|
|
{
|
|
|
|
QList *list1 = qlist_new();
|
|
|
|
QList *list2 = qlist_new();
|
|
|
|
QDict *dict1 = qdict_new();
|
|
|
|
QDict *dict2 = qdict_new();
|
|
|
|
QDict *dict3 = qdict_new();
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Test the flattening of
|
|
|
|
*
|
|
|
|
* {
|
|
|
|
* "e": [
|
|
|
|
* 42,
|
|
|
|
* [
|
|
|
|
* 23,
|
|
|
|
* 66,
|
|
|
|
* {
|
|
|
|
* "a": 0,
|
|
|
|
* "b": 1
|
|
|
|
* }
|
|
|
|
* ]
|
|
|
|
* ],
|
|
|
|
* "f": {
|
|
|
|
* "c": 2,
|
|
|
|
* "d": 3,
|
|
|
|
* },
|
|
|
|
* "g": 4
|
|
|
|
* }
|
|
|
|
*
|
|
|
|
* to
|
|
|
|
*
|
|
|
|
* {
|
|
|
|
* "e.0": 42,
|
|
|
|
* "e.1.0": 23,
|
|
|
|
* "e.1.1": 66,
|
|
|
|
* "e.1.2.a": 0,
|
|
|
|
* "e.1.2.b": 1,
|
|
|
|
* "f.c": 2,
|
|
|
|
* "f.d": 3,
|
|
|
|
* "g": 4
|
|
|
|
* }
|
|
|
|
*/
|
|
|
|
|
|
|
|
qdict_put(dict1, "a", qint_from_int(0));
|
|
|
|
qdict_put(dict1, "b", qint_from_int(1));
|
|
|
|
|
|
|
|
qlist_append_obj(list1, QOBJECT(qint_from_int(23)));
|
|
|
|
qlist_append_obj(list1, QOBJECT(qint_from_int(66)));
|
|
|
|
qlist_append_obj(list1, QOBJECT(dict1));
|
|
|
|
qlist_append_obj(list2, QOBJECT(qint_from_int(42)));
|
|
|
|
qlist_append_obj(list2, QOBJECT(list1));
|
|
|
|
|
|
|
|
qdict_put(dict2, "c", qint_from_int(2));
|
|
|
|
qdict_put(dict2, "d", qint_from_int(3));
|
|
|
|
qdict_put_obj(dict3, "e", QOBJECT(list2));
|
|
|
|
qdict_put_obj(dict3, "f", QOBJECT(dict2));
|
|
|
|
qdict_put(dict3, "g", qint_from_int(4));
|
|
|
|
|
|
|
|
qdict_flatten(dict3);
|
|
|
|
|
|
|
|
g_assert(qdict_get_int(dict3, "e.0") == 42);
|
|
|
|
g_assert(qdict_get_int(dict3, "e.1.0") == 23);
|
|
|
|
g_assert(qdict_get_int(dict3, "e.1.1") == 66);
|
|
|
|
g_assert(qdict_get_int(dict3, "e.1.2.a") == 0);
|
|
|
|
g_assert(qdict_get_int(dict3, "e.1.2.b") == 1);
|
|
|
|
g_assert(qdict_get_int(dict3, "f.c") == 2);
|
|
|
|
g_assert(qdict_get_int(dict3, "f.d") == 3);
|
|
|
|
g_assert(qdict_get_int(dict3, "g") == 4);
|
|
|
|
|
|
|
|
g_assert(qdict_size(dict3) == 8);
|
|
|
|
|
|
|
|
QDECREF(dict3);
|
|
|
|
}
|
|
|
|
|
2013-12-20 19:28:21 +01:00
|
|
|
static void qdict_array_split_test(void)
|
|
|
|
{
|
|
|
|
QDict *test_dict = qdict_new();
|
|
|
|
QDict *dict1, *dict2;
|
2014-02-21 19:11:41 +01:00
|
|
|
QInt *int1;
|
2013-12-20 19:28:21 +01:00
|
|
|
QList *test_list;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Test the split of
|
|
|
|
*
|
|
|
|
* {
|
|
|
|
* "1.x": 0,
|
2014-02-21 19:11:41 +01:00
|
|
|
* "4.y": 1,
|
2013-12-20 19:28:21 +01:00
|
|
|
* "0.a": 42,
|
|
|
|
* "o.o": 7,
|
2014-02-21 19:11:41 +01:00
|
|
|
* "0.b": 23,
|
|
|
|
* "2": 66
|
2013-12-20 19:28:21 +01:00
|
|
|
* }
|
|
|
|
*
|
|
|
|
* to
|
|
|
|
*
|
|
|
|
* [
|
|
|
|
* {
|
|
|
|
* "a": 42,
|
|
|
|
* "b": 23
|
|
|
|
* },
|
|
|
|
* {
|
|
|
|
* "x": 0
|
2014-02-21 19:11:41 +01:00
|
|
|
* },
|
|
|
|
* 66
|
2013-12-20 19:28:21 +01:00
|
|
|
* ]
|
|
|
|
*
|
|
|
|
* and
|
|
|
|
*
|
|
|
|
* {
|
2014-02-21 19:11:41 +01:00
|
|
|
* "4.y": 1,
|
2013-12-20 19:28:21 +01:00
|
|
|
* "o.o": 7
|
|
|
|
* }
|
|
|
|
*
|
|
|
|
* (remaining in the old QDict)
|
|
|
|
*
|
|
|
|
* This example is given in the comment of qdict_array_split().
|
|
|
|
*/
|
|
|
|
|
|
|
|
qdict_put(test_dict, "1.x", qint_from_int(0));
|
2014-02-21 19:11:41 +01:00
|
|
|
qdict_put(test_dict, "4.y", qint_from_int(1));
|
2013-12-20 19:28:21 +01:00
|
|
|
qdict_put(test_dict, "0.a", qint_from_int(42));
|
|
|
|
qdict_put(test_dict, "o.o", qint_from_int(7));
|
|
|
|
qdict_put(test_dict, "0.b", qint_from_int(23));
|
2014-02-21 19:11:41 +01:00
|
|
|
qdict_put(test_dict, "2", qint_from_int(66));
|
2013-12-20 19:28:21 +01:00
|
|
|
|
|
|
|
qdict_array_split(test_dict, &test_list);
|
|
|
|
|
|
|
|
dict1 = qobject_to_qdict(qlist_pop(test_list));
|
|
|
|
dict2 = qobject_to_qdict(qlist_pop(test_list));
|
2014-02-21 19:11:41 +01:00
|
|
|
int1 = qobject_to_qint(qlist_pop(test_list));
|
2013-12-20 19:28:21 +01:00
|
|
|
|
|
|
|
g_assert(dict1);
|
|
|
|
g_assert(dict2);
|
2014-02-21 19:11:41 +01:00
|
|
|
g_assert(int1);
|
2013-12-20 19:28:21 +01:00
|
|
|
g_assert(qlist_empty(test_list));
|
|
|
|
|
|
|
|
QDECREF(test_list);
|
|
|
|
|
|
|
|
g_assert(qdict_get_int(dict1, "a") == 42);
|
|
|
|
g_assert(qdict_get_int(dict1, "b") == 23);
|
|
|
|
|
|
|
|
g_assert(qdict_size(dict1) == 2);
|
|
|
|
|
|
|
|
QDECREF(dict1);
|
|
|
|
|
|
|
|
g_assert(qdict_get_int(dict2, "x") == 0);
|
|
|
|
|
|
|
|
g_assert(qdict_size(dict2) == 1);
|
|
|
|
|
|
|
|
QDECREF(dict2);
|
|
|
|
|
2014-02-21 19:11:41 +01:00
|
|
|
g_assert(qint_get_int(int1) == 66);
|
|
|
|
|
|
|
|
QDECREF(int1);
|
|
|
|
|
|
|
|
g_assert(qdict_get_int(test_dict, "4.y") == 1);
|
2013-12-20 19:28:21 +01:00
|
|
|
g_assert(qdict_get_int(test_dict, "o.o") == 7);
|
|
|
|
|
|
|
|
g_assert(qdict_size(test_dict) == 2);
|
|
|
|
|
|
|
|
QDECREF(test_dict);
|
2014-02-21 21:05:13 +01:00
|
|
|
|
|
|
|
/*
|
|
|
|
* Test the split of
|
|
|
|
*
|
|
|
|
* {
|
|
|
|
* "0": 42,
|
|
|
|
* "1": 23,
|
|
|
|
* "1.x": 84
|
|
|
|
* }
|
|
|
|
*
|
|
|
|
* to
|
|
|
|
*
|
|
|
|
* [
|
|
|
|
* 42
|
|
|
|
* ]
|
|
|
|
*
|
|
|
|
* and
|
|
|
|
*
|
|
|
|
* {
|
|
|
|
* "1": 23,
|
|
|
|
* "1.x": 84
|
|
|
|
* }
|
|
|
|
*
|
|
|
|
* That is, test whether splitting stops if there is both an entry with key
|
|
|
|
* of "%u" and other entries with keys prefixed "%u." for the same index.
|
|
|
|
*/
|
|
|
|
|
|
|
|
test_dict = qdict_new();
|
|
|
|
|
|
|
|
qdict_put(test_dict, "0", qint_from_int(42));
|
|
|
|
qdict_put(test_dict, "1", qint_from_int(23));
|
|
|
|
qdict_put(test_dict, "1.x", qint_from_int(84));
|
|
|
|
|
|
|
|
qdict_array_split(test_dict, &test_list);
|
|
|
|
|
|
|
|
int1 = qobject_to_qint(qlist_pop(test_list));
|
|
|
|
|
|
|
|
g_assert(int1);
|
|
|
|
g_assert(qlist_empty(test_list));
|
|
|
|
|
|
|
|
QDECREF(test_list);
|
|
|
|
|
|
|
|
g_assert(qint_get_int(int1) == 42);
|
|
|
|
|
|
|
|
QDECREF(int1);
|
|
|
|
|
|
|
|
g_assert(qdict_get_int(test_dict, "1") == 23);
|
|
|
|
g_assert(qdict_get_int(test_dict, "1.x") == 84);
|
|
|
|
|
|
|
|
g_assert(qdict_size(test_dict) == 2);
|
|
|
|
|
|
|
|
QDECREF(test_dict);
|
2013-12-20 19:28:21 +01:00
|
|
|
}
|
|
|
|
|
2015-05-28 17:37:55 +02:00
|
|
|
static void qdict_array_entries_test(void)
|
|
|
|
{
|
|
|
|
QDict *dict = qdict_new();
|
|
|
|
|
|
|
|
g_assert_cmpint(qdict_array_entries(dict, "foo."), ==, 0);
|
|
|
|
|
|
|
|
qdict_put(dict, "bar", qint_from_int(0));
|
|
|
|
qdict_put(dict, "baz.0", qint_from_int(0));
|
|
|
|
g_assert_cmpint(qdict_array_entries(dict, "foo."), ==, 0);
|
|
|
|
|
|
|
|
qdict_put(dict, "foo.1", qint_from_int(0));
|
|
|
|
g_assert_cmpint(qdict_array_entries(dict, "foo."), ==, -EINVAL);
|
|
|
|
qdict_put(dict, "foo.0", qint_from_int(0));
|
|
|
|
g_assert_cmpint(qdict_array_entries(dict, "foo."), ==, 2);
|
|
|
|
qdict_put(dict, "foo.bar", qint_from_int(0));
|
|
|
|
g_assert_cmpint(qdict_array_entries(dict, "foo."), ==, -EINVAL);
|
|
|
|
qdict_del(dict, "foo.bar");
|
|
|
|
|
|
|
|
qdict_put(dict, "foo.2.a", qint_from_int(0));
|
|
|
|
qdict_put(dict, "foo.2.b", qint_from_int(0));
|
|
|
|
qdict_put(dict, "foo.2.c", qint_from_int(0));
|
|
|
|
g_assert_cmpint(qdict_array_entries(dict, "foo."), ==, 3);
|
|
|
|
g_assert_cmpint(qdict_array_entries(dict, ""), ==, -EINVAL);
|
|
|
|
|
|
|
|
QDECREF(dict);
|
|
|
|
|
|
|
|
dict = qdict_new();
|
|
|
|
qdict_put(dict, "1", qint_from_int(0));
|
|
|
|
g_assert_cmpint(qdict_array_entries(dict, ""), ==, -EINVAL);
|
|
|
|
qdict_put(dict, "0", qint_from_int(0));
|
|
|
|
g_assert_cmpint(qdict_array_entries(dict, ""), ==, 2);
|
|
|
|
qdict_put(dict, "bar", qint_from_int(0));
|
|
|
|
g_assert_cmpint(qdict_array_entries(dict, ""), ==, -EINVAL);
|
|
|
|
qdict_del(dict, "bar");
|
|
|
|
|
|
|
|
qdict_put(dict, "2.a", qint_from_int(0));
|
|
|
|
qdict_put(dict, "2.b", qint_from_int(0));
|
|
|
|
qdict_put(dict, "2.c", qint_from_int(0));
|
|
|
|
g_assert_cmpint(qdict_array_entries(dict, ""), ==, 3);
|
|
|
|
|
|
|
|
QDECREF(dict);
|
|
|
|
}
|
|
|
|
|
2014-05-08 20:12:40 +02:00
|
|
|
static void qdict_join_test(void)
|
|
|
|
{
|
|
|
|
QDict *dict1, *dict2;
|
|
|
|
bool overwrite = false;
|
|
|
|
int i;
|
|
|
|
|
|
|
|
dict1 = qdict_new();
|
|
|
|
dict2 = qdict_new();
|
|
|
|
|
|
|
|
/* Test everything once without overwrite and once with */
|
|
|
|
do
|
|
|
|
{
|
|
|
|
/* Test empty dicts */
|
|
|
|
qdict_join(dict1, dict2, overwrite);
|
|
|
|
|
|
|
|
g_assert(qdict_size(dict1) == 0);
|
|
|
|
g_assert(qdict_size(dict2) == 0);
|
|
|
|
|
|
|
|
/* First iteration: Test movement */
|
|
|
|
/* Second iteration: Test empty source and non-empty destination */
|
|
|
|
qdict_put(dict2, "foo", qint_from_int(42));
|
|
|
|
|
|
|
|
for (i = 0; i < 2; i++) {
|
|
|
|
qdict_join(dict1, dict2, overwrite);
|
|
|
|
|
|
|
|
g_assert(qdict_size(dict1) == 1);
|
|
|
|
g_assert(qdict_size(dict2) == 0);
|
|
|
|
|
|
|
|
g_assert(qdict_get_int(dict1, "foo") == 42);
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Test non-empty source and destination without conflict */
|
|
|
|
qdict_put(dict2, "bar", qint_from_int(23));
|
|
|
|
|
|
|
|
qdict_join(dict1, dict2, overwrite);
|
|
|
|
|
|
|
|
g_assert(qdict_size(dict1) == 2);
|
|
|
|
g_assert(qdict_size(dict2) == 0);
|
|
|
|
|
|
|
|
g_assert(qdict_get_int(dict1, "foo") == 42);
|
|
|
|
g_assert(qdict_get_int(dict1, "bar") == 23);
|
|
|
|
|
|
|
|
/* Test conflict */
|
|
|
|
qdict_put(dict2, "foo", qint_from_int(84));
|
|
|
|
|
|
|
|
qdict_join(dict1, dict2, overwrite);
|
|
|
|
|
|
|
|
g_assert(qdict_size(dict1) == 2);
|
|
|
|
g_assert(qdict_size(dict2) == !overwrite);
|
|
|
|
|
|
|
|
g_assert(qdict_get_int(dict1, "foo") == overwrite ? 84 : 42);
|
|
|
|
g_assert(qdict_get_int(dict1, "bar") == 23);
|
|
|
|
|
|
|
|
if (!overwrite) {
|
|
|
|
g_assert(qdict_get_int(dict2, "foo") == 84);
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Check the references */
|
|
|
|
g_assert(qdict_get(dict1, "foo")->refcnt == 1);
|
|
|
|
g_assert(qdict_get(dict1, "bar")->refcnt == 1);
|
|
|
|
|
|
|
|
if (!overwrite) {
|
|
|
|
g_assert(qdict_get(dict2, "foo")->refcnt == 1);
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Clean up */
|
|
|
|
qdict_del(dict1, "foo");
|
|
|
|
qdict_del(dict1, "bar");
|
|
|
|
|
|
|
|
if (!overwrite) {
|
|
|
|
qdict_del(dict2, "foo");
|
|
|
|
}
|
|
|
|
}
|
|
|
|
while (overwrite ^= true);
|
|
|
|
|
|
|
|
QDECREF(dict1);
|
|
|
|
QDECREF(dict2);
|
|
|
|
}
|
|
|
|
|
qdict: implement a qdict_crumple method for un-flattening a dict
The qdict_flatten() method will take a dict whose elements are
further nested dicts/lists and flatten them by concatenating
keys.
The qdict_crumple() method aims to do the reverse, taking a flat
qdict, and turning it into a set of nested dicts/lists. It will
apply nesting based on the key name, with a '.' indicating a
new level in the hierarchy. If the keys in the nested structure
are all numeric, it will create a list, otherwise it will create
a dict.
If the keys are a mixture of numeric and non-numeric, or the
numeric keys are not in strictly ascending order, an error will
be reported.
As an example, a flat dict containing
{
'foo.0.bar': 'one',
'foo.0.wizz': '1',
'foo.1.bar': 'two',
'foo.1.wizz': '2'
}
will get turned into a dict with one element 'foo' whose
value is a list. The list elements will each in turn be
dicts.
{
'foo': [
{ 'bar': 'one', 'wizz': '1' },
{ 'bar': 'two', 'wizz': '2' }
],
}
If the key is intended to contain a literal '.', then it must
be escaped as '..'. ie a flat dict
{
'foo..bar': 'wizz',
'bar.foo..bar': 'eek',
'bar.hello': 'world'
}
Will end up as
{
'foo.bar': 'wizz',
'bar': {
'foo.bar': 'eek',
'hello': 'world'
}
}
The intent of this function is that it allows a set of QemuOpts
to be turned into a nested data structure that mirrors the nesting
used when the same object is defined over QMP.
Reviewed-by: Eric Blake <eblake@redhat.com>
Reviewed-by: Kevin Wolf <kwolf@redhat.com>
Reviewed-by: Marc-André Lureau <marcandre.lureau@redhat.com>
Signed-off-by: Daniel P. Berrange <berrange@redhat.com>
Message-Id: <1475246744-29302-3-git-send-email-berrange@redhat.com>
Reviewed-by: Markus Armbruster <armbru@redhat.com>
[Parameter recursive dropped along with its tests; whitespace style
touched up]
Signed-off-by: Markus Armbruster <armbru@redhat.com>
2016-09-30 16:45:25 +02:00
|
|
|
static void qdict_crumple_test_recursive(void)
|
|
|
|
{
|
|
|
|
QDict *src, *dst, *rule, *vnc, *acl, *listen;
|
|
|
|
QObject *child, *res;
|
|
|
|
QList *rules;
|
|
|
|
|
|
|
|
src = qdict_new();
|
|
|
|
qdict_put(src, "vnc.listen.addr", qstring_from_str("127.0.0.1"));
|
|
|
|
qdict_put(src, "vnc.listen.port", qstring_from_str("5901"));
|
|
|
|
qdict_put(src, "vnc.acl.rules.0.match", qstring_from_str("fred"));
|
|
|
|
qdict_put(src, "vnc.acl.rules.0.policy", qstring_from_str("allow"));
|
|
|
|
qdict_put(src, "vnc.acl.rules.1.match", qstring_from_str("bob"));
|
|
|
|
qdict_put(src, "vnc.acl.rules.1.policy", qstring_from_str("deny"));
|
|
|
|
qdict_put(src, "vnc.acl.default", qstring_from_str("deny"));
|
|
|
|
qdict_put(src, "vnc.acl..name", qstring_from_str("acl0"));
|
|
|
|
qdict_put(src, "vnc.acl.rule..name", qstring_from_str("acl0"));
|
|
|
|
|
|
|
|
res = qdict_crumple(src, &error_abort);
|
|
|
|
|
|
|
|
g_assert_cmpint(qobject_type(res), ==, QTYPE_QDICT);
|
|
|
|
|
|
|
|
dst = qobject_to_qdict(res);
|
|
|
|
|
|
|
|
g_assert_cmpint(qdict_size(dst), ==, 1);
|
|
|
|
|
|
|
|
child = qdict_get(dst, "vnc");
|
|
|
|
g_assert_cmpint(qobject_type(child), ==, QTYPE_QDICT);
|
|
|
|
vnc = qobject_to_qdict(child);
|
|
|
|
|
|
|
|
child = qdict_get(vnc, "listen");
|
|
|
|
g_assert_cmpint(qobject_type(child), ==, QTYPE_QDICT);
|
|
|
|
listen = qobject_to_qdict(child);
|
|
|
|
g_assert_cmpstr("127.0.0.1", ==, qdict_get_str(listen, "addr"));
|
|
|
|
g_assert_cmpstr("5901", ==, qdict_get_str(listen, "port"));
|
|
|
|
|
|
|
|
child = qdict_get(vnc, "acl");
|
|
|
|
g_assert_cmpint(qobject_type(child), ==, QTYPE_QDICT);
|
|
|
|
acl = qobject_to_qdict(child);
|
|
|
|
|
|
|
|
child = qdict_get(acl, "rules");
|
|
|
|
g_assert_cmpint(qobject_type(child), ==, QTYPE_QLIST);
|
|
|
|
rules = qobject_to_qlist(child);
|
|
|
|
g_assert_cmpint(qlist_size(rules), ==, 2);
|
|
|
|
|
|
|
|
rule = qobject_to_qdict(qlist_pop(rules));
|
|
|
|
g_assert_cmpint(qdict_size(rule), ==, 2);
|
|
|
|
g_assert_cmpstr("fred", ==, qdict_get_str(rule, "match"));
|
|
|
|
g_assert_cmpstr("allow", ==, qdict_get_str(rule, "policy"));
|
|
|
|
QDECREF(rule);
|
|
|
|
|
|
|
|
rule = qobject_to_qdict(qlist_pop(rules));
|
|
|
|
g_assert_cmpint(qdict_size(rule), ==, 2);
|
|
|
|
g_assert_cmpstr("bob", ==, qdict_get_str(rule, "match"));
|
|
|
|
g_assert_cmpstr("deny", ==, qdict_get_str(rule, "policy"));
|
|
|
|
QDECREF(rule);
|
|
|
|
|
|
|
|
/* With recursive crumpling, we should see all names unescaped */
|
|
|
|
g_assert_cmpstr("acl0", ==, qdict_get_str(vnc, "acl.name"));
|
|
|
|
child = qdict_get(vnc, "acl");
|
|
|
|
g_assert_cmpint(qobject_type(child), ==, QTYPE_QDICT);
|
|
|
|
acl = qdict_get_qdict(vnc, "acl");
|
|
|
|
g_assert_cmpstr("acl0", ==, qdict_get_str(acl, "rule.name"));
|
|
|
|
|
|
|
|
QDECREF(src);
|
|
|
|
QDECREF(dst);
|
|
|
|
}
|
|
|
|
|
|
|
|
static void qdict_crumple_test_empty(void)
|
|
|
|
{
|
|
|
|
QDict *src, *dst;
|
|
|
|
|
|
|
|
src = qdict_new();
|
|
|
|
|
|
|
|
dst = (QDict *)qdict_crumple(src, &error_abort);
|
|
|
|
|
|
|
|
g_assert_cmpint(qdict_size(dst), ==, 0);
|
|
|
|
|
|
|
|
QDECREF(src);
|
|
|
|
QDECREF(dst);
|
|
|
|
}
|
|
|
|
|
|
|
|
static void qdict_crumple_test_bad_inputs(void)
|
|
|
|
{
|
|
|
|
QDict *src;
|
|
|
|
Error *error = NULL;
|
|
|
|
|
|
|
|
src = qdict_new();
|
|
|
|
/* rule.0 can't be both a string and a dict */
|
|
|
|
qdict_put(src, "rule.0", qstring_from_str("fred"));
|
|
|
|
qdict_put(src, "rule.0.policy", qstring_from_str("allow"));
|
|
|
|
|
|
|
|
g_assert(qdict_crumple(src, &error) == NULL);
|
|
|
|
g_assert(error != NULL);
|
|
|
|
error_free(error);
|
|
|
|
error = NULL;
|
|
|
|
QDECREF(src);
|
|
|
|
|
|
|
|
src = qdict_new();
|
|
|
|
/* rule can't be both a list and a dict */
|
|
|
|
qdict_put(src, "rule.0", qstring_from_str("fred"));
|
|
|
|
qdict_put(src, "rule.a", qstring_from_str("allow"));
|
|
|
|
|
|
|
|
g_assert(qdict_crumple(src, &error) == NULL);
|
|
|
|
g_assert(error != NULL);
|
|
|
|
error_free(error);
|
|
|
|
error = NULL;
|
|
|
|
QDECREF(src);
|
|
|
|
|
|
|
|
src = qdict_new();
|
|
|
|
/* The input should be flat, ie no dicts or lists */
|
|
|
|
qdict_put(src, "rule.a", qdict_new());
|
|
|
|
qdict_put(src, "rule.b", qstring_from_str("allow"));
|
|
|
|
|
|
|
|
g_assert(qdict_crumple(src, &error) == NULL);
|
|
|
|
g_assert(error != NULL);
|
|
|
|
error_free(error);
|
|
|
|
error = NULL;
|
|
|
|
QDECREF(src);
|
|
|
|
|
|
|
|
src = qdict_new();
|
|
|
|
/* List indexes must not have gaps */
|
|
|
|
qdict_put(src, "rule.0", qstring_from_str("deny"));
|
|
|
|
qdict_put(src, "rule.3", qstring_from_str("allow"));
|
|
|
|
|
|
|
|
g_assert(qdict_crumple(src, &error) == NULL);
|
|
|
|
g_assert(error != NULL);
|
|
|
|
error_free(error);
|
|
|
|
error = NULL;
|
|
|
|
QDECREF(src);
|
|
|
|
|
|
|
|
src = qdict_new();
|
|
|
|
/* List indexes must be in %zu format */
|
|
|
|
qdict_put(src, "rule.0", qstring_from_str("deny"));
|
|
|
|
qdict_put(src, "rule.+1", qstring_from_str("allow"));
|
|
|
|
|
|
|
|
g_assert(qdict_crumple(src, &error) == NULL);
|
|
|
|
g_assert(error != NULL);
|
|
|
|
error_free(error);
|
|
|
|
error = NULL;
|
|
|
|
QDECREF(src);
|
|
|
|
}
|
|
|
|
|
2009-08-28 20:27:32 +02:00
|
|
|
/*
|
|
|
|
* Errors test-cases
|
|
|
|
*/
|
|
|
|
|
2012-01-10 20:10:44 +01:00
|
|
|
static void qdict_put_exists_test(void)
|
2009-08-28 20:27:32 +02:00
|
|
|
{
|
|
|
|
int value;
|
|
|
|
const char *key = "exists";
|
2012-01-10 20:10:44 +01:00
|
|
|
QDict *tests_dict = qdict_new();
|
2009-08-28 20:27:32 +02:00
|
|
|
|
|
|
|
qdict_put(tests_dict, key, qint_from_int(1));
|
|
|
|
qdict_put(tests_dict, key, qint_from_int(2));
|
|
|
|
|
|
|
|
value = qdict_get_int(tests_dict, key);
|
2012-01-10 20:10:44 +01:00
|
|
|
g_assert(value == 2);
|
2009-12-14 21:53:20 +01:00
|
|
|
|
2012-01-10 20:10:44 +01:00
|
|
|
g_assert(qdict_size(tests_dict) == 1);
|
|
|
|
|
|
|
|
QDECREF(tests_dict);
|
2009-08-28 20:27:32 +02:00
|
|
|
}
|
|
|
|
|
2012-01-10 20:10:44 +01:00
|
|
|
static void qdict_get_not_exists_test(void)
|
2009-08-28 20:27:32 +02:00
|
|
|
{
|
2012-01-10 20:10:44 +01:00
|
|
|
QDict *tests_dict = qdict_new();
|
|
|
|
g_assert(qdict_get(tests_dict, "foo") == NULL);
|
|
|
|
|
|
|
|
QDECREF(tests_dict);
|
2009-08-28 20:27:32 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Stress test-case
|
|
|
|
*
|
|
|
|
* This is a lot big for a unit-test, but there is no other place
|
|
|
|
* to have it.
|
|
|
|
*/
|
|
|
|
|
|
|
|
static void remove_dots(char *string)
|
|
|
|
{
|
|
|
|
char *p = strchr(string, ':');
|
|
|
|
if (p)
|
|
|
|
*p = '\0';
|
|
|
|
}
|
|
|
|
|
|
|
|
static QString *read_line(FILE *file, char *key)
|
|
|
|
{
|
|
|
|
char value[128];
|
|
|
|
|
2011-01-21 22:50:30 +01:00
|
|
|
if (fscanf(file, "%127s%127s", key, value) == EOF) {
|
2009-08-28 20:27:32 +02:00
|
|
|
return NULL;
|
2011-01-21 22:50:30 +01:00
|
|
|
}
|
2009-08-28 20:27:32 +02:00
|
|
|
remove_dots(key);
|
|
|
|
return qstring_from_str(value);
|
|
|
|
}
|
|
|
|
|
|
|
|
#define reset_file(file) fseek(file, 0L, SEEK_SET)
|
|
|
|
|
2012-01-10 20:10:44 +01:00
|
|
|
static void qdict_stress_test(void)
|
2009-08-28 20:27:32 +02:00
|
|
|
{
|
|
|
|
size_t lines;
|
|
|
|
char key[128];
|
|
|
|
FILE *test_file;
|
|
|
|
QDict *qdict;
|
|
|
|
QString *value;
|
|
|
|
const char *test_file_path = "qdict-test-data.txt";
|
|
|
|
|
|
|
|
test_file = fopen(test_file_path, "r");
|
2012-01-10 20:10:44 +01:00
|
|
|
g_assert(test_file != NULL);
|
2009-08-28 20:27:32 +02:00
|
|
|
|
|
|
|
// Create the dict
|
|
|
|
qdict = qdict_new();
|
2012-01-10 20:10:44 +01:00
|
|
|
g_assert(qdict != NULL);
|
2009-08-28 20:27:32 +02:00
|
|
|
|
|
|
|
// Add everything from the test file
|
|
|
|
for (lines = 0;; lines++) {
|
|
|
|
value = read_line(test_file, key);
|
|
|
|
if (!value)
|
|
|
|
break;
|
|
|
|
|
|
|
|
qdict_put(qdict, key, value);
|
|
|
|
}
|
2012-01-10 20:10:44 +01:00
|
|
|
g_assert(qdict_size(qdict) == lines);
|
2009-08-28 20:27:32 +02:00
|
|
|
|
|
|
|
// Check if everything is really in there
|
|
|
|
reset_file(test_file);
|
|
|
|
for (;;) {
|
|
|
|
const char *str1, *str2;
|
|
|
|
|
|
|
|
value = read_line(test_file, key);
|
|
|
|
if (!value)
|
|
|
|
break;
|
|
|
|
|
|
|
|
str1 = qstring_get_str(value);
|
|
|
|
|
|
|
|
str2 = qdict_get_str(qdict, key);
|
2012-01-10 20:10:44 +01:00
|
|
|
g_assert(str2 != NULL);
|
2009-08-28 20:27:32 +02:00
|
|
|
|
2012-01-10 20:10:44 +01:00
|
|
|
g_assert(strcmp(str1, str2) == 0);
|
2009-08-28 20:27:32 +02:00
|
|
|
|
|
|
|
QDECREF(value);
|
|
|
|
}
|
|
|
|
|
|
|
|
// Delete everything
|
|
|
|
reset_file(test_file);
|
|
|
|
for (;;) {
|
|
|
|
value = read_line(test_file, key);
|
|
|
|
if (!value)
|
|
|
|
break;
|
|
|
|
|
|
|
|
qdict_del(qdict, key);
|
|
|
|
QDECREF(value);
|
|
|
|
|
2012-01-10 20:10:44 +01:00
|
|
|
g_assert(qdict_haskey(qdict, key) == 0);
|
2009-08-28 20:27:32 +02:00
|
|
|
}
|
|
|
|
fclose(test_file);
|
|
|
|
|
2012-01-10 20:10:44 +01:00
|
|
|
g_assert(qdict_size(qdict) == 0);
|
2009-08-28 20:27:32 +02:00
|
|
|
QDECREF(qdict);
|
|
|
|
}
|
|
|
|
|
2012-01-10 20:10:44 +01:00
|
|
|
int main(int argc, char **argv)
|
2009-08-28 20:27:32 +02:00
|
|
|
{
|
2012-01-10 20:10:44 +01:00
|
|
|
g_test_init(&argc, &argv, NULL);
|
2009-08-28 20:27:32 +02:00
|
|
|
|
2012-01-10 20:10:44 +01:00
|
|
|
g_test_add_func("/public/new", qdict_new_test);
|
|
|
|
g_test_add_func("/public/put_obj", qdict_put_obj_test);
|
|
|
|
g_test_add_func("/public/destroy_simple", qdict_destroy_simple_test);
|
2009-08-28 20:27:32 +02:00
|
|
|
|
|
|
|
/* Continue, but now with fixtures */
|
2012-01-10 20:10:44 +01:00
|
|
|
g_test_add_func("/public/get", qdict_get_test);
|
|
|
|
g_test_add_func("/public/get_int", qdict_get_int_test);
|
|
|
|
g_test_add_func("/public/get_try_int", qdict_get_try_int_test);
|
|
|
|
g_test_add_func("/public/get_str", qdict_get_str_test);
|
|
|
|
g_test_add_func("/public/get_try_str", qdict_get_try_str_test);
|
2015-05-28 17:37:55 +02:00
|
|
|
g_test_add_func("/public/defaults", qdict_defaults_test);
|
2012-01-10 20:10:44 +01:00
|
|
|
g_test_add_func("/public/haskey_not", qdict_haskey_not_test);
|
|
|
|
g_test_add_func("/public/haskey", qdict_haskey_test);
|
|
|
|
g_test_add_func("/public/del", qdict_del_test);
|
|
|
|
g_test_add_func("/public/to_qdict", qobject_to_qdict_test);
|
|
|
|
g_test_add_func("/public/iterapi", qdict_iterapi_test);
|
2013-12-20 19:28:22 +01:00
|
|
|
g_test_add_func("/public/flatten", qdict_flatten_test);
|
2013-12-20 19:28:21 +01:00
|
|
|
g_test_add_func("/public/array_split", qdict_array_split_test);
|
2015-05-28 17:37:55 +02:00
|
|
|
g_test_add_func("/public/array_entries", qdict_array_entries_test);
|
2014-05-08 20:12:40 +02:00
|
|
|
g_test_add_func("/public/join", qdict_join_test);
|
2012-01-10 20:10:44 +01:00
|
|
|
|
|
|
|
g_test_add_func("/errors/put_exists", qdict_put_exists_test);
|
|
|
|
g_test_add_func("/errors/get_not_exists", qdict_get_not_exists_test);
|
2009-08-28 20:27:32 +02:00
|
|
|
|
qdict: implement a qdict_crumple method for un-flattening a dict
The qdict_flatten() method will take a dict whose elements are
further nested dicts/lists and flatten them by concatenating
keys.
The qdict_crumple() method aims to do the reverse, taking a flat
qdict, and turning it into a set of nested dicts/lists. It will
apply nesting based on the key name, with a '.' indicating a
new level in the hierarchy. If the keys in the nested structure
are all numeric, it will create a list, otherwise it will create
a dict.
If the keys are a mixture of numeric and non-numeric, or the
numeric keys are not in strictly ascending order, an error will
be reported.
As an example, a flat dict containing
{
'foo.0.bar': 'one',
'foo.0.wizz': '1',
'foo.1.bar': 'two',
'foo.1.wizz': '2'
}
will get turned into a dict with one element 'foo' whose
value is a list. The list elements will each in turn be
dicts.
{
'foo': [
{ 'bar': 'one', 'wizz': '1' },
{ 'bar': 'two', 'wizz': '2' }
],
}
If the key is intended to contain a literal '.', then it must
be escaped as '..'. ie a flat dict
{
'foo..bar': 'wizz',
'bar.foo..bar': 'eek',
'bar.hello': 'world'
}
Will end up as
{
'foo.bar': 'wizz',
'bar': {
'foo.bar': 'eek',
'hello': 'world'
}
}
The intent of this function is that it allows a set of QemuOpts
to be turned into a nested data structure that mirrors the nesting
used when the same object is defined over QMP.
Reviewed-by: Eric Blake <eblake@redhat.com>
Reviewed-by: Kevin Wolf <kwolf@redhat.com>
Reviewed-by: Marc-André Lureau <marcandre.lureau@redhat.com>
Signed-off-by: Daniel P. Berrange <berrange@redhat.com>
Message-Id: <1475246744-29302-3-git-send-email-berrange@redhat.com>
Reviewed-by: Markus Armbruster <armbru@redhat.com>
[Parameter recursive dropped along with its tests; whitespace style
touched up]
Signed-off-by: Markus Armbruster <armbru@redhat.com>
2016-09-30 16:45:25 +02:00
|
|
|
g_test_add_func("/public/crumple/recursive",
|
|
|
|
qdict_crumple_test_recursive);
|
|
|
|
g_test_add_func("/public/crumple/empty",
|
|
|
|
qdict_crumple_test_empty);
|
|
|
|
g_test_add_func("/public/crumple/bad_inputs",
|
|
|
|
qdict_crumple_test_bad_inputs);
|
|
|
|
|
2009-08-28 20:27:32 +02:00
|
|
|
/* The Big one */
|
2012-01-10 20:10:44 +01:00
|
|
|
if (g_test_slow()) {
|
|
|
|
g_test_add_func("/stress/test", qdict_stress_test);
|
|
|
|
}
|
2009-08-28 20:27:32 +02:00
|
|
|
|
2012-01-10 20:10:44 +01:00
|
|
|
return g_test_run();
|
2009-08-28 20:27:32 +02:00
|
|
|
}
|