|
@@ -86,7 +86,7 @@ void cJSON_Delete(cJSON *c)
|
|
next=c->next;
|
|
next=c->next;
|
|
if (!(c->type&cJSON_IsReference) && c->child) cJSON_Delete(c->child);
|
|
if (!(c->type&cJSON_IsReference) && c->child) cJSON_Delete(c->child);
|
|
if (!(c->type&cJSON_IsReference) && c->valuestring) cJSON_free(c->valuestring);
|
|
if (!(c->type&cJSON_IsReference) && c->valuestring) cJSON_free(c->valuestring);
|
|
- if (c->string) cJSON_free(c->string);
|
|
|
|
|
|
+ if (!(c->type&cJSON_StringIsConst) && c->string) cJSON_free(c->string);
|
|
cJSON_free(c);
|
|
cJSON_free(c);
|
|
c=next;
|
|
c=next;
|
|
}
|
|
}
|
|
@@ -114,19 +114,56 @@ static const char *parse_number(cJSON *item,const char *num)
|
|
return num;
|
|
return num;
|
|
}
|
|
}
|
|
|
|
|
|
-/* Render the number nicely from the given item into a string. */
|
|
|
|
-static char *print_number(cJSON *item)
|
|
|
|
|
|
+static int pow2gt (int x) { --x; x|=x>>1; x|=x>>2; x|=x>>4; x|=x>>8; x|=x>>16; return x+1; }
|
|
|
|
+
|
|
|
|
+typedef struct {char *buffer; int length; int offset; } printbuffer;
|
|
|
|
+
|
|
|
|
+static char* ensure(printbuffer *p,int needed)
|
|
|
|
+{
|
|
|
|
+ char *newbuffer;int newsize;
|
|
|
|
+ if (!p || !p->buffer) return 0;
|
|
|
|
+ needed+=p->offset;
|
|
|
|
+ if (needed<=p->length) return p->buffer+p->offset;
|
|
|
|
+
|
|
|
|
+ newsize=pow2gt(needed);
|
|
|
|
+ newbuffer=(char*)cJSON_malloc(newsize);
|
|
|
|
+ if (!newbuffer) {cJSON_free(p->buffer);p->length=0,p->buffer=0;return 0;}
|
|
|
|
+ if (newbuffer) memcpy(newbuffer,p->buffer,p->length);
|
|
|
|
+ cJSON_free(p->buffer);
|
|
|
|
+ p->length=newsize;
|
|
|
|
+ p->buffer=newbuffer;
|
|
|
|
+ return newbuffer+p->offset;
|
|
|
|
+}
|
|
|
|
+
|
|
|
|
+static int update(printbuffer *p)
|
|
{
|
|
{
|
|
char *str;
|
|
char *str;
|
|
|
|
+ if (!p || !p->buffer) return 0;
|
|
|
|
+ str=p->buffer+p->offset;
|
|
|
|
+ return p->offset+strlen(str);
|
|
|
|
+}
|
|
|
|
+
|
|
|
|
+/* Render the number nicely from the given item into a string. */
|
|
|
|
+static char *print_number(cJSON *item,printbuffer *p)
|
|
|
|
+{
|
|
|
|
+ char *str=0;
|
|
double d=item->valuedouble;
|
|
double d=item->valuedouble;
|
|
- if (fabs(((double)item->valueint)-d)<=DBL_EPSILON && d<=INT_MAX && d>=INT_MIN)
|
|
|
|
|
|
+ if (d==0)
|
|
|
|
+ {
|
|
|
|
+ if (p) str=ensure(p,2);
|
|
|
|
+ else str=(char*)cJSON_malloc(2); /* special case for 0. */
|
|
|
|
+ if (str) strcpy(str,"0");
|
|
|
|
+ }
|
|
|
|
+ else if (fabs(((double)item->valueint)-d)<=DBL_EPSILON && d<=INT_MAX && d>=INT_MIN)
|
|
{
|
|
{
|
|
- str=(char*)cJSON_malloc(21); /* 2^64+1 can be represented in 21 chars. */
|
|
|
|
- if (str) sprintf(str,"%d",item->valueint);
|
|
|
|
|
|
+ if (p) str=ensure(p,21);
|
|
|
|
+ else str=(char*)cJSON_malloc(21); /* 2^64+1 can be represented in 21 chars. */
|
|
|
|
+ if (str) sprintf(str,"%d",item->valueint);
|
|
}
|
|
}
|
|
else
|
|
else
|
|
{
|
|
{
|
|
- str=(char*)cJSON_malloc(64); /* This is a nice tradeoff. */
|
|
|
|
|
|
+ if (p) str=ensure(p,64);
|
|
|
|
+ else str=(char*)cJSON_malloc(64); /* This is a nice tradeoff. */
|
|
if (str)
|
|
if (str)
|
|
{
|
|
{
|
|
if (fabs(floor(d)-d)<=DBL_EPSILON && fabs(d)<1.0e60)sprintf(str,"%.0f",d);
|
|
if (fabs(floor(d)-d)<=DBL_EPSILON && fabs(d)<1.0e60)sprintf(str,"%.0f",d);
|
|
@@ -212,14 +249,36 @@ static const char *parse_string(cJSON *item,const char *str)
|
|
}
|
|
}
|
|
|
|
|
|
/* Render the cstring provided to an escaped version that can be printed. */
|
|
/* Render the cstring provided to an escaped version that can be printed. */
|
|
-static char *print_string_ptr(const char *str)
|
|
|
|
|
|
+static char *print_string_ptr(const char *str,printbuffer *p)
|
|
{
|
|
{
|
|
- const char *ptr;char *ptr2,*out;int len=0;unsigned char token;
|
|
|
|
|
|
+ const char *ptr;char *ptr2,*out;int len=0,flag=0;unsigned char token;
|
|
|
|
+
|
|
|
|
+ for (ptr=str;*ptr;ptr++) flag|=((*ptr>0 && *ptr<32)||(*ptr=='\"')||(*ptr=='\\'))?1:0;
|
|
|
|
+ if (!flag)
|
|
|
|
+ {
|
|
|
|
+ len=ptr-str;
|
|
|
|
+ if (p) out=ensure(p,len+3);
|
|
|
|
+ else out=(char*)cJSON_malloc(len+3);
|
|
|
|
+ if (!out) return 0;
|
|
|
|
+ ptr2=out;*ptr2++='\"';
|
|
|
|
+ strcpy(ptr2,str);
|
|
|
|
+ ptr2[len]='\"';
|
|
|
|
+ ptr2[len+1]=0;
|
|
|
|
+ return out;
|
|
|
|
+ }
|
|
|
|
|
|
- if (!str) return cJSON_strdup("");
|
|
|
|
|
|
+ if (!str)
|
|
|
|
+ {
|
|
|
|
+ if (p) out=ensure(p,3);
|
|
|
|
+ else out=(char*)cJSON_malloc(3);
|
|
|
|
+ if (!out) return 0;
|
|
|
|
+ strcpy(out,"\"\"");
|
|
|
|
+ return out;
|
|
|
|
+ }
|
|
ptr=str;while ((token=*ptr) && ++len) {if (strchr("\"\\\b\f\n\r\t",token)) len++; else if (token<32) len+=5;ptr++;}
|
|
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 (p) out=ensure(p,len+3);
|
|
|
|
+ else out=(char*)cJSON_malloc(len+3);
|
|
if (!out) return 0;
|
|
if (!out) return 0;
|
|
|
|
|
|
ptr2=out;ptr=str;
|
|
ptr2=out;ptr=str;
|
|
@@ -247,15 +306,15 @@ static char *print_string_ptr(const char *str)
|
|
return out;
|
|
return out;
|
|
}
|
|
}
|
|
/* Invote print_string_ptr (which is useful) on an item. */
|
|
/* Invote print_string_ptr (which is useful) on an item. */
|
|
-static char *print_string(cJSON *item) {return print_string_ptr(item->valuestring);}
|
|
|
|
|
|
+static char *print_string(cJSON *item,printbuffer *p) {return print_string_ptr(item->valuestring,p);}
|
|
|
|
|
|
/* Predeclare these prototypes. */
|
|
/* Predeclare these prototypes. */
|
|
static const char *parse_value(cJSON *item,const char *value);
|
|
static const char *parse_value(cJSON *item,const char *value);
|
|
-static char *print_value(cJSON *item,int depth,int fmt);
|
|
|
|
|
|
+static char *print_value(cJSON *item,int depth,int fmt,printbuffer *p);
|
|
static const char *parse_array(cJSON *item,const char *value);
|
|
static const char *parse_array(cJSON *item,const char *value);
|
|
-static char *print_array(cJSON *item,int depth,int fmt);
|
|
|
|
|
|
+static char *print_array(cJSON *item,int depth,int fmt,printbuffer *p);
|
|
static const char *parse_object(cJSON *item,const char *value);
|
|
static const char *parse_object(cJSON *item,const char *value);
|
|
-static char *print_object(cJSON *item,int depth,int fmt);
|
|
|
|
|
|
+static char *print_object(cJSON *item,int depth,int fmt,printbuffer *p);
|
|
|
|
|
|
/* Utility to jump whitespace and cr/lf */
|
|
/* Utility to jump whitespace and cr/lf */
|
|
static const char *skip(const char *in) {while (in && *in && (unsigned char)*in<=32) in++; return in;}
|
|
static const char *skip(const char *in) {while (in && *in && (unsigned char)*in<=32) in++; return in;}
|
|
@@ -280,8 +339,19 @@ cJSON *cJSON_ParseWithOpts(const char *value,const char **return_parse_end,int r
|
|
cJSON *cJSON_Parse(const char *value) {return cJSON_ParseWithOpts(value,0,0);}
|
|
cJSON *cJSON_Parse(const char *value) {return cJSON_ParseWithOpts(value,0,0);}
|
|
|
|
|
|
/* Render a cJSON item/entity/structure to text. */
|
|
/* 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);}
|
|
|
|
|
|
+char *cJSON_Print(cJSON *item) {return print_value(item,0,1,0);}
|
|
|
|
+char *cJSON_PrintUnformatted(cJSON *item) {return print_value(item,0,0,0);}
|
|
|
|
+
|
|
|
|
+char *cJSON_PrintBuffered(cJSON *item,int prebuffer,int fmt)
|
|
|
|
+{
|
|
|
|
+ printbuffer p;
|
|
|
|
+ p.buffer=(char*)cJSON_malloc(prebuffer);
|
|
|
|
+ p.length=prebuffer;
|
|
|
|
+ p.offset=0;
|
|
|
|
+ return print_value(item,0,fmt,&p);
|
|
|
|
+ return p.buffer;
|
|
|
|
+}
|
|
|
|
+
|
|
|
|
|
|
/* Parser core - when encountering text, process appropriately. */
|
|
/* Parser core - when encountering text, process appropriately. */
|
|
static const char *parse_value(cJSON *item,const char *value)
|
|
static const char *parse_value(cJSON *item,const char *value)
|
|
@@ -299,19 +369,35 @@ static const char *parse_value(cJSON *item,const char *value)
|
|
}
|
|
}
|
|
|
|
|
|
/* Render a value to text. */
|
|
/* Render a value to text. */
|
|
-static char *print_value(cJSON *item,int depth,int fmt)
|
|
|
|
|
|
+static char *print_value(cJSON *item,int depth,int fmt,printbuffer *p)
|
|
{
|
|
{
|
|
char *out=0;
|
|
char *out=0;
|
|
if (!item) return 0;
|
|
if (!item) return 0;
|
|
- switch ((item->type)&255)
|
|
|
|
|
|
+ if (p)
|
|
|
|
+ {
|
|
|
|
+ switch ((item->type)&255)
|
|
|
|
+ {
|
|
|
|
+ case cJSON_NULL: {out=ensure(p,5); if (out) strcpy(out,"null"); break;}
|
|
|
|
+ case cJSON_False: {out=ensure(p,6); if (out) strcpy(out,"false"); break;}
|
|
|
|
+ case cJSON_True: {out=ensure(p,5); if (out) strcpy(out,"true"); break;}
|
|
|
|
+ case cJSON_Number: out=print_number(item,p);break;
|
|
|
|
+ case cJSON_String: out=print_string(item,p);break;
|
|
|
|
+ case cJSON_Array: out=print_array(item,depth,fmt,p);break;
|
|
|
|
+ case cJSON_Object: out=print_object(item,depth,fmt,p);break;
|
|
|
|
+ }
|
|
|
|
+ }
|
|
|
|
+ else
|
|
{
|
|
{
|
|
- 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_Number: out=print_number(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;
|
|
|
|
|
|
+ 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_Number: out=print_number(item,0);break;
|
|
|
|
+ case cJSON_String: out=print_string(item,0);break;
|
|
|
|
+ case cJSON_Array: out=print_array(item,depth,fmt,0);break;
|
|
|
|
+ case cJSON_Object: out=print_object(item,depth,fmt,0);break;
|
|
|
|
+ }
|
|
}
|
|
}
|
|
return out;
|
|
return out;
|
|
}
|
|
}
|
|
@@ -345,60 +431,82 @@ static const char *parse_array(cJSON *item,const char *value)
|
|
}
|
|
}
|
|
|
|
|
|
/* Render an array to text */
|
|
/* Render an array to text */
|
|
-static char *print_array(cJSON *item,int depth,int fmt)
|
|
|
|
|
|
+static char *print_array(cJSON *item,int depth,int fmt,printbuffer *p)
|
|
{
|
|
{
|
|
char **entries;
|
|
char **entries;
|
|
char *out=0,*ptr,*ret;int len=5;
|
|
char *out=0,*ptr,*ret;int len=5;
|
|
cJSON *child=item->child;
|
|
cJSON *child=item->child;
|
|
int numentries=0,i=0,fail=0;
|
|
int numentries=0,i=0,fail=0;
|
|
|
|
+ size_t tmplen=0;
|
|
|
|
|
|
/* How many entries in the array? */
|
|
/* How many entries in the array? */
|
|
while (child) numentries++,child=child->next;
|
|
while (child) numentries++,child=child->next;
|
|
/* Explicitly handle numentries==0 */
|
|
/* Explicitly handle numentries==0 */
|
|
if (!numentries)
|
|
if (!numentries)
|
|
{
|
|
{
|
|
- out=(char*)cJSON_malloc(3);
|
|
|
|
|
|
+ if (p) out=ensure(p,3);
|
|
|
|
+ else out=(char*)cJSON_malloc(3);
|
|
if (out) strcpy(out,"[]");
|
|
if (out) strcpy(out,"[]");
|
|
return out;
|
|
return out;
|
|
}
|
|
}
|
|
- /* 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)
|
|
|
|
|
|
+ if (p)
|
|
{
|
|
{
|
|
- for (i=0;i<numentries;i++) if (entries[i]) cJSON_free(entries[i]);
|
|
|
|
- cJSON_free(entries);
|
|
|
|
- return 0;
|
|
|
|
|
|
+ /* Compose the output array. */
|
|
|
|
+ i=p->offset;
|
|
|
|
+ ptr=ensure(p,1);if (!ptr) return 0; *ptr='['; p->offset++;
|
|
|
|
+ child=item->child;
|
|
|
|
+ while (child && !fail)
|
|
|
|
+ {
|
|
|
|
+ print_value(child,depth+1,fmt,p);
|
|
|
|
+ p->offset=update(p);
|
|
|
|
+ if (child->next) {len=fmt?2:1;ptr=ensure(p,len+1);if (!ptr) return 0;*ptr++=',';if(fmt)*ptr++=' ';*ptr=0;p->offset+=len;}
|
|
|
|
+ child=child->next;
|
|
|
|
+ }
|
|
|
|
+ ptr=ensure(p,2);if (!ptr) return 0; *ptr++=']';*ptr=0;
|
|
|
|
+ out=(p->buffer)+i;
|
|
}
|
|
}
|
|
-
|
|
|
|
- /* Compose the output array. */
|
|
|
|
- *out='[';
|
|
|
|
- ptr=out+1;*ptr=0;
|
|
|
|
- for (i=0;i<numentries;i++)
|
|
|
|
|
|
+ else
|
|
{
|
|
{
|
|
- strcpy(ptr,entries[i]);ptr+=strlen(entries[i]);
|
|
|
|
- if (i!=numentries-1) {*ptr++=',';if(fmt)*ptr++=' ';*ptr=0;}
|
|
|
|
- cJSON_free(entries[i]);
|
|
|
|
|
|
+ /* 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,0);
|
|
|
|
+ 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++)
|
|
|
|
+ {
|
|
|
|
+ tmplen=strlen(entries[i]);memcpy(ptr,entries[i],tmplen);ptr+=tmplen;
|
|
|
|
+ if (i!=numentries-1) {*ptr++=',';if(fmt)*ptr++=' ';*ptr=0;}
|
|
|
|
+ cJSON_free(entries[i]);
|
|
|
|
+ }
|
|
|
|
+ cJSON_free(entries);
|
|
|
|
+ *ptr++=']';*ptr++=0;
|
|
}
|
|
}
|
|
- cJSON_free(entries);
|
|
|
|
- *ptr++=']';*ptr++=0;
|
|
|
|
return out;
|
|
return out;
|
|
}
|
|
}
|
|
|
|
|
|
@@ -439,70 +547,113 @@ static const char *parse_object(cJSON *item,const char *value)
|
|
}
|
|
}
|
|
|
|
|
|
/* Render an object to text. */
|
|
/* Render an object to text. */
|
|
-static char *print_object(cJSON *item,int depth,int fmt)
|
|
|
|
|
|
+static char *print_object(cJSON *item,int depth,int fmt,printbuffer *p)
|
|
{
|
|
{
|
|
char **entries=0,**names=0;
|
|
char **entries=0,**names=0;
|
|
char *out=0,*ptr,*ret,*str;int len=7,i=0,j;
|
|
char *out=0,*ptr,*ret,*str;int len=7,i=0,j;
|
|
cJSON *child=item->child;
|
|
cJSON *child=item->child;
|
|
int numentries=0,fail=0;
|
|
int numentries=0,fail=0;
|
|
|
|
+ size_t tmplen=0;
|
|
/* Count the number of entries. */
|
|
/* Count the number of entries. */
|
|
while (child) numentries++,child=child->next;
|
|
while (child) numentries++,child=child->next;
|
|
/* Explicitly handle empty object case */
|
|
/* Explicitly handle empty object case */
|
|
if (!numentries)
|
|
if (!numentries)
|
|
{
|
|
{
|
|
- out=(char*)cJSON_malloc(fmt?depth+4:3);
|
|
|
|
|
|
+ if (p) out=ensure(p,fmt?depth+4:3);
|
|
|
|
+ else out=(char*)cJSON_malloc(fmt?depth+4:3);
|
|
if (!out) return 0;
|
|
if (!out) return 0;
|
|
ptr=out;*ptr++='{';
|
|
ptr=out;*ptr++='{';
|
|
if (fmt) {*ptr++='\n';for (i=0;i<depth-1;i++) *ptr++='\t';}
|
|
if (fmt) {*ptr++='\n';for (i=0;i<depth-1;i++) *ptr++='\t';}
|
|
*ptr++='}';*ptr++=0;
|
|
*ptr++='}';*ptr++=0;
|
|
return out;
|
|
return out;
|
|
}
|
|
}
|
|
- /* 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&&!fail)
|
|
|
|
|
|
+ if (p)
|
|
{
|
|
{
|
|
- 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;
|
|
|
|
|
|
+ /* Compose the output: */
|
|
|
|
+ i=p->offset;
|
|
|
|
+ len=fmt?2:1; ptr=ensure(p,len+1); if (!ptr) return 0;
|
|
|
|
+ *ptr++='{'; if (fmt) *ptr++='\n'; *ptr=0; p->offset+=len;
|
|
|
|
+ child=item->child;depth++;
|
|
|
|
+ while (child)
|
|
|
|
+ {
|
|
|
|
+ if (fmt)
|
|
|
|
+ {
|
|
|
|
+ ptr=ensure(p,depth); if (!ptr) return 0;
|
|
|
|
+ for (j=0;j<depth;j++) *ptr++='\t';
|
|
|
|
+ p->offset+=depth;
|
|
|
|
+ }
|
|
|
|
+ print_string_ptr(child->string,p);
|
|
|
|
+ p->offset=update(p);
|
|
|
|
+
|
|
|
|
+ len=fmt?2:1;
|
|
|
|
+ ptr=ensure(p,len); if (!ptr) return 0;
|
|
|
|
+ *ptr++=':';if (fmt) *ptr++='\t';
|
|
|
|
+ p->offset+=len;
|
|
|
|
+
|
|
|
|
+ print_value(child,depth,fmt,p);
|
|
|
|
+ p->offset=update(p);
|
|
|
|
+
|
|
|
|
+ len=(fmt?1:0)+(child->next?1:0);
|
|
|
|
+ ptr=ensure(p,len+1); if (!ptr) return 0;
|
|
|
|
+ if (child->next) *ptr++=',';
|
|
|
|
+ if (fmt) *ptr++='\n';*ptr=0;
|
|
|
|
+ p->offset+=len;
|
|
|
|
+ child=child->next;
|
|
|
|
+ }
|
|
|
|
+ ptr=ensure(p,fmt?(depth+1):2); if (!ptr) return 0;
|
|
|
|
+ if (fmt) for (i=0;i<depth-1;i++) *ptr++='\t';
|
|
|
|
+ *ptr++='}';*ptr=0;
|
|
|
|
+ out=(p->buffer)+i;
|
|
}
|
|
}
|
|
-
|
|
|
|
- /* Try to allocate the output string */
|
|
|
|
- if (!fail) out=(char*)cJSON_malloc(len);
|
|
|
|
- if (!out) fail=1;
|
|
|
|
-
|
|
|
|
- /* Handle failure */
|
|
|
|
- if (fail)
|
|
|
|
|
|
+ else
|
|
{
|
|
{
|
|
- for (i=0;i<numentries;i++) {if (names[i]) cJSON_free(names[i]);if (entries[i]) cJSON_free(entries[i]);}
|
|
|
|
|
|
+ /* 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 && !fail)
|
|
|
|
+ {
|
|
|
|
+ names[i]=str=print_string_ptr(child->string,0);
|
|
|
|
+ entries[i++]=ret=print_value(child,depth,fmt,0);
|
|
|
|
+ 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';
|
|
|
|
+ tmplen=strlen(names[i]);memcpy(ptr,names[i],tmplen);ptr+=tmplen;
|
|
|
|
+ *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);
|
|
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]);
|
|
|
|
|
|
+ if (fmt) for (i=0;i<depth-1;i++) *ptr++='\t';
|
|
|
|
+ *ptr++='}';*ptr++=0;
|
|
}
|
|
}
|
|
-
|
|
|
|
- cJSON_free(names);cJSON_free(entries);
|
|
|
|
- if (fmt) for (i=0;i<depth-1;i++) *ptr++='\t';
|
|
|
|
- *ptr++='}';*ptr++=0;
|
|
|
|
return out;
|
|
return out;
|
|
}
|
|
}
|
|
|
|
|
|
@@ -519,6 +670,7 @@ static cJSON *create_reference(cJSON *item) {cJSON *ref=cJSON_New_Item();if (!re
|
|
/* Add item to array/object. */
|
|
/* 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_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_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_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_AddItemToObjectCS(cJSON *object,const char *string,cJSON *item) {if (!item) return; if (!(item->type&cJSON_StringIsConst) && item->string) cJSON_free(item->string);item->string=(char*)string;item->type|=cJSON_StringIsConst;cJSON_AddItemToArray(object,item);}
|
|
void cJSON_AddItemReferenceToArray(cJSON *array, cJSON *item) {cJSON_AddItemToArray(array,create_reference(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));}
|
|
void cJSON_AddItemReferenceToObject(cJSON *object,const char *string,cJSON *item) {cJSON_AddItemToObject(object,string,create_reference(item));}
|
|
|
|
|
|
@@ -529,6 +681,8 @@ cJSON *cJSON_DetachItemFromObject(cJSON *object,const char *string) {int i=0;cJS
|
|
void cJSON_DeleteItemFromObject(cJSON *object,const char *string) {cJSON_Delete(cJSON_DetachItemFromObject(object,string));}
|
|
void cJSON_DeleteItemFromObject(cJSON *object,const char *string) {cJSON_Delete(cJSON_DetachItemFromObject(object,string));}
|
|
|
|
|
|
/* Replace array/object items with new ones. */
|
|
/* Replace array/object items with new ones. */
|
|
|
|
+void cJSON_InsertItemInArray(cJSON *array,int which,cJSON *newitem) {cJSON *c=array->child;while (c && which>0) c=c->next,which--;if (!c) {cJSON_AddItemToArray(array,newitem);return;}
|
|
|
|
+ newitem->next=c;newitem->prev=c->prev;c->prev=newitem;if (c==array->child) array->child=newitem; else newitem->prev->next=newitem;}
|
|
void cJSON_ReplaceItemInArray(cJSON *array,int which,cJSON *newitem) {cJSON *c=array->child;while (c && which>0) c=c->next,which--;if (!c) return;
|
|
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;
|
|
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);}
|
|
if (c==array->child) array->child=newitem; else newitem->prev->next=newitem;c->next=c->prev=0;cJSON_Delete(c);}
|