mirror of
https://github.com/openharmony/third_party_vulkan-loader.git
synced 2026-07-19 17:13:36 -04:00
89db313139
Signed-off-by: ZhangLiang <zhangliang335@h-partners.com>
1807 lines
54 KiB
C
1807 lines
54 KiB
C
/*
|
|
Copyright (c) 2009-2017 Dave Gamble and cJSON contributors
|
|
|
|
Permission is hereby granted, free of charge, to any person obtaining a copy
|
|
of this software and associated documentation files (the "Software"), to deal
|
|
in the Software without restriction, including without limitation the rights
|
|
to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
|
|
copies of the Software, and to permit persons to whom the Software is
|
|
furnished to do so, subject to the following conditions:
|
|
|
|
The above copyright notice and this permission notice shall be included in
|
|
all copies or substantial portions of the Software.
|
|
|
|
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
|
|
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
|
|
FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
|
|
AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
|
|
LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
|
|
OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
|
|
THE SOFTWARE.
|
|
*/
|
|
|
|
/* cJSON */
|
|
/* JSON parser in C. */
|
|
|
|
/* disable warnings about old C89 functions in MSVC */
|
|
#if !defined(_CRT_SECURE_NO_DEPRECATE) && defined(_MSC_VER)
|
|
#define _CRT_SECURE_NO_DEPRECATE
|
|
#endif
|
|
|
|
#ifdef __GNUC__
|
|
#pragma GCC visibility push(default)
|
|
#endif
|
|
#if defined(_MSC_VER)
|
|
#pragma warning(push)
|
|
/* disable warning about single line comments in system headers */
|
|
#pragma warning(disable : 4001)
|
|
#endif
|
|
|
|
#include <string.h>
|
|
#include <stdio.h>
|
|
#include <math.h>
|
|
#include <stdlib.h>
|
|
#include <limits.h>
|
|
#include <ctype.h>
|
|
#include <float.h>
|
|
|
|
#ifdef ENABLE_LOCALES
|
|
#include <locale.h>
|
|
#endif
|
|
|
|
#if defined(_MSC_VER)
|
|
#pragma warning(pop)
|
|
#endif
|
|
#ifdef __GNUC__
|
|
#pragma GCC visibility pop
|
|
#endif
|
|
|
|
#include "cJSON.h"
|
|
|
|
#include <vulkan/vulkan_core.h>
|
|
|
|
#include "allocation.h"
|
|
|
|
/* define our own boolean type */
|
|
#ifdef true
|
|
#undef true
|
|
#endif
|
|
#define true ((cJSON_bool)1)
|
|
|
|
#ifdef false
|
|
#undef false
|
|
#endif
|
|
#define false ((cJSON_bool)0)
|
|
|
|
/* define isnan and isinf for ANSI C, if in C99 or above, isnan and isinf has been defined in math.h */
|
|
#ifndef isinf
|
|
#define isinf(d) (isnan((d - d)) && !isnan(d))
|
|
#endif
|
|
#ifndef isnan
|
|
#define isnan(d) (d != d)
|
|
#endif
|
|
|
|
#ifndef NAN
|
|
#ifdef _WIN32
|
|
#define NAN sqrt(-1.0)
|
|
#else
|
|
#define NAN 0.0 / 0.0
|
|
#endif
|
|
#endif
|
|
|
|
typedef struct {
|
|
const unsigned char *json;
|
|
size_t position;
|
|
} error;
|
|
static error global_error = {NULL, 0};
|
|
|
|
CJSON_PUBLIC(const char *) cJSON_GetErrorPtr(void) { return (const char *)(global_error.json + global_error.position); }
|
|
|
|
CJSON_PUBLIC(char *) loader_cJSON_GetStringValue(const cJSON *const item) {
|
|
if (!loader_cJSON_IsString(item)) {
|
|
return NULL;
|
|
}
|
|
|
|
return item->valuestring;
|
|
}
|
|
|
|
CJSON_PUBLIC(double) loader_cJSON_GetNumberValue(const cJSON *const item) {
|
|
if (!loader_cJSON_IsNumber(item)) {
|
|
return (double)NAN;
|
|
}
|
|
|
|
return item->valuedouble;
|
|
}
|
|
|
|
/* This is a safeguard to prevent copy-pasters from using incompatible C and header files */
|
|
#if (CJSON_VERSION_MAJOR != 1) || (CJSON_VERSION_MINOR != 7) || (CJSON_VERSION_PATCH != 18)
|
|
#error cJSON.h and cJSON.c have different versions. Make sure that both have the same.
|
|
#endif
|
|
|
|
/* Case insensitive string comparison, doesn't consider two NULL pointers equal though */
|
|
static int case_insensitive_strcmp(const unsigned char *string1, const unsigned char *string2) {
|
|
if ((string1 == NULL) || (string2 == NULL)) {
|
|
return 1;
|
|
}
|
|
|
|
if (string1 == string2) {
|
|
return 0;
|
|
}
|
|
|
|
for (; tolower(*string1) == tolower(*string2); (void)string1++, string2++) {
|
|
if (*string1 == '\0') {
|
|
return 0;
|
|
}
|
|
}
|
|
|
|
return tolower(*string1) - tolower(*string2);
|
|
}
|
|
|
|
/* strlen of character literals resolved at compile time */
|
|
#define static_strlen(string_literal) (sizeof(string_literal) - sizeof(""))
|
|
|
|
/* Internal constructor. */
|
|
static cJSON *cJSON_New_Item(const VkAllocationCallbacks *pAllocator) {
|
|
cJSON *node = (cJSON *)loader_calloc(pAllocator, sizeof(cJSON), VK_SYSTEM_ALLOCATION_SCOPE_COMMAND);
|
|
if (NULL != node) {
|
|
node->pAllocator = pAllocator;
|
|
}
|
|
return node;
|
|
}
|
|
|
|
/* Delete a cJSON structure. */
|
|
TEST_FUNCTION_EXPORT CJSON_PUBLIC(void) loader_cJSON_Delete(cJSON *item) {
|
|
cJSON *next = NULL;
|
|
while (item != NULL) {
|
|
next = item->next;
|
|
if (!(item->type & cJSON_IsReference) && (item->child != NULL)) {
|
|
loader_cJSON_Delete(item->child);
|
|
}
|
|
if (!(item->type & cJSON_IsReference) && (item->valuestring != NULL)) {
|
|
loader_free(item->pAllocator, item->valuestring);
|
|
item->valuestring = NULL;
|
|
}
|
|
if (!(item->type & cJSON_StringIsConst) && (item->string != NULL)) {
|
|
loader_free(item->pAllocator, item->string);
|
|
item->string = NULL;
|
|
}
|
|
loader_free(item->pAllocator, item);
|
|
item = next;
|
|
}
|
|
}
|
|
|
|
/* get the decimal point character of the current locale */
|
|
static unsigned char get_decimal_point(void) {
|
|
#ifdef ENABLE_LOCALES
|
|
struct lconv *lconv = localeconv();
|
|
return (unsigned char)lconv->decimal_point[0];
|
|
#else
|
|
return '.';
|
|
#endif
|
|
}
|
|
|
|
typedef struct {
|
|
const unsigned char *content;
|
|
size_t length;
|
|
size_t offset;
|
|
size_t depth; /* How deeply nested (in arrays/objects) is the input at the current offset. */
|
|
const VkAllocationCallbacks *pAllocator;
|
|
} parse_buffer;
|
|
|
|
/* check if the given size is left to read in a given parse buffer (starting with 1) */
|
|
#define can_read(buffer, size) ((buffer != NULL) && (((buffer)->offset + size) <= (buffer)->length))
|
|
/* check if the buffer can be accessed at the given index (starting with 0) */
|
|
#define can_access_at_index(buffer, index) ((buffer != NULL) && (((buffer)->offset + index) < (buffer)->length))
|
|
#define cannot_access_at_index(buffer, index) (!can_access_at_index(buffer, index))
|
|
/* get a pointer to the buffer at the position */
|
|
#define buffer_at_offset(buffer) ((buffer)->content + (buffer)->offset)
|
|
|
|
/* Parse the input text to generate a number, and populate the result into item. */
|
|
static cJSON_bool parse_number(cJSON *const item, parse_buffer *const input_buffer) {
|
|
double number = 0;
|
|
unsigned char *after_end = NULL;
|
|
unsigned char number_c_string[64];
|
|
unsigned char decimal_point = get_decimal_point();
|
|
size_t i = 0;
|
|
|
|
if ((input_buffer == NULL) || (input_buffer->content == NULL)) {
|
|
return false;
|
|
}
|
|
|
|
/* copy the number into a temporary buffer and replace '.' with the decimal point
|
|
* of the current locale (for strtod)
|
|
* This also takes care of '\0' not necessarily being available for marking the end of the input */
|
|
for (i = 0; (i < (sizeof(number_c_string) - 1)) && can_access_at_index(input_buffer, i); i++) {
|
|
switch (buffer_at_offset(input_buffer)[i]) {
|
|
case '0':
|
|
case '1':
|
|
case '2':
|
|
case '3':
|
|
case '4':
|
|
case '5':
|
|
case '6':
|
|
case '7':
|
|
case '8':
|
|
case '9':
|
|
case '+':
|
|
case '-':
|
|
case 'e':
|
|
case 'E':
|
|
number_c_string[i] = buffer_at_offset(input_buffer)[i];
|
|
break;
|
|
|
|
case '.':
|
|
number_c_string[i] = decimal_point;
|
|
break;
|
|
|
|
default:
|
|
goto loop_end;
|
|
}
|
|
}
|
|
loop_end:
|
|
number_c_string[i] = '\0';
|
|
|
|
number = strtod((const char *)number_c_string, (char **)&after_end);
|
|
if (number_c_string == after_end) {
|
|
return false; /* parse_error */
|
|
}
|
|
|
|
item->valuedouble = number;
|
|
|
|
/* use saturation in case of overflow */
|
|
if (number >= INT_MAX) {
|
|
item->valueint = INT_MAX;
|
|
} else if (number <= (double)INT_MIN) {
|
|
item->valueint = INT_MIN;
|
|
} else {
|
|
item->valueint = (int)number;
|
|
}
|
|
|
|
item->type = cJSON_Number;
|
|
|
|
input_buffer->offset += (size_t)(after_end - number_c_string);
|
|
return true;
|
|
}
|
|
|
|
typedef struct {
|
|
unsigned char *buffer;
|
|
size_t length;
|
|
size_t offset;
|
|
size_t depth; /* current nesting depth (for formatted printing) */
|
|
cJSON_bool noalloc;
|
|
cJSON_bool format; /* is this print a formatted print */
|
|
const VkAllocationCallbacks *pAllocator;
|
|
} printbuffer;
|
|
|
|
/* realloc printbuffer if necessary to have at least "needed" bytes more */
|
|
static unsigned char *ensure(printbuffer *const p, size_t needed, bool *out_of_memory) {
|
|
unsigned char *newbuffer = NULL;
|
|
size_t newsize = 0;
|
|
|
|
if ((p == NULL) || (p->buffer == NULL)) {
|
|
return NULL;
|
|
}
|
|
|
|
if ((p->length > 0) && (p->offset >= p->length)) {
|
|
/* make sure that offset is valid */
|
|
return NULL;
|
|
}
|
|
|
|
if (needed > INT_MAX) {
|
|
/* sizes bigger than INT_MAX are currently not supported */
|
|
return NULL;
|
|
}
|
|
|
|
needed += p->offset + 1;
|
|
if (needed <= p->length) {
|
|
return p->buffer + p->offset;
|
|
}
|
|
|
|
if (p->noalloc) {
|
|
return NULL;
|
|
}
|
|
|
|
/* calculate new buffer size */
|
|
if (needed > (INT_MAX / 2)) {
|
|
/* overflow of int, use INT_MAX if possible */
|
|
if (needed <= INT_MAX) {
|
|
newsize = INT_MAX;
|
|
} else {
|
|
return NULL;
|
|
}
|
|
} else {
|
|
newsize = needed * 2;
|
|
}
|
|
|
|
newbuffer = (unsigned char *)loader_realloc(p->pAllocator, p->buffer, p->length, newsize, VK_SYSTEM_ALLOCATION_SCOPE_INSTANCE);
|
|
if (newbuffer == NULL) {
|
|
*out_of_memory = true;
|
|
loader_free(p->pAllocator, p->buffer);
|
|
p->length = 0;
|
|
p->buffer = NULL;
|
|
|
|
return NULL;
|
|
}
|
|
|
|
p->length = newsize;
|
|
p->buffer = newbuffer;
|
|
|
|
return newbuffer + p->offset;
|
|
}
|
|
|
|
/* calculate the new length of the string in a printbuffer and update the offset */
|
|
static void update_offset(printbuffer *const buffer) {
|
|
const unsigned char *buffer_pointer = NULL;
|
|
if ((buffer == NULL) || (buffer->buffer == NULL)) {
|
|
return;
|
|
}
|
|
buffer_pointer = buffer->buffer + buffer->offset;
|
|
|
|
buffer->offset += strlen((const char *)buffer_pointer);
|
|
}
|
|
|
|
/* securely comparison of floating-point variables */
|
|
static cJSON_bool compare_double(double a, double b) {
|
|
double maxVal = fabs(a) > fabs(b) ? fabs(a) : fabs(b);
|
|
return (fabs(a - b) <= maxVal * DBL_EPSILON);
|
|
}
|
|
|
|
/* Render the number nicely from the given item into a string. */
|
|
static cJSON_bool print_number(const cJSON *const item, printbuffer *const output_buffer, bool *out_of_memory) {
|
|
unsigned char *output_pointer = NULL;
|
|
double d = item->valuedouble;
|
|
int length = 0;
|
|
size_t i = 0;
|
|
unsigned char number_buffer[26] = {0}; /* temporary buffer to print the number into */
|
|
unsigned char decimal_point = get_decimal_point();
|
|
double test = 0.0;
|
|
|
|
if (output_buffer == NULL) {
|
|
return false;
|
|
}
|
|
|
|
/* This checks for NaN and Infinity */
|
|
if (isnan(d) || isinf(d)) {
|
|
length = snprintf((char *)number_buffer, 26, "null");
|
|
} else if (d == (double)item->valueint) {
|
|
length = snprintf((char *)number_buffer, 26, "%d", item->valueint);
|
|
} else {
|
|
/* Try 15 decimal places of precision to avoid nonsignificant nonzero digits */
|
|
length = snprintf((char *)number_buffer, 26, "%1.15g", d);
|
|
|
|
/* Check whether the original double can be recovered */
|
|
if ((sscanf((char *)number_buffer, "%lg", &test) != 1) || !compare_double((double)test, d)) {
|
|
/* If not, print with 17 decimal places of precision */
|
|
length = snprintf((char *)number_buffer, 26, "%1.17g", d);
|
|
}
|
|
}
|
|
|
|
/* snprintf failed or buffer overrun occurred */
|
|
if ((length < 0) || (length > (int)(sizeof(number_buffer) - 1))) {
|
|
return false;
|
|
}
|
|
|
|
/* reserve appropriate space in the output */
|
|
output_pointer = ensure(output_buffer, (size_t)length + sizeof(""), out_of_memory);
|
|
if (output_pointer == NULL) {
|
|
return false;
|
|
}
|
|
|
|
/* copy the printed number to the output and replace locale
|
|
* dependent decimal point with '.' */
|
|
for (i = 0; i < ((size_t)length); i++) {
|
|
if (number_buffer[i] == decimal_point) {
|
|
output_pointer[i] = '.';
|
|
continue;
|
|
}
|
|
|
|
output_pointer[i] = number_buffer[i];
|
|
}
|
|
output_pointer[i] = '\0';
|
|
|
|
output_buffer->offset += (size_t)length;
|
|
|
|
return true;
|
|
}
|
|
|
|
/* parse 4 digit hexadecimal number */
|
|
static unsigned parse_hex4(const unsigned char *const input) {
|
|
unsigned int h = 0;
|
|
size_t i = 0;
|
|
|
|
for (i = 0; i < 4; i++) {
|
|
/* parse digit */
|
|
if ((input[i] >= '0') && (input[i] <= '9')) {
|
|
h += (unsigned int)input[i] - '0';
|
|
} else if ((input[i] >= 'A') && (input[i] <= 'F')) {
|
|
h += (unsigned int)10 + input[i] - 'A';
|
|
} else if ((input[i] >= 'a') && (input[i] <= 'f')) {
|
|
h += (unsigned int)10 + input[i] - 'a';
|
|
} else /* invalid */
|
|
{
|
|
return 0;
|
|
}
|
|
|
|
if (i < 3) {
|
|
/* shift left to make place for the next nibble */
|
|
h = h << 4;
|
|
}
|
|
}
|
|
|
|
return h;
|
|
}
|
|
|
|
/* converts a UTF-16 literal to UTF-8
|
|
* A literal can be one or two sequences of the form \uXXXX */
|
|
static unsigned char utf16_literal_to_utf8(const unsigned char *const input_pointer, const unsigned char *const input_end,
|
|
unsigned char **output_pointer) {
|
|
long unsigned int codepoint = 0;
|
|
unsigned int first_code = 0;
|
|
const unsigned char *first_sequence = input_pointer;
|
|
unsigned char utf8_length = 0;
|
|
unsigned char utf8_position = 0;
|
|
unsigned char sequence_length = 0;
|
|
unsigned char first_byte_mark = 0;
|
|
|
|
if ((input_end - first_sequence) < 6) {
|
|
/* input ends unexpectedly */
|
|
goto fail;
|
|
}
|
|
|
|
/* get the first utf16 sequence */
|
|
first_code = parse_hex4(first_sequence + 2);
|
|
|
|
/* check that the code is valid */
|
|
if (((first_code >= 0xDC00) && (first_code <= 0xDFFF))) {
|
|
goto fail;
|
|
}
|
|
|
|
/* UTF16 surrogate pair */
|
|
if ((first_code >= 0xD800) && (first_code <= 0xDBFF)) {
|
|
const unsigned char *second_sequence = first_sequence + 6;
|
|
unsigned int second_code = 0;
|
|
sequence_length = 12; /* \uXXXX\uXXXX */
|
|
|
|
if ((input_end - second_sequence) < 6) {
|
|
/* input ends unexpectedly */
|
|
goto fail;
|
|
}
|
|
|
|
if ((second_sequence[0] != '\\') || (second_sequence[1] != 'u')) {
|
|
/* missing second half of the surrogate pair */
|
|
goto fail;
|
|
}
|
|
|
|
/* get the second utf16 sequence */
|
|
second_code = parse_hex4(second_sequence + 2);
|
|
/* check that the code is valid */
|
|
if ((second_code < 0xDC00) || (second_code > 0xDFFF)) {
|
|
/* invalid second half of the surrogate pair */
|
|
goto fail;
|
|
}
|
|
|
|
/* calculate the unicode codepoint from the surrogate pair */
|
|
codepoint = 0x10000 + (((first_code & 0x3FF) << 10) | (second_code & 0x3FF));
|
|
} else {
|
|
sequence_length = 6; /* \uXXXX */
|
|
codepoint = first_code;
|
|
}
|
|
|
|
/* encode as UTF-8
|
|
* takes at maximum 4 bytes to encode:
|
|
* 11110xxx 10xxxxxx 10xxxxxx 10xxxxxx */
|
|
if (codepoint < 0x80) {
|
|
/* normal ascii, encoding 0xxxxxxx */
|
|
utf8_length = 1;
|
|
} else if (codepoint < 0x800) {
|
|
/* two bytes, encoding 110xxxxx 10xxxxxx */
|
|
utf8_length = 2;
|
|
first_byte_mark = 0xC0; /* 11000000 */
|
|
} else if (codepoint < 0x10000) {
|
|
/* three bytes, encoding 1110xxxx 10xxxxxx 10xxxxxx */
|
|
utf8_length = 3;
|
|
first_byte_mark = 0xE0; /* 11100000 */
|
|
} else if (codepoint <= 0x10FFFF) {
|
|
/* four bytes, encoding 1110xxxx 10xxxxxx 10xxxxxx 10xxxxxx */
|
|
utf8_length = 4;
|
|
first_byte_mark = 0xF0; /* 11110000 */
|
|
} else {
|
|
/* invalid unicode codepoint */
|
|
goto fail;
|
|
}
|
|
|
|
/* encode as utf8 */
|
|
for (utf8_position = (unsigned char)(utf8_length - 1); utf8_position > 0; utf8_position--) {
|
|
/* 10xxxxxx */
|
|
(*output_pointer)[utf8_position] = (unsigned char)((codepoint | 0x80) & 0xBF);
|
|
codepoint >>= 6;
|
|
}
|
|
/* encode first byte */
|
|
if (utf8_length > 1) {
|
|
(*output_pointer)[0] = (unsigned char)((codepoint | first_byte_mark) & 0xFF);
|
|
} else {
|
|
(*output_pointer)[0] = (unsigned char)(codepoint & 0x7F);
|
|
}
|
|
|
|
*output_pointer += utf8_length;
|
|
|
|
return sequence_length;
|
|
|
|
fail:
|
|
return 0;
|
|
}
|
|
|
|
/* Parse the input text into an unescaped cinput, and populate item. */
|
|
static cJSON_bool parse_string(cJSON *const item, parse_buffer *const input_buffer, bool *out_of_memory) {
|
|
const unsigned char *input_pointer = buffer_at_offset(input_buffer) + 1;
|
|
const unsigned char *input_end = buffer_at_offset(input_buffer) + 1;
|
|
unsigned char *output_pointer = NULL;
|
|
unsigned char *output = NULL;
|
|
|
|
/* not a string */
|
|
if (buffer_at_offset(input_buffer)[0] != '\"') {
|
|
goto fail;
|
|
}
|
|
|
|
{
|
|
/* calculate approximate size of the output (overestimate) */
|
|
size_t allocation_length = 0;
|
|
size_t skipped_bytes = 0;
|
|
while (((size_t)(input_end - input_buffer->content) < input_buffer->length) && (*input_end != '\"')) {
|
|
/* is escape sequence */
|
|
if (input_end[0] == '\\') {
|
|
if ((size_t)(input_end + 1 - input_buffer->content) >= input_buffer->length) {
|
|
/* prevent buffer overflow when last input character is a backslash */
|
|
goto fail;
|
|
}
|
|
skipped_bytes++;
|
|
input_end++;
|
|
}
|
|
input_end++;
|
|
}
|
|
if (((size_t)(input_end - input_buffer->content) >= input_buffer->length) || (*input_end != '\"')) {
|
|
goto fail; /* string ended unexpectedly */
|
|
}
|
|
|
|
/* This is at most how much we need for the output */
|
|
allocation_length = (size_t)(input_end - buffer_at_offset(input_buffer)) - skipped_bytes;
|
|
output = (unsigned char *)loader_calloc(input_buffer->pAllocator, allocation_length + sizeof(""),
|
|
VK_SYSTEM_ALLOCATION_SCOPE_COMMAND);
|
|
if (output == NULL) {
|
|
*out_of_memory = true;
|
|
goto fail; /* allocation failure */
|
|
}
|
|
}
|
|
|
|
output_pointer = output;
|
|
/* loop through the string literal */
|
|
while (input_pointer < input_end) {
|
|
if (*input_pointer != '\\') {
|
|
*output_pointer++ = *input_pointer++;
|
|
}
|
|
/* escape sequence */
|
|
else {
|
|
unsigned char sequence_length = 2;
|
|
if ((input_end - input_pointer) < 1) {
|
|
goto fail;
|
|
}
|
|
|
|
switch (input_pointer[1]) {
|
|
case 'b':
|
|
*output_pointer++ = '\b';
|
|
break;
|
|
case 'f':
|
|
*output_pointer++ = '\f';
|
|
break;
|
|
case 'n':
|
|
*output_pointer++ = '\n';
|
|
break;
|
|
case 'r':
|
|
*output_pointer++ = '\r';
|
|
break;
|
|
case 't':
|
|
*output_pointer++ = '\t';
|
|
break;
|
|
case '\"':
|
|
case '\\':
|
|
case '/':
|
|
*output_pointer++ = input_pointer[1];
|
|
break;
|
|
|
|
/* UTF-16 literal */
|
|
case 'u':
|
|
sequence_length = utf16_literal_to_utf8(input_pointer, input_end, &output_pointer);
|
|
if (sequence_length == 0) {
|
|
/* failed to convert UTF16-literal to UTF-8 */
|
|
goto fail;
|
|
}
|
|
break;
|
|
|
|
default:
|
|
goto fail;
|
|
}
|
|
input_pointer += sequence_length;
|
|
}
|
|
}
|
|
|
|
/* zero terminate the output */
|
|
*output_pointer = '\0';
|
|
|
|
item->type = cJSON_String;
|
|
item->valuestring = (char *)output;
|
|
|
|
input_buffer->offset = (size_t)(input_end - input_buffer->content);
|
|
input_buffer->offset++;
|
|
|
|
return true;
|
|
|
|
fail:
|
|
if (output != NULL) {
|
|
loader_free(input_buffer->pAllocator, output);
|
|
output = NULL;
|
|
}
|
|
|
|
if (input_pointer != NULL) {
|
|
input_buffer->offset = (size_t)(input_pointer - input_buffer->content);
|
|
}
|
|
|
|
return false;
|
|
}
|
|
|
|
/* Render the cstring provided to an escaped version that can be printed. */
|
|
static cJSON_bool print_string_ptr(const unsigned char *const input, printbuffer *const output_buffer, bool *out_of_memory) {
|
|
const unsigned char *input_pointer = NULL;
|
|
unsigned char *output = NULL;
|
|
unsigned char *output_pointer = NULL;
|
|
size_t output_length = 0;
|
|
/* numbers of additional characters needed for escaping */
|
|
size_t escape_characters = 0;
|
|
|
|
if (output_buffer == NULL) {
|
|
return false;
|
|
}
|
|
|
|
/* empty string */
|
|
if (input == NULL) {
|
|
output = ensure(output_buffer, sizeof(""), out_of_memory);
|
|
if (output == NULL) {
|
|
return false;
|
|
}
|
|
|
|
return true;
|
|
}
|
|
|
|
/* set "flag" to 1 if something needs to be escaped */
|
|
for (input_pointer = input; *input_pointer; input_pointer++) {
|
|
switch (*input_pointer) {
|
|
case '\"':
|
|
case '\\':
|
|
case '\b':
|
|
case '\f':
|
|
case '\n':
|
|
case '\r':
|
|
case '\t':
|
|
/* one character escape sequence */
|
|
escape_characters++;
|
|
break;
|
|
default:
|
|
if (*input_pointer < 32) {
|
|
/* UTF-16 escape sequence uXXXX */
|
|
escape_characters += 5;
|
|
}
|
|
break;
|
|
}
|
|
}
|
|
output_length = (size_t)(input_pointer - input) + escape_characters;
|
|
|
|
output = ensure(output_buffer, output_length + sizeof(""), out_of_memory);
|
|
if (output == NULL) {
|
|
return false;
|
|
}
|
|
|
|
/* no characters have to be escaped */
|
|
if (escape_characters == 0) {
|
|
memcpy(output, input, output_length);
|
|
output[output_length] = '\0';
|
|
|
|
return true;
|
|
}
|
|
|
|
output_pointer = output;
|
|
/* copy the string */
|
|
for (input_pointer = input; *input_pointer != '\0'; (void)input_pointer++, output_pointer++) {
|
|
if ((*input_pointer > 31) && (*input_pointer != '\"') && (*input_pointer != '\\')) {
|
|
/* normal character, copy */
|
|
*output_pointer = *input_pointer;
|
|
} else {
|
|
// Loader specific modification - don't add a backslash because that will 'double up' any existing back slashes.
|
|
// This change was added right after vulkan's public release, so while it may not be a problem, there are plenty
|
|
// of API calls made which might not work if the paths have "\\"" in them
|
|
/* character needs to be escaped */
|
|
//*output_pointer++ = '\\';
|
|
switch (*input_pointer) {
|
|
case '\\':
|
|
*output_pointer = '\\';
|
|
break;
|
|
case '\"':
|
|
*output_pointer = '\"';
|
|
break;
|
|
case '\b':
|
|
*output_pointer = '\b';
|
|
break;
|
|
case '\f':
|
|
*output_pointer = '\f';
|
|
break;
|
|
case '\n':
|
|
*output_pointer = '\n';
|
|
break;
|
|
case '\r':
|
|
*output_pointer = '\r';
|
|
break;
|
|
case '\t':
|
|
*output_pointer = '\t';
|
|
break;
|
|
default:
|
|
/* escape and print as unicode codepoint */
|
|
snprintf((char *)output_pointer, output_length - (size_t)(output_pointer - output), "u%04x", *input_pointer);
|
|
output_pointer += 4;
|
|
break;
|
|
}
|
|
}
|
|
}
|
|
output[output_length] = '\0';
|
|
|
|
return true;
|
|
}
|
|
|
|
/* Invoke print_string_ptr (which is useful) on an item. */
|
|
static cJSON_bool print_string(const cJSON *const item, printbuffer *const p, bool *out_of_memory) {
|
|
return print_string_ptr((unsigned char *)item->valuestring, p, out_of_memory);
|
|
}
|
|
|
|
/* Predeclare these prototypes. */
|
|
static cJSON_bool parse_value(cJSON *const item, parse_buffer *const input_buffer, bool *out_of_memory);
|
|
static cJSON_bool print_value(const cJSON *const item, printbuffer *const output_buffer, bool *out_of_memory);
|
|
static cJSON_bool parse_array(cJSON *const item, parse_buffer *const input_buffer, bool *out_of_memory);
|
|
static cJSON_bool print_array(const cJSON *const item, printbuffer *const output_buffer, bool *out_of_memory);
|
|
static cJSON_bool parse_object(cJSON *const item, parse_buffer *const input_buffer, bool *out_of_memory);
|
|
static cJSON_bool print_object(const cJSON *const item, printbuffer *const output_buffer, bool *out_of_memory);
|
|
|
|
/* Utility to jump whitespace and cr/lf */
|
|
static parse_buffer *buffer_skip_whitespace(parse_buffer *const buffer) {
|
|
if ((buffer == NULL) || (buffer->content == NULL)) {
|
|
return NULL;
|
|
}
|
|
|
|
if (cannot_access_at_index(buffer, 0)) {
|
|
return buffer;
|
|
}
|
|
|
|
while (can_access_at_index(buffer, 0) && (buffer_at_offset(buffer)[0] <= 32)) {
|
|
buffer->offset++;
|
|
}
|
|
|
|
if (buffer->offset == buffer->length) {
|
|
buffer->offset--;
|
|
}
|
|
|
|
return buffer;
|
|
}
|
|
|
|
/* skip the UTF-8 BOM (byte order mark) if it is at the beginning of a buffer */
|
|
static parse_buffer *skip_utf8_bom(parse_buffer *const buffer) {
|
|
if ((buffer == NULL) || (buffer->content == NULL) || (buffer->offset != 0)) {
|
|
return NULL;
|
|
}
|
|
|
|
if (can_access_at_index(buffer, 4) && (strncmp((const char *)buffer_at_offset(buffer), "\xEF\xBB\xBF", 3) == 0)) {
|
|
buffer->offset += 3;
|
|
}
|
|
|
|
return buffer;
|
|
}
|
|
|
|
CJSON_PUBLIC(cJSON *)
|
|
loader_cJSON_ParseWithOpts(const VkAllocationCallbacks *pAllocator, const char *value, const char **return_parse_end,
|
|
cJSON_bool require_null_terminated, bool *out_of_memory) {
|
|
size_t buffer_length;
|
|
|
|
if (NULL == value) {
|
|
return NULL;
|
|
}
|
|
|
|
/* Adding null character size due to require_null_terminated. */
|
|
buffer_length = strlen(value) + sizeof("");
|
|
|
|
return loader_cJSON_ParseWithLengthOpts(pAllocator, value, buffer_length, return_parse_end, require_null_terminated,
|
|
out_of_memory);
|
|
}
|
|
|
|
/* Parse an object - create a new root, and populate. */
|
|
CJSON_PUBLIC(cJSON *)
|
|
loader_cJSON_ParseWithLengthOpts(const VkAllocationCallbacks *pAllocator, const char *value, size_t buffer_length,
|
|
const char **return_parse_end, cJSON_bool require_null_terminated, bool *out_of_memory) {
|
|
parse_buffer buffer = {0, 0, 0, 0, 0};
|
|
cJSON *item = NULL;
|
|
|
|
/* reset error position */
|
|
global_error.json = NULL;
|
|
global_error.position = 0;
|
|
|
|
if (value == NULL || 0 == buffer_length) {
|
|
goto fail;
|
|
}
|
|
|
|
buffer.content = (const unsigned char *)value;
|
|
buffer.length = buffer_length;
|
|
buffer.offset = 0;
|
|
buffer.pAllocator = pAllocator;
|
|
|
|
item = cJSON_New_Item(pAllocator);
|
|
if (item == NULL) /* memory fail */
|
|
{
|
|
*out_of_memory = true;
|
|
goto fail;
|
|
}
|
|
|
|
if (!parse_value(item, buffer_skip_whitespace(skip_utf8_bom(&buffer)), out_of_memory)) {
|
|
/* parse failure. ep is set. */
|
|
goto fail;
|
|
}
|
|
|
|
/* if we require null-terminated JSON without appended garbage, skip and then check for a null terminator */
|
|
if (require_null_terminated) {
|
|
buffer_skip_whitespace(&buffer);
|
|
if ((buffer.offset >= buffer.length) || buffer_at_offset(&buffer)[0] != '\0') {
|
|
goto fail;
|
|
}
|
|
}
|
|
if (return_parse_end) {
|
|
*return_parse_end = (const char *)buffer_at_offset(&buffer);
|
|
}
|
|
|
|
return item;
|
|
|
|
fail:
|
|
if (item != NULL) {
|
|
loader_cJSON_Delete(item);
|
|
}
|
|
|
|
if (value != NULL) {
|
|
error local_error;
|
|
local_error.json = (const unsigned char *)value;
|
|
local_error.position = 0;
|
|
|
|
if (buffer.offset < buffer.length) {
|
|
local_error.position = buffer.offset;
|
|
} else if (buffer.length > 0) {
|
|
local_error.position = buffer.length - 1;
|
|
}
|
|
|
|
if (return_parse_end != NULL) {
|
|
*return_parse_end = (const char *)local_error.json + local_error.position;
|
|
}
|
|
|
|
global_error = local_error;
|
|
}
|
|
|
|
return NULL;
|
|
}
|
|
|
|
/* Default options for loader_cJSON_Parse */
|
|
CJSON_PUBLIC(cJSON *) loader_cJSON_Parse(const VkAllocationCallbacks *pAllocator, const char *value, bool *out_of_memory) {
|
|
return loader_cJSON_ParseWithOpts(pAllocator, value, 0, 0, out_of_memory);
|
|
}
|
|
|
|
CJSON_PUBLIC(cJSON *)
|
|
loader_cJSON_ParseWithLength(const VkAllocationCallbacks *pAllocator, const char *value, size_t buffer_length,
|
|
bool *out_of_memory) {
|
|
return loader_cJSON_ParseWithLengthOpts(pAllocator, value, buffer_length, 0, 0, out_of_memory);
|
|
}
|
|
|
|
#define cjson_min(a, b) (((a) < (b)) ? (a) : (b))
|
|
|
|
static unsigned char *print(const cJSON *const item, cJSON_bool format, bool *out_of_memory) {
|
|
static const size_t default_buffer_size = 256;
|
|
printbuffer buffer[1];
|
|
unsigned char *printed = NULL;
|
|
|
|
memset(buffer, 0, sizeof(buffer));
|
|
|
|
/* create buffer */
|
|
buffer->buffer = (unsigned char *)loader_calloc(item->pAllocator, default_buffer_size, VK_SYSTEM_ALLOCATION_SCOPE_INSTANCE);
|
|
buffer->length = default_buffer_size;
|
|
buffer->format = format;
|
|
buffer->pAllocator = item->pAllocator;
|
|
if (buffer->buffer == NULL) {
|
|
*out_of_memory = true;
|
|
goto fail;
|
|
}
|
|
|
|
/* print the value */
|
|
if (!print_value(item, buffer, out_of_memory)) {
|
|
goto fail;
|
|
}
|
|
update_offset(buffer);
|
|
|
|
printed = (unsigned char *)loader_realloc(item->pAllocator, buffer->buffer, buffer->length, buffer->offset + 1,
|
|
VK_SYSTEM_ALLOCATION_SCOPE_INSTANCE);
|
|
if (printed == NULL) {
|
|
*out_of_memory = true;
|
|
goto fail;
|
|
}
|
|
buffer->buffer = NULL;
|
|
|
|
return printed;
|
|
|
|
fail:
|
|
if (buffer->buffer != NULL) {
|
|
loader_free(item->pAllocator, buffer->buffer);
|
|
buffer->buffer = NULL;
|
|
}
|
|
|
|
if (printed != NULL) {
|
|
loader_free(item->pAllocator, printed);
|
|
printed = NULL;
|
|
}
|
|
|
|
return NULL;
|
|
}
|
|
|
|
/* Render a cJSON item/entity/structure to text. */
|
|
TEST_FUNCTION_EXPORT CJSON_PUBLIC(char *) loader_cJSON_Print(const cJSON *item, bool *out_of_memory) {
|
|
return (char *)print(item, true, out_of_memory);
|
|
}
|
|
|
|
CJSON_PUBLIC(char *) loader_cJSON_PrintUnformatted(const cJSON *item, bool *out_of_memory) {
|
|
return (char *)print(item, false, out_of_memory);
|
|
}
|
|
|
|
CJSON_PUBLIC(char *)
|
|
loader_cJSON_PrintBuffered(const cJSON *item, int prebuffer, cJSON_bool fmt, bool *out_of_memory) {
|
|
printbuffer p = {0, 0, 0, 0, 0, 0, 0};
|
|
|
|
if (prebuffer < 0) {
|
|
return NULL;
|
|
}
|
|
|
|
p.buffer = (unsigned char *)loader_alloc(item->pAllocator, (size_t)prebuffer, VK_SYSTEM_ALLOCATION_SCOPE_INSTANCE);
|
|
if (!p.buffer) {
|
|
return NULL;
|
|
}
|
|
|
|
p.length = (size_t)prebuffer;
|
|
p.offset = 0;
|
|
p.noalloc = false;
|
|
p.format = fmt;
|
|
p.pAllocator = item->pAllocator;
|
|
|
|
if (!print_value(item, &p, out_of_memory)) {
|
|
loader_free(item->pAllocator, p.buffer);
|
|
p.buffer = NULL;
|
|
return NULL;
|
|
}
|
|
|
|
return (char *)p.buffer;
|
|
}
|
|
|
|
CJSON_PUBLIC(cJSON_bool)
|
|
loader_cJSON_PrintPreallocated(cJSON *item, char *buffer, const int length, const cJSON_bool format) {
|
|
printbuffer p = {0, 0, 0, 0, 0, 0, 0};
|
|
|
|
if ((length < 0) || (buffer == NULL)) {
|
|
return false;
|
|
}
|
|
|
|
p.buffer = (unsigned char *)buffer;
|
|
p.length = (size_t)length;
|
|
p.offset = 0;
|
|
p.noalloc = true;
|
|
p.format = format;
|
|
p.pAllocator = item->pAllocator;
|
|
bool out_of_memory = false;
|
|
return print_value(item, &p, &out_of_memory);
|
|
}
|
|
|
|
/* Parser core - when encountering text, process appropriately. */
|
|
static cJSON_bool parse_value(cJSON *const item, parse_buffer *const input_buffer, bool *out_of_memory) {
|
|
if ((input_buffer == NULL) || (input_buffer->content == NULL)) {
|
|
return false; /* no input */
|
|
}
|
|
|
|
/* parse the different types of values */
|
|
/* null */
|
|
if (can_read(input_buffer, 4) && (strncmp((const char *)buffer_at_offset(input_buffer), "null", 4) == 0)) {
|
|
item->type = cJSON_NULL;
|
|
input_buffer->offset += 4;
|
|
return true;
|
|
}
|
|
/* false */
|
|
if (can_read(input_buffer, 5) && (strncmp((const char *)buffer_at_offset(input_buffer), "false", 5) == 0)) {
|
|
item->type = cJSON_False;
|
|
input_buffer->offset += 5;
|
|
return true;
|
|
}
|
|
/* true */
|
|
if (can_read(input_buffer, 4) && (strncmp((const char *)buffer_at_offset(input_buffer), "true", 4) == 0)) {
|
|
item->type = cJSON_True;
|
|
item->valueint = 1;
|
|
input_buffer->offset += 4;
|
|
return true;
|
|
}
|
|
/* string */
|
|
if (can_access_at_index(input_buffer, 0) && (buffer_at_offset(input_buffer)[0] == '\"')) {
|
|
return parse_string(item, input_buffer, out_of_memory);
|
|
}
|
|
/* number */
|
|
if (can_access_at_index(input_buffer, 0) &&
|
|
((buffer_at_offset(input_buffer)[0] == '-') ||
|
|
((buffer_at_offset(input_buffer)[0] >= '0') && (buffer_at_offset(input_buffer)[0] <= '9')))) {
|
|
return parse_number(item, input_buffer);
|
|
}
|
|
/* array */
|
|
if (can_access_at_index(input_buffer, 0) && (buffer_at_offset(input_buffer)[0] == '[')) {
|
|
return parse_array(item, input_buffer, out_of_memory);
|
|
}
|
|
/* object */
|
|
if (can_access_at_index(input_buffer, 0) && (buffer_at_offset(input_buffer)[0] == '{')) {
|
|
return parse_object(item, input_buffer, out_of_memory);
|
|
}
|
|
|
|
return false;
|
|
}
|
|
|
|
/* Render a value to text. */
|
|
static cJSON_bool print_value(const cJSON *const item, printbuffer *const output_buffer, bool *out_of_memory) {
|
|
unsigned char *output = NULL;
|
|
|
|
if ((item == NULL) || (output_buffer == NULL)) {
|
|
return false;
|
|
}
|
|
|
|
switch ((item->type) & 0xFF) {
|
|
case cJSON_NULL:
|
|
output = ensure(output_buffer, 5, out_of_memory);
|
|
if (output == NULL) {
|
|
return false;
|
|
}
|
|
strcpy((char *)output, "null");
|
|
return true;
|
|
|
|
case cJSON_False:
|
|
output = ensure(output_buffer, 6, out_of_memory);
|
|
if (output == NULL) {
|
|
return false;
|
|
}
|
|
strcpy((char *)output, "false");
|
|
return true;
|
|
|
|
case cJSON_True:
|
|
output = ensure(output_buffer, 5, out_of_memory);
|
|
if (output == NULL) {
|
|
return false;
|
|
}
|
|
strcpy((char *)output, "true");
|
|
return true;
|
|
|
|
case cJSON_Number:
|
|
return print_number(item, output_buffer, out_of_memory);
|
|
|
|
case cJSON_Raw: {
|
|
size_t raw_length = 0;
|
|
if (item->valuestring == NULL) {
|
|
return false;
|
|
}
|
|
|
|
raw_length = strlen(item->valuestring) + sizeof("");
|
|
output = ensure(output_buffer, raw_length, out_of_memory);
|
|
if (output == NULL) {
|
|
return false;
|
|
}
|
|
memcpy(output, item->valuestring, raw_length);
|
|
return true;
|
|
}
|
|
|
|
case cJSON_String:
|
|
return print_string(item, output_buffer, out_of_memory);
|
|
|
|
case cJSON_Array:
|
|
return print_array(item, output_buffer, out_of_memory);
|
|
|
|
case cJSON_Object:
|
|
return print_object(item, output_buffer, out_of_memory);
|
|
|
|
default:
|
|
return false;
|
|
}
|
|
}
|
|
|
|
/* Build an array from input text. */
|
|
static cJSON_bool parse_array(cJSON *const item, parse_buffer *const input_buffer, bool *out_of_memory) {
|
|
cJSON *head = NULL; /* head of the linked list */
|
|
cJSON *current_item = NULL;
|
|
|
|
if (input_buffer->depth >= CJSON_NESTING_LIMIT) {
|
|
return false; /* to deeply nested */
|
|
}
|
|
input_buffer->depth++;
|
|
|
|
if (buffer_at_offset(input_buffer)[0] != '[') {
|
|
/* not an array */
|
|
goto fail;
|
|
}
|
|
|
|
input_buffer->offset++;
|
|
buffer_skip_whitespace(input_buffer);
|
|
if (can_access_at_index(input_buffer, 0) && (buffer_at_offset(input_buffer)[0] == ']')) {
|
|
/* empty array */
|
|
goto success;
|
|
}
|
|
|
|
/* check if we skipped to the end of the buffer */
|
|
if (cannot_access_at_index(input_buffer, 0)) {
|
|
input_buffer->offset--;
|
|
goto fail;
|
|
}
|
|
|
|
/* step back to character in front of the first element */
|
|
input_buffer->offset--;
|
|
/* loop through the comma separated array elements */
|
|
do {
|
|
/* allocate next item */
|
|
cJSON *new_item = cJSON_New_Item(input_buffer->pAllocator);
|
|
if (new_item == NULL) {
|
|
*out_of_memory = true;
|
|
goto fail; /* allocation failure */
|
|
}
|
|
|
|
/* attach next item to list */
|
|
if (head == NULL) {
|
|
/* start the linked list */
|
|
current_item = head = new_item;
|
|
} else {
|
|
/* add to the end and advance */
|
|
current_item->next = new_item;
|
|
new_item->prev = current_item;
|
|
current_item = new_item;
|
|
}
|
|
|
|
/* parse next value */
|
|
input_buffer->offset++;
|
|
buffer_skip_whitespace(input_buffer);
|
|
if (!parse_value(current_item, input_buffer, out_of_memory)) {
|
|
goto fail; /* failed to parse value */
|
|
}
|
|
buffer_skip_whitespace(input_buffer);
|
|
} while (can_access_at_index(input_buffer, 0) && (buffer_at_offset(input_buffer)[0] == ','));
|
|
|
|
if (cannot_access_at_index(input_buffer, 0) || buffer_at_offset(input_buffer)[0] != ']') {
|
|
goto fail; /* expected end of array */
|
|
}
|
|
|
|
success:
|
|
input_buffer->depth--;
|
|
|
|
if (head != NULL) {
|
|
head->prev = current_item;
|
|
}
|
|
|
|
item->type = cJSON_Array;
|
|
item->child = head;
|
|
|
|
input_buffer->offset++;
|
|
|
|
return true;
|
|
|
|
fail:
|
|
if (head != NULL) {
|
|
loader_cJSON_Delete(head);
|
|
}
|
|
|
|
return false;
|
|
}
|
|
|
|
/* Render an array to text */
|
|
static cJSON_bool print_array(const cJSON *const item, printbuffer *const output_buffer, bool *out_of_memory) {
|
|
unsigned char *output_pointer = NULL;
|
|
size_t length = 0;
|
|
cJSON *current_element = item->child;
|
|
|
|
if (output_buffer == NULL) {
|
|
return false;
|
|
}
|
|
|
|
/* Compose the output array. */
|
|
/* opening square bracket */
|
|
output_pointer = ensure(output_buffer, 1, out_of_memory);
|
|
if (output_pointer == NULL) {
|
|
return false;
|
|
}
|
|
|
|
*output_pointer = '[';
|
|
output_buffer->offset++;
|
|
output_buffer->depth++;
|
|
|
|
while (current_element != NULL) {
|
|
if (!print_value(current_element, output_buffer, out_of_memory)) {
|
|
return false;
|
|
}
|
|
update_offset(output_buffer);
|
|
if (current_element->next) {
|
|
length = (size_t)(output_buffer->format ? 2 : 1);
|
|
output_pointer = ensure(output_buffer, length + 1, out_of_memory);
|
|
if (output_pointer == NULL) {
|
|
return false;
|
|
}
|
|
*output_pointer++ = ',';
|
|
if (output_buffer->format) {
|
|
*output_pointer++ = ' ';
|
|
}
|
|
*output_pointer = '\0';
|
|
output_buffer->offset += length;
|
|
}
|
|
current_element = current_element->next;
|
|
}
|
|
|
|
output_pointer = ensure(output_buffer, 2, out_of_memory);
|
|
if (output_pointer == NULL) {
|
|
return false;
|
|
}
|
|
*output_pointer++ = ']';
|
|
*output_pointer = '\0';
|
|
output_buffer->depth--;
|
|
|
|
return true;
|
|
}
|
|
|
|
/* Build an object from the text. */
|
|
static cJSON_bool parse_object(cJSON *const item, parse_buffer *const input_buffer, bool *out_of_memory) {
|
|
cJSON *head = NULL; /* linked list head */
|
|
cJSON *current_item = NULL;
|
|
|
|
if (input_buffer->depth >= CJSON_NESTING_LIMIT) {
|
|
return false; /* to deeply nested */
|
|
}
|
|
input_buffer->depth++;
|
|
|
|
if (cannot_access_at_index(input_buffer, 0) || (buffer_at_offset(input_buffer)[0] != '{')) {
|
|
goto fail; /* not an object */
|
|
}
|
|
|
|
input_buffer->offset++;
|
|
buffer_skip_whitespace(input_buffer);
|
|
if (can_access_at_index(input_buffer, 0) && (buffer_at_offset(input_buffer)[0] == '}')) {
|
|
goto success; /* empty object */
|
|
}
|
|
|
|
/* check if we skipped to the end of the buffer */
|
|
if (cannot_access_at_index(input_buffer, 0)) {
|
|
input_buffer->offset--;
|
|
goto fail;
|
|
}
|
|
|
|
/* step back to character in front of the first element */
|
|
input_buffer->offset--;
|
|
/* loop through the comma separated array elements */
|
|
do {
|
|
/* allocate next item */
|
|
cJSON *new_item = cJSON_New_Item(input_buffer->pAllocator);
|
|
if (new_item == NULL) {
|
|
*out_of_memory = true;
|
|
goto fail; /* allocation failure */
|
|
}
|
|
|
|
/* attach next item to list */
|
|
if (head == NULL) {
|
|
/* start the linked list */
|
|
current_item = head = new_item;
|
|
} else {
|
|
/* add to the end and advance */
|
|
current_item->next = new_item;
|
|
new_item->prev = current_item;
|
|
current_item = new_item;
|
|
}
|
|
|
|
if (cannot_access_at_index(input_buffer, 1)) {
|
|
goto fail; /* nothing comes after the comma */
|
|
}
|
|
|
|
/* parse the name of the child */
|
|
input_buffer->offset++;
|
|
buffer_skip_whitespace(input_buffer);
|
|
if (!parse_string(current_item, input_buffer, out_of_memory)) {
|
|
goto fail; /* failed to parse name */
|
|
}
|
|
buffer_skip_whitespace(input_buffer);
|
|
|
|
/* swap valuestring and string, because we parsed the name */
|
|
current_item->string = current_item->valuestring;
|
|
current_item->valuestring = NULL;
|
|
|
|
if (cannot_access_at_index(input_buffer, 0) || (buffer_at_offset(input_buffer)[0] != ':')) {
|
|
goto fail; /* invalid object */
|
|
}
|
|
|
|
/* parse the value */
|
|
input_buffer->offset++;
|
|
buffer_skip_whitespace(input_buffer);
|
|
if (!parse_value(current_item, input_buffer, out_of_memory)) {
|
|
goto fail; /* failed to parse value */
|
|
}
|
|
buffer_skip_whitespace(input_buffer);
|
|
} while (can_access_at_index(input_buffer, 0) && (buffer_at_offset(input_buffer)[0] == ','));
|
|
|
|
if (cannot_access_at_index(input_buffer, 0) || (buffer_at_offset(input_buffer)[0] != '}')) {
|
|
goto fail; /* expected end of object */
|
|
}
|
|
|
|
success:
|
|
input_buffer->depth--;
|
|
|
|
if (head != NULL) {
|
|
head->prev = current_item;
|
|
}
|
|
|
|
item->type = cJSON_Object;
|
|
item->child = head;
|
|
|
|
input_buffer->offset++;
|
|
return true;
|
|
|
|
fail:
|
|
if (head != NULL) {
|
|
loader_cJSON_Delete(head);
|
|
}
|
|
|
|
return false;
|
|
}
|
|
|
|
/* Render an object to text. */
|
|
static cJSON_bool print_object(const cJSON *const item, printbuffer *const output_buffer, bool *out_of_memory) {
|
|
unsigned char *output_pointer = NULL;
|
|
size_t length = 0;
|
|
cJSON *current_item = item->child;
|
|
|
|
if (output_buffer == NULL) {
|
|
return false;
|
|
}
|
|
|
|
/* Compose the output: */
|
|
length = (size_t)(output_buffer->format ? 2 : 1); /* fmt: {\n */
|
|
output_pointer = ensure(output_buffer, length + 1, out_of_memory);
|
|
if (output_pointer == NULL) {
|
|
return false;
|
|
}
|
|
|
|
*output_pointer++ = '{';
|
|
output_buffer->depth++;
|
|
if (output_buffer->format) {
|
|
*output_pointer++ = '\n';
|
|
}
|
|
output_buffer->offset += length;
|
|
|
|
while (current_item) {
|
|
if (output_buffer->format) {
|
|
size_t i;
|
|
output_pointer = ensure(output_buffer, output_buffer->depth, out_of_memory);
|
|
if (output_pointer == NULL) {
|
|
return false;
|
|
}
|
|
for (i = 0; i < output_buffer->depth; i++) {
|
|
*output_pointer++ = '\t';
|
|
}
|
|
output_buffer->offset += output_buffer->depth;
|
|
}
|
|
|
|
/* print key */
|
|
if (!print_string_ptr((unsigned char *)current_item->string, output_buffer, out_of_memory)) {
|
|
return false;
|
|
}
|
|
update_offset(output_buffer);
|
|
|
|
length = (size_t)(output_buffer->format ? 2 : 1);
|
|
output_pointer = ensure(output_buffer, length, out_of_memory);
|
|
if (output_pointer == NULL) {
|
|
return false;
|
|
}
|
|
*output_pointer++ = ':';
|
|
if (output_buffer->format) {
|
|
*output_pointer++ = '\t';
|
|
}
|
|
output_buffer->offset += length;
|
|
|
|
/* print value */
|
|
if (!print_value(current_item, output_buffer, out_of_memory)) {
|
|
return false;
|
|
}
|
|
update_offset(output_buffer);
|
|
|
|
/* print comma if not last */
|
|
length = ((size_t)(output_buffer->format ? 1 : 0) + (size_t)(current_item->next ? 1 : 0));
|
|
output_pointer = ensure(output_buffer, length + 1, out_of_memory);
|
|
if (output_pointer == NULL) {
|
|
return false;
|
|
}
|
|
if (current_item->next) {
|
|
*output_pointer++ = ',';
|
|
}
|
|
|
|
if (output_buffer->format) {
|
|
*output_pointer++ = '\n';
|
|
}
|
|
*output_pointer = '\0';
|
|
output_buffer->offset += length;
|
|
|
|
current_item = current_item->next;
|
|
}
|
|
|
|
output_pointer = ensure(output_buffer, output_buffer->format ? (output_buffer->depth + 1) : 2, out_of_memory);
|
|
if (output_pointer == NULL) {
|
|
return false;
|
|
}
|
|
if (output_buffer->format) {
|
|
size_t i;
|
|
for (i = 0; i < (output_buffer->depth - 1); i++) {
|
|
*output_pointer++ = '\t';
|
|
}
|
|
}
|
|
*output_pointer++ = '}';
|
|
*output_pointer = '\0';
|
|
output_buffer->depth--;
|
|
|
|
return true;
|
|
}
|
|
|
|
/* Get Array size/item / object item. */
|
|
CJSON_PUBLIC(int) loader_cJSON_GetArraySize(const cJSON *array) {
|
|
cJSON *child = NULL;
|
|
size_t size = 0;
|
|
|
|
if (array == NULL) {
|
|
return 0;
|
|
}
|
|
|
|
child = array->child;
|
|
|
|
while (child != NULL) {
|
|
size++;
|
|
child = child->next;
|
|
}
|
|
|
|
/* FIXME: Can overflow here. Cannot be fixed without breaking the API */
|
|
|
|
return (int)size;
|
|
}
|
|
|
|
static cJSON *get_array_item(const cJSON *array, size_t index) {
|
|
cJSON *current_child = NULL;
|
|
|
|
if (array == NULL) {
|
|
return NULL;
|
|
}
|
|
|
|
current_child = array->child;
|
|
while ((current_child != NULL) && (index > 0)) {
|
|
index--;
|
|
current_child = current_child->next;
|
|
}
|
|
|
|
return current_child;
|
|
}
|
|
|
|
CJSON_PUBLIC(cJSON *) loader_cJSON_GetArrayItem(const cJSON *array, int index) {
|
|
if (index < 0) {
|
|
return NULL;
|
|
}
|
|
|
|
return get_array_item(array, (size_t)index);
|
|
}
|
|
|
|
static cJSON *get_object_item(const cJSON *const object, const char *const name, const cJSON_bool case_sensitive) {
|
|
cJSON *current_element = NULL;
|
|
|
|
if ((object == NULL) || (name == NULL)) {
|
|
return NULL;
|
|
}
|
|
|
|
current_element = object->child;
|
|
if (case_sensitive) {
|
|
while ((current_element != NULL) && (current_element->string != NULL) && (strcmp(name, current_element->string) != 0)) {
|
|
current_element = current_element->next;
|
|
}
|
|
} else {
|
|
while ((current_element != NULL) &&
|
|
(case_insensitive_strcmp((const unsigned char *)name, (const unsigned char *)(current_element->string)) != 0)) {
|
|
current_element = current_element->next;
|
|
}
|
|
}
|
|
|
|
if ((current_element == NULL) || (current_element->string == NULL)) {
|
|
return NULL;
|
|
}
|
|
|
|
return current_element;
|
|
}
|
|
|
|
CJSON_PUBLIC(cJSON *) loader_cJSON_GetObjectItem(const cJSON *const object, const char *const string) {
|
|
return get_object_item(object, string, false);
|
|
}
|
|
|
|
CJSON_PUBLIC(cJSON *) loader_cJSON_GetObjectItemCaseSensitive(const cJSON *const object, const char *const string) {
|
|
return get_object_item(object, string, true);
|
|
}
|
|
|
|
CJSON_PUBLIC(cJSON_bool) loader_cJSON_HasObjectItem(const cJSON *object, const char *string) {
|
|
return loader_cJSON_GetObjectItem(object, string) ? 1 : 0;
|
|
}
|
|
|
|
static void skip_oneline_comment(char **input) {
|
|
*input += static_strlen("//");
|
|
|
|
for (; (*input)[0] != '\0'; ++(*input)) {
|
|
if ((*input)[0] == '\n') {
|
|
*input += static_strlen("\n");
|
|
return;
|
|
}
|
|
}
|
|
}
|
|
|
|
static void skip_multiline_comment(char **input) {
|
|
*input += static_strlen("/*");
|
|
|
|
for (; (*input)[0] != '\0'; ++(*input)) {
|
|
if (((*input)[0] == '*') && ((*input)[1] == '/')) {
|
|
*input += static_strlen("*/");
|
|
return;
|
|
}
|
|
}
|
|
}
|
|
|
|
static void minify_string(char **input, char **output) {
|
|
(*output)[0] = (*input)[0];
|
|
*input += static_strlen("\"");
|
|
*output += static_strlen("\"");
|
|
|
|
for (; (*input)[0] != '\0'; (void)++(*input), ++(*output)) {
|
|
(*output)[0] = (*input)[0];
|
|
|
|
if ((*input)[0] == '\"') {
|
|
(*output)[0] = '\"';
|
|
*input += static_strlen("\"");
|
|
*output += static_strlen("\"");
|
|
return;
|
|
} else if (((*input)[0] == '\\') && ((*input)[1] == '\"')) {
|
|
(*output)[1] = (*input)[1];
|
|
*input += static_strlen("\"");
|
|
*output += static_strlen("\"");
|
|
}
|
|
}
|
|
}
|
|
|
|
CJSON_PUBLIC(void) loader_cJSON_Minify(char *json) {
|
|
char *into = json;
|
|
|
|
if (json == NULL) {
|
|
return;
|
|
}
|
|
|
|
while (json[0] != '\0') {
|
|
switch (json[0]) {
|
|
case ' ':
|
|
case '\t':
|
|
case '\r':
|
|
case '\n':
|
|
json++;
|
|
break;
|
|
|
|
case '/':
|
|
if (json[1] == '/') {
|
|
skip_oneline_comment(&json);
|
|
} else if (json[1] == '*') {
|
|
skip_multiline_comment(&json);
|
|
} else {
|
|
json++;
|
|
}
|
|
break;
|
|
|
|
case '\"':
|
|
minify_string(&json, (char **)&into);
|
|
break;
|
|
|
|
default:
|
|
into[0] = json[0];
|
|
json++;
|
|
into++;
|
|
}
|
|
}
|
|
|
|
/* and null-terminate. */
|
|
*into = '\0';
|
|
}
|
|
|
|
CJSON_PUBLIC(cJSON_bool) loader_cJSON_IsInvalid(const cJSON *const item) {
|
|
if (item == NULL) {
|
|
return false;
|
|
}
|
|
|
|
return (item->type & 0xFF) == cJSON_Invalid;
|
|
}
|
|
|
|
CJSON_PUBLIC(cJSON_bool) loader_cJSON_IsFalse(const cJSON *const item) {
|
|
if (item == NULL) {
|
|
return false;
|
|
}
|
|
|
|
return (item->type & 0xFF) == cJSON_False;
|
|
}
|
|
|
|
CJSON_PUBLIC(cJSON_bool) loader_cJSON_IsTrue(const cJSON *const item) {
|
|
if (item == NULL) {
|
|
return false;
|
|
}
|
|
|
|
return (item->type & 0xff) == cJSON_True;
|
|
}
|
|
|
|
CJSON_PUBLIC(cJSON_bool) loader_cJSON_IsBool(const cJSON *const item) {
|
|
if (item == NULL) {
|
|
return false;
|
|
}
|
|
|
|
return (item->type & (cJSON_True | cJSON_False)) != 0;
|
|
}
|
|
CJSON_PUBLIC(cJSON_bool) loader_cJSON_IsNull(const cJSON *const item) {
|
|
if (item == NULL) {
|
|
return false;
|
|
}
|
|
|
|
return (item->type & 0xFF) == cJSON_NULL;
|
|
}
|
|
|
|
CJSON_PUBLIC(cJSON_bool) loader_cJSON_IsNumber(const cJSON *const item) {
|
|
if (item == NULL) {
|
|
return false;
|
|
}
|
|
|
|
return (item->type & 0xFF) == cJSON_Number;
|
|
}
|
|
|
|
CJSON_PUBLIC(cJSON_bool) loader_cJSON_IsString(const cJSON *const item) {
|
|
if (item == NULL) {
|
|
return false;
|
|
}
|
|
|
|
return (item->type & 0xFF) == cJSON_String;
|
|
}
|
|
|
|
CJSON_PUBLIC(cJSON_bool) loader_cJSON_IsArray(const cJSON *const item) {
|
|
if (item == NULL) {
|
|
return false;
|
|
}
|
|
|
|
return (item->type & 0xFF) == cJSON_Array;
|
|
}
|
|
|
|
CJSON_PUBLIC(cJSON_bool) cJSON_IsObject(const cJSON *const item) {
|
|
if (item == NULL) {
|
|
return false;
|
|
}
|
|
|
|
return (item->type & 0xFF) == cJSON_Object;
|
|
}
|
|
|
|
CJSON_PUBLIC(cJSON_bool) loader_cJSON_IsRaw(const cJSON *const item) {
|
|
if (item == NULL) {
|
|
return false;
|
|
}
|
|
|
|
return (item->type & 0xFF) == cJSON_Raw;
|
|
}
|
|
|
|
CJSON_PUBLIC(cJSON_bool) loader_cJSON_Compare(const cJSON *const a, const cJSON *const b, const cJSON_bool case_sensitive) {
|
|
if ((a == NULL) || (b == NULL) || ((a->type & 0xFF) != (b->type & 0xFF))) {
|
|
return false;
|
|
}
|
|
|
|
/* check if type is valid */
|
|
switch (a->type & 0xFF) {
|
|
case cJSON_False:
|
|
case cJSON_True:
|
|
case cJSON_NULL:
|
|
case cJSON_Number:
|
|
case cJSON_String:
|
|
case cJSON_Raw:
|
|
case cJSON_Array:
|
|
case cJSON_Object:
|
|
break;
|
|
|
|
default:
|
|
return false;
|
|
}
|
|
|
|
/* identical objects are equal */
|
|
if (a == b) {
|
|
return true;
|
|
}
|
|
|
|
switch (a->type & 0xFF) {
|
|
/* in these cases and equal type is enough */
|
|
case cJSON_False:
|
|
case cJSON_True:
|
|
case cJSON_NULL:
|
|
return true;
|
|
|
|
case cJSON_Number:
|
|
if (compare_double(a->valuedouble, b->valuedouble)) {
|
|
return true;
|
|
}
|
|
return false;
|
|
|
|
case cJSON_String:
|
|
case cJSON_Raw:
|
|
if ((a->valuestring == NULL) || (b->valuestring == NULL)) {
|
|
return false;
|
|
}
|
|
if (strcmp(a->valuestring, b->valuestring) == 0) {
|
|
return true;
|
|
}
|
|
|
|
return false;
|
|
|
|
case cJSON_Array: {
|
|
cJSON *a_element = a->child;
|
|
cJSON *b_element = b->child;
|
|
|
|
for (; (a_element != NULL) && (b_element != NULL);) {
|
|
if (!loader_cJSON_Compare(a_element, b_element, case_sensitive)) {
|
|
return false;
|
|
}
|
|
|
|
a_element = a_element->next;
|
|
b_element = b_element->next;
|
|
}
|
|
|
|
/* one of the arrays is longer than the other */
|
|
if (a_element != b_element) {
|
|
return false;
|
|
}
|
|
|
|
return true;
|
|
}
|
|
|
|
case cJSON_Object: {
|
|
cJSON *a_element = NULL;
|
|
cJSON *b_element = NULL;
|
|
cJSON_ArrayForEach(a_element, a) {
|
|
/* TODO This has O(n^2) runtime, which is horrible! */
|
|
b_element = get_object_item(b, a_element->string, case_sensitive);
|
|
if (b_element == NULL) {
|
|
return false;
|
|
}
|
|
|
|
if (!loader_cJSON_Compare(a_element, b_element, case_sensitive)) {
|
|
return false;
|
|
}
|
|
}
|
|
|
|
/* doing this twice, once on a and b to prevent true comparison if a subset of b
|
|
* TODO: Do this the proper way, this is just a fix for now */
|
|
cJSON_ArrayForEach(b_element, b) {
|
|
a_element = get_object_item(a, b_element->string, case_sensitive);
|
|
if (a_element == NULL) {
|
|
return false;
|
|
}
|
|
|
|
if (!loader_cJSON_Compare(b_element, a_element, case_sensitive)) {
|
|
return false;
|
|
}
|
|
}
|
|
|
|
return true;
|
|
}
|
|
|
|
default:
|
|
return false;
|
|
}
|
|
}
|