2011-07-19 21:50:40 +02:00
|
|
|
#
|
|
|
|
# QAPI types generator
|
|
|
|
#
|
|
|
|
# Copyright IBM, Corp. 2011
|
|
|
|
#
|
|
|
|
# Authors:
|
|
|
|
# Anthony Liguori <aliguori@us.ibm.com>
|
|
|
|
#
|
2014-03-01 08:40:34 +01:00
|
|
|
# This work is licensed under the terms of the GNU GPL, version 2.
|
|
|
|
# See the COPYING file in the top-level directory.
|
2011-07-19 21:50:40 +02:00
|
|
|
|
|
|
|
from ordereddict import OrderedDict
|
|
|
|
from qapi import *
|
|
|
|
|
2013-05-11 00:46:00 +02:00
|
|
|
def generate_fwd_struct(name, members, builtin_type=False):
|
|
|
|
if builtin_type:
|
|
|
|
return mcgen('''
|
|
|
|
|
|
|
|
typedef struct %(name)sList
|
|
|
|
{
|
2013-05-27 05:20:58 +02:00
|
|
|
union {
|
|
|
|
%(type)s value;
|
|
|
|
uint64_t padding;
|
|
|
|
};
|
2013-05-11 00:46:00 +02:00
|
|
|
struct %(name)sList *next;
|
|
|
|
} %(name)sList;
|
|
|
|
''',
|
|
|
|
type=c_type(name),
|
|
|
|
name=name)
|
|
|
|
|
2011-07-19 21:50:40 +02:00
|
|
|
return mcgen('''
|
2013-05-11 00:46:00 +02:00
|
|
|
|
2011-07-19 21:50:40 +02:00
|
|
|
typedef struct %(name)s %(name)s;
|
|
|
|
|
|
|
|
typedef struct %(name)sList
|
|
|
|
{
|
2013-05-27 05:20:58 +02:00
|
|
|
union {
|
|
|
|
%(name)s *value;
|
|
|
|
uint64_t padding;
|
|
|
|
};
|
2011-07-19 21:50:40 +02:00
|
|
|
struct %(name)sList *next;
|
|
|
|
} %(name)sList;
|
|
|
|
''',
|
2015-05-14 14:50:57 +02:00
|
|
|
name=c_name(name))
|
2011-07-19 21:50:40 +02:00
|
|
|
|
qapi: generate list struct and visit_list for enum
Currently, if we define an 'enum' and use it in one command's
data, list struct for enum could not be generated, but it's
used in qmp function.
For example: KeyCodesList could not be generated.
>>> qapi-schema.json:
{ 'enum': 'KeyCodes',
'data': [ 'shift', 'alt' ... ] }
{ 'command': 'sendkey',
'data': { 'keys': ['KeyCodes'], '*hold-time': 'int' } }
>>> qmp-command.h:
void qmp_sendkey(KeyCodesList * keys, bool has_hold_time, int64_t
hold_time, Error **errp);
This patch lets qapi generate list struct and visit_list for enum.
Signed-off-by: Amos Kong <akong@redhat.com>
Signed-off-by: Luiz Capitulino <lcapitulino@redhat.com>
2012-08-31 04:56:23 +02:00
|
|
|
def generate_fwd_enum_struct(name, members):
|
|
|
|
return mcgen('''
|
|
|
|
typedef struct %(name)sList
|
|
|
|
{
|
2013-09-01 00:36:17 +02:00
|
|
|
union {
|
|
|
|
%(name)s value;
|
|
|
|
uint64_t padding;
|
|
|
|
};
|
qapi: generate list struct and visit_list for enum
Currently, if we define an 'enum' and use it in one command's
data, list struct for enum could not be generated, but it's
used in qmp function.
For example: KeyCodesList could not be generated.
>>> qapi-schema.json:
{ 'enum': 'KeyCodes',
'data': [ 'shift', 'alt' ... ] }
{ 'command': 'sendkey',
'data': { 'keys': ['KeyCodes'], '*hold-time': 'int' } }
>>> qmp-command.h:
void qmp_sendkey(KeyCodesList * keys, bool has_hold_time, int64_t
hold_time, Error **errp);
This patch lets qapi generate list struct and visit_list for enum.
Signed-off-by: Amos Kong <akong@redhat.com>
Signed-off-by: Luiz Capitulino <lcapitulino@redhat.com>
2012-08-31 04:56:23 +02:00
|
|
|
struct %(name)sList *next;
|
|
|
|
} %(name)sList;
|
|
|
|
''',
|
2015-05-14 14:50:56 +02:00
|
|
|
name=c_name(name))
|
qapi: generate list struct and visit_list for enum
Currently, if we define an 'enum' and use it in one command's
data, list struct for enum could not be generated, but it's
used in qmp function.
For example: KeyCodesList could not be generated.
>>> qapi-schema.json:
{ 'enum': 'KeyCodes',
'data': [ 'shift', 'alt' ... ] }
{ 'command': 'sendkey',
'data': { 'keys': ['KeyCodes'], '*hold-time': 'int' } }
>>> qmp-command.h:
void qmp_sendkey(KeyCodesList * keys, bool has_hold_time, int64_t
hold_time, Error **errp);
This patch lets qapi generate list struct and visit_list for enum.
Signed-off-by: Amos Kong <akong@redhat.com>
Signed-off-by: Luiz Capitulino <lcapitulino@redhat.com>
2012-08-31 04:56:23 +02:00
|
|
|
|
2013-07-02 12:18:18 +02:00
|
|
|
def generate_struct_fields(members):
|
|
|
|
ret = ''
|
2011-07-19 21:50:40 +02:00
|
|
|
|
2015-05-04 17:05:33 +02:00
|
|
|
for argname, argentry, optional in parse_args(members):
|
2011-07-19 21:50:40 +02:00
|
|
|
if optional:
|
|
|
|
ret += mcgen('''
|
|
|
|
bool has_%(c_name)s;
|
|
|
|
''',
|
2015-05-14 14:50:48 +02:00
|
|
|
c_name=c_name(argname))
|
2015-05-04 17:05:33 +02:00
|
|
|
ret += mcgen('''
|
2011-07-19 21:50:40 +02:00
|
|
|
%(c_type)s %(c_name)s;
|
|
|
|
''',
|
2015-05-14 14:50:48 +02:00
|
|
|
c_type=c_type(argentry), c_name=c_name(argname))
|
2011-07-19 21:50:40 +02:00
|
|
|
|
2013-07-02 12:18:18 +02:00
|
|
|
return ret
|
|
|
|
|
2013-09-18 17:22:02 +02:00
|
|
|
def generate_struct(expr):
|
|
|
|
|
2015-05-04 17:05:25 +02:00
|
|
|
structname = expr.get('struct', "")
|
2013-09-18 17:22:02 +02:00
|
|
|
fieldname = expr.get('field', "")
|
|
|
|
members = expr['data']
|
2013-09-19 11:56:36 +02:00
|
|
|
base = expr.get('base')
|
2013-09-18 17:22:02 +02:00
|
|
|
|
2013-07-02 12:18:18 +02:00
|
|
|
ret = mcgen('''
|
|
|
|
struct %(name)s
|
|
|
|
{
|
|
|
|
''',
|
2015-05-14 14:50:57 +02:00
|
|
|
name=c_name(structname))
|
2013-07-02 12:18:18 +02:00
|
|
|
|
2013-09-19 11:56:36 +02:00
|
|
|
if base:
|
|
|
|
ret += generate_struct_fields({'base': base})
|
|
|
|
|
2013-07-02 12:18:18 +02:00
|
|
|
ret += generate_struct_fields(members)
|
|
|
|
|
2015-01-20 16:19:32 +01:00
|
|
|
# Make sure that all structs have at least one field; this avoids
|
|
|
|
# potential issues with attempting to malloc space for zero-length structs
|
|
|
|
# in C, and also incompatibility with C++ (where an empty struct is size 1).
|
|
|
|
if not base and not members:
|
|
|
|
ret += mcgen('''
|
|
|
|
char qapi_dummy_field_for_empty_struct;
|
|
|
|
''')
|
|
|
|
|
2011-07-19 21:50:40 +02:00
|
|
|
if len(fieldname):
|
|
|
|
fieldname = " " + fieldname
|
|
|
|
ret += mcgen('''
|
|
|
|
}%(field)s;
|
|
|
|
''',
|
|
|
|
field=fieldname)
|
|
|
|
|
|
|
|
return ret
|
|
|
|
|
|
|
|
def generate_enum_lookup(name, values):
|
|
|
|
ret = mcgen('''
|
|
|
|
const char *%(name)s_lookup[] = {
|
|
|
|
''',
|
2015-05-14 14:50:56 +02:00
|
|
|
name=c_name(name))
|
2011-07-19 21:50:40 +02:00
|
|
|
i = 0
|
|
|
|
for value in values:
|
2015-05-14 14:50:50 +02:00
|
|
|
index = c_enum_const(name, value)
|
2011-07-19 21:50:40 +02:00
|
|
|
ret += mcgen('''
|
qapi-types: add C99 index names to arrays
It's not easy to figure out how monitor translates
strings: most QEMU code deals with translated indexes,
these are translated using _lookup arrays,
so you need to find the array name, and find the
appropriate offset.
This patch adds C99 indexes to lookup arrays, which makes it possible to
find the correct key using simple grep, and see that the matching is
correct at a glance.
Example:
Before:
const char *MigrationCapability_lookup[] = {
"xbzrle",
"rdma-pin-all",
"auto-converge",
"zero-blocks",
NULL,
};
After:
const char *MigrationCapability_lookup[] = {
[MIGRATION_CAPABILITY_XBZRLE] = "xbzrle",
[MIGRATION_CAPABILITY_RDMA_PIN_ALL] = "rdma-pin-all",
[MIGRATION_CAPABILITY_AUTO_CONVERGE] = "auto-converge",
[MIGRATION_CAPABILITY_ZERO_BLOCKS] = "zero-blocks",
[MIGRATION_CAPABILITY_MAX] = NULL,
};
Signed-off-by: Michael S. Tsirkin <mst@redhat.com>
Reviewed-by: Eric Blake <eblake@redhat.com>
Signed-off-by: Luiz Capitulino <lcapitulino@redhat.com>
2015-02-19 11:13:10 +01:00
|
|
|
[%(index)s] = "%(value)s",
|
2011-07-19 21:50:40 +02:00
|
|
|
''',
|
qapi-types: add C99 index names to arrays
It's not easy to figure out how monitor translates
strings: most QEMU code deals with translated indexes,
these are translated using _lookup arrays,
so you need to find the array name, and find the
appropriate offset.
This patch adds C99 indexes to lookup arrays, which makes it possible to
find the correct key using simple grep, and see that the matching is
correct at a glance.
Example:
Before:
const char *MigrationCapability_lookup[] = {
"xbzrle",
"rdma-pin-all",
"auto-converge",
"zero-blocks",
NULL,
};
After:
const char *MigrationCapability_lookup[] = {
[MIGRATION_CAPABILITY_XBZRLE] = "xbzrle",
[MIGRATION_CAPABILITY_RDMA_PIN_ALL] = "rdma-pin-all",
[MIGRATION_CAPABILITY_AUTO_CONVERGE] = "auto-converge",
[MIGRATION_CAPABILITY_ZERO_BLOCKS] = "zero-blocks",
[MIGRATION_CAPABILITY_MAX] = NULL,
};
Signed-off-by: Michael S. Tsirkin <mst@redhat.com>
Reviewed-by: Eric Blake <eblake@redhat.com>
Signed-off-by: Luiz Capitulino <lcapitulino@redhat.com>
2015-02-19 11:13:10 +01:00
|
|
|
index = index, value = value)
|
2011-07-19 21:50:40 +02:00
|
|
|
|
2015-05-14 14:50:50 +02:00
|
|
|
max_index = c_enum_const(name, 'MAX')
|
2011-07-19 21:50:40 +02:00
|
|
|
ret += mcgen('''
|
qapi-types: add C99 index names to arrays
It's not easy to figure out how monitor translates
strings: most QEMU code deals with translated indexes,
these are translated using _lookup arrays,
so you need to find the array name, and find the
appropriate offset.
This patch adds C99 indexes to lookup arrays, which makes it possible to
find the correct key using simple grep, and see that the matching is
correct at a glance.
Example:
Before:
const char *MigrationCapability_lookup[] = {
"xbzrle",
"rdma-pin-all",
"auto-converge",
"zero-blocks",
NULL,
};
After:
const char *MigrationCapability_lookup[] = {
[MIGRATION_CAPABILITY_XBZRLE] = "xbzrle",
[MIGRATION_CAPABILITY_RDMA_PIN_ALL] = "rdma-pin-all",
[MIGRATION_CAPABILITY_AUTO_CONVERGE] = "auto-converge",
[MIGRATION_CAPABILITY_ZERO_BLOCKS] = "zero-blocks",
[MIGRATION_CAPABILITY_MAX] = NULL,
};
Signed-off-by: Michael S. Tsirkin <mst@redhat.com>
Reviewed-by: Eric Blake <eblake@redhat.com>
Signed-off-by: Luiz Capitulino <lcapitulino@redhat.com>
2015-02-19 11:13:10 +01:00
|
|
|
[%(max_index)s] = NULL,
|
2011-07-19 21:50:40 +02:00
|
|
|
};
|
|
|
|
|
qapi-types: add C99 index names to arrays
It's not easy to figure out how monitor translates
strings: most QEMU code deals with translated indexes,
these are translated using _lookup arrays,
so you need to find the array name, and find the
appropriate offset.
This patch adds C99 indexes to lookup arrays, which makes it possible to
find the correct key using simple grep, and see that the matching is
correct at a glance.
Example:
Before:
const char *MigrationCapability_lookup[] = {
"xbzrle",
"rdma-pin-all",
"auto-converge",
"zero-blocks",
NULL,
};
After:
const char *MigrationCapability_lookup[] = {
[MIGRATION_CAPABILITY_XBZRLE] = "xbzrle",
[MIGRATION_CAPABILITY_RDMA_PIN_ALL] = "rdma-pin-all",
[MIGRATION_CAPABILITY_AUTO_CONVERGE] = "auto-converge",
[MIGRATION_CAPABILITY_ZERO_BLOCKS] = "zero-blocks",
[MIGRATION_CAPABILITY_MAX] = NULL,
};
Signed-off-by: Michael S. Tsirkin <mst@redhat.com>
Reviewed-by: Eric Blake <eblake@redhat.com>
Signed-off-by: Luiz Capitulino <lcapitulino@redhat.com>
2015-02-19 11:13:10 +01:00
|
|
|
''',
|
|
|
|
max_index=max_index)
|
2011-07-19 21:50:40 +02:00
|
|
|
return ret
|
|
|
|
|
|
|
|
def generate_enum(name, values):
|
2015-05-14 14:50:56 +02:00
|
|
|
name = c_name(name)
|
2011-07-19 21:50:40 +02:00
|
|
|
lookup_decl = mcgen('''
|
|
|
|
extern const char *%(name)s_lookup[];
|
|
|
|
''',
|
|
|
|
name=name)
|
|
|
|
|
|
|
|
enum_decl = mcgen('''
|
|
|
|
typedef enum %(name)s
|
|
|
|
{
|
|
|
|
''',
|
|
|
|
name=name)
|
|
|
|
|
2011-09-30 17:43:27 +02:00
|
|
|
# append automatically generated _MAX value
|
|
|
|
enum_values = values + [ 'MAX' ]
|
|
|
|
|
2011-07-19 21:50:40 +02:00
|
|
|
i = 0
|
2011-09-30 17:43:27 +02:00
|
|
|
for value in enum_values:
|
2015-05-14 14:50:50 +02:00
|
|
|
enum_full_value = c_enum_const(name, value)
|
2011-07-19 21:50:40 +02:00
|
|
|
enum_decl += mcgen('''
|
2014-03-05 03:44:36 +01:00
|
|
|
%(enum_full_value)s = %(i)d,
|
2011-07-19 21:50:40 +02:00
|
|
|
''',
|
2014-03-05 03:44:36 +01:00
|
|
|
enum_full_value = enum_full_value,
|
2011-07-19 21:50:40 +02:00
|
|
|
i=i)
|
|
|
|
i += 1
|
|
|
|
|
|
|
|
enum_decl += mcgen('''
|
|
|
|
} %(name)s;
|
|
|
|
''',
|
|
|
|
name=name)
|
|
|
|
|
|
|
|
return lookup_decl + enum_decl
|
|
|
|
|
2015-05-04 17:05:10 +02:00
|
|
|
def generate_alternate_qtypes(expr):
|
2013-07-08 16:14:21 +02:00
|
|
|
|
2015-05-04 17:05:13 +02:00
|
|
|
name = expr['alternate']
|
2013-07-08 16:14:21 +02:00
|
|
|
members = expr['data']
|
|
|
|
|
|
|
|
ret = mcgen('''
|
|
|
|
const int %(name)s_qtypes[QTYPE_MAX] = {
|
|
|
|
''',
|
2015-05-14 14:51:00 +02:00
|
|
|
name=c_name(name))
|
2013-07-08 16:14:21 +02:00
|
|
|
|
|
|
|
for key in members:
|
2015-05-04 17:05:10 +02:00
|
|
|
qtype = find_alternate_member_qtype(members[key])
|
2015-05-04 17:05:13 +02:00
|
|
|
assert qtype, "Invalid alternate member"
|
2013-07-08 16:14:21 +02:00
|
|
|
|
|
|
|
ret += mcgen('''
|
2015-05-14 14:51:00 +02:00
|
|
|
[%(qtype)s] = %(enum_const)s,
|
2013-07-08 16:14:21 +02:00
|
|
|
''',
|
2015-05-14 14:51:00 +02:00
|
|
|
qtype = qtype,
|
|
|
|
enum_const = c_enum_const(name + 'Kind', key))
|
2013-07-08 16:14:21 +02:00
|
|
|
|
|
|
|
ret += mcgen('''
|
|
|
|
};
|
|
|
|
''')
|
|
|
|
return ret
|
|
|
|
|
|
|
|
|
2015-05-04 17:05:13 +02:00
|
|
|
def generate_union(expr, meta):
|
2013-07-02 12:18:47 +02:00
|
|
|
|
2015-05-14 14:50:58 +02:00
|
|
|
name = c_name(expr[meta])
|
2013-07-02 12:18:47 +02:00
|
|
|
typeinfo = expr['data']
|
2013-07-03 15:58:57 +02:00
|
|
|
|
2013-07-02 12:18:47 +02:00
|
|
|
base = expr.get('base')
|
2013-07-03 15:58:57 +02:00
|
|
|
discriminator = expr.get('discriminator')
|
2013-07-02 12:18:47 +02:00
|
|
|
|
2014-03-07 02:08:56 +01:00
|
|
|
enum_define = discriminator_find_enum_define(expr)
|
|
|
|
if enum_define:
|
|
|
|
discriminator_type_name = enum_define['enum_name']
|
|
|
|
else:
|
|
|
|
discriminator_type_name = '%sKind' % (name)
|
|
|
|
|
2011-07-19 21:50:40 +02:00
|
|
|
ret = mcgen('''
|
|
|
|
struct %(name)s
|
|
|
|
{
|
2014-03-07 02:08:56 +01:00
|
|
|
%(discriminator_type_name)s kind;
|
2011-07-19 21:50:40 +02:00
|
|
|
union {
|
2012-03-06 18:55:56 +01:00
|
|
|
void *data;
|
2011-07-19 21:50:40 +02:00
|
|
|
''',
|
2014-03-07 02:08:56 +01:00
|
|
|
name=name,
|
2015-05-14 14:50:59 +02:00
|
|
|
discriminator_type_name=c_name(discriminator_type_name))
|
2011-07-19 21:50:40 +02:00
|
|
|
|
|
|
|
for key in typeinfo:
|
|
|
|
ret += mcgen('''
|
|
|
|
%(c_type)s %(c_name)s;
|
|
|
|
''',
|
|
|
|
c_type=c_type(typeinfo[key]),
|
2015-05-14 14:50:48 +02:00
|
|
|
c_name=c_name(key))
|
2011-07-19 21:50:40 +02:00
|
|
|
|
|
|
|
ret += mcgen('''
|
|
|
|
};
|
2013-07-02 12:18:47 +02:00
|
|
|
''')
|
|
|
|
|
|
|
|
if base:
|
2015-05-04 17:05:07 +02:00
|
|
|
assert discriminator
|
|
|
|
base_fields = find_struct(base)['data'].copy()
|
|
|
|
del base_fields[discriminator]
|
2013-07-03 15:58:57 +02:00
|
|
|
ret += generate_struct_fields(base_fields)
|
|
|
|
else:
|
|
|
|
assert not discriminator
|
2013-07-02 12:18:47 +02:00
|
|
|
|
|
|
|
ret += mcgen('''
|
2011-07-19 21:50:40 +02:00
|
|
|
};
|
|
|
|
''')
|
2015-05-04 17:05:13 +02:00
|
|
|
if meta == 'alternate':
|
2013-07-08 16:14:21 +02:00
|
|
|
ret += mcgen('''
|
|
|
|
extern const int %(name)s_qtypes[];
|
|
|
|
''',
|
|
|
|
name=name)
|
|
|
|
|
2011-07-19 21:50:40 +02:00
|
|
|
|
|
|
|
return ret
|
|
|
|
|
|
|
|
def generate_type_cleanup_decl(name):
|
|
|
|
ret = mcgen('''
|
2015-05-14 14:50:56 +02:00
|
|
|
void qapi_free_%(name)s(%(c_type)s obj);
|
2011-07-19 21:50:40 +02:00
|
|
|
''',
|
2015-05-14 14:50:56 +02:00
|
|
|
c_type=c_type(name), name=c_name(name))
|
2011-07-19 21:50:40 +02:00
|
|
|
return ret
|
|
|
|
|
|
|
|
def generate_type_cleanup(name):
|
|
|
|
ret = mcgen('''
|
2013-05-11 00:46:00 +02:00
|
|
|
|
2015-05-14 14:50:56 +02:00
|
|
|
void qapi_free_%(name)s(%(c_type)s obj)
|
2011-07-19 21:50:40 +02:00
|
|
|
{
|
|
|
|
QapiDeallocVisitor *md;
|
|
|
|
Visitor *v;
|
|
|
|
|
|
|
|
if (!obj) {
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
|
|
|
md = qapi_dealloc_visitor_new();
|
|
|
|
v = qapi_dealloc_get_visitor(md);
|
2015-05-14 14:50:56 +02:00
|
|
|
visit_type_%(name)s(v, &obj, NULL, NULL);
|
2011-07-19 21:50:40 +02:00
|
|
|
qapi_dealloc_visitor_cleanup(md);
|
|
|
|
}
|
|
|
|
''',
|
2015-05-14 14:50:56 +02:00
|
|
|
c_type=c_type(name), name=c_name(name))
|
2011-07-19 21:50:40 +02:00
|
|
|
return ret
|
|
|
|
|
2013-05-11 00:46:00 +02:00
|
|
|
do_builtins = False
|
2011-12-27 15:02:16 +01:00
|
|
|
|
2015-04-02 13:12:21 +02:00
|
|
|
(input_file, output_dir, do_c, do_h, prefix, opts) = \
|
|
|
|
parse_command_line("b", ["builtins"])
|
|
|
|
|
2011-07-19 21:50:40 +02:00
|
|
|
for o, a in opts:
|
2015-04-02 13:12:21 +02:00
|
|
|
if o in ("-b", "--builtins"):
|
2013-05-11 00:46:00 +02:00
|
|
|
do_builtins = True
|
2011-12-27 15:02:16 +01:00
|
|
|
|
2015-04-02 14:46:39 +02:00
|
|
|
c_comment = '''
|
2011-07-19 21:50:40 +02:00
|
|
|
/*
|
|
|
|
* deallocation functions for schema-defined QAPI types
|
|
|
|
*
|
|
|
|
* Copyright IBM, Corp. 2011
|
|
|
|
*
|
|
|
|
* Authors:
|
|
|
|
* Anthony Liguori <aliguori@us.ibm.com>
|
|
|
|
* Michael Roth <mdroth@linux.vnet.ibm.com>
|
|
|
|
*
|
|
|
|
* 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.
|
|
|
|
*
|
|
|
|
*/
|
2015-04-02 14:46:39 +02:00
|
|
|
'''
|
|
|
|
h_comment = '''
|
2011-07-19 21:50:40 +02:00
|
|
|
/*
|
|
|
|
* schema-defined QAPI types
|
|
|
|
*
|
|
|
|
* Copyright IBM, Corp. 2011
|
|
|
|
*
|
|
|
|
* Authors:
|
|
|
|
* Anthony Liguori <aliguori@us.ibm.com>
|
|
|
|
*
|
|
|
|
* 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.
|
|
|
|
*
|
|
|
|
*/
|
2015-04-02 14:46:39 +02:00
|
|
|
'''
|
2011-07-19 21:50:40 +02:00
|
|
|
|
2015-04-02 14:46:39 +02:00
|
|
|
(fdef, fdecl) = open_output(output_dir, do_c, do_h, prefix,
|
|
|
|
'qapi-types.c', 'qapi-types.h',
|
|
|
|
c_comment, h_comment)
|
2011-07-19 21:50:40 +02:00
|
|
|
|
2015-04-02 14:46:39 +02:00
|
|
|
fdef.write(mcgen('''
|
|
|
|
#include "qapi/dealloc-visitor.h"
|
|
|
|
#include "%(prefix)sqapi-types.h"
|
|
|
|
#include "%(prefix)sqapi-visit.h"
|
|
|
|
|
|
|
|
''',
|
|
|
|
prefix=prefix))
|
|
|
|
|
|
|
|
fdecl.write(mcgen('''
|
2012-08-20 01:39:37 +02:00
|
|
|
#include <stdbool.h>
|
|
|
|
#include <stdint.h>
|
2012-07-27 15:56:33 +02:00
|
|
|
|
2015-04-02 14:46:39 +02:00
|
|
|
'''))
|
2011-07-19 21:50:40 +02:00
|
|
|
|
2014-05-02 15:52:35 +02:00
|
|
|
exprs = parse_schema(input_file)
|
2011-12-12 21:29:33 +01:00
|
|
|
exprs = filter(lambda expr: not expr.has_key('gen'), exprs)
|
2011-07-19 21:50:40 +02:00
|
|
|
|
2013-05-11 00:46:00 +02:00
|
|
|
fdecl.write(guardstart("QAPI_TYPES_BUILTIN_STRUCT_DECL"))
|
2015-05-04 17:05:00 +02:00
|
|
|
for typename in builtin_types.keys():
|
2013-05-11 00:46:00 +02:00
|
|
|
fdecl.write(generate_fwd_struct(typename, None, builtin_type=True))
|
|
|
|
fdecl.write(guardend("QAPI_TYPES_BUILTIN_STRUCT_DECL"))
|
|
|
|
|
2011-07-19 21:50:40 +02:00
|
|
|
for expr in exprs:
|
|
|
|
ret = "\n"
|
2015-05-04 17:05:25 +02:00
|
|
|
if expr.has_key('struct'):
|
|
|
|
ret += generate_fwd_struct(expr['struct'], expr['data'])
|
2011-07-19 21:50:40 +02:00
|
|
|
elif expr.has_key('enum'):
|
qapi: generate list struct and visit_list for enum
Currently, if we define an 'enum' and use it in one command's
data, list struct for enum could not be generated, but it's
used in qmp function.
For example: KeyCodesList could not be generated.
>>> qapi-schema.json:
{ 'enum': 'KeyCodes',
'data': [ 'shift', 'alt' ... ] }
{ 'command': 'sendkey',
'data': { 'keys': ['KeyCodes'], '*hold-time': 'int' } }
>>> qmp-command.h:
void qmp_sendkey(KeyCodesList * keys, bool has_hold_time, int64_t
hold_time, Error **errp);
This patch lets qapi generate list struct and visit_list for enum.
Signed-off-by: Amos Kong <akong@redhat.com>
Signed-off-by: Luiz Capitulino <lcapitulino@redhat.com>
2012-08-31 04:56:23 +02:00
|
|
|
ret += generate_enum(expr['enum'], expr['data']) + "\n"
|
|
|
|
ret += generate_fwd_enum_struct(expr['enum'], expr['data'])
|
2011-07-19 21:50:40 +02:00
|
|
|
fdef.write(generate_enum_lookup(expr['enum'], expr['data']))
|
|
|
|
elif expr.has_key('union'):
|
|
|
|
ret += generate_fwd_struct(expr['union'], expr['data']) + "\n"
|
2014-03-07 02:08:56 +01:00
|
|
|
enum_define = discriminator_find_enum_define(expr)
|
|
|
|
if not enum_define:
|
|
|
|
ret += generate_enum('%sKind' % expr['union'], expr['data'].keys())
|
|
|
|
fdef.write(generate_enum_lookup('%sKind' % expr['union'],
|
|
|
|
expr['data'].keys()))
|
2015-05-04 17:05:13 +02:00
|
|
|
elif expr.has_key('alternate'):
|
|
|
|
ret += generate_fwd_struct(expr['alternate'], expr['data']) + "\n"
|
|
|
|
ret += generate_enum('%sKind' % expr['alternate'], expr['data'].keys())
|
|
|
|
fdef.write(generate_enum_lookup('%sKind' % expr['alternate'],
|
|
|
|
expr['data'].keys()))
|
|
|
|
fdef.write(generate_alternate_qtypes(expr))
|
2011-07-19 21:50:40 +02:00
|
|
|
else:
|
|
|
|
continue
|
|
|
|
fdecl.write(ret)
|
|
|
|
|
2013-05-11 00:46:00 +02:00
|
|
|
# to avoid header dependency hell, we always generate declarations
|
|
|
|
# for built-in types in our header files and simply guard them
|
|
|
|
fdecl.write(guardstart("QAPI_TYPES_BUILTIN_CLEANUP_DECL"))
|
2015-05-04 17:05:00 +02:00
|
|
|
for typename in builtin_types.keys():
|
2013-05-11 00:46:00 +02:00
|
|
|
fdecl.write(generate_type_cleanup_decl(typename + "List"))
|
|
|
|
fdecl.write(guardend("QAPI_TYPES_BUILTIN_CLEANUP_DECL"))
|
|
|
|
|
|
|
|
# ...this doesn't work for cases where we link in multiple objects that
|
|
|
|
# have the functions defined, so we use -b option to provide control
|
|
|
|
# over these cases
|
|
|
|
if do_builtins:
|
|
|
|
fdef.write(guardstart("QAPI_TYPES_BUILTIN_CLEANUP_DEF"))
|
2015-05-04 17:05:00 +02:00
|
|
|
for typename in builtin_types.keys():
|
2013-05-11 00:46:00 +02:00
|
|
|
fdef.write(generate_type_cleanup(typename + "List"))
|
|
|
|
fdef.write(guardend("QAPI_TYPES_BUILTIN_CLEANUP_DEF"))
|
|
|
|
|
2011-07-19 21:50:40 +02:00
|
|
|
for expr in exprs:
|
|
|
|
ret = "\n"
|
2015-05-04 17:05:25 +02:00
|
|
|
if expr.has_key('struct'):
|
2013-09-18 17:22:02 +02:00
|
|
|
ret += generate_struct(expr) + "\n"
|
2015-05-04 17:05:25 +02:00
|
|
|
ret += generate_type_cleanup_decl(expr['struct'] + "List")
|
|
|
|
fdef.write(generate_type_cleanup(expr['struct'] + "List") + "\n")
|
|
|
|
ret += generate_type_cleanup_decl(expr['struct'])
|
|
|
|
fdef.write(generate_type_cleanup(expr['struct']) + "\n")
|
2011-07-19 21:50:40 +02:00
|
|
|
elif expr.has_key('union'):
|
2015-05-04 17:05:13 +02:00
|
|
|
ret += generate_union(expr, 'union')
|
2012-03-06 18:55:56 +01:00
|
|
|
ret += generate_type_cleanup_decl(expr['union'] + "List")
|
|
|
|
fdef.write(generate_type_cleanup(expr['union'] + "List") + "\n")
|
|
|
|
ret += generate_type_cleanup_decl(expr['union'])
|
|
|
|
fdef.write(generate_type_cleanup(expr['union']) + "\n")
|
2015-05-04 17:05:13 +02:00
|
|
|
elif expr.has_key('alternate'):
|
|
|
|
ret += generate_union(expr, 'alternate')
|
|
|
|
ret += generate_type_cleanup_decl(expr['alternate'] + "List")
|
|
|
|
fdef.write(generate_type_cleanup(expr['alternate'] + "List") + "\n")
|
|
|
|
ret += generate_type_cleanup_decl(expr['alternate'])
|
|
|
|
fdef.write(generate_type_cleanup(expr['alternate']) + "\n")
|
qapi: generate list struct and visit_list for enum
Currently, if we define an 'enum' and use it in one command's
data, list struct for enum could not be generated, but it's
used in qmp function.
For example: KeyCodesList could not be generated.
>>> qapi-schema.json:
{ 'enum': 'KeyCodes',
'data': [ 'shift', 'alt' ... ] }
{ 'command': 'sendkey',
'data': { 'keys': ['KeyCodes'], '*hold-time': 'int' } }
>>> qmp-command.h:
void qmp_sendkey(KeyCodesList * keys, bool has_hold_time, int64_t
hold_time, Error **errp);
This patch lets qapi generate list struct and visit_list for enum.
Signed-off-by: Amos Kong <akong@redhat.com>
Signed-off-by: Luiz Capitulino <lcapitulino@redhat.com>
2012-08-31 04:56:23 +02:00
|
|
|
elif expr.has_key('enum'):
|
|
|
|
ret += generate_type_cleanup_decl(expr['enum'] + "List")
|
|
|
|
fdef.write(generate_type_cleanup(expr['enum'] + "List") + "\n")
|
2011-07-19 21:50:40 +02:00
|
|
|
else:
|
|
|
|
continue
|
|
|
|
fdecl.write(ret)
|
|
|
|
|
2015-04-02 14:46:39 +02:00
|
|
|
close_output(fdef, fdecl)
|