Lines Matching defs:aOp

7950   VdbeOp *aOp;                  /* Array of opcodes for sub-program */
7951 int nOp; /* Elements in aOp[] */
8230 SQLITE_PRIVATE int sqlite3VdbeAddOpList(Vdbe*, int nOp, VdbeOpList const *aOp);
12325 Op *aOp; /* Program instructions for parent frame */
12326 int nOp; /* Size of aOp array */
12484 Op *aOp; /* Space to hold the virtual machine's program */
12491 int nOpAlloc; /* Number of slots allocated for aOp[] */
34248 SQLITE_PRIVATE int sqlite3BitvecBuiltinTest(int sz, int *aOp){
34269 while( (op = aOp[pc])!=0 ){
34275 i = aOp[pc+2] - 1;
34276 aOp[pc+2] += aOp[pc+3];
34287 if( (--aOp[pc+1]) > 0 ) nx = 0;
57228 ** Resize the Vdbe.aOp array so that it is at least one op larger than
57232 ** SQLITE_NOMEM. In this case Vdbe.aOp and Vdbe.nOpAlloc remain
57239 pNew = sqlite3DbRealloc(p->db, p->aOp, nNew*sizeof(Op));
57242 p->aOp = pNew;
57276 pOp = &p->aOp[i];
57293 if( sqlite3VdbeAddopTrace ) sqlite3VdbePrintOp(0, i, &p->aOp[i]);
57425 Op *aOp;
57431 aOp = v->aOp;
57434 aOp = p->apSub[p->iSub-1]->aOp;
57439 pRet = &aOp[p->iAddr];
57536 for(pOp=p->aOp, i=p->nOp-1; i>=0; i--, pOp++){
57587 VdbeOp *aOp = p->aOp;
57588 assert( aOp && !p->db->mallocFailed );
57595 p->aOp = 0;
57596 return aOp;
57603 SQLITE_PRIVATE int sqlite3VdbeAddOpList(Vdbe *p, int nOp, VdbeOpList const *aOp){
57612 VdbeOpList const *pIn = aOp;
57615 VdbeOp *pOut = &p->aOp[i+addr];
57630 sqlite3VdbePrintOp(0, i+addr, &p->aOp[i+addr]);
57649 p->aOp[addr].p1 = val;
57661 p->aOp[addr].p2 = val;
57672 p->aOp[addr].p3 = val;
57682 if( p->aOp ){
57684 p->aOp[p->nOp-1].p5 = val;
57760 ** Free the space allocated for aOp and any p4 values allocated for the
57761 ** opcodes contained within. If aOp is not NULL it is assumed to contain
57764 static void vdbeFreeOpArray(sqlite3 *db, Op *aOp, int nOp){
57765 if( aOp ){
57767 for(pOp=aOp; pOp<&aOp[nOp]; pOp++){
57774 sqlite3DbFree(db, aOp);
57791 if( p->aOp ){
57792 VdbeOp *pOp = &p->aOp[addr];
57834 if( p->aOp==0 || db->mallocFailed ){
57845 pOp = &p->aOp[addr];
57905 assert( p->nOp>0 || p->aOp==0 );
57906 assert( p->aOp==0 || p->aOp[p->nOp-1].zComment==0 || p->db->mallocFailed );
57908 char **pz = &p->aOp[p->nOp-1].zComment;
57919 assert( p->nOp>0 || p->aOp==0 );
57920 assert( p->aOp==0 || p->aOp[p->nOp-1].zComment==0 || p->db->mallocFailed );
57922 char **pz = &p->aOp[p->nOp-1].zComment;
57967 return &p->aOp[addr];
58306 }while( i<nRow && p->explain==2 && p->aOp[i].opcode!=OP_Explain );
58320 pOp = &p->aOp[i];
58329 pOp = &apSub[j]->aOp[i];
58439 pOp = &p->aOp[0];
58457 pOp = &p->aOp[0];
58574 u8 *zCsr = (u8 *)&p->aOp[p->nOp]; /* Memory avaliable for alloation */
58575 u8 *zEnd = (u8 *)&p->aOp[p->nOpAlloc]; /* First byte past available mem */
58649 p->aOp[i].cnt = 0;
58650 p->aOp[i].cycles = 0;
58689 v->aOp = pFrame->aOp;
59463 fprintf(out, "%02x", p->aOp[i].opcode);
59468 p->aOp[i].cnt,
59469 p->aOp[i].cycles,
59470 p->aOp[i].cnt>0 ? p->aOp[i].cycles/p->aOp[i].cnt : 0
59472 sqlite3VdbePrintOp(out, i, &p->aOp[i]);
59528 vdbeFreeOpArray(db, pSub->aOp, pSub->nOp);
59531 vdbeFreeOpArray(db, p->aOp, p->nOp);
61519 for(j=0, pOp=p->aOp; j<p->nOp; j++, pOp++){
62455 Op *aOp = p->aOp; /* Copy of p->aOp */
62909 sqlite3VdbePrintOp(stdout, i, &aOp[i]);
62921 pOp = &aOp[pc];
63156 pc = p->aOp[pc].p2-1;
63158 aOp = p->aOp;
63717 assert( pOp>aOp );
67365 ** program stored in SubProgram.aOp. As well as these, one memory
67389 u.by.pFrame->aOp = p->aOp;
67415 p->aOp = aOp = u.by.pProgram->aOp;
67440 u.bz.pIn = &u.bz.pFrame->aMem[pOp->p1 + u.bz.pFrame->aOp[u.bz.pFrame->pc].p1];
67611 assert( pOp>p->aOp );
68341 sqlite3VdbePrintOp(stdout, origPc, &aOp[origPc]);
95477 pProgram->aOp = sqlite3VdbeTakeOpArray(v, &pProgram->nOp, &pTop->nMaxArg);