加入 Gitee
与超过 1200万 开发者一起发现、参与优秀开源项目,私有仓库也完全免费 :)
免费加入
文件
克隆/下载
cJSON.c 27.85 KB
一键复制 编辑 原始数据 按行查看 历史
Bwar 提交于 2021-05-15 18:25 . remove debug msg
1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495969798991001011021031041051061071081091101111121131141151161171181191201211221231241251261271281291301311321331341351361371381391401411421431441451461471481491501511521531541551561571581591601611621631641651661671681691701711721731741751761771781791801811821831841851861871881891901911921931941951961971981992002012022032042052062072082092102112122132142152162172182192202212222232242252262272282292302312322332342352362372382392402412422432442452462472482492502512522532542552562572582592602612622632642652662672682692702712722732742752762772782792802812822832842852862872882892902912922932942952962972982993003013023033043053063073083093103113123133143153163173183193203213223233243253263273283293303313323333343353363373383393403413423433443453463473483493503513523533543553563573583593603613623633643653663673683693703713723733743753763773783793803813823833843853863873883893903913923933943953963973983994004014024034044054064074084094104114124134144154164174184194204214224234244254264274284294304314324334344354364374384394404414424434444454464474484494504514524534544554564574584594604614624634644654664674684694704714724734744754764774784794804814824834844854864874884894904914924934944954964974984995005015025035045055065075085095105115125135145155165175185195205215225235245255265275285295305315325335345355365375385395405415425435445455465475485495505515525535545555565575585595605615625635645655665675685695705715725735745755765775785795805815825835845855865875885895905915925935945955965975985996006016026036046056066076086096106116126136146156166176186196206216226236246256266276286296306316326336346356366376386396406416426436446456466476486496506516526536546556566576586596606616626636646656666676686696706716726736746756766776786796806816826836846856866876886896906916926936946956966976986997007017027037047057067077087097107117127137147157167177187197207217227237247257267277287297307317327337347357367377387397407417427437447457467477487497507517527537547557567577587597607617627637647657667677687697707717727737747757767777787797807817827837847857867877887897907917927937947957967977987998008018028038048058068078088098108118128138148158168178188198208218228238248258268278288298308318328338348358368378388398408418428438448458468478488498508518528538548558568578588598608618628638648658668678688698708718728738748758768778788798808818828838848858868878888898908918928938948958968978988999009019029039049059069079089099109119129139149159169179189199209219229239249259269279289299309319329339349359369379389399409419429439449459469479489499509519529539549559569579589599609619629639649659669679689699709719729739749759769779789799809819829839849859869879889899909919929939949959969979989991000100110021003100410051006100710081009101010111012101310141015101610171018101910201021102210231024102510261027102810291030103110321033103410351036103710381039104010411042104310441045104610471048104910501051105210531054105510561057105810591060106110621063106410651066106710681069107010711072107310741075107610771078107910801081108210831084108510861087108810891090109110921093109410951096109710981099110011011102110311041105
/*
Copyright (c) 2009 Dave Gamble
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. */
#include <string.h>
#include <stdio.h>
#include <math.h>
#include <stdlib.h>
#include <float.h>
#include <limits.h>
#include <ctype.h>
#include "cJSON.h"
#ifndef INT_MAX
#define INT_MAX 2147483647
#define INT_MIN (-INT_MAX - 1)
#define UINT_MAX 4294967295U
#endif
/* remove global variable for thread safe. --by Bwar on 2020-11-15
static const char *ep;
const char *cJSON_GetErrorPtr()
{
return ep;
}
*/
static int cJSON_strcasecmp(const char *s1, const char *s2)
{
if (!s1)
return (s1 == s2) ? 0 : 1;
if (!s2)
return 1;
for (; tolower(*s1) == tolower(*s2); ++s1, ++s2)
if (*s1 == 0)
return 0;
return tolower(*(const unsigned char *)s1)
- tolower(*(const unsigned char *)s2);
}
static void *(*cJSON_malloc)(size_t sz) = malloc;
static void (*cJSON_free)(void *ptr) = free;
static char* cJSON_strdup(const char* str)
{
size_t len;
char* copy;
len = strlen(str) + 1;
if (!(copy = (char*) cJSON_malloc(len)))
return 0;
memcpy(copy, str, len);
return copy;
}
void cJSON_InitHooks(cJSON_Hooks* hooks)
{
if (!hooks)
{ /* Reset hooks */
cJSON_malloc = malloc;
cJSON_free = free;
return;
}
cJSON_malloc = (hooks->malloc_fn) ? hooks->malloc_fn : malloc;
cJSON_free = (hooks->free_fn) ? hooks->free_fn : free;
}
/* Internal constructor. */
static cJSON *cJSON_New_Item()
{
cJSON* node = (cJSON*) cJSON_malloc(sizeof(cJSON));
if (node)
memset(node, 0, sizeof(cJSON));
return node;
}
/* Delete a cJSON structure. */
void cJSON_Delete(cJSON *c)
{
cJSON *next;
while (c)
{
next = c->next;
if (!(c->type & cJSON_IsReference) && c->child)
cJSON_Delete(c->child);
if (!(c->type & cJSON_IsReference) && c->valuestring)
cJSON_free(c->valuestring);
if (c->string)
cJSON_free(c->string);
cJSON_free(c);
c = next;
}
}
/* Parse the input text to generate a number, and populate the result into item. */
static const char *parse_number(cJSON *item, const char *num)
{
int64 n = 0;
long double d = 0.0;
double base = 0.0;
double point = 0.1;
int scale = 0.0;
int subscale = 0;
int signsubscale = 1;
item->sign = 1;
/* Could use sscanf for this? */
if (*num == '-')
item->sign = -1, num++; /* Has sign? */
if (*num == '0')
num++; /* is zero */
while (*num >= '0' && *num <= '9')
{
n = (n * 10) + (*num++ - '0');
}
d = n;
if (*num == '.' && num[1] >= '0' && num[1] <= '9')
{
num++;
base = d;
do
{
d += point * (*num - '0');
point *= 0.1;
base = (base * 10.0) + (*num - '0'), scale--;
++num;
}
while (*num >= '0' && *num <= '9');
} /* Fractional part? */
if (*num == 'e' || *num == 'E') /* Exponent? */
{
num++;
if (*num == '+')
num++;
else if (*num == '-')
signsubscale = -1, num++; /* With sign? */
while (*num >= '0' && *num <= '9')
subscale = (subscale * 10) + (*num++ - '0'); /* Number? */
}
if (scale == 0 && subscale == 0)
{
item->valuedouble = item->sign * d;
item->valueint = item->sign * n;
item->type = cJSON_Int;
}
else
{
if (subscale != 0)
{
d = item->sign * base * pow(10.0, (scale + subscale * signsubscale)); /* number = +/- number.fraction * 10^+/- exponent */
}
item->valuedouble = d;
item->valueint = n;
item->type = cJSON_Double;
}
return num;
}
/* Render the number nicely from the given item into a string. */
static char *print_double(cJSON *item)
{
char *str;
double d = item->valuedouble;
str = (char*) cJSON_malloc(64); /* This is a nice tradeoff. */
if (str)
{
sprintf(str, "%.15f", d);
}
return str;
}
static char *print_int(cJSON *item)
{
char *str;
str = (char*) cJSON_malloc(22); /* 2^64+1 can be represented in 21 chars. */
if (str)
{
if (item->sign == -1)
{
if ((int64)item->valueint <= (int64)INT_MAX && (int64)item->valueint >= (int64)INT_MIN)
{
sprintf(str, "%d", (int32)item->valueint);
}
else
{
sprintf(str, "%ld", (int64)item->valueint);
}
}
else
{
if (item->valueint <= (uint64)UINT_MAX)
{
sprintf(str, "%u", (uint32)item->valueint);
}
else
{
sprintf(str, "%lu", item->valueint);
}
}
}
return str;
}
/* Parse the input text into an unescaped cstring, and populate item. */
static const unsigned char firstByteMark[7] = { 0x00, 0x00, 0xC0, 0xE0, 0xF0,
0xF8, 0xFC };
static const char *parse_string(cJSON *item, const char *str, const char **ep)
{
const char *ptr = str + 1;
char *ptr2;
char *out;
int len = 0;
unsigned uc, uc2;
if (*str != '\"')
{
*ep = str;
return 0;
} /* not a string! */
while (*ptr != '\"' && *ptr && ++len)
if (*ptr++ == '\\')
ptr++; /* Skip escaped quotes. */
out = (char*) cJSON_malloc(len + 1); /* This is how long we need for the string, roughly. */
if (!out)
return 0;
ptr = str + 1;
ptr2 = out;
while (*ptr != '\"' && *ptr)
{
if (*ptr != '\\')
*ptr2++ = *ptr++;
else
{
ptr++;
switch (*ptr)
{
case 'b':
*ptr2++ = '\b';
break;
case 'f':
*ptr2++ = '\f';
break;
case 'n':
*ptr2++ = '\n';
break;
case 'r':
*ptr2++ = '\r';
break;
case 't':
*ptr2++ = '\t';
break;
case 'u': /* transcode utf16 to utf8. */
sscanf(ptr + 1, "%4x", &uc);
ptr += 4; /* get the unicode char. */
if ((uc >= 0xDC00 && uc <= 0xDFFF) || uc == 0)
break; // check for invalid.
if (uc >= 0xD800 && uc <= 0xDBFF) // UTF16 surrogate pairs.
{
if (ptr[1] != '\\' || ptr[2] != 'u')
break; // missing second-half of surrogate.
sscanf(ptr + 3, "%4x", &uc2);
ptr += 6;
if (uc2 < 0xDC00 || uc2 > 0xDFFF)
break; // invalid second-half of surrogate.
uc = 0x10000 | ((uc & 0x3FF) << 10) | (uc2 & 0x3FF);
}
len = 4;
if (uc < 0x80)
len = 1;
else if (uc < 0x800)
len = 2;
else if (uc < 0x10000)
len = 3;
ptr2 += len;
switch (len)
{
case 4:
*--ptr2 = ((uc | 0x80) & 0xBF);
uc >>= 6;
case 3:
*--ptr2 = ((uc | 0x80) & 0xBF);
uc >>= 6;
case 2:
*--ptr2 = ((uc | 0x80) & 0xBF);
uc >>= 6;
case 1:
*--ptr2 = (uc | firstByteMark[len]);
}
ptr2 += len;
break;
default:
*ptr2++ = *ptr;
break;
}
ptr++;
}
}
*ptr2 = 0;
if (*ptr == '\"')
ptr++;
item->valuestring = out;
item->type = cJSON_String;
return ptr;
}
/* Render the cstring provided to an escaped version that can be printed. */
static char *print_string_ptr(const char *str)
{
const char *ptr;
char *ptr2, *out;
int len = 0;
unsigned char token;
if (!str)
return cJSON_strdup("");
ptr = str;
while ((token = *ptr) && ++len)
{
if (strchr("\"\\\b\f\n\r\t", token))
len++;
else if (token < 32)
len += 5;
ptr++;
}
out = (char*) cJSON_malloc(len + 3);
if (!out)
return 0;
ptr2 = out;
ptr = str;
*ptr2++ = '\"';
while (*ptr)
{
if ((unsigned char) *ptr > 31 && *ptr != '\"' && *ptr != '\\')
*ptr2++ = *ptr++;
else
{
*ptr2++ = '\\';
switch (token = *ptr++)
{
case '\\':
*ptr2++ = '\\';
break;
case '\"':
*ptr2++ = '\"';
break;
case '\b':
*ptr2++ = 'b';
break;
case '\f':
*ptr2++ = 'f';
break;
case '\n':
*ptr2++ = 'n';
break;
case '\r':
*ptr2++ = 'r';
break;
case '\t':
*ptr2++ = 't';
break;
default:
sprintf(ptr2, "u%04x", token);
ptr2 += 5;
break; /* escape and print */
}
}
}
*ptr2++ = '\"';
*ptr2++ = 0;
return out;
}
/* Invote print_string_ptr (which is useful) on an item. */
static char *print_string(cJSON *item)
{
return print_string_ptr(item->valuestring);
}
/* Predeclare these prototypes. */
static const char *parse_value(cJSON *item, const char *value, const char **ep);
static char *print_value(cJSON *item, int depth, int fmt);
static const char *parse_array(cJSON *item, const char *value, const char **ep);
static char *print_array(cJSON *item, int depth, int fmt);
static const char *parse_object(cJSON *item, const char *value, const char **ep);
static char *print_object(cJSON *item, int depth, int fmt);
/* Utility to jump whitespace and cr/lf */
static const char *skip(const char *in)
{
while (in && *in && (unsigned char) *in <= 32)
in++;
return in;
}
/* Parse an object - create a new root, and populate. */
cJSON *cJSON_Parse(const char *value, const char **ep)
{
cJSON *c = cJSON_New_Item();
*ep = 0;
if (!c)
return 0; /* memory fail */
if (!parse_value(c, skip(value), ep))
{
cJSON_Delete(c);
return 0;
}
return c;
}
/* Render a cJSON item/entity/structure to text. */
char *cJSON_Print(cJSON *item)
{
return print_value(item, 0, 1);
}
char *cJSON_PrintUnformatted(cJSON *item)
{
return print_value(item, 0, 0);
}
/* Parser core - when encountering text, process appropriately. */
static const char *parse_value(cJSON *item, const char *value, const char **ep)
{
if (!value)
return 0; /* Fail on null. */
if (!strncmp(value, "null", 4))
{
item->type = cJSON_NULL;
return value + 4;
}
if (!strncmp(value, "false", 5))
{
item->type = cJSON_False;
return value + 5;
}
if (!strncmp(value, "true", 4))
{
item->type = cJSON_True;
item->valueint = 1;
return value + 4;
}
if (*value == '\"')
{
return parse_string(item, value, ep);
}
if (*value == '-' || (*value >= '0' && *value <= '9'))
{
return parse_number(item, value);
}
if (*value == '[')
{
return parse_array(item, value, ep);
}
if (*value == '{')
{
return parse_object(item, value, ep);
}
*ep = value;
return 0; /* failure. */
}
/* Render a value to text. */
static char *print_value(cJSON *item, int depth, int fmt)
{
char *out = 0;
if (!item)
return 0;
switch ((item->type) & 255)
{
case cJSON_NULL:
out = cJSON_strdup("null");
break;
case cJSON_False:
out = cJSON_strdup("false");
break;
case cJSON_True:
out = cJSON_strdup("true");
break;
case cJSON_Int:
out = print_int(item);
break;
case cJSON_Double:
out = print_double(item);
break;
case cJSON_String:
out = print_string(item);
break;
case cJSON_Array:
out = print_array(item, depth, fmt);
break;
case cJSON_Object:
out = print_object(item, depth, fmt);
break;
}
return out;
}
/* Build an array from input text. */
static const char *parse_array(cJSON *item, const char *value, const char **ep)
{
cJSON *child;
if (*value != '[')
{
*ep = value;
return 0;
} /* not an array! */
item->type = cJSON_Array;
value = skip(value + 1);
if (*value == ']')
return value + 1; /* empty array. */
item->child = child = cJSON_New_Item();
if (!item->child)
return 0; /* memory fail */
value = skip(parse_value(child, skip(value), ep)); /* skip any spacing, get the value. */
if (!value)
return 0;
while (*value == ',')
{
cJSON *new_item;
if (!(new_item = cJSON_New_Item()))
return 0; /* memory fail */
child->next = new_item;
new_item->prev = child;
child = new_item;
value = skip(parse_value(child, skip(value + 1), ep));
if (!value)
return 0; /* memory fail */
}
if (*value == ']')
return value + 1; /* end of array */
*ep = value;
return 0; /* malformed. */
}
/* Render an array to text */
static char *print_array(cJSON *item, int depth, int fmt)
{
char **entries;
char *out = 0, *ptr, *ret;
int len = 5;
cJSON *child = item->child;
int numentries = 0, i = 0, fail = 0;
/* How many entries in the array? */
while (child)
numentries++, child = child->next;
/* Allocate an array to hold the values for each */
entries = (char**) cJSON_malloc(numentries * sizeof(char*));
if (!entries)
return 0;
memset(entries, 0, numentries * sizeof(char*));
/* Retrieve all the results: */
child = item->child;
while (child && !fail)
{
ret = print_value(child, depth + 1, fmt);
entries[i++] = ret;
if (ret)
len += strlen(ret) + 2 + (fmt ? 1 : 0);
else
fail = 1;
child = child->next;
}
/* If we didn't fail, try to malloc the output string */
if (!fail)
out = (char*) cJSON_malloc(len);
/* If that fails, we fail. */
if (!out)
fail = 1;
/* Handle failure. */
if (fail)
{
for (i = 0; i < numentries; i++)
if (entries[i])
cJSON_free(entries[i]);
cJSON_free(entries);
return 0;
}
/* Compose the output array. */
*out = '[';
ptr = out + 1;
*ptr = 0;
for (i = 0; i < numentries; i++)
{
strcpy(ptr, entries[i]);
ptr += strlen(entries[i]);
if (i != numentries - 1)
{
*ptr++ = ',';
if (fmt)
*ptr++ = ' ';
*ptr = 0;
}
cJSON_free(entries[i]);
}
cJSON_free(entries);
*ptr++ = ']';
*ptr++ = 0;
return out;
}
/* Build an object from the text. */
static const char *parse_object(cJSON *item, const char *value, const char **ep)
{
cJSON *child;
if (*value != '{')
{
*ep = value;
return 0;
} /* not an object! */
item->type = cJSON_Object;
value = skip(value + 1);
if (*value == '}')
return value + 1; /* empty array. */
item->child = child = cJSON_New_Item();
if (!item->child)
return 0;
value = skip(parse_string(child, skip(value), ep));
if (!value)
return 0;
child->string = child->valuestring;
child->valuestring = 0;
if (*value != ':')
{
*ep = value;
return 0;
} /* fail! */
value = skip(parse_value(child, skip(value + 1), ep)); /* skip any spacing, get the value. */
if (!value)
return 0;
while (*value == ',')
{
cJSON *new_item;
if (!(new_item = cJSON_New_Item()))
return 0; /* memory fail */
child->next = new_item;
new_item->prev = child;
child = new_item;
value = skip(parse_string(child, skip(value + 1), ep));
if (!value)
return 0;
child->string = child->valuestring;
child->valuestring = 0;
if (*value != ':')
{
*ep = value;
return 0;
} /* fail! */
value = skip(parse_value(child, skip(value + 1), ep)); /* skip any spacing, get the value. */
if (!value)
return 0;
}
if (*value == '}')
return value + 1; /* end of array */
*ep = value;
return 0; /* malformed. */
}
/* Render an object to text. */
static char *print_object(cJSON *item, int depth, int fmt)
{
char **entries = 0, **names = 0;
char *out = 0, *ptr, *ret, *str;
int len = 7, i = 0, j;
cJSON *child = item->child;
int numentries = 0, fail = 0;
/* Count the number of entries. */
while (child)
numentries++, child = child->next;
/* Allocate space for the names and the objects */
entries = (char**) cJSON_malloc(numentries * sizeof(char*));
if (!entries)
return 0;
names = (char**) cJSON_malloc(numentries * sizeof(char*));
if (!names)
{
cJSON_free(entries);
return 0;
}
memset(entries, 0, sizeof(char*) * numentries);
memset(names, 0, sizeof(char*) * numentries);
/* Collect all the results into our arrays: */
child = item->child;
depth++;
if (fmt)
len += depth;
while (child)
{
names[i] = str = print_string_ptr(child->string);
entries[i++] = ret = print_value(child, depth, fmt);
if (str && ret)
len += strlen(ret) + strlen(str) + 2 + (fmt ? 2 + depth : 0);
else
fail = 1;
child = child->next;
}
/* Try to allocate the output string */
if (!fail)
out = (char*) cJSON_malloc(len);
if (!out)
fail = 1;
/* Handle failure */
if (fail)
{
for (i = 0; i < numentries; i++)
{
if (names[i])
cJSON_free(names[i]);
if (entries[i])
cJSON_free(entries[i]);
}
cJSON_free(names);
cJSON_free(entries);
return 0;
}
/* Compose the output: */
*out = '{';
ptr = out + 1;
if (fmt)
*ptr++ = '\n';
*ptr = 0;
for (i = 0; i < numentries; i++)
{
if (fmt)
for (j = 0; j < depth; j++)
*ptr++ = '\t';
strcpy(ptr, names[i]);
ptr += strlen(names[i]);
*ptr++ = ':';
if (fmt)
*ptr++ = '\t';
strcpy(ptr, entries[i]);
ptr += strlen(entries[i]);
if (i != numentries - 1)
*ptr++ = ',';
if (fmt)
*ptr++ = '\n';
*ptr = 0;
cJSON_free(names[i]);
cJSON_free(entries[i]);
}
cJSON_free(names);
cJSON_free(entries);
if (fmt)
for (i = 0; i < depth - 1; i++)
*ptr++ = '\t';
*ptr++ = '}';
*ptr++ = 0;
return out;
}
/* Get Array size/item / object item. */
int cJSON_GetArraySize(cJSON *array)
{
cJSON *c = array->child;
int i = 0;
while (c)
i++, c = c->next;
return i;
}
cJSON *cJSON_GetArrayItem(cJSON *array, int item)
{
cJSON *c = array->child;
while (c && item > 0)
item--, c = c->next;
return c;
}
cJSON *cJSON_GetObjectItem(cJSON *object, const char *string)
{
cJSON *c = object->child;
while (c && cJSON_strcasecmp(c->string, string))
c = c->next;
return c;
}
/* Utility for array list handling. */
static void suffix_object(cJSON *prev, cJSON *item)
{
prev->next = item;
item->prev = prev;
}
/* Utility for handling references. */
static cJSON *create_reference(cJSON *item)
{
cJSON *ref = cJSON_New_Item();
if (!ref)
return 0;
memcpy(ref, item, sizeof(cJSON));
ref->string = 0;
ref->type |= cJSON_IsReference;
ref->next = ref->prev = 0;
return ref;
}
/* Add item to array/object. */
void cJSON_AddItemToArray(cJSON *array, cJSON *item)
{
cJSON *c = array->child;
if (!item)
return;
if (!c)
{
array->child = item;
}
else
{
while (c && c->next)
c = c->next;
suffix_object(c, item);
}
}
void cJSON_AddItemToArrayHead(cJSON *array, cJSON *item)
{
cJSON *c = array->child;
if (!item)
return;
if (!c)
{
array->child = item;
}
else
{
item->prev = c->prev;
item->next = c;
c->prev = item;
array->child = item;
}
}
void cJSON_AddItemToObject(cJSON *object, const char *string, cJSON *item)
{
if (!item)
return;
if (item->string)
cJSON_free(item->string);
item->string = cJSON_strdup(string);
cJSON_AddItemToArray(object, item);
}
void cJSON_AddItemReferenceToArray(cJSON *array, cJSON *item)
{
cJSON_AddItemToArray(array, create_reference(item));
}
void cJSON_AddItemReferenceToObject(cJSON *object, const char *string,
cJSON *item)
{
cJSON_AddItemToObject(object, string, create_reference(item));
}
cJSON *cJSON_DetachItemFromArray(cJSON *array, int which)
{
cJSON *c = array->child;
while (c && which > 0)
c = c->next, which--;
if (!c)
return 0;
if (c->prev)
c->prev->next = c->next;
if (c->next)
c->next->prev = c->prev;
if (c == array->child)
array->child = c->next;
c->prev = c->next = 0;
return c;
}
void cJSON_DeleteItemFromArray(cJSON *array, int which)
{
cJSON_Delete(cJSON_DetachItemFromArray(array, which));
}
cJSON *cJSON_DetachItemFromObject(cJSON *object, const char *string)
{
int i = 0;
cJSON *c = object->child;
while (c && cJSON_strcasecmp(c->string, string))
i++, c = c->next;
if (c)
return cJSON_DetachItemFromArray(object, i);
return 0;
}
void cJSON_DeleteItemFromObject(cJSON *object, const char *string)
{
cJSON_Delete(cJSON_DetachItemFromObject(object, string));
}
/* Replace array/object items with new ones. */
void cJSON_ReplaceItemInArray(cJSON *array, int which, cJSON *newitem)
{
cJSON *c = array->child;
while (c && which > 0)
c = c->next, which--;
if (!c)
return;
newitem->next = c->next;
newitem->prev = c->prev;
if (newitem->next)
newitem->next->prev = newitem;
if (c == array->child)
array->child = newitem;
else
newitem->prev->next = newitem;
c->next = c->prev = 0;
cJSON_Delete(c);
}
void cJSON_ReplaceItemInObject(cJSON *object, const char *string,
cJSON *newitem)
{
int i = 0;
cJSON *c = object->child;
while (c && cJSON_strcasecmp(c->string, string))
i++, c = c->next;
if (c)
{
newitem->string = cJSON_strdup(string);
cJSON_ReplaceItemInArray(object, i, newitem);
}
}
/* Create basic types: */
cJSON *cJSON_CreateNull()
{
cJSON *item = cJSON_New_Item();
if (item)
item->type = cJSON_NULL;
return item;
}
cJSON *cJSON_CreateTrue()
{
cJSON *item = cJSON_New_Item();
if (item)
item->type = cJSON_True;
return item;
}
cJSON *cJSON_CreateFalse()
{
cJSON *item = cJSON_New_Item();
if (item)
item->type = cJSON_False;
return item;
}
cJSON *cJSON_CreateBool(int b)
{
cJSON *item = cJSON_New_Item();
if (item)
item->type = b ? cJSON_True : cJSON_False;
return item;
}
cJSON *cJSON_CreateDouble(double num, int sign)
{
cJSON *item = cJSON_New_Item();
if (item)
{
item->type = cJSON_Double;
item->valuedouble = num;
item->valueint = (int64)num;
item->sign = sign;
}
return item;
}
cJSON *cJSON_CreateInt(uint64 num, int sign)
{
cJSON *item = cJSON_New_Item();
if (item)
{
item->type = cJSON_Int;
item->valuedouble = (double)num;
item->valueint = (int64)num;
item->sign = sign;
}
return item;
}
cJSON *cJSON_CreateString(const char *string)
{
cJSON *item = cJSON_New_Item();
if (item)
{
item->type = cJSON_String;
item->valuestring = cJSON_strdup(string);
}
return item;
}
cJSON *cJSON_CreateArray()
{
cJSON *item = cJSON_New_Item();
if (item)
item->type = cJSON_Array;
return item;
}
cJSON *cJSON_CreateObject()
{
cJSON *item = cJSON_New_Item();
if (item)
item->type = cJSON_Object;
return item;
}
/* Create Arrays: */
cJSON *cJSON_CreateIntArray(int *numbers, int sign, int count)
{
int i;
cJSON *n = 0, *p = 0, *a = cJSON_CreateArray();
for (i = 0; a && i < count; i++)
{
n = cJSON_CreateDouble((long double)((unsigned int)numbers[i]), sign);
if (!i)
a->child = n;
else
suffix_object(p, n);
p = n;
}
return a;
}
cJSON *cJSON_CreateFloatArray(float *numbers, int count)
{
int i;
cJSON *n = 0, *p = 0, *a = cJSON_CreateArray();
for (i = 0; a && i < count; i++)
{
n = cJSON_CreateDouble((long double)numbers[i], -1);
if (!i)
a->child = n;
else
suffix_object(p, n);
p = n;
}
return a;
}
cJSON *cJSON_CreateDoubleArray(double *numbers, int count)
{
int i;
cJSON *n = 0, *p = 0, *a = cJSON_CreateArray();
for (i = 0; a && i < count; i++)
{
n = cJSON_CreateDouble((long double)numbers[i], -1);
if (!i)
a->child = n;
else
suffix_object(p, n);
p = n;
}
return a;
}
cJSON *cJSON_CreateStringArray(const char **strings, int count)
{
int i;
cJSON *n = 0, *p = 0, *a = cJSON_CreateArray();
for (i = 0; a && i < count; i++)
{
n = cJSON_CreateString(strings[i]);
if (!i)
a->child = n;
else
suffix_object(p, n);
p = n;
}
return a;
}
马建仓 AI 助手
尝试更多
代码解读
代码找茬
代码优化