Lines Matching defs:nOp

16532   int nOp;                      /* Elements in aOp[] */
16894 SQLITE_PRIVATE VdbeOp *sqlite3VdbeAddOpList(Vdbe*, int nOp, VdbeOpList const *aOp,int iLineno);
23304 int nOp; /* Size of aOp array */
23573 int nOp; /* Number of instructions in the program */
84992 ** Resize the Vdbe.aOp array so that it is at least nOp elements larger
84993 ** than its current size. nOp is guaranteed to be less than or equal
85001 static int growOpArray(Vdbe *v, int nOp){
85014 : (sqlite3_int64)v->nOpAlloc+nOp);
85018 UNUSED_PARAMETER(nOp);
85027 assert( nOp<=(int)(1024/sizeof(Op)) );
85028 assert( nNew>=(v->nOpAlloc+nOp) );
85065 assert( p->nOpAlloc<=p->nOp );
85067 assert( p->nOpAlloc>p->nOp );
85113 i = p->nOp;
85120 p->nOp++;
85165 i = p->nOp;
85169 p->nOp++;
85372 iThis = v->nOp;
85473 p->aLabel[j] = v->nOp;
85484 printf("RESOLVE LABEL %d to %d\n", x, v->nOp);
85491 p->aLabel[j] = v->nOp;
85507 for(i=1; ALWAYS(i<p->nOp); i++){
85545 int nOp;
85551 nOp = v->nOp;
85554 nOp = p->apSub[p->iSub-1]->nOp;
85556 assert( p->iAddr<nOp );
85560 if( p->iAddr==nOp ){
85719 pOp = &p->aOp[p->nOp-1];
85786 assert( pOp->p2<p->nOp
85845 assert( iLast<v->nOp );
85866 for(; j<v->nOp; j++){
85902 return p->nOp;
85915 assert( p->nOp + N <= p->nOpAlloc );
85929 for(i=0; i<p->nOp; i++){
85965 *pnOp = p->nOp;
85979 int nOp, /* Number of opcodes to add */
85985 assert( nOp>0 );
85987 if( p->nOp + nOp > p->nOpAlloc && growOpArray(p, nOp) ){
85990 pFirst = pOut = &p->aOp[p->nOp];
85991 for(i=0; i<nOp; i++, aOp++, pOut++){
85997 pOut->p2 += p->nOp;
86013 sqlite3VdbePrintOp(0, i+p->nOp, &p->aOp[i+p->nOp]);
86017 p->nOp += nOp;
86133 assert( p->nOp>0 || p->db->mallocFailed );
86134 if( p->nOp>0 ) p->aOp[p->nOp-1].p5 = p5;
86154 sqlite3VdbeChangeP2(p, addr, p->nOp);
86171 if( addr==p->nOp-1 ){
86179 p->nOp--;
86181 sqlite3VdbeChangeP2(p, addr, p->nOp);
86259 ** nOp entries.
86261 static void vdbeFreeOpArray(sqlite3 *db, Op *aOp, int nOp){
86262 assert( nOp>=0 );
86265 Op *pOp = &aOp[nOp-1];
86301 assert( addr>=0 && addr<p->nOp );
86315 if( p->nOp>0 && p->aOp[p->nOp-1].opcode==op ){
86316 return sqlite3VdbeChangeToNoop(p, p->nOp-1);
86403 assert( p->nOp>0 );
86404 assert( addr<p->nOp );
86406 addr = p->nOp - 1;
86443 assert( p->nOp>0 );
86444 pOp = &p->aOp[p->nOp-1];
86472 assert( p->nOp>0 || p->aOp==0 );
86473 assert( p->aOp==0 || p->aOp[p->nOp-1].zComment==0 || p->pParse->nErr>0 );
86474 if( p->nOp ){
86476 sqlite3DbFree(p->db, p->aOp[p->nOp-1].zComment);
86477 p->aOp[p->nOp-1].zComment = sqlite3VMPrintf(p->db, zFormat, ap);
86526 assert( (addr>=0 && addr<p->nOp) || p->db->mallocFailed );
86537 return sqlite3VdbeGetOp(p, p->nOp - 1);
87099 nRow = p->nOp;
87108 nRow += apSub[i]->nOp;
87119 if( i<p->nOp ){
87127 i -= p->nOp;
87130 for(j=0; i>=apSub[j]->nOp; j++){
87131 i -= apSub[j]->nOp;
87132 assert( i<apSub[j]->nOp || j+1<nSub );
87158 nRow += aOp[i].p4.pProgram->nOp;
87319 }else if( p->nOp>=1 ){
87335 int nOp = p->nOp;
87338 if( nOp<1 ) return;
87418 assert( p->nOp>0 );
87436 for(i=0; i<p->nOp; i++){
87474 assert( p->nOp>0 );
87499 n = ROUND8P(sizeof(Op)*p->nOp); /* Bytes of opcode memory used */
87626 v->nOp = pFrame->nOp;
88443 for(i=0; i<p->nOp; i++){
88457 for(i=0; i<p->nOp; i++){
88547 vdbeFreeOpArray(db, pSub->aOp, pSub->nOp);
88555 vdbeFreeOpArray(db, p->aOp, p->nOp);
92749 int nOp;
92761 nOp = p->nOp;
92766 nOp = pFrame->nOp;
92773 for(ii=0; ii<nOp; ii++){
92870 for(iOp=0; iOp<nOp; iOp++){
92909 for(ii=0; p!=0 && ii<p->nOp; ii++){
93985 for(i=0; i<p->nOp; i++){
93990 for(i=0; i<p->nOp; i++){
94007 assert( pOp>=aOp && pOp<&aOp[p->nOp]);
94247 assert( pOp->p2>=0 && pOp->p2<p->nOp );
94248 assert( pOp->p3>=0 && pOp->p3<p->nOp );
94259 assert( pOp->p2<p->nOp ); /* Jumps must be in range */
94278 assert( pIn1->u.i>=0 && pIn1->u.i<p->nOp );
94281 assert( pCaller->p2>=0 && pCaller->p2<p->nOp );
99398 assert( pOp->p2>=0 && pOp->p2<p->nOp );
100421 assert( pProgram->nOp>0 );
100462 + (pProgram->nOp + 7)/8;
100482 pFrame->nOp = p->nOp;
100517 memset(pFrame->aOnce, 0, (pProgram->nOp + 7)/8);
100519 p->nOp = pProgram->nOp;
102019 for(i=1; i<p->nOp; i++){
102158 assert( pOp>=&aOp[-1] && pOp<&aOp[p->nOp-1] );
153033 pProgram->aOp = sqlite3VdbeTakeOpArray(v, &pProgram->nOp, &pTop->nMaxArg);