Lines Matching refs:nCursor
23789 int nCursor; /* Number of entries in apCsr */ member
24045 int nCursor; /* Number of slots in apCsr[] */ member
88545 int nCursor; /* Number of cursors required */ local
88562 nCursor = pParse->nTab;
88570 nMem += nCursor;
88571 if( nCursor==0 && nMem>0 ) nMem++; /* Space for aMem[0] even if not used */
88607 p->apCsr = allocSpace(&x, 0, nCursor*sizeof(VdbeCursor*));
88615 p->apCsr = allocSpace(&x, p->apCsr, nCursor*sizeof(VdbeCursor*));
88624 p->nCursor = 0;
88627 p->nCursor = nCursor;
88632 memset(p->apCsr, 0, nCursor*sizeof(VdbeCursor*));
88689 for(i=0; i<p->nCursor; i++){
88711 v->nCursor = pFrame->nCursor;
89503 if( p->apCsr ) for(i=0; i<p->nCursor; i++) assert( p->apCsr[i]==0 );
94625 assert( iCur>=0 && iCur<p->nCursor );
95013 assert( pOp->p2<=(p->nMem+1 - p->nCursor) );
95287 assert( pOp->p1<=(p->nMem+1 - p->nCursor) );
95294 assert( pOp->p2<=(p->nMem+1 - p->nCursor) );
95301 assert( pOp->p3<=(p->nMem+1 - p->nCursor) );
95308 assert( pOp->p2<=(p->nMem+1 - p->nCursor) );
95313 assert( pOp->p3<=(p->nMem+1 - p->nCursor) );
95428 assert( pOp->p1>0 && pOp->p1<=(p->nMem+1 - p->nCursor) );
95483 assert( pOp->p1>0 && pOp->p1<=(p->nMem+1 - p->nCursor) );
95643 assert( pOp->p3<=(p->nMem + 1 - p->nCursor) );
95777 assert( pOp->p3<=(p->nMem+1 - p->nCursor) );
95826 assert( pOp->p3<=(p->nMem+1 - p->nCursor) );
95852 assert( pOp->p1>0 && pOp->p1<=(p->nMem+1 - p->nCursor) );
95924 assert( pOut<=&aMem[(p->nMem+1 - p->nCursor)] );
95925 assert( pIn1<=&aMem[(p->nMem+1 - p->nCursor)] );
96058 assert( pOp->p1+pOp->p2<=(p->nMem+1 - p->nCursor)+1 );
96825 assert( p1>0 && p1+mx<=(p->nMem+1 - p->nCursor)+1 );
96826 assert( p2>0 && p2+mx<=(p->nMem+1 - p->nCursor)+1 );
96828 assert( p1>0 && p1+n<=(p->nMem+1 - p->nCursor)+1 );
96829 assert( p2>0 && p2+n<=(p->nMem+1 - p->nCursor)+1 );
97109 assert( pOp->p1>=(-1) && pOp->p1<p->nCursor );
97110 assert( pOp->p1>=0 || (pOp->p3>=0 && pOp->p3<=(p->nMem+1 - p->nCursor)) );
97210 assert( pOp->p1>=0 && pOp->p1<p->nCursor );
97237 assert( pOp->p1>=0 && pOp->p1<p->nCursor );
97295 assert( pOp->p1>=0 && pOp->p1<p->nCursor );
97296 assert( pOp->p3>0 && pOp->p3<=(p->nMem+1 - p->nCursor) );
97696 assert( pIn1 <= &p->aMem[(p->nMem+1 - p->nCursor)] );
97788 assert( nField>0 && pOp->p2>0 && pOp->p2+nField<=(p->nMem+1 - p->nCursor)+1 );
98065 assert( pOp->p3>0 && pOp->p3<=(p->nMem+1 - p->nCursor) );
98700 assert( p2<=(u32)(p->nMem+1 - p->nCursor) );
98940 assert( pOp->p1>=0 && pOp->p1<p->nCursor );
98991 assert( pOp->p1>=0 && pOp->p1<p->nCursor );
99119 assert( pOp->p1>=0 && pOp->p1<p->nCursor );
99501 assert( pOp->p1>=0 && pOp->p1<p->nCursor );
99532 assert( pOp->p1>=0 && pOp->p1<p->nCursor );
99633 assert( pOp->p1>=0 && pOp->p1<p->nCursor );
99658 assert( pOp->p1>=0 && pOp->p1<p->nCursor );
99806 assert( pOp->p1>=0 && pOp->p1<p->nCursor );
99848 assert( pOp->p1>=0 && pOp->p1<p->nCursor );
99885 assert( pOp->p1>=0 && pOp->p1<p->nCursor );
99946 assert( pOp->p3<=(p->nMem+1 - p->nCursor) );
100041 assert( pOp->p1>=0 && pOp->p1<p->nCursor );
100193 assert( pOp->p1>=0 && pOp->p1<p->nCursor );
100353 assert( pOp->p1>=0 && pOp->p1<p->nCursor );
100394 assert( pOp->p1>=0 && pOp->p1<p->nCursor );
100444 assert( pOp->p1>=0 && pOp->p1<p->nCursor );
100490 assert( pOp->p1>=0 && pOp->p1<p->nCursor );
100542 assert( pOp->p1>=0 && pOp->p1<p->nCursor );
100585 assert( pOp->p1>=0 && pOp->p1<p->nCursor );
100660 assert( pOp->p1>=0 && pOp->p1<p->nCursor );
100753 assert( pOp->p1>=0 && pOp->p1<p->nCursor );
100768 assert( pOp->p1>=0 && pOp->p1<p->nCursor );
100831 assert( pOp->p1>=0 && pOp->p1<p->nCursor );
100867 assert( pOp->p1>=0 && pOp->p1<p->nCursor );
100904 assert( pOp->p2>0 && pOp->p2+pOp->p3<=(p->nMem+1 - p->nCursor)+1 );
100905 assert( pOp->p1>=0 && pOp->p1<p->nCursor );
100965 assert( pOp->p1>=0 && pOp->p1<p->nCursor );
100990 assert( pOp->p3>=0 && pOp->p3<p->nCursor );
101025 assert( pOp->p1>=0 && pOp->p1<p->nCursor );
101086 assert( pOp->p1>=0 && pOp->p1<p->nCursor );
101260 assert( pOp->p1>=0 && pOp->p1<p->nCursor );
101528 assert( pOp->p1>0 && (pOp->p1+1)<=(p->nMem+1 - p->nCursor) );
101744 pFrame->nCursor = p->nCursor;
101778 p->nCursor = (u16)pFrame->nChildCsr;
102044 assert( pOp->p3>0 && pOp->p3<=(p->nMem+1 - p->nCursor) );
102045 assert( n==0 || (pOp->p2>0 && pOp->p2+n<=(p->nMem+1 - p->nCursor)+1) );
102177 assert( pOp->p1>0 && pOp->p1<=(p->nMem+1 - p->nCursor) );
102423 assert( pOp->p1>=0 && pOp->p1<p->nCursor );
102438 assert( pOp->p1>=0 && pOp->p1<p->nCursor );
102754 assert( pOp->p3>0 && pOp->p3<=(p->nMem+1 - p->nCursor) );
103149 assert( pOp->p1>0 && pOp->p1<=(p->nMem+1 - p->nCursor) );
103185 assert( pOp->p1>0 && pOp->p1<=(p->nMem+1 - p->nCursor) );
103319 assert( pOp->p1>=0 && pOp->p1<p->nCursor );
103383 assert( pOp->p1+pOp->p2<=(p->nMem+1 - p->nCursor)+1 );
213637 u32 nCursor; /* Number of open cursors */
214493 assert( pRtree->nCursor==0 );
214559 pRtree->nCursor++;
214601 assert( pRtree->nCursor>0 );
214605 pRtree->nCursor--;
214606 if( pRtree->nCursor==0 && pRtree->inWrTrans==0 ){