Home
last modified time | relevance | path

Searched refs:iMin (Results 1 – 15 of 15) sorted by relevance

/sqlite-3.40.0/ext/misc/
H A Dunionvtab.c956 if( iMax<iMin || (pTab->nSrc>0 && iMin<=pTab->aSrc[pTab->nSrc-1].iMax) ){ in unionConnect()
964 pSrc->iMin = iMin; in unionConnect()
1067 if( pCsr->iMaxRowid>=pSrc->iMin ){ in doUnionNext()
1145 sqlite3_int64 iMin = SMALLEST_INT64; in unionFilter() local
1161 iMin = iMax = sqlite3_value_int64(argv[0]); in unionFilter()
1178 iMin = sqlite3_value_int64(argv[argc-1]); in unionFilter()
1180 if( iMin==LARGEST_INT64 ){ in unionFilter()
1183 iMin++; in unionFilter()
1196 if( iMin>pSrc->iMax || iMax<pSrc->iMin ){ in unionFilter()
1213 if( iMin==iMax ){ in unionFilter()
[all …]
/sqlite-3.40.0/src/
H A Dtest_func.c51 int iMin, iMax, n, r, i; in randStr() local
59 iMin = sqlite3_value_int(argv[0]); in randStr()
60 if( iMin<0 ) iMin = 0; in randStr()
61 if( iMin>=sizeof(zBuf) ) iMin = sizeof(zBuf)-1; in randStr()
63 if( iMax<iMin ) iMax = iMin; in randStr()
65 n = iMin; in randStr()
66 if( iMax>iMin ){ in randStr()
69 n += r%(iMax + 1 - iMin); in randStr()
H A Danalyze.c295 int iMin; /* Index in a[] of entry with minimum score */ member
599 StatSample *pMin = &p->a[p->iMin]; in sampleInsert()
604 memmove(pMin, &pMin[1], sizeof(p->a[0])*(p->nSample-p->iMin-1)); in sampleInsert()
629 int iMin = -1; in sampleInsert() local
632 if( iMin<0 || sampleIsBetter(p, &p->a[iMin], &p->a[i]) ){ in sampleInsert()
633 iMin = i; in sampleInsert()
636 assert( iMin>=0 ); in sampleInsert()
637 p->iMin = iMin; in sampleInsert()
657 if( p->nSample<p->mxSample || sampleIsBetter(p, pBest, &p->a[p->iMin]) ){ in samplePushPrevious()
H A Dwal.c1595 u32 iMin; /* Result pgno must be greater than iMin */ in walIteratorNext() local
1599 iMin = p->iPrior; in walIteratorNext()
1600 assert( iMin<0xffffffff ); in walIteratorNext()
1605 if( iPg>iMin ){ in walIteratorNext()
H A Dwhere.c1444 int iMin = 0; /* Smallest sample not yet tested */ in whereKeyStats() local
1508 iTest = (iMin+iSample)/2; in whereKeyStats()
1525 iMin = iTest+1; in whereKeyStats()
1528 iMin = iTest+1; in whereKeyStats()
1534 }while( res && iMin<iSample ); in whereKeyStats()
/sqlite-3.40.0/test/
H A Dswarmvtab.test39 set iMin [expr $i*10 + 1]
40 set iMax [expr $iMin+9]
46 INSERT INTO aux.t$i SELECT * FROM t0 WHERE a BETWEEN $iMin AND $iMax;
48 INSERT INTO dir VALUES('test.db$i', 't$i', $iMin, $iMax);
147 set iMin [expr $i*10 + 1]
148 set iMax [expr $iMin+9]
154 INSERT INTO aux.t$i SELECT * FROM t0 WHERE a BETWEEN $iMin AND $iMax;
156 INSERT INTO dir VALUES('test.db$i', 't$i', $iMin, $iMax);
H A Dunionvtab.test180 set iMin 0
184 lappend L "('[lindex $E 0]', '[lindex $E 1]', $iMin, $iMin)"
186 lappend L "(NULL, '$e', $iMin, $iMin)"
188 incr iMin
/sqlite-3.40.0/ext/lsm1/
H A Dlsm_unix.c199 lsm_i64 iMin, in lsmPosixOsRemap() argument
211 int nIncrSz = aIncrSz[iMin>(2*1024*1024)]; in lsmPosixOsRemap()
219 if( iMin>=0 ){ in lsmPosixOsRemap()
224 if( iSz<iMin ){ in lsmPosixOsRemap()
225 iSz = ((iMin + nIncrSz-1) / nIncrSz) * nIncrSz; in lsmPosixOsRemap()
H A Dlsm_win32.c397 lsm_i64 iMin, in lsmWin32OsRemap() argument
406 int nIncrSz = aIncrSz[iMin>(2*1024*1024)]; in lsmWin32OsRemap()
412 if( iMin>=0 ){ in lsmWin32OsRemap()
423 if( fileSize.QuadPart<iMin ){ in lsmWin32OsRemap()
425 fileSize.QuadPart = ((iMin + nIncrSz-1) / nIncrSz) * nIncrSz; in lsmWin32OsRemap()
H A Dlsm_sorted.c899 int iMin; in btreeCursorRestore() local
909 iMin = 0; in btreeCursorRestore()
933 iMin = iTry+1; in btreeCursorRestore()
1642 int iMin; in segmentPtrSeek() local
1672 iMin = 0; in segmentPtrSeek()
1698 iMin = iTry+1; in segmentPtrSeek()
1703 assert( res==0 || (iMin==iMax && iMin>=0 && iMin<pPtr->nCell) ); in segmentPtrSeek()
1793 int iMin; in seekInBtree() local
1805 iMin = 0; in seekInBtree()
1807 while( iMax>=iMin ){ in seekInBtree()
[all …]
H A Dlsm_tree.c1259 u32 iMin = 0; in treeRepairList() local
1267 iMin = i; in treeRepairList()
1301 if( iMin!=db->treehdr.iFirst ){ in treeRepairList()
/sqlite-3.40.0/ext/fts5/
H A Dfts5_expr.c502 i64 iMin = FTS5_LARGEST_INT64; in fts5ExprSynonymList() local
508 if( aIter[i].iPos<iMin ){ in fts5ExprSynonymList()
509 iMin = aIter[i].iPos; in fts5ExprSynonymList()
513 if( iMin==FTS5_LARGEST_INT64 || rc!=SQLITE_OK ) break; in fts5ExprSynonymList()
515 iPrev = iMin; in fts5ExprSynonymList()
719 i64 iMin; in fts5ExprNearIsMatch() local
730 if( pPos->iPos<iMin || pPos->iPos>iMax ){ in fts5ExprNearIsMatch()
732 while( pPos->iPos<iMin ){ in fts5ExprNearIsMatch()
750 iMin = a[0].reader.iLookahead; in fts5ExprNearIsMatch()
752 if( a[i].reader.iLookahead < iMin ){ in fts5ExprNearIsMatch()
[all …]
H A Dfts5Int.h727 int sqlite3Fts5ExprFirst(Fts5Expr*, Fts5Index *pIdx, i64 iMin, int bDesc);
/sqlite-3.40.0/ext/lsm1/lsm-test/
H A Dlsmtest_tdb4.c338 static int btMinTransaction(BtDb *p, int iMin, int *piLevel){ in btMinTransaction() argument
343 if( iLevel<iMin ){ in btMinTransaction()
344 rc = sqlite4BtBegin(p->pBt, iMin); in btMinTransaction()
H A Dlsmtest_tdb3.c312 lsm_i64 iMin, in testEnvRemap() argument
318 return pRealEnv->xRemap(p->pReal, iMin, ppOut, pnOut); in testEnvRemap()