/* Part of SWI-Prolog Author: Jan Wielemaker E-mail: J.Wielemaker@vu.nl WWW: http://www.swi-prolog.org Copyright (c) 2007-2018, University of Amsterdam All rights reserved. Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met: 1. Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer. 2. Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution. THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. */ #include #include #include #include /******************************* * READ * *******************************/ #define FAST_BUFFER 256 typedef struct text { char *t; char *o; char *e; size_t allocated; char buf[FAST_BUFFER]; } text; static void init_text(text *t) { t->t = t->o = t->buf; t->e = t->o + FAST_BUFFER; } static void free_text(text *t) { if ( t->t != t->buf ) free(t->t); } static int put_byte(text *t, int c) { if ( t->o < t->e ) { *t->o++ = c; } else { size_t cnt = t->o - t->t; if ( t->t == t->buf ) { t->allocated = FAST_BUFFER*2; if ( !(t->t = malloc(t->allocated)) ) return -1; } else { char *n; t->allocated *= 2; if ( (n = realloc(t->t, t->allocated)) ) t->t = n; else return -1; } t->o = t->t + cnt; t->e = t->t + t->allocated; *t->o++ = c; } return 0; } static foreign_t json_read_number(term_t stream, term_t c0, term_t number) { IOSTREAM *in; text t; int rc = FALSE; int c; term_t tmp; if ( !PL_get_stream(stream, &in, SIO_INPUT) || !PL_get_char_ex(c0, &c, FALSE) ) return FALSE; init_text(&t); put_byte(&t, c); for(;;) { c = Speekcode(in); if ( (c >= '0' && c <= '9') || c == '.' || c == '-' || c == '+' || c == 'e' || c == 'E' ) { if ( put_byte(&t, c) != 0 ) { rc = PL_resource_error("memory"); break; } (void)Sgetcode(in); continue; } if ( put_byte(&t, 0) != 0 ) { rc = PL_resource_error("memory"); break; } rc = ( (tmp = PL_new_term_ref()) && PL_chars_to_term(t.t, tmp) && PL_is_number(tmp) && PL_unify(tmp, number) ); break; } free_text(&t); if ( !rc ) { PL_clear_exception(); rc = PL_syntax_error("illegal_number", in); } PL_release_stream(in); return rc; } static int is_ws(int c) { return ( c == ' ' || c == '\t' || c == '\n' || c == '\r' ); } static foreign_t json_skip_ws(term_t stream, term_t c0, term_t next) { int c; if ( !PL_get_char_ex(c0, &c, TRUE) ) return FALSE; if ( is_ws(c) ) { IOSTREAM *in; if ( !PL_get_stream(stream, &in, SIO_INPUT) ) return FALSE; do { c = Sgetcode(in); } while ( is_ws(c) ); PL_release_stream(in); } return PL_unify_integer(next, c); } /******************************* * WRITE * *******************************/ #define TRYPUTC(c, s) if ( Sputcode(c, s) < 0 ) { return -1; } static int json_put_code(IOSTREAM *out, int pc, int c) { static char escape[128]; static int escape_initialized = FALSE; if ( !escape_initialized ) { memset(escape, 0, sizeof(escape)); escape['"'] = '"'; escape['\\'] = '\\'; escape['\b'] = 'b'; escape['\f'] = 'f'; escape['\n'] = 'n'; escape['\r'] = 'r'; escape['\t'] = 't'; escape_initialized = TRUE; } if ( c < 128 ) { if ( escape[c] ) { TRYPUTC('\\', out); TRYPUTC(escape[c], out); } else if ( c < ' ' ) /* control characters *must* be escaped */ { TRYPUTC('\\', out); if ( Sfprintf(out, "u%04x", c) < 0 ) return -1; } else if ( pc == '<' && c == '/' ) /* Emit 0; ap++) { int c = *ap&0xff; if ( json_put_code(out, pc, c) < 0 ) { rc = FALSE; goto out; } pc = c; } TRYPUTC('"', out); } else if ( PL_get_wchars(text, &len, &w, CVT_ATOM|CVT_STRING|CVT_LIST|CVT_EXCEPTION) ) { const pl_wchar_t *wp; size_t todo; int pc = 0; TRYPUTC('"', out); for(todo=len, wp=w; todo-- > 0; wp++) { int c = *wp; if ( json_put_code(out, pc, c) < 0 ) { rc = FALSE; goto out; } pc = c; } TRYPUTC('"', out); } else { rc = FALSE; } out: PL_release_stream(out); return rc; } static foreign_t json_write_indent(term_t stream, term_t indent, term_t tab) { int i, t, n; IOSTREAM *out; if ( !PL_get_integer(indent, &i) || !PL_get_integer(tab, &t) ) return FALSE; if ( PL_get_stream(stream, &out, SIO_OUTPUT) ) { int rc = TRUE; if ( !out->position || out->position->linepos > 0 ) { TRYPUTC('\n', out); } for(n=0; n