Lines Matching defs:iIdx
55505 int iIdx = 0;
55584 iIdx = (offset/ovflSize);
55585 nextPage = pCur->aOverflow[iIdx];
55589 for( ; rc==SQLITE_OK && amt>0 && nextPage; iIdx++){
55593 assert(!pCur->aOverflow[iIdx] || pCur->aOverflow[iIdx]==nextPage);
55594 pCur->aOverflow[iIdx] = nextPage;
55609 if( pCur->aOverflow[iIdx+1] ){
55610 nextPage = pCur->aOverflow[iIdx+1];
55827 ** asserts that page number iChild is the left-child if the iIdx'th
55828 ** cell in page pParent. Or, if iIdx is equal to the total number of
55832 static void assertParentIndex(MemPage *pParent, int iIdx, Pgno iChild){
55833 assert( iIdx<=pParent->nCell );
55834 if( iIdx==pParent->nCell ){
55837 assert( get4byte(findCell(pParent, iIdx))==iChild );
58395 int const iIdx = pCur->aiIdx[iPage-1];
58404 && pParent->nCell==iIdx
58442 rc = balance_nonroot(pParent, iIdx, pSpace, iPage==1, pCur->hints);
59229 int iIdx; /* Index of child node in parent */
59266 ** points at. This is the right-child if (iIdx==pPage->nCell).
59268 iIdx = pCur->aiIdx[pCur->iPage];
59269 if( iIdx==pPage->nCell ){
59272 rc = moveToChild(pCur, get4byte(findCell(pPage, iIdx)));
88372 int iIdx = pIdx->tnum;
88374 if( (iDestroyed==0 || (iIdx<iDestroyed)) && iIdx>iLargest ){
88375 iLargest = iIdx;
88747 int iIdx = pParse->nTab++; /* Btree cursor used for pIndex */
88795 sqlite3VdbeAddOp4(v, OP_OpenWrite, iIdx, tnum, iDb,
88812 sqlite3VdbeAddOp3(v, OP_IdxInsert, iIdx, regRecord, 1);
88819 sqlite3VdbeAddOp1(v, OP_Close, iIdx);
128336 int iIdx;
128410 iIdx = 1;
128412 pInfo->aConstraintUsage[iCons].argvIndex = iIdx++;
128417 pInfo->aConstraintUsage[iLangidCons].argvIndex = iIdx++;
128421 pInfo->aConstraintUsage[iDocidGe].argvIndex = iIdx++;
128425 pInfo->aConstraintUsage[iDocidLe].argvIndex = iIdx++;
129932 int iIdx;
129942 iIdx = 0;
129943 if( eSearch!=FTS3_FULLSCAN_SEARCH ) pCons = apVal[iIdx++];
129944 if( idxNum & FTS3_HAVE_LANGID ) pLangid = apVal[iIdx++];
129945 if( idxNum & FTS3_HAVE_DOCID_GE ) pDocidGe = apVal[iIdx++];
129946 if( idxNum & FTS3_HAVE_DOCID_LE ) pDocidLe = apVal[iIdx++];
129947 assert( iIdx==nVal );
136837 int iIdx; /* Index within level, or 0x7FFFFFFF for PT */
138302 pReader->iIdx = iAge;
138431 pReader->iIdx = 0x7FFFFFFF;
138472 rc = pRhs->iIdx - pLhs->iIdx;
138493 rc = pRhs->iIdx - pLhs->iIdx;
138505 rc = pRhs->iIdx - pLhs->iIdx;
138624 int iIdx, /* Value for "idx" field */
138636 sqlite3_bind_int(pStmt, 2, iIdx);
139029 int iIdx /* Value for 'idx' column of %_segdir */
139045 rc = fts3WriteSegdir(p, iLevel, iIdx,
139050 rc = fts3WriteSegdir(p, iLevel, iIdx,
139783 int iIdx = 0;
139807 sqlite3_bind_int(pUpdate1, 1, iIdx++);
139853 int iIdx = 0; /* Index of new segment */
139895 rc = fts3AllocateSegdirIdx(p, iLangid, iIndex, iLevel+1, &iIdx);
139925 rc = fts3SegWriterFlush(p, pWriter, iNewLevel, iIdx);
140334 int iIdx; /* Index of *output* segment in iAbsLevel+1 */
140773 pWriter->iIdx, /* idx */
140839 ** It checks if the existing segment with index value iIdx at absolute level
140855 int iIdx, /* Index of candidate output segment */
140873 /* Read the %_segdir entry for index iIdx absolute level (iAbsLevel+1) */
140875 sqlite3_bind_int(pSelect, 2, iIdx);
140926 pWriter->iIdx = iIdx;
141005 ** with idx value iIdx.
141032 int iIdx, /* Index of new output segment */
141074 pWriter->iIdx = iIdx;
141087 ** DELETE FROM %_segdir WHERE level = :iAbsLevel AND idx = :iIdx
141088 ** UPDATE %_segdir SET idx = idx - 1 WHERE level = :iAbsLevel AND idx > :iIdx
141097 int iIdx /* Index of %_segdir entry to delete */
141105 sqlite3_bind_int(pDelete, 2, iIdx);
141240 ** Remove all terms smaller than zTerm/nTerm from segment iIdx in absolute
141251 int iIdx, /* Index within level of segment to modify */
141267 sqlite3_bind_int(pFetch, 2, iIdx);
141312 sqlite3_bind_int(pChomp, 4, iIdx);
141347 /* Find the Fts3SegReader object with Fts3SegReader.iIdx==i. It is hiding
141351 if( pSeg->iIdx==i ) break;
141353 assert( j<pCsr->nSegment && pSeg->iIdx==i );
141359 rc = fts3RemoveSegdirEntry(p, iAbsLevel, pSeg->iIdx);
141368 rc = fts3TruncateSegment(p, iAbsLevel, pSeg->iIdx, zTerm, nTerm);
141513 int iIdx = 0; /* Largest idx in level (iAbsLevel+1) */
141569 rc = fts3IncrmergeOutputIdx(p, iAbsLevel, &iIdx);
141571 if( iIdx==0 || (bUseHint && iIdx==1) ){
141587 if( bUseHint && iIdx>0 ){
141590 rc = fts3IncrmergeLoad(p, iAbsLevel, iIdx-1, zKey, nKey, pWriter);
141592 rc = fts3IncrmergeWriter(p, iAbsLevel, iIdx, pCsr, pWriter);
146321 int iIdx = 0;
146326 for(ii=0; ii<pIdxInfo->nConstraint && iIdx<(int)(sizeof(zIdxStr)-1); ii++){
146364 zIdxStr[iIdx++] = op;
146365 zIdxStr[iIdx++] = p->iColumn - 1 + '0';
146366 pIdxInfo->aConstraintUsage[ii].argvIndex = (iIdx/2);
146373 if( iIdx>0 && 0==(pIdxInfo->idxStr = sqlite3_mprintf("%s", zIdxStr)) ){
146377 nRow = pRtree->nRowEst / (iIdx + 1);