qapi.py 20.3 KB
Newer Older
1 2 3 4
#
# QAPI helper library
#
# Copyright IBM, Corp. 2011
E
Eric Blake 已提交
5
# Copyright (c) 2013-2015 Red Hat Inc.
6 7 8
#
# Authors:
#  Anthony Liguori <aliguori@us.ibm.com>
9
#  Markus Armbruster <armbru@redhat.com>
10
#
11 12
# This work is licensed under the terms of the GNU GPL, version 2.
# See the COPYING file in the top-level directory.
13

14
import re
15
from ordereddict import OrderedDict
16
import os
17
import sys
18

19
builtin_types = {
K
Kevin Wolf 已提交
20 21 22 23 24 25 26 27 28 29 30 31
    'str':      'QTYPE_QSTRING',
    'int':      'QTYPE_QINT',
    'number':   'QTYPE_QFLOAT',
    'bool':     'QTYPE_QBOOL',
    'int8':     'QTYPE_QINT',
    'int16':    'QTYPE_QINT',
    'int32':    'QTYPE_QINT',
    'int64':    'QTYPE_QINT',
    'uint8':    'QTYPE_QINT',
    'uint16':   'QTYPE_QINT',
    'uint32':   'QTYPE_QINT',
    'uint64':   'QTYPE_QINT',
32
    'size':     'QTYPE_QINT',
K
Kevin Wolf 已提交
33 34
}

35 36 37 38 39 40 41 42
def error_path(parent):
    res = ""
    while parent:
        res = ("In file included from %s:%d:\n" % (parent['file'],
                                                   parent['line'])) + res
        parent = parent['parent']
    return res

43 44
class QAPISchemaError(Exception):
    def __init__(self, schema, msg):
45
        self.input_file = schema.input_file
46
        self.msg = msg
47 48 49 50
        self.col = 1
        self.line = schema.line
        for ch in schema.src[schema.line_pos:schema.pos]:
            if ch == '\t':
51 52 53
                self.col = (self.col + 7) % 8 + 1
            else:
                self.col += 1
54
        self.info = schema.parent_info
55 56

    def __str__(self):
57 58
        return error_path(self.info) + \
            "%s:%d:%d: %s" % (self.input_file, self.line, self.col, self.msg)
59

60 61
class QAPIExprError(Exception):
    def __init__(self, expr_info, msg):
62
        self.info = expr_info
63 64 65
        self.msg = msg

    def __str__(self):
66 67
        return error_path(self.info['parent']) + \
            "%s:%d: %s" % (self.info['file'], self.info['line'], self.msg)
68

69 70
class QAPISchema:

B
Benoît Canet 已提交
71 72 73 74 75
    def __init__(self, fp, input_relname=None, include_hist=[],
                 previously_included=[], parent_info=None):
        """ include_hist is a stack used to detect inclusion cycles
            previously_included is a global state used to avoid multiple
                                inclusions of the same file"""
76 77 78 79 80 81
        input_fname = os.path.abspath(fp.name)
        if input_relname is None:
            input_relname = fp.name
        self.input_dir = os.path.dirname(input_fname)
        self.input_file = input_relname
        self.include_hist = include_hist + [(input_relname, input_fname)]
B
Benoît Canet 已提交
82
        previously_included.append(input_fname)
83
        self.parent_info = parent_info
84 85 86 87
        self.src = fp.read()
        if self.src == '' or self.src[-1] != '\n':
            self.src += '\n'
        self.cursor = 0
88 89
        self.line = 1
        self.line_pos = 0
90 91 92 93
        self.exprs = []
        self.accept()

        while self.tok != None:
94 95 96 97 98 99 100 101 102 103 104
            expr_info = {'file': input_relname, 'line': self.line, 'parent': self.parent_info}
            expr = self.get_expr(False)
            if isinstance(expr, dict) and "include" in expr:
                if len(expr) != 1:
                    raise QAPIExprError(expr_info, "Invalid 'include' directive")
                include = expr["include"]
                if not isinstance(include, str):
                    raise QAPIExprError(expr_info,
                                        'Expected a file name (string), got: %s'
                                        % include)
                include_path = os.path.join(self.input_dir, include)
105 106 107 108
                for elem in self.include_hist:
                    if include_path == elem[1]:
                        raise QAPIExprError(expr_info, "Inclusion loop for %s"
                                            % include)
B
Benoît Canet 已提交
109 110 111
                # skip multiple include of the same file
                if include_path in previously_included:
                    continue
112 113
                try:
                    fobj = open(include_path, 'r')
114
                except IOError, e:
115 116
                    raise QAPIExprError(expr_info,
                                        '%s: %s' % (e.strerror, include))
B
Benoît Canet 已提交
117 118
                exprs_include = QAPISchema(fobj, include, self.include_hist,
                                           previously_included, expr_info)
119 120 121 122 123
                self.exprs.extend(exprs_include.exprs)
            else:
                expr_elem = {'expr': expr,
                             'info': expr_info}
                self.exprs.append(expr_elem)
124 125 126 127

    def accept(self):
        while True:
            self.tok = self.src[self.cursor]
128
            self.pos = self.cursor
129 130 131
            self.cursor += 1
            self.val = None

132
            if self.tok == '#':
133 134 135 136 137 138 139 140 141 142
                self.cursor = self.src.find('\n', self.cursor)
            elif self.tok in ['{', '}', ':', ',', '[', ']']:
                return
            elif self.tok == "'":
                string = ''
                esc = False
                while True:
                    ch = self.src[self.cursor]
                    self.cursor += 1
                    if ch == '\n':
143 144
                        raise QAPISchemaError(self,
                                              'Missing terminating "\'"')
145 146 147 148 149 150 151 152 153 154 155 156 157 158
                    if esc:
                        string += ch
                        esc = False
                    elif ch == "\\":
                        esc = True
                    elif ch == "'":
                        self.val = string
                        return
                    else:
                        string += ch
            elif self.tok == '\n':
                if self.cursor == len(self.src):
                    self.tok = None
                    return
159 160
                self.line += 1
                self.line_pos = self.cursor
161 162
            elif not self.tok.isspace():
                raise QAPISchemaError(self, 'Stray "%s"' % self.tok)
163 164 165

    def get_members(self):
        expr = OrderedDict()
166 167 168 169 170 171
        if self.tok == '}':
            self.accept()
            return expr
        if self.tok != "'":
            raise QAPISchemaError(self, 'Expected string or "}"')
        while True:
172 173
            key = self.val
            self.accept()
174 175 176
            if self.tok != ':':
                raise QAPISchemaError(self, 'Expected ":"')
            self.accept()
177 178
            if key in expr:
                raise QAPISchemaError(self, 'Duplicate key "%s"' % key)
179
            expr[key] = self.get_expr(True)
180
            if self.tok == '}':
181
                self.accept()
182 183 184 185 186 187
                return expr
            if self.tok != ',':
                raise QAPISchemaError(self, 'Expected "," or "}"')
            self.accept()
            if self.tok != "'":
                raise QAPISchemaError(self, 'Expected string')
188 189 190

    def get_values(self):
        expr = []
191 192 193 194 195 196
        if self.tok == ']':
            self.accept()
            return expr
        if not self.tok in [ '{', '[', "'" ]:
            raise QAPISchemaError(self, 'Expected "{", "[", "]" or string')
        while True:
197
            expr.append(self.get_expr(True))
198
            if self.tok == ']':
199
                self.accept()
200 201 202 203
                return expr
            if self.tok != ',':
                raise QAPISchemaError(self, 'Expected "," or "]"')
            self.accept()
204

205 206 207
    def get_expr(self, nested):
        if self.tok != '{' and not nested:
            raise QAPISchemaError(self, 'Expected "{"')
208 209 210 211 212 213
        if self.tok == '{':
            self.accept()
            expr = self.get_members()
        elif self.tok == '[':
            self.accept()
            expr = self.get_values()
214
        elif self.tok == "'":
215 216
            expr = self.val
            self.accept()
217 218
        else:
            raise QAPISchemaError(self, 'Expected "{", "[" or string')
219
        return expr
K
Kevin Wolf 已提交
220

221 222 223 224 225 226
def find_base_fields(base):
    base_struct_define = find_struct(base)
    if not base_struct_define:
        return None
    return base_struct_define['data']

227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245
# Return the discriminator enum define if discriminator is specified as an
# enum type, otherwise return None.
def discriminator_find_enum_define(expr):
    base = expr.get('base')
    discriminator = expr.get('discriminator')

    if not (discriminator and base):
        return None

    base_fields = find_base_fields(base)
    if not base_fields:
        return None

    discriminator_type = base_fields.get(discriminator)
    if not discriminator_type:
        return None

    return find_enum(discriminator_type)

W
Wenchao Xia 已提交
246 247 248 249 250 251 252
def check_event(expr, expr_info):
    params = expr.get('data')
    if params:
        for argname, argentry, optional, structured in parse_args(params):
            if structured:
                raise QAPIExprError(expr_info,
                                    "Nested structure define in event is not "
W
Wenchao Xia 已提交
253
                                    "supported, event '%s', argname '%s'"
W
Wenchao Xia 已提交
254 255
                                    % (expr['event'], argname))

256 257 258 259 260 261
def check_union(expr, expr_info):
    name = expr['union']
    base = expr.get('base')
    discriminator = expr.get('discriminator')
    members = expr['data']

262 263 264 265 266 267 268
    # If the object has a member 'base', its value must name a complex type,
    # and there must be a discriminator.
    if base is not None:
        if discriminator is None:
            raise QAPIExprError(expr_info,
                                "Union '%s' requires a discriminator to go "
                                "along with base" %name)
269 270 271 272 273 274
        base_fields = find_base_fields(base)
        if not base_fields:
            raise QAPIExprError(expr_info,
                                "Base '%s' is not a valid type"
                                % base)

275 276 277
    # If the union object has no member 'discriminator', it's a
    # simple union. If 'discriminator' is {}, it is an anonymous union.
    if not discriminator or discriminator == {}:
278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295
        enum_define = None

    # Else, it's a flat union.
    else:
        # The object must have a member 'base'.
        if not base:
            raise QAPIExprError(expr_info,
                                "Flat union '%s' must have a base field"
                                % name)
        # The value of member 'discriminator' must name a member of the
        # base type.
        discriminator_type = base_fields.get(discriminator)
        if not discriminator_type:
            raise QAPIExprError(expr_info,
                                "Discriminator '%s' is not a member of base "
                                "type '%s'"
                                % (discriminator, base))
        enum_define = find_enum(discriminator_type)
296 297 298 299 300
        # Do not allow string discriminator
        if not enum_define:
            raise QAPIExprError(expr_info,
                                "Discriminator '%s' must be of enumeration "
                                "type" % discriminator)
301 302 303 304 305 306 307 308 309 310 311 312 313

    # Check every branch
    for (key, value) in members.items():
        # If this named member's value names an enum type, then all members
        # of 'data' must also be members of the enum type.
        if enum_define and not key in enum_define['enum_values']:
            raise QAPIExprError(expr_info,
                                "Discriminator value '%s' is not found in "
                                "enum '%s'" %
                                (key, enum_define["enum_name"]))
        # Todo: add checking for values. Key is checked as above, value can be
        # also checked here, but we need more functions to handle array case.

314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333
def check_enum(expr, expr_info):
    name = expr['enum']
    members = expr.get('data')
    values = { 'MAX': '(automatic)' }

    if not isinstance(members, list):
        raise QAPIExprError(expr_info,
                            "Enum '%s' requires an array for 'data'" % name)
    for member in members:
        if not isinstance(member, str):
            raise QAPIExprError(expr_info,
                                "Enum '%s' member '%s' is not a string"
                                % (name, member))
        key = _generate_enum_string(member)
        if key in values:
            raise QAPIExprError(expr_info,
                                "Enum '%s' member '%s' clashes with '%s'"
                                % (name, member, values[key]))
        values[key] = member

334 335 336
def check_exprs(schema):
    for expr_elem in schema.exprs:
        expr = expr_elem['expr']
337 338 339 340 341 342 343 344
        info = expr_elem['info']

        if expr.has_key('enum'):
            check_enum(expr, info)
        elif expr.has_key('union'):
            check_union(expr, info)
        elif expr.has_key('event'):
            check_event(expr, info)
345

346
def parse_schema(input_file):
347
    try:
348
        schema = QAPISchema(open(input_file, "r"))
349
    except (QAPISchemaError, QAPIExprError), e:
350 351 352
        print >>sys.stderr, e
        exit(1)

K
Kevin Wolf 已提交
353 354
    exprs = []

355 356
    for expr_elem in schema.exprs:
        expr = expr_elem['expr']
357
        if expr.has_key('enum'):
358
            add_enum(expr['enum'], expr.get('data'))
359 360 361 362 363
        elif expr.has_key('union'):
            add_union(expr)
        elif expr.has_key('type'):
            add_struct(expr)
        exprs.append(expr)
364

365 366 367 368 369 370 371
    # Try again for hidden UnionKind enum
    for expr_elem in schema.exprs:
        expr = expr_elem['expr']
        if expr.has_key('union'):
            if not discriminator_find_enum_define(expr):
                add_enum('%sKind' % expr['union'])

372 373 374 375 376 377
    try:
        check_exprs(schema)
    except QAPIExprError, e:
        print >>sys.stderr, e
        exit(1)

378 379 380
    return exprs

def parse_args(typeinfo):
E
Eric Blake 已提交
381
    if isinstance(typeinfo, str):
382 383 384 385
        struct = find_struct(typeinfo)
        assert struct != None
        typeinfo = struct['data']

386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421
    for member in typeinfo:
        argname = member
        argentry = typeinfo[member]
        optional = False
        structured = False
        if member.startswith('*'):
            argname = member[1:]
            optional = True
        if isinstance(argentry, OrderedDict):
            structured = True
        yield (argname, argentry, optional, structured)

def de_camel_case(name):
    new_name = ''
    for ch in name:
        if ch.isupper() and new_name:
            new_name += '_'
        if ch == '-':
            new_name += '_'
        else:
            new_name += ch.lower()
    return new_name

def camel_case(name):
    new_name = ''
    first = True
    for ch in name:
        if ch in ['_', '-']:
            first = True
        elif first:
            new_name += ch.upper()
            first = False
        else:
            new_name += ch.lower()
    return new_name

422
def c_var(name, protect=True):
B
Blue Swirl 已提交
423 424 425 426 427 428 429 430 431 432 433 434 435 436
    # ANSI X3J11/88-090, 3.1.1
    c89_words = set(['auto', 'break', 'case', 'char', 'const', 'continue',
                     'default', 'do', 'double', 'else', 'enum', 'extern', 'float',
                     'for', 'goto', 'if', 'int', 'long', 'register', 'return',
                     'short', 'signed', 'sizeof', 'static', 'struct', 'switch',
                     'typedef', 'union', 'unsigned', 'void', 'volatile', 'while'])
    # ISO/IEC 9899:1999, 6.4.1
    c99_words = set(['inline', 'restrict', '_Bool', '_Complex', '_Imaginary'])
    # ISO/IEC 9899:2011, 6.4.1
    c11_words = set(['_Alignas', '_Alignof', '_Atomic', '_Generic', '_Noreturn',
                     '_Static_assert', '_Thread_local'])
    # GCC http://gcc.gnu.org/onlinedocs/gcc-4.7.1/gcc/C-Extensions.html
    # excluding _.*
    gcc_words = set(['asm', 'typeof'])
437 438 439 440 441 442 443 444 445 446
    # C++ ISO/IEC 14882:2003 2.11
    cpp_words = set(['bool', 'catch', 'class', 'const_cast', 'delete',
                     'dynamic_cast', 'explicit', 'false', 'friend', 'mutable',
                     'namespace', 'new', 'operator', 'private', 'protected',
                     'public', 'reinterpret_cast', 'static_cast', 'template',
                     'this', 'throw', 'true', 'try', 'typeid', 'typename',
                     'using', 'virtual', 'wchar_t',
                     # alternative representations
                     'and', 'and_eq', 'bitand', 'bitor', 'compl', 'not',
                     'not_eq', 'or', 'or_eq', 'xor', 'xor_eq'])
447
    # namespace pollution:
448
    polluted_words = set(['unix', 'errno'])
449
    if protect and (name in c89_words | c99_words | c11_words | gcc_words | cpp_words | polluted_words):
B
Blue Swirl 已提交
450
        return "q_" + name
451 452
    return name.replace('-', '_').lstrip("*")

453 454
def c_fun(name, protect=True):
    return c_var(name, protect).replace('.', '_')
455 456 457 458 459 460 461 462 463 464

def c_list_type(name):
    return '%sList' % name

def type_name(name):
    if type(name) == list:
        return c_list_type(name[0])
    return name

enum_types = []
465
struct_types = []
466
union_types = []
467 468 469 470 471 472 473 474 475 476 477

def add_struct(definition):
    global struct_types
    struct_types.append(definition)

def find_struct(name):
    global struct_types
    for struct in struct_types:
        if struct['type'] == name:
            return struct
    return None
478

479 480 481 482 483 484 485 486 487 488 489
def add_union(definition):
    global union_types
    union_types.append(definition)

def find_union(name):
    global union_types
    for union in union_types:
        if union['union'] == name:
            return union
    return None

490
def add_enum(name, enum_values = None):
491
    global enum_types
492
    enum_types.append({"enum_name": name, "enum_values": enum_values})
493

494
def find_enum(name):
495
    global enum_types
496 497 498 499 500 501 502
    for enum in enum_types:
        if enum['enum_name'] == name:
            return enum
    return None

def is_enum(name):
    return find_enum(name) != None
503

504 505 506 507 508
eatspace = '\033EATSPACE.'

# A special suffix is added in c_type() for pointer types, and it's
# stripped in mcgen(). So please notice this when you check the return
# value of c_type() outside mcgen().
509
def c_type(name, is_param=False):
510
    if name == 'str':
511
        if is_param:
512 513 514
            return 'const char *' + eatspace
        return 'char *' + eatspace

515 516
    elif name == 'int':
        return 'int64_t'
517 518 519 520
    elif (name == 'int8' or name == 'int16' or name == 'int32' or
          name == 'int64' or name == 'uint8' or name == 'uint16' or
          name == 'uint32' or name == 'uint64'):
        return name + '_t'
L
Laszlo Ersek 已提交
521 522
    elif name == 'size':
        return 'uint64_t'
523 524 525 526 527
    elif name == 'bool':
        return 'bool'
    elif name == 'number':
        return 'double'
    elif type(name) == list:
528
        return '%s *%s' % (c_list_type(name[0]), eatspace)
529 530 531 532 533
    elif is_enum(name):
        return name
    elif name == None or len(name) == 0:
        return 'void'
    elif name == name.upper():
534
        return '%sEvent *%s' % (camel_case(name), eatspace)
535
    else:
536 537 538 539 540
        return '%s *%s' % (name, eatspace)

def is_c_ptr(name):
    suffix = "*" + eatspace
    return c_type(name).endswith(suffix)
541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564

def genindent(count):
    ret = ""
    for i in range(count):
        ret += " "
    return ret

indent_level = 0

def push_indent(indent_amount=4):
    global indent_level
    indent_level += indent_amount

def pop_indent(indent_amount=4):
    global indent_level
    indent_level -= indent_amount

def cgen(code, **kwds):
    indent = genindent(indent_level)
    lines = code.split('\n')
    lines = map(lambda x: indent + x, lines)
    return '\n'.join(lines) % kwds + '\n'

def mcgen(code, **kwds):
565 566
    raw = cgen('\n'.join(code.split('\n')[1:-1]), **kwds)
    return re.sub(re.escape(eatspace) + ' *', '', raw)
567 568 569 570 571

def basename(filename):
    return filename.split("/")[-1]

def guardname(filename):
M
Michael Roth 已提交
572 573 574 575
    guard = basename(filename).rsplit(".", 1)[0]
    for substr in [".", " ", "-"]:
        guard = guard.replace(substr, "_")
    return guard.upper() + '_H'
576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592

def guardstart(name):
    return mcgen('''

#ifndef %(name)s
#define %(name)s

''',
                 name=guardname(name))

def guardend(name):
    return mcgen('''

#endif /* %(name)s */

''',
                 name=guardname(name))
593

594 595 596 597 598
# ENUMName -> ENUM_NAME, EnumName1 -> ENUM_NAME1
# ENUM_NAME -> ENUM_NAME, ENUM_NAME1 -> ENUM_NAME1, ENUM_Name2 -> ENUM_NAME2
# ENUM24_Name -> ENUM24_NAME
def _generate_enum_string(value):
    c_fun_str = c_fun(value, False)
599
    if value.isupper():
600 601
        return c_fun_str

602
    new_name = ''
603 604 605 606 607 608 609 610 611 612
    l = len(c_fun_str)
    for i in range(l):
        c = c_fun_str[i]
        # When c is upper and no "_" appears before, do more checks
        if c.isupper() and (i > 0) and c_fun_str[i - 1] != "_":
            # Case 1: next string is lower
            # Case 2: previous string is digit
            if (i < (l - 1) and c_fun_str[i + 1].islower()) or \
            c_fun_str[i - 1].isdigit():
                new_name += '_'
613 614
        new_name += c
    return new_name.lstrip('_').upper()
615 616

def generate_enum_full_value(enum_name, enum_value):
617 618
    abbrev_string = _generate_enum_string(enum_name)
    value_string = _generate_enum_string(enum_value)
619
    return "%s_%s" % (abbrev_string, value_string)