Lines Matching defs:nOp
13756 int nOp; /* Elements in aOp[] */
14087 SQLITE_PRIVATE VdbeOp *sqlite3VdbeAddOpList(Vdbe*, int nOp, VdbeOpList const *aOp, int iLineno);
18806 int nOp; /* Size of aOp array */
19015 int nOp; /* Number of instructions in the program */
41672 OSTRACE(("SYNC-NOP pid=%lu, pFile=%p, file=%p, rc=SQLITE_OK\n",
73055 ** Resize the Vdbe.aOp array so that it is at least nOp elements larger
73056 ** than its current size. nOp is guaranteed to be less than or equal
73064 static int growOpArray(Vdbe *v, int nOp){
73076 int nNew = (p->nOpAlloc>=512 ? p->nOpAlloc*2 : p->nOpAlloc+nOp);
73079 UNUSED_PARAMETER(nOp);
73088 assert( nOp<=(1024/sizeof(Op)) );
73089 assert( nNew>=(p->nOpAlloc+nOp) );
73127 assert( p->pParse->nOpAlloc<=p->nOp );
73129 assert( p->pParse->nOpAlloc>p->nOp );
73136 i = p->nOp;
73142 p->nOp++;
73355 p->aLabel[j] = v->nOp;
73403 int nOp;
73409 nOp = v->nOp;
73412 nOp = p->apSub[p->iSub-1]->nOp;
73414 assert( p->iAddr<nOp );
73418 if( p->iAddr==nOp ){
73532 pOp = &p->aOp[p->nOp-1];
73630 return p->nOp;
73643 assert( p->nOp + N <= p->pParse->nOpAlloc );
73657 for(i=0; i<p->nOp; i++){
73682 *pnOp = p->nOp;
73696 int nOp, /* Number of opcodes to add */
73702 assert( nOp>0 );
73704 if( p->nOp + nOp > p->pParse->nOpAlloc && growOpArray(p, nOp) ){
73707 pFirst = pOut = &p->aOp[p->nOp];
73708 for(i=0; i<nOp; i++, aOp++, pOut++){
73714 pOut->p2 += p->nOp;
73730 sqlite3VdbePrintOp(0, i+p->nOp, &p->aOp[i+p->nOp]);
73734 p->nOp += nOp;
73783 assert( p->nOp>0 || p->db->mallocFailed );
73784 if( p->nOp>0 ) p->aOp[p->nOp-1].p5 = p5;
73792 sqlite3VdbeChangeP2(p, addr, p->nOp);
73866 ** nOp entries.
73868 static void vdbeFreeOpArray(sqlite3 *db, Op *aOp, int nOp){
73871 for(pOp=&aOp[nOp-1]; pOp>=aOp; pOp--){
73897 assert( addr>=0 && addr<p->nOp );
73911 if( p->nOp>0 && p->aOp[p->nOp-1].opcode==op ){
73912 return sqlite3VdbeChangeToNoop(p, p->nOp-1);
73965 assert( p->nOp>0 );
73966 assert( addr<p->nOp );
73968 addr = p->nOp - 1;
74005 assert( p->nOp>0 );
74006 pOp = &p->aOp[p->nOp-1];
74034 assert( p->nOp>0 || p->aOp==0 );
74035 assert( p->aOp==0 || p->aOp[p->nOp-1].zComment==0 || p->db->mallocFailed );
74036 if( p->nOp ){
74038 sqlite3DbFree(p->db, p->aOp[p->nOp-1].zComment);
74039 p->aOp[p->nOp-1].zComment = sqlite3VMPrintf(p->db, zFormat, ap);
74089 addr = p->nOp - 1;
74091 assert( (addr>=0 && addr<p->nOp) || p->db->mallocFailed );
74632 nRow = p->nOp;
74647 nRow += apSub[i]->nOp;
74658 if( i<p->nOp ){
74666 i -= p->nOp;
74667 for(j=0; i>=apSub[j]->nOp; j++){
74668 i -= apSub[j]->nOp;
74694 nRow += pOp->p4.pProgram->nOp;
74789 }else if( p->nOp>=1 ){
74805 int nOp = p->nOp;
74808 if( nOp<1 ) return;
74886 assert( p->nOp>0 );
74905 for(i=0; i<p->nOp; i++){
74943 assert( p->nOp>0 );
74966 n = ROUND8(sizeof(Op)*p->nOp); /* Bytes of opcode memory used */
74997 p->anExec = allocSpace(&x, p->anExec, p->nOp*sizeof(i64));
75019 memset(p->anExec, 0, p->nOp*sizeof(i64));
75091 v->nOp = pFrame->nOp;
75897 for(i=0; i<p->nOp; i++){
75911 for(i=0; i<p->nOp; i++){
75993 vdbeFreeOpArray(db, pSub->aOp, pSub->nOp);
76001 vdbeFreeOpArray(db, p->aOp, p->nOp);
79689 memset(p->anExec, 0, p->nOp * sizeof(i64));
80602 for(i=0; i<p->nOp; i++){
80607 for(i=0; i<p->nOp; i++){
80624 assert( pOp>=aOp && pOp<&aOp[p->nOp]);
80827 assert( pOp->p2>=0 && pOp->p2<p->nOp );
80828 assert( pOp->p3>=0 && pOp->p3<p->nOp );
80849 assert( pIn1->u.i>=0 && pIn1->u.i<p->nOp );
80852 assert( pCaller->p2>=0 && pCaller->p2<p->nOp );
84983 assert( pOp->p2>0 && pOp->p2<p->nOp );
85850 assert( pProgram->nOp>0 );
85891 + (pProgram->nOp + 7)/8;
85909 pFrame->nOp = p->nOp;
85943 memset(pFrame->aOnce, 0, (pProgram->nOp + 7)/8);
85945 p->nOp = pProgram->nOp;
87141 for(i=1; i<p->nOp; i++){
87212 assert( pOp>=&aOp[-1] && pOp<&aOp[p->nOp-1] );
125854 pProgram->aOp = sqlite3VdbeTakeOpArray(v, &pProgram->nOp, &pTop->nMaxArg);
