Lines Matching defs:nIdx
123989 int nIdx; /* Number of indices */
124091 for(nIdx=0, pIdx=pTab->pIndex; pIdx; pIdx=pIdx->pNext, nIdx++){
124245 aToOpen = sqlite3DbMallocRawNN(db, nIdx+2);
124250 memset(aToOpen, 1, nIdx+1);
124251 aToOpen[nIdx+1] = 0;
129650 int nIdx;
129651 nIdx = sqlite3OpenTableAndIndices(pParse, pTab, OP_OpenWrite, 0, -1, 0,
129653 aRegIdx = sqlite3DbMallocRawNN(db, sizeof(int)*(nIdx+2));
129657 for(i=0, pIdx=pTab->pIndex; i<nIdx; pIdx=pIdx->pNext, i++){
130134 int nIdx; /* Size of the array */
130164 if( i>=pIter->u.ax.nIdx ){
130214 ** register identified by aRegIdx[nIdx] - in other words in the first
130527 int nIdx, jj;
130531 for(nIdx=0, pIdx=pTab->pIndex; pIdx; pIdx=pIdx->pNext, nIdx++){
130532 assert( aRegIdx[nIdx]>0 );
130535 sIdxIter.u.ax.nIdx = nIdx;
130536 nByte = (sizeof(IndexListTerm)+1)*nIdx + nIdx;
130539 bUsed = (u8*)&sIdxIter.u.ax.aIdx[nIdx];
130562 assert( i==nIdx );
135961 int nIdx; /* Number of indexes on pTab */
135964 for(nIdx=0, pIdx=pTab->pIndex; pIdx; pIdx=pIdx->pNext, nIdx++){ cnt++; }
135965 if( nIdx>mxIdx ) mxIdx = nIdx;
148141 int nIdx; /* Number of indices that need updating */
148263 for(nIdx=0, pIdx=pTab->pIndex; pIdx; pIdx=pIdx->pNext, nIdx++){
148280 aXRef = sqlite3DbMallocRawNN(db, sizeof(int) * (pTab->nCol+nIdx+1) + nIdx+2 );
148283 aToOpen = (u8*)(aRegIdx+nIdx+1);
148284 memset(aToOpen, 1, nIdx+1);
148285 aToOpen[nIdx+1] = 0;
148439 memset(aToOpen, 1, nIdx+1);
148652 if( eOnePass==ONEPASS_MULTI && (nIdx-(aiCurOnePass[1]>=0))>0 ){
194425 int nIdx = 0; /* Valid entries in aIdx[] */
194436 if( nIdx>=nAlloc ){
194446 aIdx[nIdx++] = sqlite3_column_int(pSelect, 0);
194461 for(i=0; rc==SQLITE_OK && i<nIdx; i++){
203263 ** nIdx. The aIdx array contains the set of integers from 0 to
203264 ** (nIdx-1) in no particular order. This function sorts the values
203280 int nIdx,
203284 if( nIdx>1 ){
203288 int nLeft = nIdx/2;
203289 int nRight = nIdx-nLeft;
203323 for(jj=1; jj<nIdx; jj++){
203335 ** nIdx. The aIdx array contains the set of integers from 0 to
203336 ** (nIdx-1) in no particular order. This function sorts the values
203347 int nIdx,
203352 if( nIdx>1 ){
203357 int nLeft = nIdx/2;
203358 int nRight = nIdx-nLeft;
203388 for(jj=1; jj<nIdx; jj++){
236971 int nIdx; /* Number of entries in aIdx[] */
237650 for(i=0; i<(pSorter->nIdx-1); i++){
237826 pSorter->nIdx = nPhrase;