mirrors/sqlite
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

Rework the JSON parse structure to facilitate better caching. Passes all

Browse Source 
tests.

FossilOrigin-Name: ecdcb1ded76e9a0591bf7a2009679f49fc3aa639d3cc12406c6d29243ed8e1c5
This commit is contained in:
drh 2023-07-24 22:34:26 +00:00
parent 9125d5ab6c
commit 27553579c0
3 changed files with 135 additions and 103 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

12
manifest
View File

@ -1,5 +1,5 @@
C Incremental\sprogress\stoward\simproved\scaching\sof\sparsed\sJSON. C Rework\sthe\sJSON\sparse\sstructure\sto\sfacilitate\sbetter\scaching.\s\sPasses\sall\ntests.
D 2023-07-24T17:59:25.604 D 2023-07-24T22:34:26.093
F .fossil-settings/empty-dirs dbb81e8fc0401ac46a1491ab34a7f2c7c0452f2f06b54ebb845d024ca8283ef1 F .fossil-settings/empty-dirs dbb81e8fc0401ac46a1491ab34a7f2c7c0452f2f06b54ebb845d024ca8283ef1
F .fossil-settings/ignore-glob 35175cdfcf539b2318cb04a9901442804be81cd677d8b889fcc9149c21f239ea F .fossil-settings/ignore-glob 35175cdfcf539b2318cb04a9901442804be81cd677d8b889fcc9149c21f239ea
F LICENSE.md df5091916dbb40e6e9686186587125e1b2ff51f022cc334e886c19a0e9982724 F LICENSE.md df5091916dbb40e6e9686186587125e1b2ff51f022cc334e886c19a0e9982724
@ -598,7 +598,7 @@ F src/hash.h 3340ab6e1d13e725571d7cee6d3e3135f0779a7d8e76a9ce0a85971fa3953c51
F src/hwtime.h f9c2dfb84dce7acf95ce6d289e46f5f9d3d1afd328e53da8f8e9008e3b3caae6 F src/hwtime.h f9c2dfb84dce7acf95ce6d289e46f5f9d3d1afd328e53da8f8e9008e3b3caae6
F src/in-operator.md 10cd8f4bcd225a32518407c2fb2484089112fd71 F src/in-operator.md 10cd8f4bcd225a32518407c2fb2484089112fd71
F src/insert.c 3f0a94082d978bbdd33c38fefea15346c6c6bffb70bc645a71dc0f1f87dd3276 F src/insert.c 3f0a94082d978bbdd33c38fefea15346c6c6bffb70bc645a71dc0f1f87dd3276
F src/json.c 3584f5fb0ff48009ebabb34704328c2086d924fc2403fdf0e48afce5b9f22777 F src/json.c e743eb83ad6d581bdfd355aee1d0f2c3025e955ec1799706ec4542b46e3af7f2
F src/legacy.c d7874bc885906868cd51e6c2156698f2754f02d9eee1bae2d687323c3ca8e5aa F src/legacy.c d7874bc885906868cd51e6c2156698f2754f02d9eee1bae2d687323c3ca8e5aa
F src/loadext.c 176d6b2cb18a6ad73b133db17f6fc351c4d9a2d510deebdb76c22bde9cfd1465 F src/loadext.c 176d6b2cb18a6ad73b133db17f6fc351c4d9a2d510deebdb76c22bde9cfd1465
F src/main.c 512b1d45bc556edf4471a845afb7ba79e64bd5b832ab222dc195c469534cd002 F src/main.c 512b1d45bc556edf4471a845afb7ba79e64bd5b832ab222dc195c469534cd002
@ -2044,8 +2044,8 @@ F vsixtest/vsixtest.tcl 6a9a6ab600c25a91a7acc6293828957a386a8a93
F vsixtest/vsixtest.vcxproj.data 2ed517e100c66dc455b492e1a33350c1b20fbcdc F vsixtest/vsixtest.vcxproj.data 2ed517e100c66dc455b492e1a33350c1b20fbcdc
F vsixtest/vsixtest.vcxproj.filters 37e51ffedcdb064aad6ff33b6148725226cd608e F vsixtest/vsixtest.vcxproj.filters 37e51ffedcdb064aad6ff33b6148725226cd608e
F vsixtest/vsixtest_TemporaryKey.pfx e5b1b036facdb453873e7084e1cae9102ccc67a0 F vsixtest/vsixtest_TemporaryKey.pfx e5b1b036facdb453873e7084e1cae9102ccc67a0
P 00bfc4918be49ac74a3e7851c88ab7ec226e6a37853f8ad4c77f758751960456 P f2c063884685a79d5a787590447c292f51e898a98c9508159c788f505227ba85
R 831d8993ebdb0e60bc4ab13513e5d282 R fee4083d53f0bb74692c3aad54ce5646
U drh U drh
Z 8cedb8d1881aa5ce4f4f5c5fea73c221 Z 5a89ce2654bac729f780024f319554e3
# Remove this line to create a well-formed Fossil manifest. # Remove this line to create a well-formed Fossil manifest.

2
manifest.uuid
View File

@ -1 +1 @@
f2c063884685a79d5a787590447c292f51e898a98c9508159c788f505227ba85 ecdcb1ded76e9a0591bf7a2009679f49fc3aa639d3cc12406c6d29243ed8e1c5

224
src/json.c
View File

@ -87,15 +87,14 @@ struct JsonTask {
/* JSON type values /* JSON type values
*/ */
#define JSON_SUBST 0 /* Special edit node. Uses u.iPrev */ #define JSON_SUBST 0 /* Special edit node. Uses u.iPrev */
#define JSON_PATCH 1 /* Special edit node. Uses u.pPatch */ #define JSON_NULL 1
#define JSON_NULL 2 #define JSON_TRUE 2
#define JSON_TRUE 3 #define JSON_FALSE 3
#define JSON_FALSE 4 #define JSON_INT 4
#define JSON_INT 5 #define JSON_REAL 5
#define JSON_REAL 6 #define JSON_STRING 6
#define JSON_STRING 7 #define JSON_ARRAY 7
#define JSON_ARRAY 8 #define JSON_OBJECT 8
#define JSON_OBJECT 9
/* The "subtype" set for JSON values */ /* The "subtype" set for JSON values */
#define JSON_SUBTYPE 74 /* Ascii for "J" */ #define JSON_SUBTYPE 74 /* Ascii for "J" */
@ -104,7 +103,7 @@ struct JsonTask {
** Names of the various JSON types: ** Names of the various JSON types:
*/ */
static const char * const jsonType[] = { static const char * const jsonType[] = {
"subst", "patch", "subst",
"null", "true", "false", "integer", "real", "text", "array", "object" "null", "true", "false", "integer", "real", "text", "array", "object"
}; };
@ -113,8 +112,8 @@ static const char * const jsonType[] = {
#define JNODE_RAW 0x01 /* Content is raw, not JSON encoded */ #define JNODE_RAW 0x01 /* Content is raw, not JSON encoded */
#define JNODE_ESCAPE 0x02 /* Content is text with \ escapes */ #define JNODE_ESCAPE 0x02 /* Content is text with \ escapes */
#define JNODE_REMOVE 0x04 /* Do not output */ #define JNODE_REMOVE 0x04 /* Do not output */
#define JNODE_REPLACE 0x08 /* Replace with JsonNode.u.iReplace */ #define JNODE_REPLACE 0x08 /* Target of a JSON_SUBST node */
#define JNODE_PATCH 0x10 /* Patch with JsonNode.u.pPatch */ /* 0x10 Available for reuse */
#define JNODE_APPEND 0x20 /* More ARRAY/OBJECT entries at u.iAppend */ #define JNODE_APPEND 0x20 /* More ARRAY/OBJECT entries at u.iAppend */
#define JNODE_LABEL 0x40 /* Is a label of an object */ #define JNODE_LABEL 0x40 /* Is a label of an object */
#define JNODE_JSON5 0x80 /* Node contains JSON5 enhancements */ #define JNODE_JSON5 0x80 /* Node contains JSON5 enhancements */
@ -133,8 +132,7 @@ struct JsonNode {
const char *zJContent; /* 1: Content for INT, REAL, and STRING */ const char *zJContent; /* 1: Content for INT, REAL, and STRING */
u32 iAppend; /* 2: More terms for ARRAY and OBJECT */ u32 iAppend; /* 2: More terms for ARRAY and OBJECT */
u32 iKey; /* 3: Key for ARRAY objects in json_tree() */ u32 iKey; /* 3: Key for ARRAY objects in json_tree() */
JsonNode *pPatch; /* 5: Node chain of patch for JNODE_PATCH */ u32 iPrev; /* 4: Previous SUBST node, or 0 */
u32 iPrev; /* 6: Previous SUBST node, or 0 */
} u; } u;
}; };
@ -613,23 +611,19 @@ static void jsonRenderNode(
JsonString *pOut /* Write JSON here */ JsonString *pOut /* Write JSON here */
){ ){
assert( pNode!=0 ); assert( pNode!=0 );
while( (pNode->jnFlags & (JNODE_REPLACE|JNODE_PATCH)) ){ while( (pNode->jnFlags & JNODE_REPLACE)!=0 ){
if( (pNode->jnFlags & JNODE_REPLACE)!=0 ){ u32 idx = (u32)(pNode - pParse->aNode);
u32 idx = (u32)(pNode - pParse->aNode); u32 i = pParse->iSubst;
u32 i = pParse->iSubst; while( 1 /*exit-by-break*/ ){
while( 1 /*exit-by-break*/ ){ assert( i<pParse->nNode );
assert( i<pParse->nNode ); assert( pParse->aNode[i].eType==JSON_SUBST );
assert( pParse->aNode[i].eType==JSON_SUBST ); assert( pParse->aNode[i].eU==4 );
assert( pParse->aNode[i].eU==6 ); assert( pParse->aNode[i].u.iPrev<i );
assert( pParse->aNode[i].u.iPrev<i ); if( pParse->aNode[i].n==idx ){
if( pParse->aNode[i].n==idx ){ pNode = &pParse->aNode[i+1];
pNode = &pParse->aNode[i+1]; break;
break;
}
i = pParse->aNode[i].u.iPrev;
} }
}else{ i = pParse->aNode[i].u.iPrev;
pNode = pNode->u.pPatch;
} }
} }
switch( pNode->eType ){ switch( pNode->eType ){
@ -697,7 +691,7 @@ static void jsonRenderNode(
} }
if( (pNode->jnFlags & JNODE_APPEND)==0 ) break; if( (pNode->jnFlags & JNODE_APPEND)==0 ) break;
assert( pNode->eU==2 ); assert( pNode->eU==2 );
pNode = &pNode[pNode->u.iAppend]; pNode = &pParse->aNode[pNode->u.iAppend];
j = 1; j = 1;
} }
jsonAppendChar(pOut, ']'); jsonAppendChar(pOut, ']');
@ -718,7 +712,7 @@ static void jsonRenderNode(
} }
if( (pNode->jnFlags & JNODE_APPEND)==0 ) break; if( (pNode->jnFlags & JNODE_APPEND)==0 ) break;
assert( pNode->eU==2 ); assert( pNode->eU==2 );
pNode = &pNode[pNode->u.iAppend]; pNode = &pParse->aNode[pNode->u.iAppend];
j = 1; j = 1;
} }
jsonAppendChar(pOut, '}'); jsonAppendChar(pOut, '}');
@ -736,6 +730,10 @@ static void jsonReturnJson(
sqlite3_context *pCtx /* Return value for this function */ sqlite3_context *pCtx /* Return value for this function */
){ ){
JsonString s; JsonString s;
if( pParse->oom ){
sqlite3_result_error_nomem(pCtx);
return;
}
jsonInit(&s, pCtx); jsonInit(&s, pCtx);
jsonRenderNode(pParse, pNode, &s); jsonRenderNode(pParse, pNode, &s);
jsonResult(&s); jsonResult(&s);
@ -948,6 +946,12 @@ static int jsonParseAddNode(JsonParse*,u32,u32,const char*);
#endif #endif
/*
** Add a single node to pParse->aNode after first expanding the
** size of the aNode array. Return the index of the new node.
**
** If an OOM error occurs, set pParse->oom and return -1.
*/
static JSON_NOINLINE int jsonParseAddNodeExpand( static JSON_NOINLINE int jsonParseAddNodeExpand(
JsonParse *pParse, /* Append the node to this object */ JsonParse *pParse, /* Append the node to this object */
u32 eType, /* Node type */ u32 eType, /* Node type */
@ -964,7 +968,7 @@ static JSON_NOINLINE int jsonParseAddNodeExpand(
pParse->oom = 1; pParse->oom = 1;
return -1; return -1;
} }
pParse->nAlloc = nNew; pParse->nAlloc = sqlite3_msize(pNew)/sizeof(JsonNode);
pParse->aNode = pNew; pParse->aNode = pNew;
assert( pParse->nNode<pParse->nAlloc ); assert( pParse->nNode<pParse->nAlloc );
return jsonParseAddNode(pParse, eType, n, zContent); return jsonParseAddNode(pParse, eType, n, zContent);
@ -995,6 +999,31 @@ static int jsonParseAddNode(
return pParse->nNode++; return pParse->nNode++;
} }
/*
** Add an array of new nodes to the current pParse->aNode array.
** Return the index of the first node added.
**
** If an OOM error occurs, set pParse->oom.
*/
static void jsonParseAddNodeArray(
JsonParse *pParse, /* Append the node to this object */
JsonNode *aNode, /* Array of nodes to add */
u32 nNode /* Number of elements in aNew */
){
if( pParse->nNode + nNode > pParse->nAlloc ){
u32 nNew = pParse->nNode + nNode;
JsonNode *aNew = sqlite3_realloc64(pParse->aNode, nNew*sizeof(JsonNode));
if( aNew==0 ){
pParse->oom = 1;
return;
}
pParse->nAlloc = sqlite3_msize(aNew)/sizeof(JsonNode);
pParse->aNode = aNew;
}
memcpy(&pParse->aNode[pParse->nNode], aNode, nNode*sizeof(JsonNode));
pParse->nNode += nNode;
}
/* /*
** Add a new JSON_SUBST node. The node immediately following ** Add a new JSON_SUBST node. The node immediately following
** this new node will be the substitute content for iNode. ** this new node will be the substitute content for iNode.
@ -1004,8 +1033,9 @@ static int jsonParseAddSubstNode(
u32 iNode /* References this node */ u32 iNode /* References this node */
){ ){
int idx = jsonParseAddNode(pParse, JSON_SUBST, iNode, 0); int idx = jsonParseAddNode(pParse, JSON_SUBST, iNode, 0);
if( idx<=0 ) return idx; if( pParse->oom ) return -1;
pParse->aNode[idx].eU = 6; pParse->aNode[iNode].jnFlags |= JNODE_REPLACE;
pParse->aNode[idx].eU = 4;
pParse->aNode[idx].u.iPrev = pParse->iSubst; pParse->aNode[idx].u.iPrev = pParse->iSubst;
pParse->iSubst = idx; pParse->iSubst = idx;
return idx; return idx;
@ -1852,6 +1882,22 @@ static JsonNode *jsonLookupStep(
u32 i, j, nKey; u32 i, j, nKey;
const char *zKey; const char *zKey;
JsonNode *pRoot = &pParse->aNode[iRoot]; JsonNode *pRoot = &pParse->aNode[iRoot];
while( (pRoot->jnFlags & JNODE_REPLACE)!=0 ){
u32 idx = (u32)(pRoot - pParse->aNode);
u32 i = pParse->iSubst;
while( 1 /*exit-by-break*/ ){
assert( i<pParse->nNode );
assert( pParse->aNode[i].eType==JSON_SUBST );
assert( pParse->aNode[i].eU==4 );
assert( pParse->aNode[i].u.iPrev<i );
if( pParse->aNode[i].n==idx ){
pRoot = &pParse->aNode[i+1];
iRoot = i+1;
break;
}
i = pParse->aNode[i].u.iPrev;
}
}
if( zPath[0]==0 ) return pRoot; if( zPath[0]==0 ) return pRoot;
if( zPath[0]=='.' ){ if( zPath[0]=='.' ){
if( pRoot->eType!=JSON_OBJECT ) return 0; if( pRoot->eType!=JSON_OBJECT ) return 0;
@ -1887,7 +1933,7 @@ static JsonNode *jsonLookupStep(
} }
if( (pRoot->jnFlags & JNODE_APPEND)==0 ) break; if( (pRoot->jnFlags & JNODE_APPEND)==0 ) break;
assert( pRoot->eU==2 ); assert( pRoot->eU==2 );
iRoot += pRoot->u.iAppend; iRoot = pRoot->u.iAppend;
pRoot = &pParse->aNode[iRoot]; pRoot = &pParse->aNode[iRoot];
j = 1; j = 1;
} }
@ -1902,7 +1948,7 @@ static JsonNode *jsonLookupStep(
if( pNode ){ if( pNode ){
pRoot = &pParse->aNode[iRoot]; pRoot = &pParse->aNode[iRoot];
assert( pRoot->eU==0 ); assert( pRoot->eU==0 );
pRoot->u.iAppend = iStart - iRoot; pRoot->u.iAppend = iStart;
pRoot->jnFlags |= JNODE_APPEND; pRoot->jnFlags |= JNODE_APPEND;
VVA( pRoot->eU = 2 ); VVA( pRoot->eU = 2 );
pParse->aNode[iLabel].jnFlags |= JNODE_RAW; pParse->aNode[iLabel].jnFlags |= JNODE_RAW;
@ -1928,7 +1974,7 @@ static JsonNode *jsonLookupStep(
} }
if( (pBase->jnFlags & JNODE_APPEND)==0 ) break; if( (pBase->jnFlags & JNODE_APPEND)==0 ) break;
assert( pBase->eU==2 ); assert( pBase->eU==2 );
iBase += pBase->u.iAppend; iBase = pBase->u.iAppend;
pBase = &pParse->aNode[iBase]; pBase = &pParse->aNode[iBase];
j = 1; j = 1;
} }
@ -1962,7 +2008,7 @@ static JsonNode *jsonLookupStep(
} }
if( (pRoot->jnFlags & JNODE_APPEND)==0 ) break; if( (pRoot->jnFlags & JNODE_APPEND)==0 ) break;
assert( pRoot->eU==2 ); assert( pRoot->eU==2 );
iRoot += pRoot->u.iAppend; iRoot = pRoot->u.iAppend;
pRoot = &pParse->aNode[iRoot]; pRoot = &pParse->aNode[iRoot];
j = 1; j = 1;
} }
@ -1978,7 +2024,7 @@ static JsonNode *jsonLookupStep(
if( pNode ){ if( pNode ){
pRoot = &pParse->aNode[iRoot]; pRoot = &pParse->aNode[iRoot];
assert( pRoot->eU==0 ); assert( pRoot->eU==0 );
pRoot->u.iAppend = iStart - iRoot; pRoot->u.iAppend = iStart;
pRoot->jnFlags |= JNODE_APPEND; pRoot->jnFlags |= JNODE_APPEND;
VVA( pRoot->eU = 2 ); VVA( pRoot->eU = 2 );
} }
@ -2111,9 +2157,7 @@ static void jsonRemoveAllNulls(JsonNode *pNode){
*/ */
static void jsonDebugPrintNodeEntries( static void jsonDebugPrintNodeEntries(
JsonNode *aNode, /* First node entry to print */ JsonNode *aNode, /* First node entry to print */
int N, /* Number of node entries to print */ int N /* Number of node entries to print */
int ofst, /* Node number for p */
int nDent /* Indent by this many spaces */
){ ){
int i; int i;
for(i=0; i<N; i++){ for(i=0; i<N; i++){
@ -2123,35 +2167,28 @@ static void jsonDebugPrintNodeEntries(
}else{ }else{
zType = jsonType[aNode[i].eType]; zType = jsonType[aNode[i].eType];
} }
if( nDent>0 ) printf("%*s", nDent, "");
if( (aNode[i].jnFlags & ~JNODE_LABEL)!=0 ){ if( (aNode[i].jnFlags & ~JNODE_LABEL)!=0 ){
printf("node %4u: %-7s %02x n=%-5d", printf("node %4u: %-7s %02x n=%-5d",
i+ofst, zType, aNode[i].jnFlags, aNode[i].n); i, zType, aNode[i].jnFlags, aNode[i].n);
}else{ }else{
printf("node %4u: %-7s n=%-5d", printf("node %4u: %-7s n=%-5d",
i+ofst, zType, aNode[i].n); i, zType, aNode[i].n);
} }
switch( aNode[i].eU ){ switch( aNode[i].eU ){
case 1: printf(" zJContent=[%.*s]\n", case 1: printf(" zJContent=[%.*s]\n",
aNode[i].n, aNode[i].u.zJContent); break; aNode[i].n, aNode[i].u.zJContent); break;
case 2: printf(" iAppend=%u\n", aNode[i].u.iAppend); break; case 2: printf(" iAppend=%u\n", aNode[i].u.iAppend); break;
case 3: printf(" iKey=%u\n", aNode[i].u.iKey); break; case 3: printf(" iKey=%u\n", aNode[i].u.iKey); break;
case 5: { case 4: printf(" iPrev=%u\n", aNode[i].u.iPrev); break;
JsonNode *pX = aNode[i].u.pPatch;
printf(" pPatch=...\n");
jsonDebugPrintNodeEntries(pX, jsonNodeSize(pX), 0, nDent+3);
break;
}
case 6: printf(" iPrev=%u\n", aNode[i].u.iPrev); break;
default: printf("\n"); default: printf("\n");
} }
} }
} }
static void jsonDebugPrintParse(JsonParse *p){ static void jsonDebugPrintParse(JsonParse *p){
jsonDebugPrintNodeEntries(p->aNode, p->nNode, 0, 0); jsonDebugPrintNodeEntries(p->aNode, p->nNode);
} }
static void jsonDebugPrintNode(JsonNode *pNode){ static void jsonDebugPrintNode(JsonNode *pNode){
jsonDebugPrintNodeEntries(pNode, jsonNodeSize(pNode), 0, 0); jsonDebugPrintNodeEntries(pNode, jsonNodeSize(pNode));
} }
#else #else
/* The usual case */ /* The usual case */
@ -2447,45 +2484,38 @@ static JsonNode *jsonMergePatch(
assert( pTarget[j].eType==JSON_STRING ); assert( pTarget[j].eType==JSON_STRING );
assert( pTarget[j].jnFlags & JNODE_LABEL ); assert( pTarget[j].jnFlags & JNODE_LABEL );
if( jsonSameLabel(&pPatch[i], &pTarget[j]) ){ if( jsonSameLabel(&pPatch[i], &pTarget[j]) ){
if( pTarget[j+1].jnFlags & (JNODE_REMOVE|JNODE_PATCH) ) break; if( pTarget[j+1].jnFlags & (JNODE_REMOVE|JNODE_REPLACE) ) break;
if( pPatch[i+1].eType==JSON_NULL ){ if( pPatch[i+1].eType==JSON_NULL ){
pTarget[j+1].jnFlags |= JNODE_REMOVE; pTarget[j+1].jnFlags |= JNODE_REMOVE;
}else{ }else{
JsonNode *pNew = jsonMergePatch(pParse, iTarget+j+1, &pPatch[i+1]); JsonNode *pNew = jsonMergePatch(pParse, iTarget+j+1, &pPatch[i+1]);
if( pNew==0 ) return 0; if( pNew==0 ) return 0;
pTarget = &pParse->aNode[iTarget]; if( pNew!=&pParse->aNode[iTarget+j+1] ){
if( pNew!=&pTarget[j+1] ){ jsonParseAddSubstNode(pParse, iTarget+j+1);
assert( pTarget[j+1].eU==0 jsonParseAddNodeArray(pParse, pNew, jsonNodeSize(pNew));
|| pTarget[j+1].eU==1
|| pTarget[j+1].eU==2 );
testcase( pTarget[j+1].eU==1 );
testcase( pTarget[j+1].eU==2 );
VVA( pTarget[j+1].eU = 5 );
pTarget[j+1].u.pPatch = pNew;
pTarget[j+1].jnFlags |= JNODE_PATCH;
} }
pTarget = &pParse->aNode[iTarget];
} }
break; break;
} }
} }
if( j>=pTarget->n && pPatch[i+1].eType!=JSON_NULL ){ if( j>=pTarget->n && pPatch[i+1].eType!=JSON_NULL ){
int iStart, iPatch; int iStart;
iStart = jsonParseAddNode(pParse, JSON_OBJECT, 2, 0); JsonNode *pApnd;
u32 nApnd;
iStart = jsonParseAddNode(pParse, JSON_OBJECT, 0, 0);
jsonParseAddNode(pParse, JSON_STRING, nKey, zKey); jsonParseAddNode(pParse, JSON_STRING, nKey, zKey);
iPatch = jsonParseAddNode(pParse, JSON_TRUE, 0, 0); pApnd = &pPatch[i+1];
if( pApnd->eType==JSON_OBJECT ) jsonRemoveAllNulls(pApnd);
nApnd = jsonNodeSize(pApnd);
jsonParseAddNodeArray(pParse, pApnd, jsonNodeSize(pApnd));
if( pParse->oom ) return 0; if( pParse->oom ) return 0;
jsonRemoveAllNulls(pPatch); pParse->aNode[iStart].n = 1+nApnd;
pTarget = &pParse->aNode[iTarget];
assert( pParse->aNode[iRoot].eU==0 || pParse->aNode[iRoot].eU==2 );
testcase( pParse->aNode[iRoot].eU==2 );
pParse->aNode[iRoot].jnFlags |= JNODE_APPEND; pParse->aNode[iRoot].jnFlags |= JNODE_APPEND;
pParse->aNode[iRoot].u.iAppend = iStart;
VVA( pParse->aNode[iRoot].eU = 2 ); VVA( pParse->aNode[iRoot].eU = 2 );
pParse->aNode[iRoot].u.iAppend = iStart - iRoot;
iRoot = iStart; iRoot = iStart;
assert( pParse->aNode[iPatch].eU==0 ); pTarget = &pParse->aNode[iTarget];
VVA( pParse->aNode[iPatch].eU = 5 );
pParse->aNode[iPatch].jnFlags |= JNODE_PATCH;
pParse->aNode[iPatch].u.pPatch = &pPatch[i+1];
} }
} }
return pTarget; return pTarget;
@ -2513,7 +2543,8 @@ static void jsonPatchFunc(
} }
pResult = jsonMergePatch(&x, 0, y.aNode); pResult = jsonMergePatch(&x, 0, y.aNode);
assert( pResult!=0 || x.oom ); assert( pResult!=0 || x.oom );
if( pResult ){ if( pResult && x.oom==0 ){
jsonDebugPrintParse(&x);
jsonDebugPrintNode(pResult); jsonDebugPrintNode(pResult);
jsonReturnJson(&x, pResult, ctx); jsonReturnJson(&x, pResult, ctx);
}else{ }else{
@ -2652,23 +2683,26 @@ static void jsonReplaceNode(
} }
if( sqlite3_value_subtype(pValue)!=JSON_SUBTYPE ){ if( sqlite3_value_subtype(pValue)!=JSON_SUBTYPE ){
int k = jsonParseAddNode(p, JSON_STRING, n, z); int k = jsonParseAddNode(p, JSON_STRING, n, z);
char *zCopy = sqlite3DbStrDup(0, z);
if( k>0 ) p->aNode[k].jnFlags |= JNODE_RAW; if( k>0 ) p->aNode[k].jnFlags |= JNODE_RAW;
jsonParseAddCleanup(p, sqlite3_free, sqlite3DbStrDup(0,z)); if( zCopy ){
}else{ jsonParseAddCleanup(p, sqlite3_free, zCopy);
int k= jsonParseAddNode(p, JSON_PATCH, 0, 0); }else{
if( k>0 ){ sqlite3_result_error_nomem(pCtx);
JsonParse *pPatch = jsonParseCached(pCtx, &pValue, pCtx);
if( pPatch==0 ){
p->oom = 1;
break;
}
assert( pPatch->nJPRef>=1 );
pPatch->nJPRef++;
p->aNode[k].jnFlags |= JNODE_PATCH;
p->aNode[k].eU = 5;
p->aNode[k].u.pPatch = pPatch->aNode;
jsonParseAddCleanup(p, (void(*)(void*))jsonParseFree, pPatch);
} }
}else{
JsonParse *pPatch = jsonParseCached(pCtx, &pValue, pCtx);
if( pPatch==0 ){
p->oom = 1;
break;
}
jsonParseAddNodeArray(p, pPatch->aNode, pPatch->nNode);
/* The nodes copied out of pPatch and into p likely contain
** u.zJContent pointers into pPatch->zJson. So preserve the
** content of pPatch until p is destroyed. */
assert( pPatch->nJPRef>=1 );
pPatch->nJPRef++;
jsonParseAddCleanup(p, (void(*)(void*))jsonParseFree, pPatch);
} }
break; break;
} }
@ -2703,7 +2737,6 @@ static void jsonReplaceFunc(
pNode = jsonLookup(&x, zPath, 0, ctx); pNode = jsonLookup(&x, zPath, 0, ctx);
if( x.nErr ) goto replace_err; if( x.nErr ) goto replace_err;
if( pNode ){ if( pNode ){
pNode->jnFlags |= (u8)JNODE_REPLACE;
jsonReplaceNode(ctx, &x, (u32)(pNode - x.aNode), argv[i+1]); jsonReplaceNode(ctx, &x, (u32)(pNode - x.aNode), argv[i+1]);
} }
} }
@ -2755,7 +2788,6 @@ static void jsonSetFunc(
}else if( x.nErr ){ }else if( x.nErr ){
goto jsonSetDone; goto jsonSetDone;
}else if( pNode && (bApnd || bIsSet) ){ }else if( pNode && (bApnd || bIsSet) ){
pNode->jnFlags |= (u8)JNODE_REPLACE;
jsonReplaceNode(ctx, &x, (u32)(pNode - x.aNode), argv[i+1]); jsonReplaceNode(ctx, &x, (u32)(pNode - x.aNode), argv[i+1]);
} }
} }