Lines Matching refs:nNode

150630   int nNode,                      /* Size of buffer at zNode */
150636   const char *zEnd = &zCsr[nNode];/* End of interior node buffer */
150753   int nNode,                      /* Size of buffer at zNode */
150763   rc = fts3ScanInteriorNode(zTerm, nTerm, zNode, nNode, piLeaf, piLeaf2);
159065   int nNode;                      /* Size of buffer at aNode (or 0) */
160174   nRead = MIN(pReader->nNode - pReader->nPopulate, FTS3_NODE_CHUNKSIZE);
160185     if( pReader->nPopulate==pReader->nNode ){
160197        || (pFrom>=pReader->aNode && pFrom<&pReader->aNode[pReader->nNode])
160240   if( !pNext || pNext>=&pReader->aNode[pReader->nNode] ){
160255         pReader->nNode = pReader->nDoclist = nCopy;
160273         p, ++pReader->iCurrentBlock, &pReader->aNode, &pReader->nNode, 
160278     if( bIncr && pReader->nPopulate<pReader->nNode ){
160295    || (&pReader->aNode[pReader->nNode] - pNext)<nSuffix
160328   if( pReader->nDoclist > pReader->nNode-(pReader->aDoclist-pReader->aNode)
160548     pReader->nNode = nRoot;
162592   int nNode;
162642   if( p->iOff>=p->nNode ){
162651     if( nPrefix>p->iOff || nSuffix>p->nNode-p->iOff ){
162661         if( (p->nNode-p->iOff)<p->nDoclist ){
162670   assert( p->iOff<=p->nNode );
162688 static int nodeReaderInit(NodeReader *p, const char *aNode, int nNode){
162691   p->nNode = nNode;
163440   int nNode,                      /* Size of aNode in bytes */
163452   blobGrowBuffer(pNew, nNode, &rc);
163457   for(rc = nodeReaderInit(&reader, aNode, nNode); 
170813       int nNode = sqlite3_column_bytes(pCheck->pGetNode, 0);
170815       pRet = sqlite3_malloc(nNode);
170819         memcpy(pRet, pNode, nNode);
170820         *pnNode = nNode;
170949   int nNode = 0;
170954   aNode = rtreeCheckGetNode(pCheck, iNode, &nNode);
170956     if( nNode<4 ){
170958           "Node %lld is too small (%d bytes)", iNode, nNode
170972       if( (4 + nCell*(8 + pCheck->nDim*2*4))>nNode ){
170975             iNode, nCell, nNode
183782   u32 nNode;         /* Number of slots of aNode[] used */
184027   pParse->nNode = 0;
184306   assert( pParse->nNode>=pParse->nAlloc );
184316   assert( pParse->nNode<pParse->nAlloc );
184332   if( pParse->nNode>=pParse->nAlloc ){
184335   p = &pParse->aNode[pParse->nNode];
184340   return pParse->nNode++;
184378         if( x==(-2) && pParse->nNode==(u32)iThis+1 ) return j+1;
184382       pNode = &pParse->aNode[pParse->nNode-1];
184399     pParse->aNode[iThis].n = pParse->nNode - (u32)iThis - 1;
184411         if( x==(-3) && pParse->nNode==(u32)iThis+1 ) return j+1;
184421     pParse->aNode[iThis].n = pParse->nNode - (u32)iThis - 1;
184448     if( !pParse->oom ) pParse->aNode[pParse->nNode-1].jnFlags = jnFlags;
184583   aUp = pParse->aUp = sqlite3_malloc( sizeof(u32)*pParse->nNode );
184783     return pParse->oom ? 0 : &pParse->aNode[pParse->nNode-1];
184793   return jsonLookupStep(pParse, pParse->nNode-1, zPath, pApnd, pzErr);
184904   for(i=0; i<x.nNode; i++){
185007   assert( p->nNode );
185086   assert( iTarget>=0 && iTarget<pParse->nNode );
185231   assert( x.nNode );
185268   assert( x.nNode );
185317   assert( x.nNode );
185358   assert( x.nNode );