Lines Matching refs:nOp
7148 int nOp; /* Elements in aOp[] */
7427 SQLITE_PRIVATE int sqlite3VdbeAddOpList(Vdbe*, int nOp, VdbeOpList const *aOp);
17624 int nOp; /* Size of aOp array */
17793 int nOp; /* Number of instructions in the program */
47554 i = p->nOp;
47562 p->nOp++;
47666 p->aLabel[j] = p->nOp;
47707 int nOp;
47713 nOp = v->nOp;
47716 nOp = p->apSub[p->iSub-1]->nOp;
47718 assert( p->iAddr<nOp );
47722 if( p->iAddr==nOp ){
47817 for(pOp=p->aOp, i=p->nOp-1; i>=0; i--, pOp++){
47830 assert( p->nOp - i >= 3 );
47853 return p->nOp;
47875 *pnOp = p->nOp;
47884 SQLITE_PRIVATE int sqlite3VdbeAddOpList(Vdbe *p, int nOp, VdbeOpList const *aOp){
47887 if( p->nOp + nOp > p->nOpAlloc && growOpArray(p) ){
47890 addr = p->nOp;
47891 if( ALWAYS(nOp>0) ){
47894 for(i=0; i<nOp; i++, pIn++){
47915 p->nOp += nOp;
47929 if( p->nOp>addr ){
47941 if( p->nOp>addr ){
47952 if( p->nOp>addr ){
47964 assert( p->nOp>0 );
47965 p->aOp[p->nOp-1].p5 = val;
47974 sqlite3VdbeChangeP2(p, addr, p->nOp);
48034 ** nOp entries.
48036 static void vdbeFreeOpArray(sqlite3 *db, Op *aOp, int nOp){
48039 for(pOp=aOp; pOp<&aOp[nOp]; pOp++){
48068 vdbeFreeOpArray(db, aOp, p->nOp);
48069 p->nOp = 0;
48132 assert( p->nOp>0 );
48133 assert( addr<p->nOp );
48135 addr = p->nOp - 1;
48197 assert( p->nOp>0 || p->aOp==0 );
48198 assert( p->aOp==0 || p->aOp[p->nOp-1].zComment==0 || p->db->mallocFailed );
48199 if( p->nOp ){
48200 char **pz = &p->aOp[p->nOp-1].zComment;
48211 assert( p->nOp>0 || p->aOp==0 );
48212 assert( p->aOp==0 || p->aOp[p->nOp-1].zComment==0 || p->db->mallocFailed );
48213 if( p->nOp ){
48214 char **pz = &p->aOp[p->nOp-1].zComment;
48234 ** unless p->nOp>0. This is because in the absense of SQLITE_OMIT_TRACE,
48236 ** a new VDBE is created. So we are free to set addr to p->nOp-1 without
48239 ** check the value of p->nOp-1 before continuing.
48246 if( p->nOp==0 ) return &dummy;
48248 addr = p->nOp - 1;
48250 assert( (addr>=0 && addr<p->nOp) || p->db->mallocFailed );
48503 nRow = p->nOp;
48518 nRow += apSub[i]->nOp;
48535 if( i<p->nOp ){
48543 i -= p->nOp;
48544 for(j=0; i>=apSub[j]->nOp; j++){
48545 i -= apSub[j]->nOp;
48656 int nOp = p->nOp;
48658 if( nOp<1 ) return;
48673 int nOp = p->nOp;
48676 if( nOp<1 ) return;
48772 assert( p->nOp>0 );
48794 u8 *zCsr = (u8 *)&p->aOp[p->nOp]; /* Memory avaliable for alloation */
48867 for(i=0; i<p->nOp; i++){
48909 v->nOp = pFrame->nOp;
49674 for(i=0; i<p->nOp; i++){
49678 for(i=0; i<p->nOp; i++){
49746 vdbeFreeOpArray(db, p->aOp, p->nOp);
51647 for(j=0, pOp=p->aOp; j<p->nOp; j++, pOp++){
53001 for(i=0; i<p->nOp; i++){
53011 assert( pc>=0 && pc<p->nOp );
56643 assert( pOp->p2>0 && pOp->p2<p->nOp );
57346 assert( u.by.pProgram->nOp>0 );
57402 u.by.pFrame->nOp = p->nOp;
57428 p->nOp = u.by.pProgram->nOp;
58215 assert( pc>=-1 && pc<p->nOp );
84584 pProgram->aOp = sqlite3VdbeTakeOpArray(v, &pProgram->nOp, &pTop->nMaxArg);
