Home
last modified time | relevance | path

Searched refs:iNext (Results 1 – 25 of 26) sorted by relevance

12

/sqlite-3.40.0/ext/fts3/
H A Dfts3_aux.c158 int iNext = 1; /* Next free argvIndex value */ in fts3auxBestIndexMethod() local
192 pInfo->aConstraintUsage[iEq].argvIndex = iNext++; in fts3auxBestIndexMethod()
199 pInfo->aConstraintUsage[iGe].argvIndex = iNext++; in fts3auxBestIndexMethod()
204 pInfo->aConstraintUsage[iLe].argvIndex = iNext++; in fts3auxBestIndexMethod()
209 pInfo->aConstraintUsage[iLangid].argvIndex = iNext++; in fts3auxBestIndexMethod()
382 int iNext = 0; in fts3auxFilterMethod() local
394 iEq = iNext++; in fts3auxFilterMethod()
398 iGe = iNext++; in fts3auxFilterMethod()
401 iLe = iNext++; in fts3auxFilterMethod()
404 if( iNext<nVal ){ in fts3auxFilterMethod()
[all …]
H A Dfts3_snippet.c349 static void fts3SnippetAdvance(char **ppIter, i64 *piIter, int iNext){ in fts3SnippetAdvance() argument
354 while( iIter<iNext ){ in fts3SnippetAdvance()
H A Dfts3_write.c1135 int iNext = 0; /* Result of query pNextIdx */ in fts3AllocateSegdirIdx() local
1147 iNext = sqlite3_column_int(pNextIdx, 0); in fts3AllocateSegdirIdx()
1158 if( iNext>=MergeCount(p) ){ in fts3AllocateSegdirIdx()
1163 *piIdx = iNext; in fts3AllocateSegdirIdx()
/sqlite-3.40.0/tool/
H A Dfuzzershell.c796 int iNext; /* Next block of SQL */ in main() local
1016 for(i=0; i<nIn; i=iNext+1){ in main()
1018 for(iNext=i+1; iNext<nIn && zIn[iNext]!='\n'; iNext++){} in main()
1024 for(; i<nIn; i=iNext, nTest++, g.zTestName[0]=0){ in main()
1040 for(iNext=i; iNext<nIn && strncmp(&zIn[iNext],"/****<",6)!=0; iNext++){} in main()
1041 cSaved = zIn[iNext]; in main()
1042 zIn[iNext] = 0; in main()
1055 int pct = (10*iNext)/nIn; in main()
1181 sqlite3_bind_blob(pStmt, 1, &zIn[i], iNext-i, SQLITE_STATIC); in main()
1194 zIn[iNext] = cSaved; in main()
H A Dmkkeywordhash.c46 int iNext; /* Index in aKeywordTable[] of next with same hash */ member
382 j = aKeywordTable[i].iNext; in reorder()
386 aKeywordTable[i].iNext = aKeywordTable[j].iNext; in reorder()
387 aKeywordTable[j].iNext = i+1; in reorder()
389 reorder(&aKeywordTable[i].iNext); in reorder()
534 aKeywordTable[i].iNext = aKWHash[h]; in main()
602 printf(" %3d,", aKeywordTable[i].iNext); in main()
657 j = aKeywordTable[j-1].iNext; in main()
H A Dshowdb.c954 int iNext; in page_usage_freelist() local
960 iNext = decodeInt32(a); in page_usage_freelist()
969 pgno = iNext; in page_usage_freelist()
/sqlite-3.40.0/src/
H A Dbackup.c27 Pgno iNext; /* Page number of the next source page to copy */ member
188 p->iNext = 1; in sqlite3_backup_init()
393 for(ii=0; (nPage<0 || ii<nPage) && p->iNext<=(Pgno)nSrcPage && !rc; ii++){ in sqlite3_backup_step()
394 const Pgno iSrcPg = p->iNext; /* Source page number */ in sqlite3_backup_step()
403 p->iNext++; in sqlite3_backup_step()
407 p->nRemaining = nSrcPage+1-p->iNext; in sqlite3_backup_step()
408 if( p->iNext>(Pgno)nSrcPage ){ in sqlite3_backup_step()
672 if( !isFatalError(p->rc) && iPage<p->iNext ){ in backupUpdate()
708 p->iNext = 1; in sqlite3BackupRestart()
746 b.iNext = 1; in sqlite3BtreeCopyFile()
H A Dmem3.c316 u32 iNext, prev, size, i, x; in memsys3Merge() local
319 for(i=*pRoot; i>0; i=iNext){ in memsys3Merge()
320 iNext = mem3.aPool[i].u.list.next; in memsys3Merge()
327 if( prev==iNext ){ in memsys3Merge()
328 iNext = mem3.aPool[prev].u.list.next; in memsys3Merge()
H A Ddbstat.c422 int iNext; in statDecodePage() local
425 iNext = get2byte(&aData[iOff]); in statDecodePage()
426 if( iNext<iOff+4 && iNext>0 ) goto statPageIsCorrupt; in statDecodePage()
427 iOff = iNext; in statDecodePage()
H A Dtest_bestindex.c601 static int iNext = 43; in tclBestIndex() local
609 sqlite3_snprintf(sizeof(zHdl), zHdl, "bestindex%d", iNext++); in tclBestIndex()
H A Dwherecode.c2459 int iNext = 0; /* Next value for iLoop */ in sqlite3WhereCodeOneLoopStart() local
2491 iNext = 2; in sqlite3WhereCodeOneLoopStart()
2495 if( iNext==0 ) iNext = 3; in sqlite3WhereCodeOneLoopStart()
2530 iLoop = iNext; in sqlite3WhereCodeOneLoopStart()
H A Dwal.c581 int iNext; /* Next slot in aIndex[] not yet returned */ member
1603 while( pSegment->iNext<pSegment->nEntry ){ in walIteratorNext()
1604 u32 iPg = pSegment->aPgno[pSegment->aIndex[pSegment->iNext]]; in walIteratorNext()
1608 *piFrame = pSegment->iZero + pSegment->aIndex[pSegment->iNext]; in walIteratorNext()
1612 pSegment->iNext++; in walIteratorNext()
H A Dvdbesort.c446 int iNext; /* Offset within aMemory of next record */ member
1421 assert( p->u.iNext<sqlite3MallocSize(pList->aMemory) ); in vdbeSorterSort()
1422 pNext = (SorterRecord*)&pList->aMemory[p->u.iNext]; in vdbeSorterSort()
1857 pNew->u.iNext = (int)((u8*)(pSorter->list.pList) - pSorter->list.aMemory); in sqlite3VdbeSorterWrite()
H A Dtest1.c8365 int i, iNext; in test_decode_hexdb() local
8375 for(i=0; zIn[i]; i=iNext){ in test_decode_hexdb()
8377 for(iNext=i; zIn[iNext] && zIn[iNext]!='\n'; iNext++){} in test_decode_hexdb()
8378 if( zIn[iNext]=='\n' ) iNext++; in test_decode_hexdb()
/sqlite-3.40.0/ext/session/
H A Dsqlite3session.c2899 pIn->iNext = 0; in sessionDiscardData()
3061 pIn->iNext += 8; in sessionReadRecord()
3106 while( (pIn->iNext + nRead)<pIn->nData && pIn->aData[pIn->iNext + nRead] ){ in sessionChangesetBufferTblhdr()
3181 p->in.iNext += nVarint; in sessionChangesetReadTblhdr()
3194 p->in.iNext += nCopy; in sessionChangesetReadTblhdr()
3255 p->in.iCurrent = p->in.iNext; in sessionChangesetNextOne()
3294 p->in.iNext += *pnRec; in sessionChangesetNextOne()
3586 pInput->iNext++; in sessionChangesetInvert()
3597 pInput->iNext += nByte; in sessionChangesetInvert()
3609 pInput->iNext += 2; in sessionChangesetInvert()
[all …]
/sqlite-3.40.0/ext/lsm1/
H A Dlsm_tree.c672 iNext = pDb->treehdr.iFirst; in treeShmalloc()
677 if( iNext==0 ) iNext = pDb->treehdr.nChunk++; in treeShmalloc()
682 pNext->iNext = 0; in treeShmalloc()
691 pHdr->iNext = iNext; in treeShmalloc()
1129 pOne->iNext = 0; in lsmTreeInit()
1195 if( p->iNext ){ in treeCheckLinkedList()
2323 u32 iNext; in lsmTreeRollback() local
2344 iNext = pChunk->iNext; in lsmTreeRollback()
2345 pChunk->iNext = 0; in lsmTreeRollback()
2350 while( iNext ){ in lsmTreeRollback()
[all …]
H A Dlsm_file.c1789 int iNext = 0; in lsmFsSortedDelete() local
1796 iBlk = iNext; in lsmFsSortedDelete()
1878 int iNext = 0; in lsmFsGobble() local
1889 iBlk = iNext; in lsmFsGobble()
1917 LsmPgno iNext; in fsNextPageOffset() local
1924 iNext = 0; in fsNextPageOffset()
1926 rc = fsAddOffset(pFS, pSeg, iNext, 1, &iNext); in fsNextPageOffset()
1929 *piNext = iNext; in fsNextPageOffset()
2107 LsmPgno iNext = 0; in lsmFsSortedAppend() local
2612 int iNext; in fsAppendPage() local
[all …]
H A DlsmInt.h522 u32 iNext; member
/sqlite-3.40.0/test/
H A Dindex5.test60 set iNext [lindex $::write_list $i]
61 if {$iNext==($iPrev+1)} {
63 } elseif {$iNext==($iPrev-1)} {
68 set iPrev $iNext
/sqlite-3.40.0/ext/misc/
H A Dfossildelta.c774 int iNext; /* Next cursor value */ member
870 pCur->iCursor = pCur->iNext; in deltaparsevtabNext()
878 pCur->iNext = (int)(&z[1] - pCur->aDelta); in deltaparsevtabNext()
885 pCur->iNext = (int)(&z[pCur->a1] - pCur->aDelta); in deltaparsevtabNext()
890 pCur->iNext = pCur->nDelta; in deltaparsevtabNext()
894 if( pCur->iNext==pCur->nDelta ){ in deltaparsevtabNext()
898 pCur->iNext = pCur->nDelta; in deltaparsevtabNext()
997 pCur->iNext = pCur->nDelta; in deltaparsevtabFilter()
1001 pCur->iNext = (unsigned int)(a - pCur->aDelta); in deltaparsevtabFilter()
/sqlite-3.40.0/ext/lsm1/lsm-test/
H A Dlsmtest6.c7 int iNext; /* Next value to pass to testMallocOom() */ member
15 p->iNext = 1; in testOomStart()
26 if( p->rc!=0 || (p->iNext>1 && p->nFail==0) ){ in testOomContinue()
30 testMallocOom(p->pEnv, p->iNext, 0, (void (*)(void*))xOomHook, (void *)p); in testOomContinue()
40 p->iNext++; in testOomNext()
649 printf("(%d injections).", t.iNext-2); in do_test_oom1()
/sqlite-3.40.0/ext/repair/
H A Dcheckfreelist.c181 u32 iNext = get4byte(&aData[0]); in checkFreelist() local
193 if( iNext>nPage ){ in checkFreelist()
195 "trunk page %d is out of range", (int)iNext in checkFreelist()
/sqlite-3.40.0/ext/fts1/
H A Dfts1.c2783 int i, iNext, rc; in fulltextQuery() local
2794 for(i = 0; i<pQuery->nTerms; i=iNext){ in fulltextQuery()
2798 iNext = i + aTerm[i].nPhrase+1; in fulltextQuery()
2801 iNext = i + aTerm[i].nPhrase + 1; in fulltextQuery()
2807 while( iNext<pQuery->nTerms && aTerm[iNext].isOr ){ in fulltextQuery()
2808 rc = docListOfTerm(v, aTerm[iNext].iColumn, &aTerm[iNext], &pOr); in fulltextQuery()
2809 iNext += aTerm[iNext].nPhrase + 1; in fulltextQuery()
/sqlite-3.40.0/ext/recover/
H A Dsqlite3recover.c2097 int iNext = 0; in recoverIsValidPage() local
2100 iNext = recoverGetU16(&a[iFree]); in recoverIsValidPage()
2103 if( iNext && iNext<iFree+nByte ) return 0; in recoverIsValidPage()
2105 iFree = iNext; in recoverIsValidPage()
/sqlite-3.40.0/ext/fts2/
H A Dfts2.c3652 int i, iNext, rc; in fulltextQuery() local
3684 for(i = 0; i<pQuery->nTerms; i=iNext){ in fulltextQuery()
3688 iNext = i + aTerm[i].nPhrase+1; in fulltextQuery()
3691 iNext = i + aTerm[i].nPhrase + 1; in fulltextQuery()
3698 while( iNext<pQuery->nTerms && aTerm[iNext].isOr ){ in fulltextQuery()
3699 rc = docListOfTerm(v, aTerm[iNext].iColumn, &aTerm[iNext], &or); in fulltextQuery()
3700 iNext += aTerm[iNext].nPhrase + 1; in fulltextQuery()

12