Home
last modified time | relevance | path

Searched refs:nNode (Results 1 – 5 of 5) sorted by relevance

/sqlite-3.40.0/src/
H A Djson.c375 pParse->nNode = 0; in jsonParseReset()
710 assert( pParse->nNode>=pParse->nAlloc ); in jsonParseAddNodeExpand()
720 assert( pParse->nNode<pParse->nAlloc ); in jsonParseAddNodeExpand()
739 p = &pParse->aNode[pParse->nNode]; in jsonParseAddNode()
745 return pParse->nNode++; in jsonParseAddNode()
1380 for(i=0; i<x.nNode; i++){ in jsonParseFunc()
1487 assert( p->nNode ); in jsonArrayLengthFunc()
1629 assert( iTarget<pParse->nNode ); in jsonMergePatch()
1786 assert( x.nNode ); in jsonRemoveFunc()
1823 assert( x.nNode ); in jsonReplaceFunc()
[all …]
/sqlite-3.40.0/ext/fts3/
H A Dfts3_write.c1273 if( pReader->nPopulate==pReader->nNode ){ in fts3SegReaderIncrRead()
1353 pReader->nNode = pReader->nDoclist = nCopy; in fts3SegReaderNext()
1652 pReader->nNode = nRoot; in sqlite3Fts3SegReaderNew()
3733 int nNode; member
3783 if( p->iOff>=p->nNode ){ in nodeReaderNext()
3802 if( (p->nNode-p->iOff)<p->nDoclist ){ in nodeReaderNext()
3811 assert_fts3_nc( p->iOff<=p->nNode ); in nodeReaderNext()
3832 p->nNode = nNode; in nodeReaderInit()
4620 if( nNode<1 ) return FTS_CORRUPT_VTAB; in fts3TruncateNode()
4624 blobGrowBuffer(pNew, nNode, &rc); in fts3TruncateNode()
[all …]
H A Dfts3.c1891 int nNode, /* Size of buffer at zNode */ in fts3ScanInteriorNode() argument
1897 const char *zEnd = &zCsr[nNode];/* End of interior node buffer */ in fts3ScanInteriorNode()
2018 int nNode, /* Size of buffer at zNode */ in fts3SelectLeaf() argument
2028 rc = fts3ScanInteriorNode(zTerm, nTerm, zNode, nNode, piLeaf, piLeaf2); in fts3SelectLeaf()
/sqlite-3.40.0/ext/rtree/
H A Drtree_util.tcl93 set nNode [$db one "SELECT count(*) FROM ${zTab}_node"]
98 if {$nNode != ($nParent+1)} {
H A Drtree.c4048 int nNode = sqlite3_column_bytes(pCheck->pGetNode, 0); in rtreeCheckGetNode() local
4050 pRet = sqlite3_malloc64(nNode); in rtreeCheckGetNode()
4054 memcpy(pRet, pNode, nNode); in rtreeCheckGetNode()
4055 *pnNode = nNode; in rtreeCheckGetNode()
4184 int nNode = 0; in rtreeCheckNode() local
4189 aNode = rtreeCheckGetNode(pCheck, iNode, &nNode); in rtreeCheckNode()
4191 if( nNode<4 ){ in rtreeCheckNode()
4193 "Node %lld is too small (%d bytes)", iNode, nNode in rtreeCheckNode()
4207 if( (4 + nCell*(8 + pCheck->nDim*2*4))>nNode ){ in rtreeCheckNode()
4210 iNode, nCell, nNode in rtreeCheckNode()