Lines Matching defs:iIdx
12866 ** Query for the details of phrase match iIdx within the current row.
12867 ** Phrase matches are numbered starting from zero, so the iIdx argument
13034 int (*xInst)(Fts5Context*, int iIdx, int *piPhrase, int *piCol, int *piOff);
69788 int iIdx = 0;
69865 iIdx = (offset/ovflSize);
69866 nextPage = pCur->aOverflow[iIdx];
69875 assert( pCur->aOverflow[iIdx]==0
69876 || pCur->aOverflow[iIdx]==nextPage
69878 pCur->aOverflow[iIdx] = nextPage;
69889 if( pCur->aOverflow[iIdx+1] ){
69890 nextPage = pCur->aOverflow[iIdx+1];
69953 iIdx++;
70113 ** asserts that page number iChild is the left-child if the iIdx'th
70114 ** cell in page pParent. Or, if iIdx is equal to the total number of
70118 static void assertParentIndex(MemPage *pParent, int iIdx, Pgno iChild){
70121 assert( iIdx<=pParent->nCell );
70122 if( iIdx==pParent->nCell ){
70125 assert( get4byte(findCell(pParent, iIdx))==iChild );
73427 int const iIdx = pCur->aiIdx[iPage-1];
73439 && pParent->nCell==iIdx
73478 rc = balance_nonroot(pParent, iIdx, pSpace, iPage==1,
74690 int iIdx; /* Index of child node in parent */
74727 ** points at. This is the right-child if (iIdx==pPage->nCell).
74729 iIdx = pCur->ix;
74730 if( iIdx==pPage->nCell ){
74733 rc = moveToChild(pCur, get4byte(findCell(pPage, iIdx)));
85448 SQLITE_API int sqlite3_preupdate_old(sqlite3 *db, int iIdx, sqlite3_value **ppValue){
85454 ** SQLITE_UPDATE pre-update callback, and that iIdx is within range. */
85460 iIdx = sqlite3TableColumnToIndex(p->pPk, iIdx);
85462 if( iIdx>=p->pCsr->nField || iIdx<0 ){
85487 pMem = *ppValue = &p->pUnpacked->aMem[iIdx];
85488 if( iIdx==p->pTab->iPKey ){
85490 }else if( iIdx>=p->pUnpacked->nField ){
85492 }else if( p->pTab->aCol[iIdx].affinity==SQLITE_AFF_REAL ){
85540 SQLITE_API int sqlite3_preupdate_new(sqlite3 *db, int iIdx, sqlite3_value **ppValue){
85550 iIdx = sqlite3TableColumnToIndex(p->pPk, iIdx);
85552 if( iIdx>=p->pCsr->nField || iIdx<0 ){
85572 pMem = &pUnpack->aMem[iIdx];
85573 if( iIdx==p->pTab->iPKey ){
85575 }else if( iIdx>=pUnpack->nField ){
85579 /* For an UPDATE, memory cell (p->iNewReg+1+iIdx) contains the required
85592 assert( iIdx>=0 && iIdx<p->pCsr->nField );
85593 pMem = &p->aNew[iIdx];
85595 if( iIdx==p->pTab->iPKey ){
85598 rc = sqlite3VdbeMemCopy(pMem, &p->v->aMem[p->iNewReg+1+iIdx]);
114594 Pgno iIdx = pIdx->tnum;
114596 if( (iDestroyed==0 || (iIdx<iDestroyed)) && iIdx>iLargest ){
114597 iLargest = iIdx;
115013 int iIdx = pParse->nTab++; /* Btree cursor used for pIndex */
115063 sqlite3VdbeAddOp4(v, OP_OpenWrite, iIdx, (int)tnum, iDb,
115087 sqlite3VdbeAddOp3(v, OP_SorterData, iSorter, regRecord, iIdx);
115096 sqlite3VdbeAddOp1(v, OP_SeekEnd, iIdx);
115098 sqlite3VdbeAddOp2(v, OP_IdxInsert, iIdx, regRecord);
115105 sqlite3VdbeAddOp1(v, OP_Close, iIdx);
171622 int iIdx;
171703 iIdx = 1;
171705 pInfo->aConstraintUsage[iCons].argvIndex = iIdx++;
171710 pInfo->aConstraintUsage[iLangidCons].argvIndex = iIdx++;
171714 pInfo->aConstraintUsage[iDocidGe].argvIndex = iIdx++;
171718 pInfo->aConstraintUsage[iDocidLe].argvIndex = iIdx++;
173318 int iIdx;
173332 iIdx = 0;
173333 if( eSearch!=FTS3_FULLSCAN_SEARCH ) pCons = apVal[iIdx++];
173334 if( idxNum & FTS3_HAVE_LANGID ) pLangid = apVal[iIdx++];
173335 if( idxNum & FTS3_HAVE_DOCID_GE ) pDocidGe = apVal[iIdx++];
173336 if( idxNum & FTS3_HAVE_DOCID_LE ) pDocidLe = apVal[iIdx++];
173337 assert( iIdx==nVal );
180363 int iIdx; /* Index within level, or 0x7FFFFFFF for PT */
181859 pReader->iIdx = iAge;
181992 pReader->iIdx = 0x7FFFFFFF;
182033 rc = pRhs->iIdx - pLhs->iIdx;
182054 rc = pRhs->iIdx - pLhs->iIdx;
182066 rc = pRhs->iIdx - pLhs->iIdx;
182186 int iIdx, /* Value for "idx" field */
182198 sqlite3_bind_int(pStmt, 2, iIdx);
182606 int iIdx /* Value for 'idx' column of %_segdir */
182622 rc = fts3WriteSegdir(p, iLevel, iIdx,
182627 rc = fts3WriteSegdir(p, iLevel, iIdx,
183371 int iIdx = 0;
183395 sqlite3_bind_int(pUpdate1, 1, iIdx++);
183441 int iIdx = 0; /* Index of new segment */
183483 rc = fts3AllocateSegdirIdx(p, iLangid, iIndex, iLevel+1, &iIdx);
183515 rc = fts3SegWriterFlush(p, pWriter, iNewLevel, iIdx);
183930 int iIdx; /* Index of *output* segment in iAbsLevel+1 */
184376 pWriter->iIdx, /* idx */
184442 ** It checks if the existing segment with index value iIdx at absolute level
184458 int iIdx, /* Index of candidate output segment */
184476 /* Read the %_segdir entry for index iIdx absolute level (iAbsLevel+1) */
184478 sqlite3_bind_int(pSelect, 2, iIdx);
184537 pWriter->iIdx = iIdx;
184627 ** with idx value iIdx.
184654 int iIdx, /* Index of new output segment */
184696 pWriter->iIdx = iIdx;
184709 ** DELETE FROM %_segdir WHERE level = :iAbsLevel AND idx = :iIdx
184710 ** UPDATE %_segdir SET idx = idx - 1 WHERE level = :iAbsLevel AND idx > :iIdx
184719 int iIdx /* Index of %_segdir entry to delete */
184727 sqlite3_bind_int(pDelete, 2, iIdx);
184865 ** Remove all terms smaller than zTerm/nTerm from segment iIdx in absolute
184876 int iIdx, /* Index within level of segment to modify */
184892 sqlite3_bind_int(pFetch, 2, iIdx);
184937 sqlite3_bind_int(pChomp, 4, iIdx);
184973 /* Find the Fts3SegReader object with Fts3SegReader.iIdx==i. It is hiding
184977 if( pSeg->iIdx==i ) break;
184979 assert( j<pCsr->nSegment && pSeg->iIdx==i );
184985 rc = fts3RemoveSegdirEntry(p, iAbsLevel, pSeg->iIdx);
184994 rc = fts3TruncateSegment(p, iAbsLevel, pSeg->iIdx, zTerm, nTerm);
185144 int iIdx = 0; /* Largest idx in level (iAbsLevel+1) */
185213 rc = fts3IncrmergeOutputIdx(p, iAbsLevel, &iIdx);
185215 if( iIdx==0 || (bUseHint && iIdx==1) ){
185238 if( bUseHint && iIdx>0 ){
185241 rc = fts3IncrmergeLoad(p, iAbsLevel, iIdx-1, zKey, nKey, pWriter);
185243 rc = fts3IncrmergeWriter(p, iAbsLevel, iIdx, pCsr, pWriter);
193169 int iIdx = 0;
193184 for(ii=0; ii<pIdxInfo->nConstraint && iIdx<(int)(sizeof(zIdxStr)-1); ii++){
193227 zIdxStr[iIdx++] = op;
193228 zIdxStr[iIdx++] = (char)(p->iColumn - 1 + '0');
193229 pIdxInfo->aConstraintUsage[ii].argvIndex = (iIdx/2);
193237 if( iIdx>0 && 0==(pIdxInfo->idxStr = sqlite3_mprintf("%s", zIdxStr)) ){
193241 nRow = pRtree->nRowEst >> (iIdx/2);
211313 ** Query for the details of phrase match iIdx within the current row.
211314 ** Phrase matches are numbered starting from zero, so the iIdx argument
211481 int (*xInst)(Fts5Context*, int iIdx, int *piPhrase, int *piCol, int *piOff);
212161 int iIdx,
215154 int iIdx; /* Index (main or aPrefix[] entry) */
215170 int iIdx,
215188 hash = (hash << 3) ^ hash ^ iIdx;
215192 if( pEntry->iIdx==iIdx
215206 pEntry->iIdx = iIdx;
224930 int iIdx, /* Index to scan for data */
224968 if( iIdx!=0 ){
224988 pToken[0] = FTS5_MAIN_PREFIX + iIdx;
225295 int iIdx = 0; /* Index to search */
225299 /* Figure out which index to search and set iIdx accordingly. If this
225300 ** is a prefix query for which there is no prefix index, set iIdx to
225312 iIdx = 1+pConfig->nPrefix;
225317 for(iIdx=1; iIdx<=pConfig->nPrefix; iIdx++){
225318 int nIdxChar = pConfig->aPrefix[iIdx-1];
225320 if( nIdxChar==nChar+1 ) iPrefixIdx = iIdx;
225324 if( iIdx<=pConfig->nPrefix ){
225327 buf.p[0] = (u8)(FTS5_MAIN_PREFIX + iIdx);
225519 int iIdx,
225527 if( iIdx>=0 ) ret += (ret<<3) + (FTS5_MAIN_PREFIX + iIdx);
225579 int iIdx,
225594 cksum ^= sqlite3Fts5IndexEntryCksum(rowid, 0, 0, iIdx, z, n);
225603 cksum ^= sqlite3Fts5IndexEntryCksum(rowid, iCol, iOff, iIdx, z, n);
225667 int iIdx = (pPrev->p[0] - FTS5_MAIN_PREFIX);
225668 int flags = (iIdx==0 ? 0 : FTS5INDEX_QUERY_PREFIX);
225674 rc = fts5QueryCksum(p, iIdx, zTerm, nTerm, flags, &ck1);
225677 rc = fts5QueryCksum(p, iIdx, zTerm, nTerm, f, &ck2);
225695 if( iIdx>0 && rc==SQLITE_OK ){
225698 rc = fts5QueryCksum(p, iIdx, zTerm, nTerm, f, &ck2);
225701 if( iIdx>0 && rc==SQLITE_OK ){
225704 rc = fts5QueryCksum(p, iIdx, zTerm, nTerm, f, &ck2);
228510 int iIdx,
228520 if( iIdx<0 || iIdx>=pCsr->nInstCount ){
228524 *piPhrase = pCsr->aInst[iIdx*3];
228525 *piCol = pCsr->aInst[iIdx*3 + 2];
228529 *piPhrase = pCsr->aInst[iIdx*3];
228530 *piCol = pCsr->aInst[iIdx*3 + 1];
228531 *piOff = pCsr->aInst[iIdx*3 + 2];