cozis/tinytemplate
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity
Files
e3575553f0cdfde5d71a5a44bb6d5ff20ec25ea7
tinytemplate/3p/xjson.c
T

1985 lines
51 KiB
C
Raw Blame History

#include <assert.h>
#include <stdlib.h>
#include <string.h>
#include <stdarg.h>
#include <stdint.h>
#include <stdio.h>
#include <ctype.h>
#include "xjson.h"
#define XJ_MAX_DEPTH 128
#define XJ_MAX_EXPNT 10
typedef struct chunk_t chunk_t;
/* Symbol:
* chunk_t
*
* Description:
* This is the structure that implements a pool of
* an [xj_alloc] allocator. It's used for both the
* main pool and any extension pool. It's basically
* just a chunk of memory with a pointer before it
* to make a linked list of chunks.
*
* Fields:
* prev: Pointer to the previously allocated chunk.
*
* body: The actual chunk of memory. This hold the
* memory allocations. It's important to make
* sure that this field is properly aligned
* so that the first allocation is also aligned.
*/
struct chunk_t {
chunk_t *prev;
_Alignas(void*) char body[];
};
/* Symbol:
* xj_alloc
*
* Description:
* This is the structure that holds the state of a
* bump-pointer allocator.
*
* A bump-pointer allocator is the simplest form of
* allocation scheme. It's basically a big pool of
* memory that's linearly filled up with allocations.
* Since the allocations may be of different sizes,
* there's no way of freeing previous allocations,
* so all allocations must be freed at the same time
* with the whole pool.
*
* A bump-pointer allocator is good for JSON objects
* because they're made up by lots of nodes with the
* same lifetime.
*
* This implementation allows a dynamic growth of the
* memory it holds by appending extension pools. It's
* both possible to specify the size of the main pool
* and the extension pools on instanciation of the
* allocator (all extension pools will have the same
* size which may be different to the main pool's size).
*
* The first pool is allocated along with the allocator
* object. By using [xj_alloc_using], the user provides
* a memory region that the allocator will use to instanciate
* itself. This memory region must both hold the allocator
* and the first chunk. Since this memory was provided
* by the user, he must also be able to specify a way
* to free the provided chunk that holds allocator and
* pool.
*
* Fields:
* free: An user-provided freeing callback that, if not
* NULL, is called on the allocator pointer (xj_alloc*).
* This is useful when it's the user to provide
* the allocator with memory, by instanciating it
* using [xj_alloc_using].
*
* tail: The currently used pool. At first this will refer
* to the main pool. When extensions are added, this
* refers to the last extension.
* All chunks are linked together using their [prev]
* pointer in allocation order, therefore the [tail]
* pointer is the tail of the linked list of all chunks.
*
* tail_used: The amount of bytes used of the currently
* used pool (the [tail]). Allocation occur
* by incrementing this offset in the pool.
*
* tail_size: The total size of the tail pool. This is
* equal to the main pool's size when there
* are no extension pools and it's equal to
* the extensions size when there are.
*
* ext_size: The size of an extension pool.
*/
struct xj_alloc {
void (*free)(void*);
chunk_t *tail;
int tail_used;
int tail_size;
int ext_size;
};
/* Symbol:
* xj_alloc_new
*
* Description:
* Instanciate an allocator.
*
* Arguments:
* size: The size of the main memory pool.
*
* ext: The size of the pools allocated if the
* main pool isn't enough. By specifying 0,
* you're telling the allocator to only use
* the main pool and fail if it's not enough.
*
* Returns:
* The pointer to an allocator instance if all went
* well or NULL.
*
* Notes:
* The returned pointer, if not NULL, must be
* deallocated using [xj_alloc_del].
*/
xj_alloc *xj_alloc_new(int size, int ext)
{
assert(size >= 0 && ext >= 0);
int allocated = sizeof(xj_alloc) + sizeof(chunk_t) + size;
void *temp = malloc(allocated);
if(temp == NULL)
return NULL;
return xj_alloc_using(temp, allocated, ext, free);
}
/* Symbol:
* xj_alloc_using
*
* Description:
* Instanciate an allocator by telling by
* providing it with the main pool's memory.
*
* Arguments:
* mem: The the pointer to the main memory pool.
* It can't be NULL.
*
* size: The size of the region referred by [mem]
* in bytes. It can't be negative.
*
* ext: The size of any extension pool allocated
* if the main pool isn't enough.
*
* free: The freeing routine that needs to be
* called on [mem] when the allocator is
* destroyed using [xj_alloc_del]. This
* is only called on the [mem] pointer and
* not on any additional extension pool.
*
* Returns:
* The pointer to an allocator instance if all went
* well or NULL.
*
* Notes:
* The returned pointer, if not NULL, must be
* deallocated using [xj_alloc_del].
*
* The [mem] pool is also used to store the allocator's
* header, so if it's not big enough, this function will
* fail.
*/
xj_alloc *xj_alloc_using(void *mem, int size, int ext, void (*free)(void*))
{
assert(mem != NULL && size >= 0 && ext >= 0);
if((unsigned int) size < sizeof(xj_alloc) + sizeof(chunk_t))
return NULL;
xj_alloc *alloc = mem;
alloc->free = free;
alloc->tail = (chunk_t*) (alloc + 1);
alloc->tail->prev = NULL;
alloc->tail_used = 0;
alloc->tail_size = size - (sizeof(xj_alloc) + sizeof(chunk_t));
alloc->ext_size = ext;
return alloc;
}
/* Symbol:
* xj_alloc_del
*
* Description:
* Free an allocator instance.
*/
void xj_alloc_del(xj_alloc *alloc)
{
// Free all of the allocator's chunks,
// with exception of the first one,
// which is allocated with the allocator's
// header and must be deallocated with
// the user-provided callback.
chunk_t *curr = alloc->tail;
while(curr->prev != NULL)
{
chunk_t *prev = curr->prev;
free(curr);
curr = prev;
}
// Free the allocator header and first
// chunk.
if(alloc->free != NULL)
alloc->free(alloc);
}
/* Symbol:
* next_aligned
*
* Description:
* If the argument is multiple of 8, then
* the argument is returned, else the first
* multiple of 8 higher than the argument is
* returned.
*/
unsigned long long next_aligned(unsigned long long n)
{
// NOTE: For powers of 2, the modulo operator
// is equivalent to and & operation where
// the right operand if the power of 2
// minus 1:
//
// x % (2^i) === x & (2^i - 1)
//
// usually & are faster than %'s so if it's
// known that the divisor (the right argument)
// is a power of 2, it's preferred to use the
// &.
//
// (n & 7) is equivalent to (n % 8), to it's the
// remainder of the division by 8, therefore an
// unaligned [n] will have a non-zero (n & 7).
// If the [n] is aligned to 8, then we return 8
// (the case after the :). If there's a remainder
// then we need to find the first aligned offset
// after [n], which can be calculated by removing
// the remainder (n & ~7) and adding 8.
return (n & 7) ? (n & ~7) + 8 : n;
}
void *xj_bpalloc(xj_alloc *alloc, int size)
{
assert(size >= 0);
// Make sure the returned memory is aligned
// to 8 bytes boundaries, which is assumed
// to be the a valid alignment for anything.
alloc->tail_used = next_aligned(alloc->tail_used);
// If there's not enough memory in the
// current chunk, allocate an extension.
if(alloc->tail_used + size > alloc->tail_size)
{
// When the user instanciated the allocator,
// he specified an extension size of 0, which
// means that he doesn't want the allocator
// to grow. Therefore, we just wen out of
// memory!
if(alloc->ext_size == 0)
return NULL;
// Either allocate a chunk of the size specified
// by the user during the instanciation of the
// allocator, or a bigger one if the current
// allocation wouldn't fit in it.
int new_chunk_size = alloc->ext_size;
if(new_chunk_size < size)
new_chunk_size = size;
chunk_t *chunk = malloc(sizeof(chunk_t) + new_chunk_size);
if(chunk == NULL)
return NULL;
chunk->prev = alloc->tail;
alloc->tail = chunk;
alloc->tail_used = 0;
alloc->tail_size = new_chunk_size;
}
// Do the bump-pointer's bumping of the pointer.
void *addr = alloc->tail->body + alloc->tail_used;
alloc->tail_used += size;
return addr;
}
void xj_preport(xj_error *error, const char *src, int off, const char *fmt, ...)
{
if(error != NULL)
{
int row = -1,
col = -1;
if(src != NULL)
{
// Calculate column and row given
// the source string and an index
// in it.
assert(off >= 0);
col = 0;
row = 0;
int i = 0;
while(i < off)
{
if(src[i] == '\n')
{
row += 1;
col = 0;
}
else
col += 1;
i += 1;
}
}
int k;
va_list va;
va_start(va, fmt);
k = vsnprintf(error->message, sizeof(error->message), fmt, va);
va_end(va);
assert(k >= 0);
error->truncated = (k >= (int) sizeof(error->message)-1);
error->occurred = 1;
error->off = off;
error->row = row;
error->col = col;
}
}
// Create an [xj_value] that represents the [null] JSON value.
xj_value *xj_value_null(xj_alloc *alloc, xj_error *error)
{
xj_value *x = xj_bpalloc(alloc, sizeof(xj_value));
if(x == NULL)
xj_report(error, "Out of memory");
else
{
x->type = XJ_NULL;
x->size = -1;
x->next = NULL;
x->key = NULL;
}
return x;
}
// Create an [xj_value] that represents a boolean value.
xj_value *xj_value_bool(xj_bool val, xj_alloc *alloc, xj_error *error)
{
xj_value *x = xj_value_null(alloc, error);
if(x != NULL)
{
x->type = XJ_BOOL;
x->as_bool = val;
}
return x;
}
xj_value *xj_value_int(xj_i64 val, xj_alloc *alloc, xj_error *error)
{
xj_value *x = xj_value_null(alloc, error);
if(x != NULL)
{
x->type = XJ_INT;
x->as_int = val;
}
return x;
}
xj_value *xj_value_float(xj_f64 val, xj_alloc *alloc, xj_error *error)
{
xj_value *x = xj_value_null(alloc, error);
if(x != NULL)
{
x->type = XJ_FLOAT;
x->as_float = val;
}
return x;
}
xj_value *xj_value_string(const char *str, int len, xj_alloc *alloc, xj_error *error)
{
if(str == NULL) str = "";
if(len < 0) len = strlen(str);
char *copy = xj_strdup(str, len, alloc, error);
if(copy == NULL)
return NULL;
xj_value *x = xj_value_null(alloc, error);
if(x != NULL)
{
x->type = XJ_STRING;
x->size = len;
x->as_string = copy;
}
return x;
}
xj_value *xj_value_array__nocheck(xj_value *head, int count, xj_alloc *alloc, xj_error *error)
{
if(count < 0)
{
count = 0;
xj_value *curs = head;
while(curs != NULL)
{
count += 1;
curs = curs->next;
}
}
xj_value *x = xj_value_null(alloc, error);
if(x != NULL)
{
x->type = XJ_ARRAY;
x->size = count;
x->as_array = head;
}
return x;
}
xj_value *xj_value_array(xj_value *head, xj_alloc *alloc, xj_error *error)
{
int count = 0;
xj_value *curs = head;
while(curs != NULL)
{
if(curs->key != NULL)
{
/* Array child has a
key associated to it? */
return NULL;
}
count += 1;
curs = curs->next;
}
return xj_value_array__nocheck(head, count, alloc, error);
}
xj_value *xj_value_object__nocheck(xj_value *head, int count, xj_alloc *alloc, xj_error *error)
{
if(count < 0)
{
count = 0;
xj_value *curs = head;
while(curs != NULL)
{
count += 1;
curs = curs->next;
}
}
xj_value *x = xj_value_null(alloc, error);
if(x != NULL)
{
x->type = XJ_OBJECT;
x->size = count;
x->as_object = head;
}
return x;
}
xj_value *xj_value_object(xj_value *head, xj_alloc *alloc, xj_error *error)
{
int count = 0;
xj_value *curs = head;
while(curs != NULL)
{
if(curs->key == NULL)
{
/* Object child has no
key associated to it! */
return NULL;
}
xj_value *curs2 = head;
while(curs2 != curs)
{
if(!strcmp(curs->key, curs2->key))
{
/* Duplicate key. */
return NULL;
}
curs2 = curs2->next;
}
count += 1;
curs = curs->next;
}
return xj_value_object__nocheck(head, count, alloc, error);
}
_Bool xj_array_append(xj_value *array, xj_value *child,
xj_error *error)
{
assert(array != NULL);
if(child != NULL)
{
if(child->key != NULL)
{
xj_report(error, "Array child can't have a key");
return 0;
}
if(child->next != NULL)
{
xj_report(error, "Array child can't be in a list");
return 0;
}
// Find the end of the array
xj_value **tail;
if(array->as_array == NULL)
// The tail is the base node pointer
tail = &array->as_array;
else
{
// Scan the list 'til the end
xj_value *curs = array->as_array;
while(curs->next != NULL)
curs = curs->next;
tail = &curs;
}
*tail = child;
}
return 1;
}
char *xj_strdup(const char *str, int len, xj_alloc *alloc, xj_error *error)
{
assert(str != NULL);
if(len < 0)
len = strlen(str);
char *copy = xj_bpalloc(alloc, len+1);
if(copy == NULL)
xj_report(error, "Out of memory");
else
{
memcpy(copy, str, len);
copy[len] = '\0';
}
return copy;
}
typedef struct {
const char *str;
int i, len, depth;
xj_alloc *alloc;
xj_error *error;
} context_t;
/* Symbol:
* xutf8_sequence_from_utf32_codepoint
*
* Description:
* Transform a UTF-32 encoded codepoint to a UTF-8 encoded byte sequence.
*
* Arguments:
* utf8_data: Refers to the location of the UTF-8 sequence of bytes.
*
* nbytes: The maximum number of bytes that can be written to [utf8_data].
* It can't be negative.
*
* utf32_code: UTF-32 codepoint that needs to be converted.
*
* Returns:
* If [utf32_code] is valid UTF-32 and the provided buffer is big enough,
* the UTF-8 equivalent sequence is stored in [utf8_data]. No more than
* [nbytes] are ever written. If one of those conitions isn't true, -1 is
* returned.
*
* Notes:
* This was taken by the cozis/xUTF8 library on github.com
*/
static int xutf8_sequence_from_utf32_codepoint(char *utf8_data, int nbytes, uint32_t utf32_code)
{
if(utf32_code < 128)
{
if(nbytes < 1)
return -1;
utf8_data[0] = utf32_code;
return 1;
}
if(utf32_code < 2048)
{
if(nbytes < 2)
return -1;
utf8_data[0] = 0xc0 | (utf32_code >> 6);
utf8_data[1] = 0x80 | (utf32_code & 0x3f);
return 2;
}
if(utf32_code < 65536)
{
if(nbytes < 3)
return -1;
utf8_data[0] = 0xe0 | (utf32_code >> 12);
utf8_data[1] = 0x80 | ((utf32_code >> 6) & 0x3f);
utf8_data[2] = 0x80 | (utf32_code & 0x3f);
return 3;
}
if(utf32_code <= 0x10ffff)
{
if(nbytes < 4)
return -1;
utf8_data[0] = 0xf0 | (utf32_code >> 18);
utf8_data[1] = 0x80 | ((utf32_code >> 12) & 0x3f);
utf8_data[2] = 0x80 | ((utf32_code >> 6) & 0x3f);
utf8_data[3] = 0x80 | (utf32_code & 0x3f);
return 4;
}
// Code is out of range for UTF-8.
return -1;
}
/* Symbol
* xutf8_sequence_to_utf32_codepoint
*
* Description
* Transform a UTF-8 encoded byte sequence pointed by `utf8_data`
* into a UTF-32 encoded codepoint.
*
* Arguments:
* utf8_data: Refers to the location of the UTF-8 byte sequence.
*
* nbytes: The maximum number of bytes that can be read after
* [utf8_data]. It can't be negative.
*
* utf32_code: Location where the encoded UTF-32 code will be stored.
* It may be NULL, in which case the value is evaluated
* and then thrown away.
*
* Returns:
* The codepoint is returned through the output parameter `utf32_code`.
* The returned value is the number of bytes of the UTF-8 sequence that
* were scanned to encode the UTF-32 code, or -1 if the UTF-8 sequence
* is invalid.
*
* Notes:
* By calling this function with a NULL [utf32_code], you can check the
* validity of a UTF-8 sequence.
*
* The [nbytes] argument has no relation to the UTF-8 byte count sequence.
* You may think about this argument as the "raw" string length (the one
* [strlen] whould return if [utf8_data] were zero-terminated).
*
* This was taken by the cozis/xUTF8 library on github.com
*/
static int xutf8_sequence_to_utf32_codepoint(const char *utf8_data, int nbytes, uint32_t *utf32_code)
{
assert(utf8_data != NULL);
assert(nbytes >= 0);
uint32_t dummy;
if(utf32_code == NULL)
utf32_code = &dummy;
if(nbytes == 0)
return -1;
if(utf8_data[0] & 0x80)
{
// May be UTF-8.
if((unsigned char) utf8_data[0] >= 0xF0)
{
// 4 bytes.
// 11110xxx 10xxxxxx 10xxxxxx 10xxxxxx
if(nbytes < 4)
return -1;
uint32_t temp
= (((uint32_t) utf8_data[0] & 0x07) << 18)
| (((uint32_t) utf8_data[1] & 0x3f) << 12)
| (((uint32_t) utf8_data[2] & 0x3f) << 6)
| (((uint32_t) utf8_data[3] & 0x3f));
if(temp > 0x10ffff)
return -1;
*utf32_code = temp;
return 4;
}
if((unsigned char) utf8_data[0] >= 0xE0)
{
// 3 bytes.
// 1110xxxx 10xxxxxx 10xxxxxx
if(nbytes < 3)
return -1;
uint32_t temp
= (((uint32_t) utf8_data[0] & 0x0f) << 12)
| (((uint32_t) utf8_data[1] & 0x3f) << 6)
| (((uint32_t) utf8_data[2] & 0x3f));
if(temp > 0x10ffff)
return -1;
*utf32_code = temp;
return 3;
}
if((unsigned char) utf8_data[0] >= 0xC0)
{
// 2 bytes.
// 110xxxxx 10xxxxxx
if(nbytes < 2)
return -1;
*utf32_code
= (((uint32_t) utf8_data[0] & 0x1f) << 6)
| (((uint32_t) utf8_data[1] & 0x3f));
assert(*utf32_code <= 0x10ffff);
return 2;
}
// 1 byte
// 10xxxxxx
*utf32_code = (uint32_t) utf8_data[0] & 0x3f;
return 1;
}
// It's ASCII
// 0xxxxxxx
*utf32_code = (uint32_t) utf8_data[0];
return 1;
}
static _Bool parse_XXXX_after_u(context_t *ctx, uint16_t *res)
{
const char *bytes = ctx->str + ctx->i;
if(ctx->i+3 >= ctx->len
|| !isxdigit(bytes[0]) || !isxdigit(bytes[1])
|| !isxdigit(bytes[2]) || !isxdigit(bytes[3]))
{
xj_preport(ctx->error, ctx->str, ctx->i,
"The \\u specifier expects 4 hex digits after it");
return 0;
}
ctx->i += 4;
uint16_t rune = 0;
for(int i = 0; i < 4; i += 1)
{
char c = tolower(bytes[i]);
if(isdigit(c))
c = c - '0';
else
c = c - 'a' + 10;
rune |= c << ((3 - i) * 4);
}
if(res)
*res = rune;
return 1;
}
typedef struct {
char *buffer;
int size, capacity;
char maybe[256];
} string_parsing_context_t;
static _Bool spc_append(string_parsing_context_t *spc, const char *str, int len)
{
if(spc->size + len > spc->capacity)
{
// Grow the buffer.
int new_capacity = spc->capacity * 2;
if(new_capacity < (spc->size + len))
new_capacity = (spc->size + len);
char *temp;
if(spc->maybe == spc->buffer)
{
temp = malloc(new_capacity);
if(temp == NULL)
return 0;
memcpy(temp, spc->buffer, spc->size);
}
else
{
temp = realloc(spc->buffer, new_capacity);
if(temp == NULL)
return 0;
}
spc->buffer = temp;
spc->capacity = new_capacity;
}
memcpy(spc->buffer + spc->size, str, len);
spc->size += len;
return 1;
}
static void spc_free(string_parsing_context_t *spc)
{
if(spc->maybe != spc->buffer)
free(spc->buffer);
}
static void *parse_string(context_t *ctx, _Bool raw)
{
// This is probably the hottest function of the
// parser. JSON documents contain a lot of strings.
// The string is scanned and copied into a temporary
// buffer, then the buffer is transformed into
// the final form that will be returned.
assert(ctx->i < ctx->len && ctx->str[ctx->i] == '"');
string_parsing_context_t spc;
{
spc.buffer = spc.maybe;
spc.size = 0;
spc.capacity = sizeof(spc.maybe);
}
ctx->i += 1; // Skip '"'.
while(1)
{
int start = ctx->i;
while(ctx->i < ctx->len
&& ctx->str[ctx->i] != '\\'
&& ctx->str[ctx->i] != '"'
&& (unsigned char) ctx->str[ctx->i] >= 32
&& (unsigned char) ctx->str[ctx->i] <= 127)
ctx->i += 1;
if(ctx->i == ctx->len)
{
xj_report(ctx->error, "String ended inside a string value");
spc_free(&spc);
return NULL;
}
if((unsigned char) ctx->str[ctx->i] < 32)
{
xj_preport(ctx->error, ctx->str, ctx->i, "String contains control characters");
spc_free(&spc);
return NULL;
}
int end = ctx->i;
if(!spc_append(&spc, ctx->str + start, end - start))
{
xj_report(ctx->error, "Out of memory");
spc_free(&spc);
return NULL;
}
if(ctx->str[ctx->i] == '"')
break;
if(ctx->str[ctx->i] == '\\')
{
ctx->i += 1; // Skip '\'.
if(ctx->i == ctx->len)
{
xj_report(ctx->error, "String ended inside a string");
spc_free(&spc);
return NULL;
}
uint32_t rune;
int rune_byte_count = xutf8_sequence_to_utf32_codepoint(ctx->str + ctx->i, ctx->len - ctx->i, &rune);
if(rune == 'u')
{
int start = ctx->i-1; // Points to the '\'.
assert(start >= 0);
assert(rune_byte_count == 1);
ctx->i += 1; // Skip the 'u'.
uint16_t first_half;
if(!parse_XXXX_after_u(ctx, &first_half))
{
spc_free(&spc);
return NULL;
}
int end = ctx->i;
_Bool have_2_parts = 0;
uint16_t second_half;
if(ctx->i+1 < ctx->len && ctx->str[ctx->i] == '\\'
&& ctx->str[ctx->i+1] == 'u')
{
have_2_parts = 1;
ctx->i += 2; // Skip the "\u".
if(!parse_XXXX_after_u(ctx, &second_half))
{
spc_free(&spc);
return NULL;
}
end = ctx->i;
}
uint32_t rune = first_half;
if(have_2_parts)
rune = (rune << 16) | second_half;
char as_utf8[16];
int byte_count_as_utf8 = xutf8_sequence_from_utf32_codepoint(as_utf8, sizeof(as_utf8), rune);
if(byte_count_as_utf8 < 0)
{
// Failed to convert to UTF-8.
// Either the rune isn't valid unicode or
// the buffer is too small to hold the
// UTF-8 text. We'll assume the buffer is
// big enough to hold any UTF-8 symbol and
// the error is due to malformed unicode.
// If the invalid UTF-32 token was invalid
// but composed of two \uXXXX tokens, maybe
// they're valid individually.
if(have_2_parts == 0)
{
xj_preport(ctx->error, ctx->str, start, "Invalid unicode symbol %.*s", end - start, ctx->str + start);
spc_free(&spc);
return NULL;
}
rune = first_half;
byte_count_as_utf8 = xutf8_sequence_from_utf32_codepoint(as_utf8, sizeof(as_utf8), rune);
if(byte_count_as_utf8 < 0)
{
xj_preport(ctx->error, ctx->str, start, "Invalid unicode symbol %.*s", end - start, ctx->str + start);
spc_free(&spc);
return NULL;
}
if(!spc_append(&spc, as_utf8, byte_count_as_utf8))
{
xj_report(ctx->error, "Out of memory");
spc_free(&spc);
return NULL;
}
rune = second_half;
byte_count_as_utf8 = xutf8_sequence_from_utf32_codepoint(as_utf8, sizeof(as_utf8), rune);
if(byte_count_as_utf8 < 0)
{
xj_preport(ctx->error, ctx->str, start, "Invalid unicode symbol %.*s", end - start, ctx->str + start);
spc_free(&spc);
return NULL;
}
if(!spc_append(&spc, as_utf8, byte_count_as_utf8))
{
xj_report(ctx->error, "Out of memory");
spc_free(&spc);
return NULL;
}
}
else
{
if(!spc_append(&spc, as_utf8, byte_count_as_utf8))
{
xj_report(ctx->error, "Out of memory");
spc_free(&spc);
return NULL;
}
}
}
else
{
const char *s; int l;
switch(rune)
{
case 'n': s = "\n"; l = 1; break;
case 't': s = "\t"; l = 1; break;
case 'b': s = "\b"; l = 1; break;
case 'f': s = "\f"; l = 1; break;
case 'r': s = "\r"; l = 1; break;
default:
s = ctx->str + ctx->i;
l = rune_byte_count;
break;
}
ctx->i += rune_byte_count;
if(!spc_append(&spc, s, l))
{
xj_report(ctx->error, "Out of memory");
spc_free(&spc);
return NULL;
}
}
}
else
{
assert(!isascii(ctx->str[ctx->i]));
int n = xutf8_sequence_to_utf32_codepoint(ctx->str + ctx->i, ctx->len - ctx->i, NULL);
if(n < 0)
{
xj_preport(ctx->error, ctx->str, ctx->i, "Invalid UTF-8");
spc_free(&spc);
return NULL;
}
assert(n > 0);
if(!spc_append(&spc, ctx->str + ctx->i, n))
{
xj_report(ctx->error, "Out of memory");
spc_free(&spc);
return NULL;
}
ctx->i += n;
}
}
ctx->i += 1; // Skip '"'.
void *p = raw ? (void*) xj_strdup(spc.buffer, spc.size, ctx->alloc, ctx->error)
: (void*) xj_value_string(spc.buffer, spc.size, ctx->alloc, ctx->error);
if(p == NULL)
xj_report(ctx->error, "No memory");
spc_free(&spc);
return p;
}
static xj_value *parse_number(context_t *ctx)
{
assert(ctx->i < ctx->len && (isdigit(ctx->str[ctx->i]) || ctx->str[ctx->i] == '-'));
_Bool negative = 0;
if(ctx->str[ctx->i] == '-')
{
negative = 1;
ctx->i += 1; // Skip '-'.
if(ctx->i == ctx->len)
{
xj_report(ctx->error, "String ended inside after minus sign");
return NULL;
}
if(!isdigit(ctx->str[ctx->i]))
{
xj_preport(ctx->error, ctx->str, ctx->i, "Expected a digit after minus sign");
return NULL;
}
}
// NOTE: We allow non-0 numbers starting with 0.
xj_i64 parsed = 0;
while(ctx->i < ctx->len && isdigit(ctx->str[ctx->i]))
{
if(parsed > (INT64_MAX - ctx->str[ctx->i] + '0') / 10)
{
/* Overflow */
xj_preport(ctx->error, ctx->str, ctx->i, "Integer would overflow");
return NULL;
}
parsed = parsed * 10 + ctx->str[ctx->i] - '0';
ctx->i += 1;
}
xj_bool followed_by_dot = ctx->i+1 < ctx->len && ctx->str[ctx->i] == '.' && isdigit(ctx->str[ctx->i+1]);
xj_f64 decimal;
if(followed_by_dot)
{
ctx->i += 1; // Skip '.'.
xj_f64 f = 1.0;
decimal = 0;
while(ctx->i < ctx->len && isdigit(ctx->str[ctx->i]))
{
f /= 10;
decimal += f * (ctx->str[ctx->i] - '0');
ctx->i += 1;
}
}
_Bool have_exponent = 0;
xj_f64 coeff;
if(ctx->i < ctx->len && (ctx->str[ctx->i] == 'e' || ctx->str[ctx->i] == 'E'))
{
ctx->i += 1; // Skip 'e'.
if(ctx->i == ctx->len)
{
xj_report(ctx->error, "String ended where an exponent was expected");
return NULL;
}
int exponent_start = ctx->i;
_Bool negative_exponent = 0;
if(ctx->str[ctx->i] == '+' || ctx->str[ctx->i] == '-')
{
if(ctx->str[ctx->i] == '-')
negative_exponent = 1;
ctx->i += 1;
if(ctx->i == ctx->len)
{
xj_report(ctx->error, "String ended where an exponent was expected");
return NULL;
}
}
if(!isdigit(ctx->str[ctx->i]))
{
xj_preport(ctx->error, ctx->str, ctx->i, "Expected digit as exponent");
return NULL;
}
have_exponent = 1;
int exponent = 0;
while(ctx->i < ctx->len && isdigit(ctx->str[ctx->i]))
{
exponent = exponent * 10 + ctx->str[ctx->i] - '0';
ctx->i += 1;
}
if(exponent > XJ_MAX_EXPNT)
{
xj_preport(ctx->error, ctx->str, exponent_start, "Exponent is too big");
return NULL;
}
coeff = 1;
for(int j = 0; j < exponent; j += 1)
coeff *= 10;
if(negative_exponent)
coeff = -coeff;
}
xj_value *v;
if(followed_by_dot)
{
xj_f64 r = (xj_f64) parsed + decimal;
if(negative)
r = -r;
if(have_exponent)
r = r * coeff;
v = xj_value_float(r, ctx->alloc, ctx->error);
}
else
{
xj_i64 r = parsed;
if(negative)
r = -r;
if(have_exponent)
r = r * coeff;
v = xj_value_int(r, ctx->alloc, ctx->error);
}
return v;
}
static xj_value *parse_value(context_t *ctx);
static xj_value *parse_array(context_t *ctx)
{
assert(ctx->i < ctx->len && ctx->str[ctx->i] == '[');
ctx->i += 1; // Skip '['.
// Skip whitespace.
while(ctx->i < ctx->len && isspace(ctx->str[ctx->i]))
ctx->i += 1;
if(ctx->i == ctx->len)
{
xj_report(ctx->error, "String ended inside an array, right after the first '['");
return NULL;
}
if(ctx->str[ctx->i] == ']') /* Empty array */
{
ctx->i += 1; // Skip ']'.
return xj_value_array__nocheck(NULL, 0, ctx->alloc, ctx->error);
}
xj_value *head = NULL;
xj_value **tail = &head;
int count = 0;
while(1)
{
xj_value *child = parse_value(ctx);
if(child == NULL)
return NULL;
// Skip whitespace.
while(ctx->i < ctx->len && isspace(ctx->str[ctx->i]))
ctx->i += 1;
if(ctx->i == ctx->len)
{
xj_report(ctx->error, "String ended inside an array, right after the %dth child", count+1);
return NULL;
}
*tail = child;
tail = &child->next;
count += 1;
if(ctx->str[ctx->i] == ']')
break;
if(ctx->str[ctx->i] != ',')
{
xj_preport(ctx->error, ctx->str, ctx->i, "Bad character '%c' inside of an array", ctx->str[ctx->i]);
return NULL;
}
ctx->i += 1; // Skip ','.
// Skip whitespace.
while(ctx->i < ctx->len && isspace(ctx->str[ctx->i]))
ctx->i += 1;
if(ctx->i == ctx->len)
{
xj_report(ctx->error, "String ended inside an array, right after the ',' after the %dth child", count+1);
return NULL;
}
}
ctx->i += 1; // Skip ']'.
return xj_value_array__nocheck(head, count, ctx->alloc, ctx->error);
}
static xj_value *parse_object(context_t *ctx)
{
assert(ctx->i < ctx->len && ctx->str[ctx->i] == '{');
ctx->i += 1; // Skip '{'.
// Skip whitespace.
while(ctx->i < ctx->len && isspace(ctx->str[ctx->i]))
ctx->i += 1;
if(ctx->i == ctx->len)
{
xj_report(ctx->error, "String ended inside an object, right after the first '{'");
return NULL;
}
if(ctx->str[ctx->i] == '}') /* Empty object */
{
ctx->i += 1; // Skip '}'.
return xj_value_object__nocheck(NULL, 0, ctx->alloc, ctx->error);
}
xj_value *head = NULL;
xj_value **tail = &head;
int count = 0;
while(1)
{
if(ctx->str[ctx->i] != '"')
{
xj_preport(ctx->error, ctx->str, ctx->i, "Bad character '%c' where a string was expected");
return NULL;
}
char *key = parse_string(ctx, 1);
if(key == NULL)
return NULL;
// Skip whitespace before ':'.
while(ctx->i < ctx->len && isspace(ctx->str[ctx->i]))
ctx->i += 1;
if(ctx->i == ctx->len)
{
xj_report(ctx->error, "String ended inside an object, right after the %dth child's key", count+1);
return NULL;
}
if(ctx->str[ctx->i] != ':')
{
xj_preport(ctx->error, ctx->str, ctx->i, "Bad character '%c' where ':' was expected");
return NULL;
}
ctx->i += 1; // Skip the ':'.
// Skip whitespace after ':'.
while(ctx->i < ctx->len && isspace(ctx->str[ctx->i]))
ctx->i += 1;
xj_value *child = parse_value(ctx);
if(child == NULL)
return NULL;
// Skip whitespace.
while(ctx->i < ctx->len && isspace(ctx->str[ctx->i]))
ctx->i += 1;
if(ctx->i == ctx->len)
{
xj_report(ctx->error, "String ended inside an object, right after the %dth child", count+1);
return NULL;
}
child->key = key;
*tail = child;
tail = &child->next;
count += 1;
if(ctx->str[ctx->i] == '}')
break;
if(ctx->str[ctx->i] != ',')
{
xj_preport(ctx->error, ctx->str, ctx->i, "Bad character '%c' inside of an object", ctx->str[ctx->i]);
return NULL;
}
ctx->i += 1; // Skip ','.
// Skip whitespace.
while(ctx->i < ctx->len && isspace(ctx->str[ctx->i]))
ctx->i += 1;
if(ctx->i == ctx->len)
{
xj_report(ctx->error, "String ended inside an object, right after the ',' after the %dth child", count+1);
return NULL;
}
}
ctx->i += 1; // Skip '}'.
return xj_value_object__nocheck(head, count, ctx->alloc, ctx->error);
}
static xj_value *parse_bool_or_null(context_t *ctx)
{
static const char kword_null [] = "null";
static const char kword_true [] = "true";
static const char kword_false[] = "false";
const char *kword;
int kwlen;
char c = ctx->str[ctx->i];
if(c == 'n')
{
kword = kword_null;
kwlen = sizeof(kword_null)-1;
}
else if(c == 't')
{
kword = kword_true;
kwlen = sizeof(kword_true)-1;
}
else if(c == 'f')
{
kword = kword_false;
kwlen = sizeof(kword_false)-1;
}
else
{
xj_preport(ctx->error, ctx->str, ctx->i, "Bad character '%c'", c);
return NULL;
}
if(ctx->i + kwlen <= ctx->len && !strncmp(ctx->str + ctx->i, kword, kwlen))
{
ctx->i += kwlen;
switch(c)
{
case 'n': return xj_value_null(ctx->alloc, ctx->error);
case 't': return xj_value_bool(1, ctx->alloc, ctx->error);
case 'f': return xj_value_bool(0, ctx->alloc, ctx->error);
}
/* UNREACHABLE */
}
if(ctx->i + kwlen > ctx->len)
{
xj_report(ctx->error, "String ended unexpectedly");
return NULL;
}
// Get to the character that made the comparison fail
int p = 0;
while(kword[p] == ctx->str[ctx->i+p])
p += 1;
ctx->i += p;
xj_preport(ctx->error, ctx->str, ctx->i,
"Bad character '%c'", ctx->str[ctx->i]);
return NULL;
}
static xj_value *parse_value(context_t *ctx)
{
if(ctx->i == ctx->len)
{
xj_report(ctx->error, "String ended where a value was expected");
return NULL;
}
if(ctx->depth+1 == XJ_MAX_DEPTH)
{
xj_preport(ctx->error, ctx->str, ctx->i, "Maximum depth reached");
return NULL;
}
ctx->depth += 1;
assert(!isspace(ctx->str[ctx->i]));
xj_value *res;
char c = ctx->str[ctx->i];
if(c == '"')
res = parse_string(ctx, 0);
else if(isdigit(c) || c == '-')
res = parse_number(ctx);
else if(c == '[')
res = parse_array(ctx);
else if(c == '{')
res = parse_object(ctx);
else
res = parse_bool_or_null(ctx);
ctx->depth -= 1;
return res;
}
/* Symbol:
* xj_decode
*
* Description:
* Transform a JSON UTF-8 string to a tree of [xj_value] nodes.
*
* Arguments:
* str: The string to be parsed. It's doesn't need to be
* zero-terminated. If NULL, an empty string is assumed.
*
* len: The length of [str] (in bytes). If negative, [str] is
* assumed to be zero-terminated and [len] is computed
* using [strlen].
*
* alloc: The allocator that will be used to store the parsing
* result. It's not optional (can't be NULL).
*
* error: The reference to a caller-allocated [xj_error]. If
* an error occurres (NULL is returned) then this is
* used to provide the caller with useful information
* regarting the failure. It's not required and can be
* NULL.
*
* Returns:
* The pointer to a tree of [xj_value] nodes, or NULL on failure.
* If NULL is returned and an [xj_error] is provided, than it's
* fields are set to provide the caller with extra information
* related to the failure.
*
* Notes:
* The returned objects are deallocated with the whole allocator
* when calling [xj_alloc_del].
*/
xj_value *xj_decode(const char *str, int len,
xj_alloc *alloc, xj_error *error)
{
if(str == NULL)
str = "";
if(len < 0)
len = strlen(str);
if(error != NULL)
memset(error, 0, sizeof(xj_error));
int i = 0;
// Skip whitespace
while(i < len && isspace(str[i]))
i += 1;
if(i == len)
{
xj_report(error, "The string only contains whitespace");
return NULL;
}
context_t ctx = {
.str = str, .i = i, .len = len, .depth = 0,
.alloc = alloc, .error = error };
return parse_value(&ctx);
}
typedef struct bucket_t bucket_t;
/* Symbol:
* bucket_t
*
* Description:
* A memory region that linked with other [bucket_t]
* can represent long strings of text. It's a sub-type
* of [bucket_t].
*
* Notes:
* This is a big structure.
*
* The [body]'s was chosen to be such that the whole
* [bucket_t] is 4kb big, but it's not really necessary.
*/
struct bucket_t {
bucket_t *next;
char body[4096-sizeof(void*)];
};
/* Symbol:
* buffer_t
*
* Description:
* A buffer that can be used to build large strings
* without the degradation of performance that one
* would get by using a plain dinamically growing
* array.
* It's implemented as a linked list of chunks, so
* it grows by adding new chunks, without the need
* to move the old chunks.
*
* Fields:
* size: The absolute string size (in bytes) that is
* contained in the buffer. When the buffer is
* serialized, the resulting string will have
* this size.
*
* used: The amount of bytes held by the last chunk.
*
* tail: The pointer to the last chunk.
*
* head: The first chunk of the buffer. It's not a
* pointer because it's pre-allocated with
* the [buffer_t].
*
* Notes:
* The fact that the first chunk comes preallocated with
* the buffer makes it a large structure. A [bucket_t] is
* around 4kb, so a buffer will be bigger than that.
*
* The [head] is the last field so that the other fields
* are contiguous in memory. If [head] were between other
* fields, then there would be a 4kb distance between them.
*/
typedef struct {
int size, used;
bucket_t *tail, head;
} buffer_t;
/* Symbol:
* buffer_append
*
* Description:
* Appends a string to a [buffer_t].
*
* Returns:
* 1 if all went well or 0 if an error occurred.
*/
static xj_bool buffer_append(buffer_t *buff, const char *str, int len)
{
assert(str != NULL && len >= 0);
// If there's not enough memory in the tail chunk
// then create a new tail chunk!
if(buff->used + len > (int) sizeof(buff->tail->body))
{
// It's not possible to add a string that
// is bigger than a chunk.
if(len > (int) sizeof(buff->tail->body))
return 0;
bucket_t *buck = malloc(sizeof(bucket_t));
if(buck == NULL)
return 0;
buck->next = NULL;
buff->tail->next = buck;
buff->tail = buck;
buff->used = 0;
}
memcpy(buff->tail->body + buff->used, str, len);
buff->used += len;
buff->size += len;
return 1;
}
/* Symbol:
* encode_string
*
* Description:
* Serializes a string to a [buffer_t] in JSON form.
*
* Returns:
* 1 if all went well or 0 if an error occurred.
*/
static _Bool encode_string(const char *str, int len, buffer_t *buff)
{
assert(str != NULL && len >= 0);
if(!buffer_append(buff, "\"", 1))
return 0;
int i = 0;
while(1)
{
int start = i;
while(i < len && str[i] != '"' && str[i] != '\\'
&& (unsigned char) str[i] >= 32
&& (unsigned char) str[i] <= 127)
i += 1;
int end = i;
if(!buffer_append(buff, str + start, end - start))
return 0;
if(i == len)
break;
if(str[i] == '"')
{
if(!buffer_append(buff, "\\\"", 2))
return 0;
i += 1;
}
else if(str[i] == '\\')
{
if(!buffer_append(buff, "\\\\", 2))
return 0;
i += 1;
}
else if((unsigned char) str[i] < 32)
{
char *m = NULL;
switch(str[i])
{
case '\t': m = "\\t"; break;
case '\n': m = "\\n"; break;
case '\b': m = "\\b"; break;
case '\f': m = "\\f"; break;
case '\r': m = "\\r"; break;
default:
assert(0);
// Unexpected control character.
break;
}
assert(m != NULL);
if(!buffer_append(buff, m, 2))
return 0;
i += 1;
}
else
{
uint32_t rune;
int scanned = xutf8_sequence_to_utf32_codepoint(str + i, len - i, &rune);
if(scanned < 0)
{
assert(0);
// Invalid UTF-8
}
static const char map[] = "0123456789ABCDEF";
char buffer[13];
int used;
if((rune >> 16) == 0)
{
used = 6;
buffer[0] = '\\';
buffer[1] = 'u';
buffer[2] = map[(rune >> 12) & 0xF];
buffer[3] = map[(rune >> 8) & 0xF];
buffer[4] = map[(rune >> 4) & 0xF];
buffer[5] = map[(rune >> 0) & 0xF];
buffer[6] = '\0';
}
else
{
used = 12;
buffer[0] = '\\';
buffer[1] = 'u';
buffer[2] = map[(rune >> 28) & 0xF];
buffer[3] = map[(rune >> 24) & 0xF];
buffer[4] = map[(rune >> 20) & 0xF];
buffer[5] = map[(rune >> 16) & 0xF];
buffer[6] = '\\';
buffer[7] = 'u';
buffer[8] = map[(rune >> 12) & 0xF];
buffer[9] = map[(rune >> 8) & 0xF];
buffer[10] = map[(rune >> 4) & 0xF];
buffer[11] = map[(rune >> 0) & 0xF];
buffer[12] = '\0';
}
if(!buffer_append(buff, buffer, used))
return 0;
i += scanned;
}
}
if(!buffer_append(buff, "\"", 1))
return 0;
return 1;
}
/* Symbol:
* encode_value
*
* Description:
* Serializes an [xj_value] to a [buffer_t]
*
* Returns:
* 1 if all went well or 0 if an error occurred.
*/
static _Bool encode_value(xj_value *val, buffer_t *buff)
{
switch(val == NULL ? XJ_NULL : val->type)
{
case XJ_NULL:
return buffer_append(buff, "null", 4);
case XJ_BOOL:
return val->as_bool
? buffer_append(buff, "true", 4)
: buffer_append(buff, "false", 5);
case XJ_INT:
{
char temp[32];
int k = snprintf(temp, sizeof(temp),
"%lld", val->as_int);
assert(k >= 0 && k < (int) sizeof(temp));
if(!buffer_append(buff, temp, k))
return 0;
return 1;
}
case XJ_FLOAT:
{
char temp[32];
int k = snprintf(temp, sizeof(temp),
"%g", val->as_float);
assert(k >= 0 && k < (int) sizeof(temp));
if(!buffer_append(buff, temp, k))
return 0;
return 1;
}
case XJ_ARRAY:
{
if(!buffer_append(buff, "[", 1))
return 0;
xj_value *child = val->as_object;
while(child != NULL)
{
if(!encode_value(child, buff))
return 0;
child = child->next;
if(child != NULL)
if(!buffer_append(buff, ", ", 2))
return 0;
}
if(!buffer_append(buff, "]", 1))
return 0;
return 1;
}
case XJ_OBJECT:
{
if(!buffer_append(buff, "{", 1))
return 0;
xj_value *child = val->as_object;
while(child != NULL)
{
if(!encode_string(child->key, strlen(child->key), buff))
return 0;
if(!buffer_append(buff, ": ", 2))
return 0;
if(!encode_value(child, buff))
return 0;
child = child->next;
if(child != NULL)
if(!buffer_append(buff, ", ", 2))
return 0;
}
if(!buffer_append(buff, "}", 1))
return 0;
return 1;
}
case XJ_STRING:
return encode_string(val->as_string, val->size, buff);
}
return 0;
}
/* Symbol:
* xj_encode
*
* Description:
* Transforms an [xj_value] to a string.
*
* Arguments:
* value: The object to be converted to a string.
*
* len: An output argument that returns the length
* of the generated string. It's optional, so
* it can be NULL.
*
* Returns:
* The pointer to a zero-terminated string if all went
* well or NULL.
*
* Notes:
* The returned pointer, if not NULL, must be
* deallocated using [free].
*/
char *xj_encode(xj_value *value, int *len)
{
buffer_t buff;
buff.size = 0;
buff.used = 0;
buff.tail = &buff.head;
buff.head.next = NULL;
_Bool ok = encode_value(value, &buff);
char *serialized = NULL;
if(ok)
{
/* Serialize */
serialized = malloc(buff.size+1);
if(serialized != NULL)
{
int copied = 0;
bucket_t *curs = &buff.head;
while(curs->next != NULL)
{
memcpy(serialized + copied,
curs->body, sizeof(curs->body));
copied += sizeof(curs->body);
curs = curs->next;
}
memcpy(serialized + copied,
curs->body, buff.used);
serialized[buff.size] = '\0';
if(len)
*len = buff.size;
}
}
/* Free the buffer */
bucket_t *curs = buff.head.next;
while(curs != NULL)
{
bucket_t *next = curs->next;
free(curs);
curs = next;
}
return serialized;
}
Reference in New Issue View Git Blame Copy Permalink