Searched refs:aIdx (Results 1 – 2 of 2) sorted by relevance
6109 int aIdx[5]; /* Constraints on start, stop, step, LIMIT, OFFSET */ in seriesBestIndex() local6117 aIdx[0] = aIdx[1] = aIdx[2] = aIdx[3] = aIdx[4] = -1; in seriesBestIndex()6129 aIdx[3] = i; in seriesBestIndex()6133 aIdx[4] = i; in seriesBestIndex()6152 aIdx[iCol] = i; in seriesBestIndex()6155 if( aIdx[3]==0 ){ in seriesBestIndex()6158 aIdx[4] = 0; in seriesBestIndex()6161 if( (j = aIdx[i])>=0 ){ in seriesBestIndex()
134635 IndexListTerm *aIdx; /* Array of IndexListTerms */134652 *pIx = pIter->u.ax.aIdx[0].ix;134653 return pIter->u.ax.aIdx[0].p;134668 *pIx = pIter->u.ax.aIdx[i].ix;134669 return pIter->u.ax.aIdx[i].p;135009 sIdxIter.u.ax.aIdx = 0; /* Silence harmless compiler warning */135038 sIdxIter.u.ax.aIdx = sqlite3DbMallocZero(db, nByte);135039 if( sIdxIter.u.ax.aIdx==0 ) return; /* OOM */135040 bUsed = (u8*)&sIdxIter.u.ax.aIdx[nIdx];135041 pUpsert->pToFree = sIdxIter.u.ax.aIdx;[all …]