Lines Matching defs:iIdx
12808 ** Query for the details of phrase match iIdx within the current row.
12809 ** Phrase matches are numbered starting from zero, so the iIdx argument
12976 int (*xInst)(Fts5Context*, int iIdx, int *piPhrase, int *piCol, int *piOff);
73589 int iIdx = 0;
73668 iIdx = (offset/ovflSize);
73669 nextPage = pCur->aOverflow[iIdx];
73678 assert( pCur->aOverflow[iIdx]==0
73679 || pCur->aOverflow[iIdx]==nextPage
73681 pCur->aOverflow[iIdx] = nextPage;
73692 if( pCur->aOverflow[iIdx+1] ){
73693 nextPage = pCur->aOverflow[iIdx+1];
73756 iIdx++;
73914 ** asserts that page number iChild is the left-child if the iIdx'th
73915 ** cell in page pParent. Or, if iIdx is equal to the total number of
73919 static void assertParentIndex(MemPage *pParent, int iIdx, Pgno iChild){
73922 assert( iIdx<=pParent->nCell );
73923 if( iIdx==pParent->nCell ){
73926 assert( get4byte(findCell(pParent, iIdx))==iChild );
77419 int const iIdx = pCur->aiIdx[iPage-1];
77431 && pParent->nCell==iIdx
77470 rc = balance_nonroot(pParent, iIdx, pSpace, iPage==1,
78730 int iIdx; /* Index of child node in parent */
78767 ** points at. This is the right-child if (iIdx==pPage->nCell).
78769 iIdx = pCur->ix;
78770 if( iIdx==pPage->nCell ){
78773 rc = moveToChild(pCur, get4byte(findCell(pPage, iIdx)));
89830 SQLITE_API int sqlite3_preupdate_old(sqlite3 *db, int iIdx, sqlite3_value **ppValue){
89836 ** SQLITE_UPDATE pre-update callback, and that iIdx is within range. */
89842 iIdx = sqlite3TableColumnToIndex(p->pPk, iIdx);
89844 if( iIdx>=p->pCsr->nField || iIdx<0 ){
89870 pMem = *ppValue = &p->pUnpacked->aMem[iIdx];
89871 if( iIdx==p->pTab->iPKey ){
89873 }else if( iIdx>=p->pUnpacked->nField ){
89875 }else if( p->pTab->aCol[iIdx].affinity==SQLITE_AFF_REAL ){
89934 SQLITE_API int sqlite3_preupdate_new(sqlite3 *db, int iIdx, sqlite3_value **ppValue){
89944 iIdx = sqlite3TableColumnToIndex(p->pPk, iIdx);
89946 if( iIdx>=p->pCsr->nField || iIdx<0 ){
89966 pMem = &pUnpack->aMem[iIdx];
89967 if( iIdx==p->pTab->iPKey ){
89969 }else if( iIdx>=pUnpack->nField ){
89973 /* For an UPDATE, memory cell (p->iNewReg+1+iIdx) contains the required
89986 assert( iIdx>=0 && iIdx<p->pCsr->nField );
89987 pMem = &p->aNew[iIdx];
89989 if( iIdx==p->pTab->iPKey ){
89992 rc = sqlite3VdbeMemCopy(pMem, &p->v->aMem[p->iNewReg+1+iIdx]);
120779 Pgno iIdx = pIdx->tnum;
120781 if( (iDestroyed==0 || (iIdx<iDestroyed)) && iIdx>iLargest ){
120782 iLargest = iIdx;
121209 int iIdx = pParse->nTab++; /* Btree cursor used for pIndex */
121259 sqlite3VdbeAddOp4(v, OP_OpenWrite, iIdx, (int)tnum, iDb,
121283 sqlite3VdbeAddOp3(v, OP_SorterData, iSorter, regRecord, iIdx);
121292 sqlite3VdbeAddOp1(v, OP_SeekEnd, iIdx);
121294 sqlite3VdbeAddOp2(v, OP_IdxInsert, iIdx, regRecord);
121301 sqlite3VdbeAddOp1(v, OP_Close, iIdx);
181260 int iIdx;
181341 iIdx = 1;
181343 pInfo->aConstraintUsage[iCons].argvIndex = iIdx++;
181348 pInfo->aConstraintUsage[iLangidCons].argvIndex = iIdx++;
181352 pInfo->aConstraintUsage[iDocidGe].argvIndex = iIdx++;
181356 pInfo->aConstraintUsage[iDocidLe].argvIndex = iIdx++;
182956 int iIdx;
182970 iIdx = 0;
182971 if( eSearch!=FTS3_FULLSCAN_SEARCH ) pCons = apVal[iIdx++];
182972 if( idxNum & FTS3_HAVE_LANGID ) pLangid = apVal[iIdx++];
182973 if( idxNum & FTS3_HAVE_DOCID_GE ) pDocidGe = apVal[iIdx++];
182974 if( idxNum & FTS3_HAVE_DOCID_LE ) pDocidLe = apVal[iIdx++];
182975 assert( iIdx==nVal );
190025 int iIdx; /* Index within level, or 0x7FFFFFFF for PT */
191529 pReader->iIdx = iAge;
191662 pReader->iIdx = 0x7FFFFFFF;
191703 rc = pRhs->iIdx - pLhs->iIdx;
191724 rc = pRhs->iIdx - pLhs->iIdx;
191736 rc = pRhs->iIdx - pLhs->iIdx;
191856 int iIdx, /* Value for "idx" field */
191868 sqlite3_bind_int(pStmt, 2, iIdx);
192276 int iIdx /* Value for 'idx' column of %_segdir */
192292 rc = fts3WriteSegdir(p, iLevel, iIdx,
192297 rc = fts3WriteSegdir(p, iLevel, iIdx,
193043 int iIdx = 0;
193067 sqlite3_bind_int(pUpdate1, 1, iIdx++);
193113 int iIdx = 0; /* Index of new segment */
193155 rc = fts3AllocateSegdirIdx(p, iLangid, iIndex, iLevel+1, &iIdx);
193187 rc = fts3SegWriterFlush(p, pWriter, iNewLevel, iIdx);
193602 int iIdx; /* Index of *output* segment in iAbsLevel+1 */
194051 pWriter->iIdx, /* idx */
194121 ** It checks if the existing segment with index value iIdx at absolute level
194137 int iIdx, /* Index of candidate output segment */
194155 /* Read the %_segdir entry for index iIdx absolute level (iAbsLevel+1) */
194157 sqlite3_bind_int(pSelect, 2, iIdx);
194216 pWriter->iIdx = iIdx;
194306 ** with idx value iIdx.
194333 int iIdx, /* Index of new output segment */
194375 pWriter->iIdx = iIdx;
194388 ** DELETE FROM %_segdir WHERE level = :iAbsLevel AND idx = :iIdx
194389 ** UPDATE %_segdir SET idx = idx - 1 WHERE level = :iAbsLevel AND idx > :iIdx
194398 int iIdx /* Index of %_segdir entry to delete */
194406 sqlite3_bind_int(pDelete, 2, iIdx);
194544 ** Remove all terms smaller than zTerm/nTerm from segment iIdx in absolute
194555 int iIdx, /* Index within level of segment to modify */
194571 sqlite3_bind_int(pFetch, 2, iIdx);
194616 sqlite3_bind_int(pChomp, 4, iIdx);
194652 /* Find the Fts3SegReader object with Fts3SegReader.iIdx==i. It is hiding
194656 if( pSeg->iIdx==i ) break;
194658 assert( j<pCsr->nSegment && pSeg->iIdx==i );
194664 rc = fts3RemoveSegdirEntry(p, iAbsLevel, pSeg->iIdx);
194673 rc = fts3TruncateSegment(p, iAbsLevel, pSeg->iIdx, zTerm, nTerm);
194823 int iIdx = 0; /* Largest idx in level (iAbsLevel+1) */
194892 rc = fts3IncrmergeOutputIdx(p, iAbsLevel, &iIdx);
194894 if( iIdx==0 || (bUseHint && iIdx==1) ){
194917 if( bUseHint && iIdx>0 ){
194920 rc = fts3IncrmergeLoad(p, iAbsLevel, iIdx-1, zKey, nKey, pWriter);
194922 rc = fts3IncrmergeWriter(p, iAbsLevel, iIdx, pCsr, pWriter);
202938 int iIdx = 0;
202953 for(ii=0; ii<pIdxInfo->nConstraint && iIdx<(int)(sizeof(zIdxStr)-1); ii++){
202996 zIdxStr[iIdx++] = op;
202997 zIdxStr[iIdx++] = (char)(p->iColumn - 1 + '0');
202998 pIdxInfo->aConstraintUsage[ii].argvIndex = (iIdx/2);
203006 if( iIdx>0 && 0==(pIdxInfo->idxStr = sqlite3_mprintf("%s", zIdxStr)) ){
203010 nRow = pRtree->nRowEst >> (iIdx/2);
221469 ** Query for the details of phrase match iIdx within the current row.
221470 ** Phrase matches are numbered starting from zero, so the iIdx argument
221637 int (*xInst)(Fts5Context*, int iIdx, int *piPhrase, int *piCol, int *piOff);
222329 int iIdx,
225329 int iIdx; /* Index (main or aPrefix[] entry) */
225345 int iIdx,
225363 hash = (hash << 3) ^ hash ^ iIdx;
225367 if( pEntry->iIdx==iIdx
225381 pEntry->iIdx = iIdx;
235208 int iIdx, /* Index to scan for data */
235246 if( iIdx!=0 ){
235266 pToken[0] = FTS5_MAIN_PREFIX + iIdx;
235573 int iIdx = 0; /* Index to search */
235577 /* Figure out which index to search and set iIdx accordingly. If this
235578 ** is a prefix query for which there is no prefix index, set iIdx to
235590 iIdx = 1+pConfig->nPrefix;
235595 for(iIdx=1; iIdx<=pConfig->nPrefix; iIdx++){
235596 int nIdxChar = pConfig->aPrefix[iIdx-1];
235598 if( nIdxChar==nChar+1 ) iPrefixIdx = iIdx;
235602 if( iIdx<=pConfig->nPrefix ){
235605 buf.p[0] = (u8)(FTS5_MAIN_PREFIX + iIdx);
235801 int iIdx,
235809 if( iIdx>=0 ) ret += (ret<<3) + (FTS5_MAIN_PREFIX + iIdx);
235861 int iIdx,
235876 cksum ^= sqlite3Fts5IndexEntryCksum(rowid, 0, 0, iIdx, z, n);
235885 cksum ^= sqlite3Fts5IndexEntryCksum(rowid, iCol, iOff, iIdx, z, n);
235949 int iIdx = (pPrev->p[0] - FTS5_MAIN_PREFIX);
235950 int flags = (iIdx==0 ? 0 : FTS5INDEX_QUERY_PREFIX);
235956 rc = fts5QueryCksum(p, iIdx, zTerm, nTerm, flags, &ck1);
235959 rc = fts5QueryCksum(p, iIdx, zTerm, nTerm, f, &ck2);
235977 if( iIdx>0 && rc==SQLITE_OK ){
235980 rc = fts5QueryCksum(p, iIdx, zTerm, nTerm, f, &ck2);
235983 if( iIdx>0 && rc==SQLITE_OK ){
235986 rc = fts5QueryCksum(p, iIdx, zTerm, nTerm, f, &ck2);
238825 int iIdx,
238835 if( iIdx<0 || iIdx>=pCsr->nInstCount ){
238839 *piPhrase = pCsr->aInst[iIdx*3];
238840 *piCol = pCsr->aInst[iIdx*3 + 2];
238844 *piPhrase = pCsr->aInst[iIdx*3];
238845 *piCol = pCsr->aInst[iIdx*3 + 1];
238846 *piOff = pCsr->aInst[iIdx*3 + 2];