Lines Matching refs:nOp
12647 int nOp; /* Elements in aOp[] */
12962 SQLITE_PRIVATE VdbeOp *sqlite3VdbeAddOpList(Vdbe*, int nOp, VdbeOpList const *aOp, int iLineno);
18082 int nOp; /* Size of aOp array */
18287 int nOp; /* Number of instructions in the program */
40649 OSTRACE(("SYNC-NOP pid=%lu, pFile=%p, file=%p, rc=SQLITE_OK\n",
71425 ** Resize the Vdbe.aOp array so that it is at least nOp elements larger
71426 ** than its current size. nOp is guaranteed to be less than or equal
71434 static int growOpArray(Vdbe *v, int nOp){
71446 int nNew = (p->nOpAlloc>=512 ? p->nOpAlloc*2 : p->nOpAlloc+nOp);
71449 UNUSED_PARAMETER(nOp);
71458 assert( nOp<=(1024/sizeof(Op)) );
71459 assert( nNew>=(p->nOpAlloc+nOp) );
71497 assert( p->pParse->nOpAlloc<=p->nOp );
71499 assert( p->pParse->nOpAlloc>p->nOp );
71506 i = p->nOp;
71512 p->nOp++;
71719 p->aLabel[j] = v->nOp;
71767 int nOp;
71773 nOp = v->nOp;
71776 nOp = p->apSub[p->iSub-1]->nOp;
71778 assert( p->iAddr<nOp );
71782 if( p->iAddr==nOp ){
71895 pOp = &p->aOp[p->nOp-1];
71974 return p->nOp;
71987 assert( p->nOp + N <= p->pParse->nOpAlloc );
72001 for(i=0; i<p->nOp; i++){
72026 *pnOp = p->nOp;
72040 int nOp, /* Number of opcodes to add */
72046 assert( nOp>0 );
72048 if( p->nOp + nOp > p->pParse->nOpAlloc && growOpArray(p, nOp) ){
72051 pFirst = pOut = &p->aOp[p->nOp];
72052 for(i=0; i<nOp; i++, aOp++, pOut++){
72058 pOut->p2 += p->nOp;
72074 sqlite3VdbePrintOp(0, i+p->nOp, &p->aOp[i+p->nOp]);
72078 p->nOp += nOp;
72127 assert( p->nOp>0 || p->db->mallocFailed );
72128 if( p->nOp>0 ) p->aOp[p->nOp-1].p5 = p5;
72136 sqlite3VdbeChangeP2(p, addr, p->nOp);
72209 ** nOp entries.
72211 static void vdbeFreeOpArray(sqlite3 *db, Op *aOp, int nOp){
72214 for(pOp=aOp; pOp<&aOp[nOp]; pOp++){
72240 assert( addr>=0 && addr<p->nOp );
72254 if( p->nOp>0 && p->aOp[p->nOp-1].opcode==op ){
72255 return sqlite3VdbeChangeToNoop(p, p->nOp-1);
72308 assert( p->nOp>0 );
72309 assert( addr<p->nOp );
72311 addr = p->nOp - 1;
72348 assert( p->nOp>0 );
72349 pOp = &p->aOp[p->nOp-1];
72377 assert( p->nOp>0 || p->aOp==0 );
72378 assert( p->aOp==0 || p->aOp[p->nOp-1].zComment==0 || p->db->mallocFailed );
72379 if( p->nOp ){
72381 sqlite3DbFree(p->db, p->aOp[p->nOp-1].zComment);
72382 p->aOp[p->nOp-1].zComment = sqlite3VMPrintf(p->db, zFormat, ap);
72432 addr = p->nOp - 1;
72434 assert( (addr>=0 && addr<p->nOp) || p->db->mallocFailed );
72972 nRow = p->nOp;
72987 nRow += apSub[i]->nOp;
73004 if( i<p->nOp ){
73012 i -= p->nOp;
73013 for(j=0; i>=apSub[j]->nOp; j++){
73014 i -= apSub[j]->nOp;
73119 }else if( p->nOp>=1 ){
73135 int nOp = p->nOp;
73138 if( nOp<1 ) return;
73216 assert( p->nOp>0 );
73235 for(i=0; i<p->nOp; i++){
73273 assert( p->nOp>0 );
73296 n = ROUND8(sizeof(Op)*p->nOp); /* Bytes of opcode memory used */
73327 p->anExec = allocSpace(&x, p->anExec, p->nOp*sizeof(i64));
73349 memset(p->anExec, 0, p->nOp*sizeof(i64));
73421 v->nOp = pFrame->nOp;
74237 for(i=0; i<p->nOp; i++){
74251 for(i=0; i<p->nOp; i++){
74332 vdbeFreeOpArray(db, pSub->aOp, pSub->nOp);
74340 vdbeFreeOpArray(db, p->aOp, p->nOp);
77896 memset(p->anExec, 0, p->nOp * sizeof(i64));
78806 for(i=0; i<p->nOp; i++){
78811 for(i=0; i<p->nOp; i++){
78828 assert( pOp>=aOp && pOp<&aOp[p->nOp]);
79031 assert( pOp->p2>=0 && pOp->p2<p->nOp );
79032 assert( pOp->p3>=0 && pOp->p3<p->nOp );
79053 assert( pIn1->u.i>=0 && pIn1->u.i<p->nOp );
79056 assert( pCaller->p2>=0 && pCaller->p2<p->nOp );
83153 assert( pOp->p2>0 && pOp->p2<p->nOp );
84040 assert( pProgram->nOp>0 );
84081 + (pProgram->nOp + 7)/8;
84099 pFrame->nOp = p->nOp;
84133 memset(pFrame->aOnce, 0, (pProgram->nOp + 7)/8);
84135 p->nOp = pProgram->nOp;
85191 for(i=1; i<p->nOp; i++){
85261 assert( pOp>=&aOp[-1] && pOp<&aOp[p->nOp-1] );
123063 pProgram->aOp = sqlite3VdbeTakeOpArray(v, &pProgram->nOp, &pTop->nMaxArg);
