2009-08-28 22:27:07 +04:00
|
|
|
/*
|
2010-05-12 23:34:42 +04:00
|
|
|
* QDict Module
|
2009-08-28 22:27:07 +04:00
|
|
|
*
|
|
|
|
* Copyright (C) 2009 Red Hat Inc.
|
|
|
|
*
|
|
|
|
* Authors:
|
|
|
|
* Luiz Capitulino <lcapitulino@redhat.com>
|
|
|
|
*
|
2010-05-12 23:34:42 +04: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 22:27:07 +04:00
|
|
|
*/
|
|
|
|
|
2012-12-17 21:19:43 +04:00
|
|
|
#include "qapi/qmp/qint.h"
|
|
|
|
#include "qapi/qmp/qfloat.h"
|
|
|
|
#include "qapi/qmp/qdict.h"
|
|
|
|
#include "qapi/qmp/qbool.h"
|
|
|
|
#include "qapi/qmp/qstring.h"
|
|
|
|
#include "qapi/qmp/qobject.h"
|
2012-12-17 21:20:00 +04:00
|
|
|
#include "qemu/queue.h"
|
2009-08-28 22:27:07 +04:00
|
|
|
#include "qemu-common.h"
|
|
|
|
|
2009-09-04 21:43:37 +04:00
|
|
|
static void qdict_destroy_obj(QObject *obj);
|
|
|
|
|
|
|
|
static const QType qdict_type = {
|
|
|
|
.code = QTYPE_QDICT,
|
|
|
|
.destroy = qdict_destroy_obj,
|
|
|
|
};
|
2009-08-28 22:27:07 +04:00
|
|
|
|
|
|
|
/**
|
|
|
|
* qdict_new(): Create a new QDict
|
|
|
|
*
|
|
|
|
* Return strong reference.
|
|
|
|
*/
|
|
|
|
QDict *qdict_new(void)
|
|
|
|
{
|
|
|
|
QDict *qdict;
|
|
|
|
|
2011-08-21 07:09:37 +04:00
|
|
|
qdict = g_malloc0(sizeof(*qdict));
|
2009-08-28 22:27:07 +04:00
|
|
|
QOBJECT_INIT(qdict, &qdict_type);
|
|
|
|
|
|
|
|
return qdict;
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* qobject_to_qdict(): Convert a QObject into a QDict
|
|
|
|
*/
|
|
|
|
QDict *qobject_to_qdict(const QObject *obj)
|
|
|
|
{
|
|
|
|
if (qobject_type(obj) != QTYPE_QDICT)
|
|
|
|
return NULL;
|
|
|
|
|
|
|
|
return container_of(obj, QDict, base);
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* tdb_hash(): based on the hash agorithm from gdbm, via tdb
|
|
|
|
* (from module-init-tools)
|
|
|
|
*/
|
|
|
|
static unsigned int tdb_hash(const char *name)
|
|
|
|
{
|
|
|
|
unsigned value; /* Used to compute the hash value. */
|
|
|
|
unsigned i; /* Used to cycle through random values. */
|
|
|
|
|
|
|
|
/* Set the initial value from the key size. */
|
|
|
|
for (value = 0x238F13AF * strlen(name), i=0; name[i]; i++)
|
|
|
|
value = (value + (((const unsigned char *)name)[i] << (i*5 % 24)));
|
|
|
|
|
|
|
|
return (1103515243 * value + 12345);
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* alloc_entry(): allocate a new QDictEntry
|
|
|
|
*/
|
|
|
|
static QDictEntry *alloc_entry(const char *key, QObject *value)
|
|
|
|
{
|
|
|
|
QDictEntry *entry;
|
|
|
|
|
2011-08-21 07:09:37 +04:00
|
|
|
entry = g_malloc0(sizeof(*entry));
|
|
|
|
entry->key = g_strdup(key);
|
2009-08-28 22:27:07 +04:00
|
|
|
entry->value = value;
|
|
|
|
|
|
|
|
return entry;
|
|
|
|
}
|
|
|
|
|
2010-06-07 23:53:51 +04:00
|
|
|
/**
|
|
|
|
* qdict_entry_value(): Return qdict entry value
|
|
|
|
*
|
|
|
|
* Return weak reference.
|
|
|
|
*/
|
|
|
|
QObject *qdict_entry_value(const QDictEntry *entry)
|
|
|
|
{
|
|
|
|
return entry->value;
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* qdict_entry_key(): Return qdict entry key
|
|
|
|
*
|
|
|
|
* Return a *pointer* to the string, it has to be duplicated before being
|
|
|
|
* stored.
|
|
|
|
*/
|
|
|
|
const char *qdict_entry_key(const QDictEntry *entry)
|
|
|
|
{
|
|
|
|
return entry->key;
|
|
|
|
}
|
|
|
|
|
2009-08-28 22:27:07 +04:00
|
|
|
/**
|
|
|
|
* qdict_find(): List lookup function
|
|
|
|
*/
|
|
|
|
static QDictEntry *qdict_find(const QDict *qdict,
|
2010-06-07 22:45:22 +04:00
|
|
|
const char *key, unsigned int bucket)
|
2009-08-28 22:27:07 +04:00
|
|
|
{
|
|
|
|
QDictEntry *entry;
|
|
|
|
|
2010-06-07 22:45:22 +04:00
|
|
|
QLIST_FOREACH(entry, &qdict->table[bucket], next)
|
2009-08-28 22:27:07 +04:00
|
|
|
if (!strcmp(entry->key, key))
|
|
|
|
return entry;
|
|
|
|
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* qdict_put_obj(): Put a new QObject into the dictionary
|
|
|
|
*
|
|
|
|
* Insert the pair 'key:value' into 'qdict', if 'key' already exists
|
|
|
|
* its 'value' will be replaced.
|
|
|
|
*
|
|
|
|
* This is done by freeing the reference to the stored QObject and
|
|
|
|
* storing the new one in the same entry.
|
|
|
|
*
|
|
|
|
* NOTE: ownership of 'value' is transferred to the QDict
|
|
|
|
*/
|
|
|
|
void qdict_put_obj(QDict *qdict, const char *key, QObject *value)
|
|
|
|
{
|
2010-06-07 22:45:22 +04:00
|
|
|
unsigned int bucket;
|
2009-08-28 22:27:07 +04:00
|
|
|
QDictEntry *entry;
|
|
|
|
|
2010-06-07 22:45:22 +04:00
|
|
|
bucket = tdb_hash(key) % QDICT_BUCKET_MAX;
|
|
|
|
entry = qdict_find(qdict, key, bucket);
|
2009-08-28 22:27:07 +04:00
|
|
|
if (entry) {
|
|
|
|
/* replace key's value */
|
|
|
|
qobject_decref(entry->value);
|
|
|
|
entry->value = value;
|
|
|
|
} else {
|
|
|
|
/* allocate a new entry */
|
|
|
|
entry = alloc_entry(key, value);
|
2010-06-07 22:45:22 +04:00
|
|
|
QLIST_INSERT_HEAD(&qdict->table[bucket], entry, next);
|
2009-12-14 23:53:20 +03:00
|
|
|
qdict->size++;
|
2009-08-28 22:27:07 +04:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* qdict_get(): Lookup for a given 'key'
|
|
|
|
*
|
|
|
|
* Return a weak reference to the QObject associated with 'key' if
|
|
|
|
* 'key' is present in the dictionary, NULL otherwise.
|
|
|
|
*/
|
|
|
|
QObject *qdict_get(const QDict *qdict, const char *key)
|
|
|
|
{
|
|
|
|
QDictEntry *entry;
|
|
|
|
|
2010-06-07 22:45:22 +04:00
|
|
|
entry = qdict_find(qdict, key, tdb_hash(key) % QDICT_BUCKET_MAX);
|
2009-08-28 22:27:07 +04:00
|
|
|
return (entry == NULL ? NULL : entry->value);
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* qdict_haskey(): Check if 'key' exists
|
|
|
|
*
|
|
|
|
* Return 1 if 'key' exists in the dict, 0 otherwise
|
|
|
|
*/
|
|
|
|
int qdict_haskey(const QDict *qdict, const char *key)
|
|
|
|
{
|
2010-06-07 22:45:22 +04:00
|
|
|
unsigned int bucket = tdb_hash(key) % QDICT_BUCKET_MAX;
|
|
|
|
return (qdict_find(qdict, key, bucket) == NULL ? 0 : 1);
|
2009-08-28 22:27:07 +04:00
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* qdict_size(): Return the size of the dictionary
|
|
|
|
*/
|
|
|
|
size_t qdict_size(const QDict *qdict)
|
|
|
|
{
|
|
|
|
return qdict->size;
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* qdict_get_obj(): Get a QObject of a specific type
|
|
|
|
*/
|
|
|
|
static QObject *qdict_get_obj(const QDict *qdict, const char *key,
|
|
|
|
qtype_code type)
|
|
|
|
{
|
|
|
|
QObject *obj;
|
|
|
|
|
|
|
|
obj = qdict_get(qdict, key);
|
|
|
|
assert(obj != NULL);
|
|
|
|
assert(qobject_type(obj) == type);
|
|
|
|
|
|
|
|
return obj;
|
|
|
|
}
|
|
|
|
|
2010-01-27 19:16:38 +03:00
|
|
|
/**
|
|
|
|
* qdict_get_double(): Get an number mapped by 'key'
|
|
|
|
*
|
|
|
|
* This function assumes that 'key' exists and it stores a
|
|
|
|
* QFloat or QInt object.
|
|
|
|
*
|
|
|
|
* Return number mapped by 'key'.
|
|
|
|
*/
|
|
|
|
double qdict_get_double(const QDict *qdict, const char *key)
|
|
|
|
{
|
|
|
|
QObject *obj = qdict_get(qdict, key);
|
|
|
|
|
|
|
|
assert(obj);
|
|
|
|
switch (qobject_type(obj)) {
|
|
|
|
case QTYPE_QFLOAT:
|
|
|
|
return qfloat_get_double(qobject_to_qfloat(obj));
|
|
|
|
case QTYPE_QINT:
|
|
|
|
return qint_get_int(qobject_to_qint(obj));
|
|
|
|
default:
|
2010-03-18 21:41:57 +03:00
|
|
|
abort();
|
2010-01-27 19:16:38 +03:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2009-08-28 22:27:07 +04:00
|
|
|
/**
|
|
|
|
* qdict_get_int(): Get an integer mapped by 'key'
|
|
|
|
*
|
|
|
|
* This function assumes that 'key' exists and it stores a
|
|
|
|
* QInt object.
|
|
|
|
*
|
|
|
|
* Return integer mapped by 'key'.
|
|
|
|
*/
|
|
|
|
int64_t qdict_get_int(const QDict *qdict, const char *key)
|
|
|
|
{
|
|
|
|
QObject *obj = qdict_get_obj(qdict, key, QTYPE_QINT);
|
|
|
|
return qint_get_int(qobject_to_qint(obj));
|
|
|
|
}
|
|
|
|
|
2009-12-10 22:15:53 +03:00
|
|
|
/**
|
|
|
|
* qdict_get_bool(): Get a bool mapped by 'key'
|
|
|
|
*
|
|
|
|
* This function assumes that 'key' exists and it stores a
|
|
|
|
* QBool object.
|
|
|
|
*
|
|
|
|
* Return bool mapped by 'key'.
|
|
|
|
*/
|
|
|
|
int qdict_get_bool(const QDict *qdict, const char *key)
|
|
|
|
{
|
|
|
|
QObject *obj = qdict_get_obj(qdict, key, QTYPE_QBOOL);
|
|
|
|
return qbool_get_int(qobject_to_qbool(obj));
|
|
|
|
}
|
|
|
|
|
2009-12-10 22:15:54 +03:00
|
|
|
/**
|
|
|
|
* qdict_get_qlist(): Get the QList mapped by 'key'
|
|
|
|
*
|
|
|
|
* This function assumes that 'key' exists and it stores a
|
|
|
|
* QList object.
|
|
|
|
*
|
|
|
|
* Return QList mapped by 'key'.
|
|
|
|
*/
|
|
|
|
QList *qdict_get_qlist(const QDict *qdict, const char *key)
|
|
|
|
{
|
|
|
|
return qobject_to_qlist(qdict_get_obj(qdict, key, QTYPE_QLIST));
|
|
|
|
}
|
|
|
|
|
2010-01-22 00:15:39 +03:00
|
|
|
/**
|
|
|
|
* qdict_get_qdict(): Get the QDict mapped by 'key'
|
|
|
|
*
|
|
|
|
* This function assumes that 'key' exists and it stores a
|
|
|
|
* QDict object.
|
|
|
|
*
|
|
|
|
* Return QDict mapped by 'key'.
|
|
|
|
*/
|
|
|
|
QDict *qdict_get_qdict(const QDict *qdict, const char *key)
|
|
|
|
{
|
|
|
|
return qobject_to_qdict(qdict_get_obj(qdict, key, QTYPE_QDICT));
|
|
|
|
}
|
|
|
|
|
2009-08-28 22:27:07 +04:00
|
|
|
/**
|
|
|
|
* qdict_get_str(): Get a pointer to the stored string mapped
|
|
|
|
* by 'key'
|
|
|
|
*
|
|
|
|
* This function assumes that 'key' exists and it stores a
|
|
|
|
* QString object.
|
|
|
|
*
|
|
|
|
* Return pointer to the string mapped by 'key'.
|
|
|
|
*/
|
|
|
|
const char *qdict_get_str(const QDict *qdict, const char *key)
|
|
|
|
{
|
|
|
|
QObject *obj = qdict_get_obj(qdict, key, QTYPE_QSTRING);
|
|
|
|
return qstring_get_str(qobject_to_qstring(obj));
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* qdict_get_try_int(): Try to get integer mapped by 'key'
|
|
|
|
*
|
|
|
|
* Return integer mapped by 'key', if it is not present in
|
|
|
|
* the dictionary or if the stored object is not of QInt type
|
2010-06-05 02:20:54 +04:00
|
|
|
* 'def_value' will be returned.
|
2009-08-28 22:27:07 +04:00
|
|
|
*/
|
|
|
|
int64_t qdict_get_try_int(const QDict *qdict, const char *key,
|
2010-06-05 02:20:54 +04:00
|
|
|
int64_t def_value)
|
2009-08-28 22:27:07 +04:00
|
|
|
{
|
|
|
|
QObject *obj;
|
|
|
|
|
|
|
|
obj = qdict_get(qdict, key);
|
|
|
|
if (!obj || qobject_type(obj) != QTYPE_QINT)
|
2010-06-05 02:20:54 +04:00
|
|
|
return def_value;
|
2009-08-28 22:27:07 +04:00
|
|
|
|
|
|
|
return qint_get_int(qobject_to_qint(obj));
|
|
|
|
}
|
|
|
|
|
2010-06-08 00:25:04 +04:00
|
|
|
/**
|
|
|
|
* qdict_get_try_bool(): Try to get a bool mapped by 'key'
|
|
|
|
*
|
|
|
|
* Return bool mapped by 'key', if it is not present in the
|
|
|
|
* dictionary or if the stored object is not of QBool type
|
|
|
|
* 'def_value' will be returned.
|
|
|
|
*/
|
|
|
|
int qdict_get_try_bool(const QDict *qdict, const char *key, int def_value)
|
|
|
|
{
|
|
|
|
QObject *obj;
|
|
|
|
|
|
|
|
obj = qdict_get(qdict, key);
|
|
|
|
if (!obj || qobject_type(obj) != QTYPE_QBOOL)
|
|
|
|
return def_value;
|
|
|
|
|
|
|
|
return qbool_get_int(qobject_to_qbool(obj));
|
|
|
|
}
|
|
|
|
|
2009-08-28 22:27:07 +04:00
|
|
|
/**
|
|
|
|
* qdict_get_try_str(): Try to get a pointer to the stored string
|
|
|
|
* mapped by 'key'
|
|
|
|
*
|
|
|
|
* Return a pointer to the string mapped by 'key', if it is not present
|
|
|
|
* in the dictionary or if the stored object is not of QString type
|
|
|
|
* NULL will be returned.
|
|
|
|
*/
|
|
|
|
const char *qdict_get_try_str(const QDict *qdict, const char *key)
|
|
|
|
{
|
|
|
|
QObject *obj;
|
|
|
|
|
|
|
|
obj = qdict_get(qdict, key);
|
|
|
|
if (!obj || qobject_type(obj) != QTYPE_QSTRING)
|
|
|
|
return NULL;
|
|
|
|
|
|
|
|
return qstring_get_str(qobject_to_qstring(obj));
|
|
|
|
}
|
|
|
|
|
2009-10-13 20:56:58 +04:00
|
|
|
/**
|
|
|
|
* qdict_iter(): Iterate over all the dictionary's stored values.
|
|
|
|
*
|
|
|
|
* This function allows the user to provide an iterator, which will be
|
|
|
|
* called for each stored value in the dictionary.
|
|
|
|
*/
|
|
|
|
void qdict_iter(const QDict *qdict,
|
|
|
|
void (*iter)(const char *key, QObject *obj, void *opaque),
|
|
|
|
void *opaque)
|
|
|
|
{
|
|
|
|
int i;
|
|
|
|
QDictEntry *entry;
|
|
|
|
|
2010-06-07 22:45:22 +04:00
|
|
|
for (i = 0; i < QDICT_BUCKET_MAX; i++) {
|
2009-10-13 20:56:58 +04:00
|
|
|
QLIST_FOREACH(entry, &qdict->table[i], next)
|
|
|
|
iter(entry->key, entry->value, opaque);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2010-06-07 23:07:29 +04:00
|
|
|
static QDictEntry *qdict_next_entry(const QDict *qdict, int first_bucket)
|
|
|
|
{
|
|
|
|
int i;
|
|
|
|
|
|
|
|
for (i = first_bucket; i < QDICT_BUCKET_MAX; i++) {
|
|
|
|
if (!QLIST_EMPTY(&qdict->table[i])) {
|
|
|
|
return QLIST_FIRST(&qdict->table[i]);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* qdict_first(): Return first qdict entry for iteration.
|
|
|
|
*/
|
|
|
|
const QDictEntry *qdict_first(const QDict *qdict)
|
|
|
|
{
|
|
|
|
return qdict_next_entry(qdict, 0);
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* qdict_next(): Return next qdict entry in an iteration.
|
|
|
|
*/
|
|
|
|
const QDictEntry *qdict_next(const QDict *qdict, const QDictEntry *entry)
|
|
|
|
{
|
|
|
|
QDictEntry *ret;
|
|
|
|
|
|
|
|
ret = QLIST_NEXT(entry, next);
|
|
|
|
if (!ret) {
|
|
|
|
unsigned int bucket = tdb_hash(entry->key) % QDICT_BUCKET_MAX;
|
|
|
|
ret = qdict_next_entry(qdict, bucket + 1);
|
|
|
|
}
|
|
|
|
|
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
|
2013-03-15 13:35:03 +04:00
|
|
|
/**
|
|
|
|
* qdict_clone_shallow(): Clones a given QDict. Its entries are not copied, but
|
|
|
|
* another reference is added.
|
|
|
|
*/
|
|
|
|
QDict *qdict_clone_shallow(const QDict *src)
|
|
|
|
{
|
|
|
|
QDict *dest;
|
|
|
|
QDictEntry *entry;
|
|
|
|
int i;
|
|
|
|
|
|
|
|
dest = qdict_new();
|
|
|
|
|
|
|
|
for (i = 0; i < QDICT_BUCKET_MAX; i++) {
|
|
|
|
QLIST_FOREACH(entry, &src->table[i], next) {
|
|
|
|
qobject_incref(entry->value);
|
|
|
|
qdict_put_obj(dest, entry->key, entry->value);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
return dest;
|
|
|
|
}
|
|
|
|
|
2009-08-28 22:27:07 +04:00
|
|
|
/**
|
|
|
|
* qentry_destroy(): Free all the memory allocated by a QDictEntry
|
|
|
|
*/
|
|
|
|
static void qentry_destroy(QDictEntry *e)
|
|
|
|
{
|
|
|
|
assert(e != NULL);
|
|
|
|
assert(e->key != NULL);
|
|
|
|
assert(e->value != NULL);
|
|
|
|
|
|
|
|
qobject_decref(e->value);
|
2011-08-21 07:09:37 +04:00
|
|
|
g_free(e->key);
|
|
|
|
g_free(e);
|
2009-08-28 22:27:07 +04:00
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* qdict_del(): Delete a 'key:value' pair from the dictionary
|
|
|
|
*
|
|
|
|
* This will destroy all data allocated by this entry.
|
|
|
|
*/
|
|
|
|
void qdict_del(QDict *qdict, const char *key)
|
|
|
|
{
|
|
|
|
QDictEntry *entry;
|
|
|
|
|
2010-06-07 22:45:22 +04:00
|
|
|
entry = qdict_find(qdict, key, tdb_hash(key) % QDICT_BUCKET_MAX);
|
2009-08-28 22:27:07 +04:00
|
|
|
if (entry) {
|
2009-09-12 11:36:22 +04:00
|
|
|
QLIST_REMOVE(entry, next);
|
2009-08-28 22:27:07 +04:00
|
|
|
qentry_destroy(entry);
|
|
|
|
qdict->size--;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* qdict_destroy_obj(): Free all the memory allocated by a QDict
|
|
|
|
*/
|
|
|
|
static void qdict_destroy_obj(QObject *obj)
|
|
|
|
{
|
|
|
|
int i;
|
|
|
|
QDict *qdict;
|
|
|
|
|
|
|
|
assert(obj != NULL);
|
|
|
|
qdict = qobject_to_qdict(obj);
|
|
|
|
|
2010-06-07 22:45:22 +04:00
|
|
|
for (i = 0; i < QDICT_BUCKET_MAX; i++) {
|
2009-09-12 11:36:22 +04:00
|
|
|
QDictEntry *entry = QLIST_FIRST(&qdict->table[i]);
|
2009-08-28 22:27:07 +04:00
|
|
|
while (entry) {
|
2009-09-12 11:36:22 +04:00
|
|
|
QDictEntry *tmp = QLIST_NEXT(entry, next);
|
|
|
|
QLIST_REMOVE(entry, next);
|
2009-08-28 22:27:07 +04:00
|
|
|
qentry_destroy(entry);
|
|
|
|
entry = tmp;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2011-08-21 07:09:37 +04:00
|
|
|
g_free(qdict);
|
2009-08-28 22:27:07 +04:00
|
|
|
}
|
2013-07-08 19:11:58 +04:00
|
|
|
|
|
|
|
static void qdict_do_flatten(QDict *qdict, QDict *target, const char *prefix)
|
|
|
|
{
|
|
|
|
QObject *value;
|
|
|
|
const QDictEntry *entry, *next;
|
2013-11-20 16:09:20 +04:00
|
|
|
char *new_key;
|
2013-07-08 19:11:58 +04:00
|
|
|
bool delete;
|
|
|
|
|
|
|
|
entry = qdict_first(qdict);
|
|
|
|
|
|
|
|
while (entry != NULL) {
|
|
|
|
|
|
|
|
next = qdict_next(qdict, entry);
|
|
|
|
value = qdict_entry_value(entry);
|
|
|
|
new_key = NULL;
|
|
|
|
delete = false;
|
|
|
|
|
|
|
|
if (prefix) {
|
|
|
|
new_key = g_strdup_printf("%s.%s", prefix, entry->key);
|
|
|
|
}
|
|
|
|
|
|
|
|
if (qobject_type(value) == QTYPE_QDICT) {
|
2013-11-20 16:09:21 +04:00
|
|
|
/* Entries of QDicts are processed recursively, the QDict object
|
|
|
|
* itself disappears. */
|
2013-07-08 19:11:58 +04:00
|
|
|
qdict_do_flatten(qobject_to_qdict(value), target,
|
|
|
|
new_key ? new_key : entry->key);
|
|
|
|
delete = true;
|
2013-11-20 16:09:21 +04:00
|
|
|
} else if (prefix) {
|
|
|
|
/* All other objects are moved to the target unchanged. */
|
|
|
|
qobject_incref(value);
|
|
|
|
qdict_put_obj(target, new_key, value);
|
|
|
|
delete = true;
|
2013-07-08 19:11:58 +04:00
|
|
|
}
|
|
|
|
|
2013-11-20 16:09:20 +04:00
|
|
|
g_free(new_key);
|
|
|
|
|
2013-07-08 19:11:58 +04:00
|
|
|
if (delete) {
|
|
|
|
qdict_del(qdict, entry->key);
|
|
|
|
|
|
|
|
/* Restart loop after modifying the iterated QDict */
|
|
|
|
entry = qdict_first(qdict);
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
|
|
|
|
entry = next;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* qdict_flatten(): For each nested QDict with key x, all fields with key y
|
|
|
|
* are moved to this QDict and their key is renamed to "x.y". This operation
|
|
|
|
* is applied recursively for nested QDicts.
|
|
|
|
*/
|
|
|
|
void qdict_flatten(QDict *qdict)
|
|
|
|
{
|
|
|
|
qdict_do_flatten(qdict, qdict, NULL);
|
|
|
|
}
|
2013-09-25 15:30:01 +04:00
|
|
|
|
|
|
|
/* extract all the src QDict entries starting by start into dst */
|
|
|
|
void qdict_extract_subqdict(QDict *src, QDict **dst, const char *start)
|
|
|
|
|
|
|
|
{
|
|
|
|
const QDictEntry *entry, *next;
|
|
|
|
const char *p;
|
|
|
|
|
|
|
|
*dst = qdict_new();
|
|
|
|
entry = qdict_first(src);
|
|
|
|
|
|
|
|
while (entry != NULL) {
|
|
|
|
next = qdict_next(src, entry);
|
|
|
|
if (strstart(entry->key, start, &p)) {
|
|
|
|
qobject_incref(entry->value);
|
|
|
|
qdict_put_obj(*dst, p, entry->value);
|
|
|
|
qdict_del(src, entry->key);
|
|
|
|
}
|
|
|
|
entry = next;
|
|
|
|
}
|
|
|
|
}
|