Home
last modified time | relevance | path

Searched refs:iIdx (Results 1 – 19 of 19) sorted by relevance

/sqlite-3.40.0/ext/fts5/
H A Dfts5_buffer.c332 int iIdx; /* Index (main or aPrefix[] entry) */ member
348 int iIdx, in sqlite3Fts5TermsetAdd() argument
366 hash = (hash << 3) ^ hash ^ iIdx; in sqlite3Fts5TermsetAdd()
370 if( pEntry->iIdx==iIdx in sqlite3Fts5TermsetAdd()
384 pEntry->iIdx = iIdx; in sqlite3Fts5TermsetAdd()
H A Dfts5_index.c5241 if( iIdx!=0 ){ in fts5SetupPrefixIter()
5261 pToken[0] = FTS5_MAIN_PREFIX + iIdx; in fts5SetupPrefixIter()
5585 iIdx = 1+pConfig->nPrefix; in sqlite3Fts5IndexQuery()
5590 for(iIdx=1; iIdx<=pConfig->nPrefix; iIdx++){ in sqlite3Fts5IndexQuery()
5597 if( iIdx<=pConfig->nPrefix ){ in sqlite3Fts5IndexQuery()
5600 buf.p[0] = (u8)(FTS5_MAIN_PREFIX + iIdx); in sqlite3Fts5IndexQuery()
5796 int iIdx, in sqlite3Fts5IndexEntryCksum() argument
5804 if( iIdx>=0 ) ret += (ret<<3) + (FTS5_MAIN_PREFIX + iIdx); in sqlite3Fts5IndexEntryCksum()
5856 int iIdx, in fts5QueryCksum() argument
5972 if( iIdx>0 && rc==SQLITE_OK ){ in fts5TestTerm()
[all …]
H A Dfts5_main.c1997 int iIdx, in fts5ApiInst() argument
2007 if( iIdx<0 || iIdx>=pCsr->nInstCount ){ in fts5ApiInst()
2011 *piPhrase = pCsr->aInst[iIdx*3]; in fts5ApiInst()
2012 *piCol = pCsr->aInst[iIdx*3 + 2]; in fts5ApiInst()
2016 *piPhrase = pCsr->aInst[iIdx*3]; in fts5ApiInst()
2017 *piCol = pCsr->aInst[iIdx*3 + 1]; in fts5ApiInst()
2018 *piOff = pCsr->aInst[iIdx*3 + 2]; in fts5ApiInst()
H A Dfts5.h284 int (*xInst)(Fts5Context*, int iIdx, int *piPhrase, int *piCol, int *piOff);
H A Dfts5_tcl.c337 int iIdx, ip, ic, io; in xF5tApi() local
338 if( Tcl_GetIntFromObj(interp, objv[2], &iIdx) ){ in xF5tApi()
341 rc = p->pApi->xInst(p->pFts, iIdx, &ip, &ic, &io); in xF5tApi()
H A Dfts5Int.h400 int iIdx,
/sqlite-3.40.0/src/
H A Dvdbeapi.c1941 iIdx = sqlite3TableColumnToIndex(p->pPk, iIdx); in sqlite3_preupdate_old()
1943 if( iIdx>=p->pCsr->nField || iIdx<0 ){ in sqlite3_preupdate_old()
1970 if( iIdx==p->pTab->iPKey ){ in sqlite3_preupdate_old()
2043 iIdx = sqlite3TableColumnToIndex(p->pPk, iIdx); in sqlite3_preupdate_new()
2045 if( iIdx>=p->pCsr->nField || iIdx<0 ){ in sqlite3_preupdate_new()
2065 pMem = &pUnpack->aMem[iIdx]; in sqlite3_preupdate_new()
2066 if( iIdx==p->pTab->iPKey ){ in sqlite3_preupdate_new()
2068 }else if( iIdx>=pUnpack->nField ){ in sqlite3_preupdate_new()
2085 assert( iIdx>=0 && iIdx<p->pCsr->nField ); in sqlite3_preupdate_new()
2086 pMem = &p->aNew[iIdx]; in sqlite3_preupdate_new()
[all …]
H A Dtest_func.c484 int iIdx; /* Required field */ in test_extract() local
489 iIdx = sqlite3_value_int(argv[1]); in test_extract()
494 for(iCurrent=0; pHdr<pEndHdr && iCurrent<=iIdx; iCurrent++){ in test_extract()
505 if( iCurrent==iIdx ){ in test_extract()
H A Dbtree.c4949 int iIdx = 0; in accessPayload() local
5028 iIdx = (offset/ovflSize); in accessPayload()
5038 assert( pCur->aOverflow[iIdx]==0 in accessPayload()
5041 pCur->aOverflow[iIdx] = nextPage; in accessPayload()
5052 if( pCur->aOverflow[iIdx+1] ){ in accessPayload()
5116 iIdx++; in accessPayload()
5282 assert( iIdx<=pParent->nCell ); in assertParentIndex()
5283 if( iIdx==pParent->nCell ){ in assertParentIndex()
8791 && pParent->nCell==iIdx in balance()
10129 iIdx = pCur->ix; in sqlite3BtreeCount()
[all …]
H A Dbuild.c3306 Pgno iIdx = pIdx->tnum; in destroyTable() local
3308 if( (iDestroyed==0 || (iIdx<iDestroyed)) && iIdx>iLargest ){ in destroyTable()
3309 iLargest = iIdx; in destroyTable()
3736 int iIdx = pParse->nTab++; /* Btree cursor used for pIndex */ in sqlite3RefillIndex() local
3786 sqlite3VdbeAddOp4(v, OP_OpenWrite, iIdx, (int)tnum, iDb, in sqlite3RefillIndex()
3810 sqlite3VdbeAddOp3(v, OP_SorterData, iSorter, regRecord, iIdx); in sqlite3RefillIndex()
3819 sqlite3VdbeAddOp1(v, OP_SeekEnd, iIdx); in sqlite3RefillIndex()
3821 sqlite3VdbeAddOp2(v, OP_IdxInsert, iIdx, regRecord); in sqlite3RefillIndex()
3828 sqlite3VdbeAddOp1(v, OP_Close, iIdx); in sqlite3RefillIndex()
H A Dtclsqlite.c3577 int iIdx; in DbObjCmd()
3583 if( Tcl_GetIntFromObj(interp, objv[3], &iIdx) ){ in DbObjCmd()
3588 rc = sqlite3_preupdate_old(pDb->db, iIdx, &pValue); in DbObjCmd()
3591 rc = sqlite3_preupdate_new(pDb->db, iIdx, &pValue); in DbObjCmd()
/sqlite-3.40.0/ext/fts3/
H A Dfts3_write.c1642 pReader->iIdx = iAge; in sqlite3Fts3SegReaderNew()
1775 pReader->iIdx = 0x7FFFFFFF; in sqlite3Fts3SegReaderPending()
1816 rc = pRhs->iIdx - pLhs->iIdx; in fts3SegReaderCmp()
1837 rc = pRhs->iIdx - pLhs->iIdx; in fts3SegReaderDoclistCmp()
1849 rc = pRhs->iIdx - pLhs->iIdx; in fts3SegReaderDoclistCmpRev()
3156 int iIdx = 0; in fts3PromoteSegments() local
4329 pWriter->iIdx = iIdx; in fts3IncrmergeLoad()
4488 pWriter->iIdx = iIdx; in fts3IncrmergeWriter()
4769 if( pSeg->iIdx==i ) break; in fts3IncrmergeChomp()
5007 if( iIdx==0 || (bUseHint && iIdx==1) ){ in sqlite3Fts3Incrmerge()
[all …]
H A Dfts3.c1619 int iIdx; in fts3BestIndexMethod() local
1700 iIdx = 1; in fts3BestIndexMethod()
1702 pInfo->aConstraintUsage[iCons].argvIndex = iIdx++; in fts3BestIndexMethod()
1707 pInfo->aConstraintUsage[iLangidCons].argvIndex = iIdx++; in fts3BestIndexMethod()
1711 pInfo->aConstraintUsage[iDocidGe].argvIndex = iIdx++; in fts3BestIndexMethod()
1715 pInfo->aConstraintUsage[iDocidLe].argvIndex = iIdx++; in fts3BestIndexMethod()
3315 int iIdx; in fts3FilterMethod() local
3329 iIdx = 0; in fts3FilterMethod()
3330 if( eSearch!=FTS3_FULLSCAN_SEARCH ) pCons = apVal[iIdx++]; in fts3FilterMethod()
3331 if( idxNum & FTS3_HAVE_LANGID ) pLangid = apVal[iIdx++]; in fts3FilterMethod()
[all …]
/sqlite-3.40.0/test/
H A Dsoak.test77 set iIdx [expr {$iRun % [llength $SOAKTESTS]}]
78 source [file join $testdir [lindex $SOAKTESTS $iIdx]]
/sqlite-3.40.0/ext/fts3/tool/
H A Dfts3view.c492 int iIdx = sqlite3_column_int(pStmt, 1); in showSegdirMap() local
498 printf("level %2d idx %2d", iLevel, iIdx); in showSegdirMap()
501 printf(" idx %2d", iIdx); in showSegdirMap()
/sqlite-3.40.0/ext/lsm1/
H A Dlsm_ckpt.c246 static void ckptSetValue(CkptBuffer *p, int iIdx, u32 iVal, int *pRc){ in ckptSetValue() argument
248 if( iIdx>=p->nAlloc ){ in ckptSetValue()
249 int nNew = LSM_MAX(8, iIdx*2); in ckptSetValue()
257 p->aCkpt[iIdx] = iVal; in ckptSetValue()
H A Dlsm_tree.c254 static u32 intArrayEntry(IntArray *p, int iIdx){ in intArrayEntry() argument
255 return p->aArray[iIdx]; in intArrayEntry()
2321 int iIdx; in lsmTreeRollback() local
2330 for(iIdx = pMark->iRollback; iIdx<nIdx; iIdx++){ in lsmTreeRollback()
2332 pNode = treeShmptr(pDb, intArrayEntry(&pDb->rollback, iIdx)); in lsmTreeRollback()
/sqlite-3.40.0/ext/rtree/
H A Drtree.c1992 int iIdx = 0; in rtreeBestIndex() local
2007 for(ii=0; ii<pIdxInfo->nConstraint && iIdx<(int)(sizeof(zIdxStr)-1); ii++){ in rtreeBestIndex()
2050 zIdxStr[iIdx++] = op; in rtreeBestIndex()
2051 zIdxStr[iIdx++] = (char)(p->iColumn - 1 + '0'); in rtreeBestIndex()
2052 pIdxInfo->aConstraintUsage[ii].argvIndex = (iIdx/2); in rtreeBestIndex()
2060 if( iIdx>0 && 0==(pIdxInfo->idxStr = sqlite3_mprintf("%s", zIdxStr)) ){ in rtreeBestIndex()
2064 nRow = pRtree->nRowEst >> (iIdx/2); in rtreeBestIndex()
/sqlite-3.40.0/ext/expert/
H A Dsqlite3expert.c910 int iIdx = sqlite3_column_int(pInfo, 0); in idxFindCompatible() local
914 if( iIdx<nEq ){ in idxFindCompatible()