Lines Matching defs:nCursor

12952   u16 nCursor;            /* Number of entries in apCsr */
13131 u16 nCursor; /* Number of slots in apCsr[] */
61008 int nCursor; /* Number of cursors required */
61024 nCursor = pParse->nTab;
61030 ** cells (nMem+1-nCursor)..nMem, inclusive, will never be used by
61038 nMem += nCursor;
61072 p->apCsr = allocSpace(p->apCsr, nCursor*sizeof(VdbeCursor*),
61082 p->nCursor = (u16)nCursor;
61149 v->nCursor = pFrame->nCursor;
61174 for(i=0; i<p->nCursor; i++){
61206 if( p->apCsr ) for(i=0; i<p->nCursor; i++) assert( p->apCsr[i]==0 );
64585 assert( iCur<p->nCursor );
67062 assert( u.an.p1<p->nCursor );
68229 assert( pOp->p1>=0 && pOp->p1<p->nCursor );
68300 assert( pOp->p1>=0 && pOp->p1<p->nCursor );
68455 assert( pOp->p1>=0 && pOp->p1<p->nCursor );
68511 assert( pOp->p1>=0 && pOp->p1<p->nCursor );
68599 assert( pOp->p1>=0 && pOp->p1<p->nCursor );
68670 assert( pOp->p1>=0 && pOp->p1<p->nCursor );
68709 assert( pOp->p1>=0 && pOp->p1<p->nCursor );
68742 assert( pOp->p1>=0 && pOp->p1<p->nCursor );
68926 assert( pOp->p1>=0 && pOp->p1<p->nCursor );
69008 assert( pOp->p1>=0 && pOp->p1<p->nCursor );
69136 assert( pOp->p1>=0 && pOp->p1<p->nCursor );
69205 assert( pOp->p1>=0 && pOp->p1<p->nCursor );
69248 assert( pOp->p1>=0 && pOp->p1<p->nCursor );
69275 assert( pOp->p1>=0 && pOp->p1<p->nCursor );
69333 assert( pOp->p1>=0 && pOp->p1<p->nCursor );
69401 assert( pOp->p1>=0 && pOp->p1<p->nCursor );
69456 assert( pOp->p1>=0 && pOp->p1<p->nCursor );
69499 assert( pOp->p1>=0 && pOp->p1<p->nCursor );
69536 assert( pOp->p1>=0 && pOp->p1<p->nCursor );
69592 assert( pOp->p1>=0 && pOp->p1<p->nCursor );
70130 u.cc.pFrame->nCursor = p->nCursor;
70157 p->nCursor = (u16)u.cc.pFrame->nChildCsr;
70161 p->aOnceFlag = (u8 *)&p->apCsr[p->nCursor];