Skip to content

HTTPS clone URL

Subversion checkout URL

You can clone with HTTPS or Subversion.

Download ZIP
Commits on Jun 11, 2010
  1. @bonzini

    remove unnecessary lookaheads

    bonzini authored Luiz Capitulino committed
    Signed-off-by: Paolo Bonzini <pbonzini@redhat.com>
    Signed-off-by: Luiz Capitulino <lcapitulino@redhat.com>
  2. @bonzini

    implement optional lookahead in json lexer

    bonzini authored Luiz Capitulino committed
    Not requiring one extra character when lookahead is not necessary
    ensures that clients behave properly even if they, for example,
    send QMP requests without a trailing newline.
    
    Signed-off-by: Paolo Bonzini <pbonzini@redhat.com>
    Signed-off-by: Luiz Capitulino <lcapitulino@redhat.com>
  3. json-lexer: Drop 'buf'

    Luiz Capitulino authored
    QString supports adding a single char, 'buf' is unneeded.
    
    Signed-off-by: Luiz Capitulino <lcapitulino@redhat.com>
  4. json-lexer: Handle missing escapes

    Luiz Capitulino authored
    The JSON escape sequence "\/" and "\\" are valid and should be
    handled.
    
    Signed-off-by: Luiz Capitulino <lcapitulino@redhat.com>
  5. json-lexer: Initialize 'x' and 'y'

    Luiz Capitulino authored
    The 'lexer' variable is passed by the caller, it can contain anything
    (eg. garbage).
    
    Signed-off-by: Luiz Capitulino <lcapitulino@redhat.com>
Commits on Feb 10, 2010
  1. @roytam1

    json: fix PRId64 on Win32

    roytam1 authored Anthony Liguori committed
    OK we are fooled by the json lexer and parser. As we use %I64d to
    print 'long long' variables in Win32, but lexer and parser only deal
    with %lld but not %I64d, this patch add support for %I64d and solve
    'info pci', 'powser_reset' and 'power_powerdown' assert failure in
    Win32.
    
    Signed-off-by: Anthony Liguori <aliguori@us.ibm.com>
Commits on Nov 17, 2009
  1. Add a lexer for JSON

    Anthony Liguori authored
    Our JSON parser is a three stage parser.  The first stage tokenizes the stream
    into a set of lexical tokens.  Since the lexical grammar is regular, we can
    use a finite state machine to model it.  The state machine will emit tokens
    as they are identified.
    
    Signed-off-by: Anthony Liguori <aliguori@us.ibm.com>
Something went wrong with that request. Please try again.