Lines Matching defs:nMem
16295 ** key and the pData,nData,nZero fields are uninitialized. The aMem,nMem
16297 ** The nMem field might be zero, indicating that no decomposition is available.
16303 ** The aMem,nMem fields are uninitialized for table btrees.
16313 ** nMem not used entries in aMem
16327 sqlite3_value *aMem; /* First of nMem value in the unpacked pKey */
16328 u16 nMem; /* Number of aMem[] value. Might be zero */
16533 int nMem; /* Number of memory cells required */
19813 int nMem; /* Number of memory cells used so far */
23305 int nMem; /* Number of entries in aMem */
23553 int nMem; /* Number of memory locations currently allocated */
79833 ** if pX->nMem is non-zero, then pX->aMem contains pointers to the unpacked
79959 if( pX->nMem ){
79963 r.nField = pX->nMem;
83831 for(i=1, pX=pVdbe->aMem+1; i<pVdbe->nMem; i++, pX++){
86337 assert( iFirst+N-1<=pParse->nMem );
87254 assert( p->nMem>9 );
87423 for(i=0; i<p->nMem; i++){
87467 int nMem; /* Number of VM memory registers */
87483 nMem = pParse->nMem;
87492 nMem += nCursor;
87493 if( nCursor==0 && nMem>0 ) nMem++; /* Space for aMem[0] even if not used */
87509 if( nMem<10 ) nMem = 10;
87526 p->aMem = allocSpace(&x, 0, nMem*sizeof(Mem));
87534 p->aMem = allocSpace(&x, p->aMem, nMem*sizeof(Mem));
87544 p->nMem = 0;
87549 p->nMem = nMem;
87550 initMemArray(p->aMem, nMem, db, MEM_Undefined);
87628 v->nMem = pFrame->nMem;
87658 releaseMemArray(p->aMem, p->nMem);
88424 for(i=0; i<p->nMem; i++) assert( p->aMem[i].flags==MEM_Undefined );
92378 }else if( v->nMem>=10 && (eMode!=2 || v->haveEqpOps) ){
93378 ** the top of the register space. Cursor 1 is at Mem[p->nMem-1].
93379 ** Cursor 2 is at Mem[p->nMem-2]. And so forth.
93381 Mem *pMem = iCur>0 ? &p->aMem[p->nMem-iCur] : p->aMem;
93733 for(i=1; i<v->nMem; i++) registerTrace(i, v->aMem+i);
93776 assert( pOp->p2<=(p->nMem+1 - p->nCursor) );
94050 assert( pOp->p1<=(p->nMem+1 - p->nCursor) );
94057 assert( pOp->p2<=(p->nMem+1 - p->nCursor) );
94064 assert( pOp->p3<=(p->nMem+1 - p->nCursor) );
94071 assert( pOp->p2<=(p->nMem+1 - p->nCursor) );
94076 assert( pOp->p3<=(p->nMem+1 - p->nCursor) );
94191 assert( pOp->p1>0 && pOp->p1<=(p->nMem+1 - p->nCursor) );
94246 assert( pOp->p1>0 && pOp->p1<=(p->nMem+1 - p->nCursor) );
94528 assert( pOp->p3<=(p->nMem+1 - p->nCursor) );
94577 assert( pOp->p3<=(p->nMem+1 - p->nCursor) );
94603 assert( pOp->p1>0 && pOp->p1<=(p->nMem+1 - p->nCursor) );
94675 assert( pOut<=&aMem[(p->nMem+1 - p->nCursor)] );
94676 assert( pIn1<=&aMem[(p->nMem+1 - p->nCursor)] );
94683 for(i=1; i<p->nMem; i++){
94807 assert( pOp->p1+pOp->p2<=(p->nMem+1 - p->nCursor)+1 );
95574 assert( p1>0 && p1+mx<=(p->nMem+1 - p->nCursor)+1 );
95575 assert( p2>0 && p2+mx<=(p->nMem+1 - p->nCursor)+1 );
95577 assert( p1>0 && p1+n<=(p->nMem+1 - p->nCursor)+1 );
95578 assert( p2>0 && p2+n<=(p->nMem+1 - p->nCursor)+1 );
95853 assert( pOp->p1>=0 || (pOp->p3>=0 && pOp->p3<=(p->nMem+1 - p->nCursor)) );
96039 assert( pOp->p3>0 && pOp->p3<=(p->nMem+1 - p->nCursor) );
96439 assert( pIn1 <= &p->aMem[(p->nMem+1 - p->nCursor)] );
96531 assert( nField>0 && pOp->p2>0 && pOp->p2+nField<=(p->nMem+1 - p->nCursor)+1 );
96807 assert( pOp->p3>0 && pOp->p3<=(p->nMem+1 - p->nCursor) );
97445 assert( p2<=(u32)(p->nMem+1 - p->nCursor) );
98678 assert( pOp->p3<=pFrame->nMem );
98682 assert( pOp->p3<=(p->nMem+1 - p->nCursor) );
99582 x.nMem = (u16)pOp->p4.i;
99640 assert( pOp->p2>0 && pOp->p2+pOp->p3<=(p->nMem+1 - p->nCursor)+1 );
100264 assert( pOp->p1>0 && (pOp->p1+1)<=(p->nMem+1 - p->nCursor) );
100410 int nMem; /* Number of memory registers for sub-program */
100451 /* SubProgram.nMem is set to the number of memory cells used by the
100454 ** variable nMem (and later, VdbeFrame.nChildMem) to this value.
100456 nMem = pProgram->nMem + pProgram->nCsr;
100457 assert( nMem>0 );
100458 if( pProgram->nCsr==0 ) nMem++;
100460 + nMem * sizeof(Mem)
100474 pFrame->nChildMem = nMem;
100478 pFrame->nMem = p->nMem;
100496 assert( pProgram->nMem+pProgram->nCsr==pFrame->nChildMem
100497 || (pProgram->nCsr==0 && pProgram->nMem+1==pFrame->nChildMem) );
100513 p->nMem = pFrame->nChildMem;
100515 p->apCsr = (VdbeCursor **)&aMem[p->nMem];
100525 for(i=0; i<p->nMem; i++){
100777 assert( pOp->p3>0 && pOp->p3<=(p->nMem+1 - p->nCursor) );
100778 assert( n==0 || (pOp->p2>0 && pOp->p2+n<=(p->nMem+1 - p->nCursor)+1) );
100900 assert( pOp->p1>0 && pOp->p1<=(p->nMem+1 - p->nCursor) );
101476 assert( pOp->p3>0 && pOp->p3<=(p->nMem+1 - p->nCursor) );
101870 assert( pOp->p1>0 && pOp->p1<=(p->nMem+1 - p->nCursor) );
101906 assert( pOp->p1>0 && pOp->p1<=(p->nMem+1 - p->nCursor) );
102104 assert( pOp->p1+pOp->p2<=(p->nMem+1 - p->nCursor)+1 );
102603 sParse.nMem = 1;
112278 *prRhsHasNull = ++pParse->nMem;
112317 *prRhsHasNull = rMayHaveNull = ++pParse->nMem;
112480 pExpr->y.sub.regReturn = ++pParse->nMem;
112665 pExpr->y.sub.regReturn = ++pParse->nMem;
112697 sqlite3SelectDestInit(&dest, 0, pParse->nMem+1);
112698 pParse->nMem += nReg;
113291 iResult = pParse->nMem+1;
113292 pParse->nMem += nResult;
113548 assert( target>0 && target<=pParse->nMem );
113963 r1 = pParse->nMem+1;
113964 pParse->nMem += nFarg;
114383 if( regDest<0 ) regDest = ++pParse->nMem;
114394 if( regDest<0 ) regDest = ++pParse->nMem;
114447 assert( target>0 && target<=pParse->nMem );
116019 return ++pParse->nMem;
116049 i = pParse->nMem+1;
116050 pParse->nMem += nReg;
116084 if( pParse->nMem<iReg ) pParse->nMem = iReg;
116417 int i = ++pParse->nMem;
118380 reg = ++pParse->nMem;
118383 pParse->nMem += pTab->nCol;
118386 pParse->nMem += pPk->nColumn;
118392 regRec = ++pParse->nMem;
118419 pParse->nMem++;
119861 iMem = pParse->nMem+1;
119896 analyzeOneTable(pParse, pTab, pOnlyIdx, iStatCur,pParse->nMem+1,pParse->nTab);
122555 int iReg = ++pParse->nMem;
122717 reg1 = pParse->regRowid = ++pParse->nMem;
122718 reg2 = pParse->regRoot = ++pParse->nMem;
122719 reg3 = ++pParse->nMem;
124206 regYield = ++pParse->nMem;
124207 regRec = ++pParse->nMem;
124208 regRowid = ++pParse->nMem;
125776 int iMem = ++pParse->nMem;
128070 memCnt = ++pParse->nMem;
128118 iRowSet = ++pParse->nMem;
128126 iPk = pParse->nMem+1;
128127 pParse->nMem += nPk;
128166 iKey = ++pParse->nMem;
128189 iKey = ++pParse->nMem;
128407 iOld = pParse->nMem+1;
128408 pParse->nMem += (1 + pTab->nCol);
133337 pToplevel->nMem++; /* Register to hold name of table */
133338 pInfo->regCtr = ++pToplevel->nMem; /* Max rowid register */
133339 pToplevel->nMem +=2; /* Rowid in sqlite_sequence + orig max val */
133622 p->regReturn = ++pParse->nMem;
133633 dest.iSdst = pParse->nMem + 3;
133635 pParse->nMem += 2 + dest.nSdst;
133924 regRowid = regIns = pParse->nMem+1;
133925 pParse->nMem += pTab->nCol + 1;
133928 pParse->nMem++;
134017 int regYield = ++pParse->nMem;
134144 regRowCount = ++pParse->nMem;
134159 aRegIdx[i] = ++pParse->nMem;
134160 pParse->nMem += pIdx->nColumn;
134162 aRegIdx[i] = ++pParse->nMem; /* Register to store the table record */
135103 regTrigCnt = ++pParse->nMem;
139154 pParse->nMem = 2;
139277 pParse->nMem += 2;
139375 iReg = ++pParse->nMem;
139931 pParse->nMem = 7;
139988 pParse->nMem = 6;
140056 pParse->nMem = 5;
140099 pParse->nMem = 6;
140103 pParse->nMem = 3;
140107 assert( pParse->nMem<=pPragma->nPragCName );
140118 sqlite3VdbeAddOp2(v, OP_ResultRow, 1, pParse->nMem);
140131 pParse->nMem = 5;
140148 pParse->nMem = 3;
140163 pParse->nMem = 2;
140177 pParse->nMem = 6;
140195 pParse->nMem = 1;
140225 pParse->nMem = 8;
140266 regResult = pParse->nMem+1;
140267 pParse->nMem += 4;
140268 regRow = ++pParse->nMem;
140425 pParse->nMem = 6;
140563 assert( pParse->nMem>=8+j );
141074 pParse->nMem = 1;
141102 pParse->nMem = 3;
141443 pParse->nMem = 2;
143574 int regOut = ++pParse->nMem;
143631 regBase = pParse->nMem + 1;
143632 pParse->nMem += nBase;
143654 regPrevKey = pParse->nMem+1;
143655 pParse->nMem += pSort->nOBSat;
143677 pSort->regReturn = ++pParse->nMem;
143808 iRet = regPrev = pParse->nMem+1;
143809 pParse->nMem += nResultCol;
144039 pParse->nMem += nPrefixReg;
144041 pDest->iSdst = pParse->nMem+1;
144042 pParse->nMem += nResultCol;
144043 }else if( pDest->iSdst+nResultCol > pParse->nMem ){
144049 pParse->nMem += nResultCol;
144098 pParse->nMem += pExtra->nExpr;
144615 int regSortOut = ++pParse->nMem;
145383 p->iLimit = iLimit = ++pParse->nMem;
145402 p->iOffset = iOffset = ++pParse->nMem;
145403 pParse->nMem++; /* Allocate an extra register for limit+offset */
145580 regCurrent = ++pParse->nMem;
146468 regPrev = pParse->nMem+1;
146469 pParse->nMem += nExpr+1;
146511 regLimitA = ++pParse->nMem;
146512 regLimitB = ++pParse->nMem;
146522 regAddrA = ++pParse->nMem;
146523 regAddrB = ++pParse->nMem;
146524 regOutA = ++pParse->nMem;
146525 regOutB = ++pParse->nMem;
149545 pAggInfo->iFirstReg = pParse->nMem + 1;
149546 pParse->nMem += pAggInfo->nColumn + pAggInfo->nFunc;
149732 if( regHit==0 ) regHit = ++pParse->nMem;
149826 if( regHit==0 && pAggInfo->nAccumulator ) regHit = ++pParse->nMem;
150628 pItem->regReturn = ++pParse->nMem;
150671 pItem->regReturn = ++pParse->nMem;
150875 int regGosub = ++pParse->nMem;
151065 iUseFlag = ++pParse->nMem;
151066 iAbortFlag = ++pParse->nMem;
151067 regOutputRow = ++pParse->nMem;
151069 regReset = ++pParse->nMem;
151071 iAMem = pParse->nMem + 1;
151072 pParse->nMem += pGroupBy->nExpr;
151073 iBMem = pParse->nMem + 1;
151074 pParse->nMem += pGroupBy->nExpr;
151391 regAcc = ++pParse->nMem;
152794 int reg = pParse->nMem+1;
152796 pParse->nMem += nCol+2;
153035 pProgram->nMem = sSubParse.nMem;
153109 sqlite3VdbeAddOp4(v, OP_Program, reg, ignoreJump, ++pParse->nMem,
153851 reg = ++pParse->nMem;
153852 pParse->nMem += pIdx->nColumn;
153857 reg = ++pParse->nMem;
153858 pParse->nMem += pIdx->nColumn;
153869 aRegIdx[nAllIdx] = ++pParse->nMem; /* Register storing the table record */
153886 assert( aRegIdx[nAllIdx]==pParse->nMem );
153888 regOldRowid = regNewRowid = ++pParse->nMem;
153890 regOld = pParse->nMem + 1;
153891 pParse->nMem += pTab->nCol;
153894 regNewRowid = ++pParse->nMem;
153896 regNew = pParse->nMem + 1;
153897 pParse->nMem += pTab->nCol;
153945 regRowCount = ++pParse->nMem;
153956 iPk = pParse->nMem+1;
153957 pParse->nMem += nPk;
153958 pParse->nMem += nChangeFrom;
153959 regKey = ++pParse->nMem;
154054 aRegIdx[nAllIdx] = ++pParse->nMem;
154506 regArg = pParse->nMem + 1;
154507 pParse->nMem += nArg;
154548 regRec = ++pParse->nMem;
154549 regRowid = ++pParse->nMem;
154940 int iPk = pParse->nMem+1;
154941 pParse->nMem += nPk;
155105 iIntoReg = ++pParse->nMem;
155897 iReg = ++pParse->nMem;
158231 regBase = pParse->nMem + 1;
158233 pParse->nMem += nReg;
158432 reg = ++pWalker->pParse->nMem; /* Register for column value */
158443 reg = ++pWalker->pParse->nMem; /* Register for column value */
158848 pLevel->iLeftJoin = ++pParse->nMem;
158889 int iCache = ++pParse->nMem;
159008 iReleaseReg = ++pParse->nMem;
159103 memEndValue = ++pParse->nMem;
159122 iRowidReg = ++pParse->nMem;
159222 pLevel->iLikeRepCntr = (u32)++pParse->nMem;
159259 pLevel->regBignull = regBignull = ++pParse->nMem;
159588 int regReturn = ++pParse->nMem; /* Register used with OP_Gosub */
159642 regRowset = ++pParse->nMem;
159650 regRowid = ++pParse->nMem;
160208 int r = ++pParse->nMem;
160220 pParse->nMem += nPk - 1;
163231 pLevel->regFilter = ++pParse->nMem;
163346 pLevel->regFilter = ++pParse->nMem;
168899 pRJ->regBloom = ++pParse->nMem;
168901 pRJ->regReturn = ++pParse->nMem;
169056 int r1 = pParse->nMem+1;
169061 pParse->nMem += n+1;
170400 pWin->regAccum = ++pParse->nMem;
170401 pWin->regResult = ++pParse->nMem;
170753 pMWin->regPart = pParse->nMem+1;
170754 pParse->nMem += nExpr;
170758 pMWin->regOne = ++pParse->nMem;
170762 pMWin->regStartRowid = ++pParse->nMem;
170763 pMWin->regEndRowid = ++pParse->nMem;
170787 pWin->regApp = pParse->nMem+1;
170788 pParse->nMem += 3;
170800 pWin->regApp = pParse->nMem+1;
170802 pParse->nMem += 2;
171363 regArg = pParse->nMem+1;
171364 pParse->nMem += nArg;
171457 int regString = ++pParse->nMem; /* Reg. for constant value '' */
172215 regNew = pParse->nMem+1;
172216 pParse->nMem += nInput;
172217 regRecord = ++pParse->nMem;
172218 s.regRowid = ++pParse->nMem;
172224 regStart = ++pParse->nMem;
172227 regEnd = ++pParse->nMem;
172237 regPeer = pParse->nMem+1; pParse->nMem += nPeer;
172238 s.start.reg = pParse->nMem+1; pParse->nMem += nPeer;
172239 s.current.reg = pParse->nMem+1; pParse->nMem += nPeer;
172240 s.end.reg = pParse->nMem+1; pParse->nMem += nPeer;
172263 regFlushPart = ++pParse->nMem;