Home
last modified time | relevance | path

Searched refs:pNode (Results 1 – 8 of 8) sorted by relevance

/sqlite-3.40.0/src/
H A Djson.c365 return pNode->eType>=JSON_ARRAY ? pNode->n+1 : 1; in jsonNodeSize()
407 pNode = pNode->u.pPatch; in jsonRenderNode()
434 jsonAppendRaw(pOut, pNode->u.zJContent, pNode->n); in jsonRenderNode()
450 pNode = &pNode[pNode->u.iAppend]; in jsonRenderNode()
471 pNode = &pNode[pNode->u.iAppend]; in jsonRenderNode()
1792 if( pNode ) pNode->jnFlags |= JNODE_REMOVE; in jsonRemoveFunc()
1829 assert( pNode->eU==0 || pNode->eU==1 || pNode->eU==4 ); in jsonReplaceFunc()
1830 testcase( pNode->eU!=0 && pNode->eU!=1 ); in jsonReplaceFunc()
1888 testcase( pNode->eU!=0 && pNode->eU!=1 ); in jsonSetFunc()
1889 assert( pNode->eU!=3 && pNode->eU!=5 ); in jsonSetFunc()
[all …]
/sqlite-3.40.0/ext/fts5/
H A Dfts5_expr.c979 if( pNode->eType==FTS5_STRING || pNode->eType==FTS5_TERM ){ in fts5ExprNodeZeroPoslist()
1087 assert( pNode->bEof==0 || pNode->bNomatch==0 ); in fts5ExprNodeTest_STRING()
1447 pNode->iRowid = pNode->apChild[0]->iRowid; in fts5ExprNodeFirst()
1455 if( pNode->nChild==nEof ) fts5ExprSetEof(pNode); in fts5ExprNodeFirst()
1460 pNode->bEof = pNode->apChild[0]->bEof; in fts5ExprNodeFirst()
2115 || pNode->eType==FTS5_AND || pNode->eType==FTS5_OR in fts5ParseSetColset()
2134 assert( pNode->eType!=FTS5_EOF || pNode->nChild==0 ); in fts5ParseSetColset()
2845 Fts5ExprNode *pNode = pPhrase->pNode; in sqlite3Fts5ExprPoslist() local
2879 Fts5ExprNode *pNode = pExpr->apExprPhrase[i]->pNode; in sqlite3Fts5ExprClearPoslists() local
2960 Fts5ExprNode *pNode = pExpr->apExprPhrase[i]->pNode; in sqlite3Fts5ExprPopulatePoslists() local
[all …]
/sqlite-3.40.0/ext/rtree/
H A Drtree.c369 #define NCELL(pNode) readInt16(&(pNode)->zData[2]) argument
670 if( pNode ){ in nodeNew()
672 pNode->zData = (u8 *)&pNode[1]; in nodeNew()
679 return pNode; in nodeNew()
713 pNode->nRef++; in nodeAcquire()
746 if( !pNode ){ in nodeAcquire()
750 pNode->zData = (u8 *)&pNode[1]; in nodeAcquire()
796 if( pNode ){ in nodeAcquire()
832 writeInt16(&pNode->zData[2], NCELL(pNode)-1); in nodeDeleteCell()
894 if( pNode ){ in nodeRelease()
[all …]
H A Dgeopoly.c1530 RtreeNode *pNode = rtreeNodeOfFirstSearchPoint(pCsr, &rc); in geopolyColumn() local
1543 nodeGetRowid(pRtree, pNode, p->iCell)); in geopolyColumn()
/sqlite-3.40.0/ext/lsm1/
H A Dlsm_tree.c326 TreeNode *pNode, in assertIsWorkingChild() argument
333 assert( p==pNode ); in assertIsWorkingChild()
396 if( pNode ){ in assert_node_looks_ok()
496 TreeNode *pNode; in dump_node_contents() local
908 if( pNode->aiKeyPtr[0] && pNode->aiKeyPtr[2] ){ in treeInsert()
1605 if( pNode->aiKeyPtr[0] || pNode->aiKeyPtr[2] ){ in treeDeleteEntry()
2073 TreeNode *pNode; in lsmTreeCursorNext() local
2139 TreeNode *pNode; in lsmTreeCursorPrev() local
2215 TreeNode *pNode; in lsmTreeCursorEnd() local
2331 TreeNode *pNode; in lsmTreeRollback() local
[all …]
/sqlite-3.40.0/ext/fts3/
H A Dfts3_write.c3883 if( pNode->key.n==0 || (pNode->block.n + nSpace)<=p->nNodeSize ){ in fts3IncrmergePush()
3916 rc = fts3WriteSegment(p, pNode->iBlock, pNode->block.a, pNode->block.n); in fts3IncrmergePush()
3987 pNode->n += sqlite3Fts3PutVarint(&pNode->a[pNode->n], nPrefix); in fts3AppendToNode()
3989 pNode->n += sqlite3Fts3PutVarint(&pNode->a[pNode->n], nSuffix); in fts3AppendToNode()
3990 memcpy(&pNode->a[pNode->n], &zTerm[nPrefix], nSuffix); in fts3AppendToNode()
3994 pNode->n += sqlite3Fts3PutVarint(&pNode->a[pNode->n], nDoclist); in fts3AppendToNode()
3995 memcpy(&pNode->a[pNode->n], aDoclist, nDoclist); in fts3AppendToNode()
3999 assert( pNode->n<=pNode->nAlloc ); in fts3AppendToNode()
4154 rc = fts3WriteSegment(p, pNode->iBlock, pNode->block.a, pNode->block.n); in fts3IncrmergeRelease()
4592 pNode->n = 1 + sqlite3Fts3PutVarint(&pNode->a[1], iChild); in fts3StartNode()
[all …]
/sqlite-3.40.0/ext/misc/
H A Damatch.c1030 amatch_avl *pNode; in amatchAddWord() local
1052 pNode = amatchAvlSearch(pCur->pWord, pCur->zBuf); in amatchAddWord()
1053 if( pNode ){ in amatchAddWord()
1054 pWord = pNode->pWord; in amatchAddWord()
1105 amatch_avl *pNode; in amatchNext() local
1145 pNode = amatchAvlFirst(pCur->pCost); in amatchNext()
1146 if( pNode==0 ){ in amatchNext()
1150 pWord = pNode->pWord; in amatchNext()
H A Dclosure.c389 static void queuePush(closure_queue *pQueue, closure_avl *pNode){ in queuePush() argument
390 pNode->pList = 0; in queuePush()
392 pQueue->pLast->pList = pNode; in queuePush()
394 pQueue->pFirst = pNode; in queuePush()
396 pQueue->pLast = pNode; in queuePush()