Lines Matching refs:nCursor

20110   int nCursor;            /* Number of entries in apCsr */  member
20319 int nCursor; /* Number of slots in apCsr[] */ member
78488 int nCursor; /* Number of cursors required */
78502 nCursor = pParse->nTab;
78510 nMem += nCursor;
78511 if( nCursor==0 && nMem>0 ) nMem++; /* Space for aMem[0] even if not used */
78545 p->apCsr = allocSpace(&x, 0, nCursor*sizeof(VdbeCursor*));
78556 p->apCsr = allocSpace(&x, p->apCsr, nCursor*sizeof(VdbeCursor*));
78568 p->nCursor = 0;
78571 p->nCursor = nCursor;
78576 memset(p->apCsr, 0, nCursor*sizeof(VdbeCursor*));
78628 for(i=0; i<p->nCursor; i++){
78654 v->nCursor = pFrame->nCursor;
79440 if( p->apCsr ) for(i=0; i<p->nCursor; i++) assert( p->apCsr[i]==0 );
83744 assert( iCur>=0 && iCur<p->nCursor );
84169 assert( pOp->p2<=(p->nMem+1 - p->nCursor) );
84307 assert( pOp->p1<=(p->nMem+1 - p->nCursor) );
84314 assert( pOp->p2<=(p->nMem+1 - p->nCursor) );
84321 assert( pOp->p3<=(p->nMem+1 - p->nCursor) );
84328 assert( pOp->p2<=(p->nMem+1 - p->nCursor) );
84333 assert( pOp->p3<=(p->nMem+1 - p->nCursor) );
84434 assert( pOp->p1>0 && pOp->p1<=(p->nMem+1 - p->nCursor) );
84474 assert( pOp->p1>0 && pOp->p1<=(p->nMem+1 - p->nCursor) );
84740 assert( pOp->p3<=(p->nMem+1 - p->nCursor) );
84766 assert( pOp->p3<=(p->nMem+1 - p->nCursor) );
84792 assert( pOp->p1>0 && pOp->p1<=(p->nMem+1 - p->nCursor) );
84862 assert( pOut<=&aMem[(p->nMem+1 - p->nCursor)] );
84863 assert( pIn1<=&aMem[(p->nMem+1 - p->nCursor)] );
84965 assert( pOp->p1+pOp->p2<=(p->nMem+1 - p->nCursor)+1 );
85739 assert( p1>0 && p1+mx<=(p->nMem+1 - p->nCursor)+1 );
85740 assert( p2>0 && p2+mx<=(p->nMem+1 - p->nCursor)+1 );
85742 assert( p1>0 && p1+n<=(p->nMem+1 - p->nCursor)+1 );
85743 assert( p2>0 && p2+n<=(p->nMem+1 - p->nCursor)+1 );
85993 assert( pOp->p1>=0 && pOp->p1<p->nCursor );
86020 assert( pOp->p1>=0 && pOp->p1<p->nCursor );
86082 assert( pOp->p3>0 && pOp->p3<=(p->nMem+1 - p->nCursor) );
86085 assert( pOp->p1>=0 && pOp->p1<p->nCursor );
86341 assert( pIn1 <= &p->aMem[(p->nMem+1 - p->nCursor)] );
86403 assert( nField>0 && pOp->p2>0 && pOp->p2+nField<=(p->nMem+1 - p->nCursor)+1 );
86527 assert( pOp->p3>0 && pOp->p3<=(p->nMem+1 - p->nCursor) );
87129 assert( p2<=(p->nMem+1 - p->nCursor) );
87338 assert( pOp->p1>=0 && pOp->p1<p->nCursor );
87388 assert( pOp->p1>=0 && pOp->p1<p->nCursor );
87512 assert( pOp->p1>=0 && pOp->p1<p->nCursor );
87692 assert( pOp->p1>=0 && pOp->p1<p->nCursor );
87788 assert( pOp->p1>=0 && pOp->p1<p->nCursor );
87810 assert( pOp->p1>=0 && pOp->p1<p->nCursor );
87946 assert( pOp->p1>=0 && pOp->p1<p->nCursor );
87987 assert( pOp->p1>=0 && pOp->p1<p->nCursor );
88022 assert( pOp->p1>=0 && pOp->p1<p->nCursor );
88083 assert( pOp->p3<=(p->nMem+1 - p->nCursor) );
88178 assert( pOp->p1>=0 && pOp->p1<p->nCursor );
88291 assert( pOp->p1>=0 && pOp->p1<p->nCursor );
88445 assert( pOp->p1>=0 && pOp->p1<p->nCursor );
88486 assert( pOp->p1>=0 && pOp->p1<p->nCursor );
88540 assert( pOp->p1>=0 && pOp->p1<p->nCursor );
88583 assert( pOp->p1>=0 && pOp->p1<p->nCursor );
88626 assert( pOp->p1>=0 && pOp->p1<p->nCursor );
88666 assert( pOp->p1>=0 && pOp->p1<p->nCursor );
88730 assert( pOp->p1>=0 && pOp->p1<p->nCursor );
88826 assert( pOp->p1>=0 && pOp->p1<p->nCursor );
88904 assert( pOp->p1>=0 && pOp->p1<p->nCursor );
88948 assert( pOp->p2>0 && pOp->p2+pOp->p3<=(p->nMem+1 - p->nCursor)+1 );
88949 assert( pOp->p1>=0 && pOp->p1<p->nCursor );
89007 assert( pOp->p1>=0 && pOp->p1<p->nCursor );
89032 assert( pOp->p3>=0 && pOp->p3<p->nCursor );
89107 assert( pOp->p1>=0 && pOp->p1<p->nCursor );
89262 assert( pOp->p1>=0 && pOp->p1<p->nCursor );
89484 assert( pOp->p3>0 && pOp->p3<=(p->nMem+1 - p->nCursor) );
89697 pFrame->nCursor = p->nCursor;
89734 p->nCursor = (u16)pFrame->nChildCsr;
90000 assert( pOp->p3>0 && pOp->p3<=(p->nMem+1 - p->nCursor) );
90001 assert( n==0 || (pOp->p2>0 && pOp->p2+n<=(p->nMem+1 - p->nCursor)+1) );
90121 assert( pOp->p1>0 && pOp->p1<=(p->nMem+1 - p->nCursor) );
90593 assert( pOp->p3>0 && pOp->p3<=(p->nMem+1 - p->nCursor) );
90878 assert( pOp->p3>0 && pOp->p3<=(p->nMem+1 - p->nCursor) );
90879 assert( n==0 || (pOp->p2>0 && pOp->p2+n<=(p->nMem+1 - p->nCursor)+1) );
91056 assert( pOp->p1>=0 && pOp->p1<p->nCursor );
181292 u32 nCursor; /* Number of open cursors */
181784 if( pRtree->pNodeBlob && pRtree->inWrTrans==0 && pRtree->nCursor==0 ){
182131 assert( pRtree->nCursor==0 );
182197 pRtree->nCursor++;
182230 assert( pRtree->nCursor>0 );
182236 pRtree->nCursor--;