Lines Matching refs:nIdx

129624   int nIdx;              /* Number of indices */
129726 for(nIdx=0, pIdx=pTab->pIndex; pIdx; pIdx=pIdx->pNext, nIdx++){
129881 aToOpen = sqlite3DbMallocRawNN(db, nIdx+2);
129886 memset(aToOpen, 1, nIdx+1);
129887 aToOpen[nIdx+1] = 0;
136060 int nIdx;
136061 nIdx = sqlite3OpenTableAndIndices(pParse, pTab, OP_OpenWrite, 0, -1, 0,
136063 aRegIdx = sqlite3DbMallocRawNN(db, sizeof(int)*(nIdx+2));
136067 for(i=0, pIdx=pTab->pIndex; i<nIdx; pIdx=pIdx->pNext, i++){
136547 int nIdx; /* Size of the array */
136577 if( i>=pIter->u.ax.nIdx ){
136941 int nIdx, jj;
136945 for(nIdx=0, pIdx=pTab->pIndex; pIdx; pIdx=pIdx->pNext, nIdx++){
136946 assert( aRegIdx[nIdx]>0 );
136949 sIdxIter.u.ax.nIdx = nIdx;
136950 nByte = (sizeof(IndexListTerm)+1)*nIdx + nIdx;
136953 bUsed = (u8*)&sIdxIter.u.ax.aIdx[nIdx];
136976 assert( i==nIdx );
142381 int nIdx; /* Number of indexes on pTab */
142384 for(nIdx=0, pIdx=pTab->pIndex; pIdx; pIdx=pIdx->pNext, nIdx++){ cnt++; }
155711 int nIdx; /* Number of indices that need updating */
155833 for(nIdx=0, pIdx=pTab->pIndex; pIdx; pIdx=pIdx->pNext, nIdx++){
155850 aXRef = sqlite3DbMallocRawNN(db, sizeof(int) * (pTab->nCol+nIdx+1) + nIdx+2 );
155853 aToOpen = (u8*)(aRegIdx+nIdx+1);
155854 memset(aToOpen, 1, nIdx+1);
155855 aToOpen[nIdx+1] = 0;
156003 memset(aToOpen, 1, nIdx+1);
156228 if( eOnePass==ONEPASS_MULTI && (nIdx-(aiCurOnePass[1]>=0))>0 ){
203947 int nIdx = 0; /* Valid entries in aIdx[] */
203958 if( nIdx>=nAlloc ){
203968 aIdx[nIdx++] = sqlite3_column_int(pSelect, 0);
203983 for(i=0; rc==SQLITE_OK && i<nIdx; i++){
215799 int nIdx,
215804 if( nIdx>1 ){
215809 int nLeft = nIdx/2;
215810 int nRight = nIdx-nLeft;
215840 for(jj=1; jj<nIdx; jj++){
249357 int nIdx = 0;
249381 nIdx = i2;
249390 if( nIdx>0 ){
249391 memcpy(&aPg[nPg], aIdx, nIdx);
249392 nPg += nIdx;
249422 int nIdx = 0;
249429 nIdx = nPg-iPgIdx;
249430 aIdx = sqlite3Fts5MallocZero(&p->rc, ((i64)nIdx)+16);
249432 memcpy(aIdx, &aPg[iPgIdx], nIdx);
249521 for(iIdx=0; iIdx<nIdx; /* no-op */){
249559 for(iIdx=0; iIdx<nIdx; iKey++){
249675 for(iIdx=0; iIdx<nIdx; /* no-op */){
249686 if( iPgIdx==nPg && nIdx>0 && pSeg->iLeafPgno!=1 ){
253860 int nIdx; /* Number of entries in aIdx[] */
253865 #define SZ_FTS5SORTER(N) (offsetof(Fts5Sorter,nIdx)+((N+2)/2)*sizeof(i64))
254560 for(i=0; i<(pSorter->nIdx-1); i++){
254747 pSorter->nIdx = nPhrase;