Lines Matching refs:nCursor
20828 int nCursor; /* Number of entries in apCsr */ member
21038 int nCursor; /* Number of slots in apCsr[] */ member
79884 int nCursor; /* Number of cursors required */
79898 nCursor = pParse->nTab;
79906 nMem += nCursor;
79907 if( nCursor==0 && nMem>0 ) nMem++; /* Space for aMem[0] even if not used */
79960 p->apCsr = allocSpace(&x, 0, nCursor*sizeof(VdbeCursor*));
79971 p->apCsr = allocSpace(&x, p->apCsr, nCursor*sizeof(VdbeCursor*));
79982 p->nCursor = 0;
79985 p->nCursor = nCursor;
79990 memset(p->apCsr, 0, nCursor*sizeof(VdbeCursor*));
80042 for(i=0; i<p->nCursor; i++){
80068 v->nCursor = pFrame->nCursor;
80855 if( p->apCsr ) for(i=0; i<p->nCursor; i++) assert( p->apCsr[i]==0 );
85302 assert( iCur>=0 && iCur<p->nCursor );
85760 assert( pOp->p2<=(p->nMem+1 - p->nCursor) );
85901 assert( pOp->p1<=(p->nMem+1 - p->nCursor) );
85908 assert( pOp->p2<=(p->nMem+1 - p->nCursor) );
85915 assert( pOp->p3<=(p->nMem+1 - p->nCursor) );
85922 assert( pOp->p2<=(p->nMem+1 - p->nCursor) );
85927 assert( pOp->p3<=(p->nMem+1 - p->nCursor) );
86042 assert( pOp->p1>0 && pOp->p1<=(p->nMem+1 - p->nCursor) );
86082 assert( pOp->p1>0 && pOp->p1<=(p->nMem+1 - p->nCursor) );
86348 assert( pOp->p3<=(p->nMem+1 - p->nCursor) );
86374 assert( pOp->p3<=(p->nMem+1 - p->nCursor) );
86400 assert( pOp->p1>0 && pOp->p1<=(p->nMem+1 - p->nCursor) );
86470 assert( pOut<=&aMem[(p->nMem+1 - p->nCursor)] );
86471 assert( pIn1<=&aMem[(p->nMem+1 - p->nCursor)] );
86578 assert( pOp->p1+pOp->p2<=(p->nMem+1 - p->nCursor)+1 );
87395 assert( p1>0 && p1+mx<=(p->nMem+1 - p->nCursor)+1 );
87396 assert( p2>0 && p2+mx<=(p->nMem+1 - p->nCursor)+1 );
87398 assert( p1>0 && p1+n<=(p->nMem+1 - p->nCursor)+1 );
87399 assert( p2>0 && p2+n<=(p->nMem+1 - p->nCursor)+1 );
87654 assert( pOp->p1>=0 && pOp->p1<p->nCursor );
87681 assert( pOp->p1>=0 && pOp->p1<p->nCursor );
87729 assert( pOp->p1>=0 && pOp->p1<p->nCursor );
87740 assert( pOp->p3>0 && pOp->p3<=(p->nMem+1 - p->nCursor) );
87999 assert( pIn1 <= &p->aMem[(p->nMem+1 - p->nCursor)] );
88081 assert( nField>0 && pOp->p2>0 && pOp->p2+nField<=(p->nMem+1 - p->nCursor)+1 );
88305 assert( pOp->p3>0 && pOp->p3<=(p->nMem+1 - p->nCursor) );
88915 assert( p2<=(p->nMem+1 - p->nCursor) );
89126 assert( pOp->p1>=0 && pOp->p1<p->nCursor );
89176 assert( pOp->p1>=0 && pOp->p1<p->nCursor );
89304 assert( pOp->p1>=0 && pOp->p1<p->nCursor );
89495 assert( pOp->p1>=0 && pOp->p1<p->nCursor );
89509 assert( pOp->p1>=0 && pOp->p1<p->nCursor );
89605 assert( pOp->p1>=0 && pOp->p1<p->nCursor );
89627 assert( pOp->p1>=0 && pOp->p1<p->nCursor );
89767 assert( pOp->p1>=0 && pOp->p1<p->nCursor );
89809 assert( pOp->p1>=0 && pOp->p1<p->nCursor );
89844 assert( pOp->p1>=0 && pOp->p1<p->nCursor );
89905 assert( pOp->p3<=(p->nMem+1 - p->nCursor) );
90000 assert( pOp->p1>=0 && pOp->p1<p->nCursor );
90114 assert( pOp->p1>=0 && pOp->p1<p->nCursor );
90272 assert( pOp->p1>=0 && pOp->p1<p->nCursor );
90313 assert( pOp->p1>=0 && pOp->p1<p->nCursor );
90367 assert( pOp->p1>=0 && pOp->p1<p->nCursor );
90410 assert( pOp->p1>=0 && pOp->p1<p->nCursor );
90453 assert( pOp->p1>=0 && pOp->p1<p->nCursor );
90493 assert( pOp->p1>=0 && pOp->p1<p->nCursor );
90557 assert( pOp->p1>=0 && pOp->p1<p->nCursor );
90653 assert( pOp->p1>=0 && pOp->p1<p->nCursor );
90724 assert( pOp->p1>=0 && pOp->p1<p->nCursor );
90760 assert( pOp->p1>=0 && pOp->p1<p->nCursor );
90796 assert( pOp->p2>0 && pOp->p2+pOp->p3<=(p->nMem+1 - p->nCursor)+1 );
90797 assert( pOp->p1>=0 && pOp->p1<p->nCursor );
90857 assert( pOp->p1>=0 && pOp->p1<p->nCursor );
90882 assert( pOp->p3>=0 && pOp->p3<p->nCursor );
90914 assert( pOp->p1>=0 && pOp->p1<p->nCursor );
90975 assert( pOp->p1>=0 && pOp->p1<p->nCursor );
91130 assert( pOp->p1>=0 && pOp->p1<p->nCursor );
91352 assert( pOp->p3>0 && pOp->p3<=(p->nMem+1 - p->nCursor) );
91565 pFrame->nCursor = p->nCursor;
91602 p->nCursor = (u16)pFrame->nChildCsr;
91868 assert( pOp->p3>0 && pOp->p3<=(p->nMem+1 - p->nCursor) );
91869 assert( n==0 || (pOp->p2>0 && pOp->p2+n<=(p->nMem+1 - p->nCursor)+1) );
91989 assert( pOp->p1>0 && pOp->p1<=(p->nMem+1 - p->nCursor) );
92236 assert( pOp->p1>=0 && pOp->p1<p->nCursor );
92251 assert( pOp->p1>=0 && pOp->p1<p->nCursor );
92491 assert( pOp->p3>0 && pOp->p3<=(p->nMem+1 - p->nCursor) );
92936 assert( pOp->p1>=0 && pOp->p1<p->nCursor );
93000 assert( pOp->p1+pOp->p2<=(p->nMem+1 - p->nCursor)+1 );
187333 u32 nCursor; /* Number of open cursors */
187831 if( pRtree->pNodeBlob && pRtree->inWrTrans==0 && pRtree->nCursor==0 ){
188180 assert( pRtree->nCursor==0 );
188246 pRtree->nCursor++;
188288 assert( pRtree->nCursor>0 );
188292 pRtree->nCursor--;