Home
last modified time | relevance | path

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

/sqlite-3.40.0/ext/lsm1/lsm-test/
H A Dlsmtest_tdb.c27 unused_parameter(iLevel); in error_transaction_function()
551 if( iLevel==0 ) return 0; in sql_begin()
563 for(i=pDb->nOpenTrans; i<iLevel; i++){ in sql_begin()
570 pDb->nOpenTrans = iLevel; in sql_begin()
576 assert( iLevel>=0 ); in sql_commit()
579 if( pDb->nOpenTrans>=1 && iLevel==0 ){ in sql_commit()
586 if( pDb->nOpenTrans>iLevel ){ in sql_commit()
593 pDb->nOpenTrans = iLevel; in sql_commit()
599 assert( iLevel>=0 ); in sql_rollback()
617 pDb->nOpenTrans = iLevel; in sql_rollback()
[all …]
H A Dlsmtest_tdb4.c339 int iLevel; in btMinTransaction() local
343 if( iLevel<iMin ){ in btMinTransaction()
345 *piLevel = iLevel; in btMinTransaction()
354 if( iLevel>=0 ){ in btRestoreTransaction()
367 int iLevel; in bt_write() local
370 rc = btMinTransaction(p, 2, &iLevel); in bt_write()
391 int iLevel; in bt_delete_range() local
393 rc = btMinTransaction(p, 2, &iLevel); in bt_delete_range()
442 int iLevel; in bt_fetch() local
446 if( iLevel==0 ){ in bt_fetch()
[all …]
H A Dlsmtest5.c81 int iLevel, in dbFormatKey() argument
85 if( iLevel==0 ){ in dbFormatKey()
90 for(i=0; i<iLevel; i++) f = f * pParam->nFanout; in dbFormatKey()
91 snprintf(aBuf, DB_KEY_BYTES, "c.%d.%.10d", iLevel, f*(iKey/f)); in dbFormatKey()
145 int iLevel, /* Level of checksum to compute */ in dbComputeCksum() argument
160 assert( iLevel>=1 ); in dbComputeCksum()
161 for(i=0; i<iLevel; i++) f = f * pParam->nFanout; in dbComputeCksum()
165 dbFormatKey(pParam, iLevel-1, iFirst, zFirst); in dbComputeCksum()
166 dbFormatKey(pParam, iLevel-1, iLast, zLast); in dbComputeCksum()
H A Dlsmtest_tdb.h99 int tdb_begin(TestDb *pDb, int iLevel);
100 int tdb_commit(TestDb *pDb, int iLevel);
101 int tdb_rollback(TestDb *pDb, int iLevel);
H A Dlsmtest_tdb3.c729 static int test_lsm_begin(TestDb *pTestDb, int iLevel){ in test_lsm_begin() argument
734 if( iLevel==0 ) return 0; in test_lsm_begin()
737 if( rc==LSM_OK && iLevel>1 ){ in test_lsm_begin()
738 rc = lsm_begin(pDb->db, iLevel-1); in test_lsm_begin()
743 static int test_lsm_commit(TestDb *pTestDb, int iLevel){ in test_lsm_commit() argument
747 if( iLevel==0 && pDb->pCsr ){ in test_lsm_commit()
753 return lsm_commit(pDb->db, MAX(0, iLevel-1)); in test_lsm_commit()
755 static int test_lsm_rollback(TestDb *pTestDb, int iLevel){ in test_lsm_rollback() argument
759 if( iLevel==0 && pDb->pCsr ){ in test_lsm_rollback()
764 return lsm_rollback(pDb->db, MAX(0, iLevel-1)); in test_lsm_rollback()
/sqlite-3.40.0/ext/lsm1/
H A Dlsm_main.c878 if( iLevel<0 ) iLevel = pDb->nTransOpen + 1; in lsm_begin()
879 if( iLevel>pDb->nTransOpen ){ in lsm_begin()
906 pDb->nTransOpen = iLevel; in lsm_begin()
919 if( iLevel<0 ) iLevel = LSM_MAX(0, pDb->nTransOpen - 1); in lsm_commit()
921 if( iLevel<pDb->nTransOpen ){ in lsm_commit()
922 if( iLevel==0 ){ in lsm_commit()
932 pDb->nTransOpen = iLevel; in lsm_commit()
944 if( iLevel<0 ) iLevel = LSM_MAX(0, pDb->nTransOpen - 1); in lsm_rollback()
946 if( iLevel<=pDb->nTransOpen ){ in lsm_rollback()
947 TransMark *pMark = &pDb->aTrans[(iLevel==0 ? 0 : iLevel-1)]; in lsm_rollback()
[all …]
H A Dlsm.h504 int lsm_begin(lsm_db *pDb, int iLevel);
505 int lsm_commit(lsm_db *pDb, int iLevel);
506 int lsm_rollback(lsm_db *pDb, int iLevel);
H A Dlsm_sorted.c3605 for(iLevel=0; iLevel<=p->nHier; iLevel++){ in mergeWorkerBtreeWrite()
3608 if( iLevel==p->nHier ){ in mergeWorkerBtreeWrite()
3624 pOld = p->apHier[iLevel]; in mergeWorkerBtreeWrite()
3648 p->apHier[iLevel] = 0; in mergeWorkerBtreeWrite()
3656 aData = fsPageData(p->apHier[iLevel], &nData); in mergeWorkerBtreeWrite()
3661 if( iLevel==p->nHier ){ in mergeWorkerBtreeWrite()
3668 aData = fsPageData(p->apHier[iLevel], &nData); in mergeWorkerBtreeWrite()
4475 int iLevel; in sortedMergeSetup() local
4477 for(iLevel=0; iLevel<nMerge; iLevel++){ in sortedMergeSetup()
5877 int iLevel = 0; in lsmSortedDumpStructure() local
[all …]
H A Dlsm_ckpt.c411 int iLevel; /* Used to count out nLevel levels */ in ckptExportSnapshot() local
432 iLevel = 0; in ckptExportSnapshot()
433 for(pLevel=lsmDbSnapshotLevel(pSnap); iLevel<nLevel; pLevel=pLevel->pNext){ in ckptExportSnapshot()
435 iLevel++; in ckptExportSnapshot()
/sqlite-3.40.0/ext/rtree/
H A Drtreedoc3.test103 iLevel [expr $nHeight+1] \
138 proc pq_new_entry {rScore iLevel cell} {
142 if {$iLevel==0} { set rowid_name "iRowid" }
146 lappend kv iLevel $iLevel
148 if {$iLevel==0} {
172 if {$P(iLevel)==0} { error "query callback mismatch (1)" }
187 if {$G(iLevel) != $P(iLevel)-1} {
188 error "iLevel mismatch in query callback (1)"
206 pq_new_entry $rScore [expr $P(iLevel)-1] $expected_cell
229 if {$N(iLevel)!=0} { error "result row mismatch (1)" }
[all …]
H A Drtree.c1253 pInfo->iLevel = pSearch->iLevel - 1; in rtreeCallbackConstraint()
1406 if( pA->iLevel<pB->iLevel ) return -1; in rtreeSearchPointCompare()
1407 if( pA->iLevel>pB->iLevel ) return +1; in rtreeSearchPointCompare()
1475 pNew->iLevel = iLevel; in rtreeEnqueue()
1500 pCur->anQueue[iLevel]++; in rtreeSearchPointNew()
1503 || (pFirst->rScore==rScore && pFirst->iLevel>iLevel) in rtreeSearchPointNew()
1521 pCur->sPoint.iLevel = iLevel; in rtreeSearchPointNew()
1570 p->anQueue[p->sPoint.iLevel]--; in rtreeSearchPointPop()
1638 }else if( p->iLevel==1 ){ in rtreeStepToLeaf()
1651 x.iLevel = p->iLevel - 1; in rtreeStepToLeaf()
[all …]
H A Dsqlite3rtree.h94 int iLevel; /* Level of current node or entry */ member
H A Dtest_rtreedoc.c253 Tcl_ListObjAppendElement(interp, pArg, Tcl_NewIntObj(pInfo->iLevel)); in box_query()
/sqlite-3.40.0/src/
H A Dtest_rtree.c290 p->rScore = p->iLevel; in circle_query_func()
293 p->rScore = 100 - p->iLevel; in circle_query_func()
297 if( p->iLevel==1 ){ in circle_query_func()
305 p->rScore = p->iLevel; in circle_query_func()
309 p->rScore = 100 - p->iLevel; in circle_query_func()
342 p->rScore = 100 - p->iLevel; in bfs_query_func()
H A Dwherecode.c1270 while( ++iLevel < pWInfo->nLevel ){ in filterPullDown()
1271 WhereLevel *pLevel = &pWInfo->a[iLevel]; in filterPullDown()
1347 bRev = (pWInfo->revMask>>iLevel)&1; in sqlite3WhereCodeOneLoopStart()
1352 iLevel, pWInfo->nLevel, (u64)notReady, pLevel->iFrom); in sqlite3WhereCodeOneLoopStart()
1356 if( iLevel==0 ){ in sqlite3WhereCodeOneLoopStart()
1393 for(j=iLevel; j>0; j--){ in sqlite3WhereCodeOneLoopStart()
2158 nNotReady = pWInfo->nLevel - iLevel - 1; in sqlite3WhereCodeOneLoopStart()
2669 iLevel); in sqlite3WhereCodeOneLoopStart()
2674 iLevel, (u64)pLevel->notReady); in sqlite3WhereCodeOneLoopStart()
2686 int iLevel, in sqlite3WhereRightJoinLoop() argument
[all …]
H A Dtreeview.c34 p->iLevel++; in sqlite3TreeViewPush()
37 if( p->iLevel<(int)sizeof(p->bLine) ) p->bLine[p->iLevel] = moreToFollow; in sqlite3TreeViewPush()
46 p->iLevel--; in sqlite3TreeViewPop()
47 if( p->iLevel<0 ){ in sqlite3TreeViewPop()
64 for(i=0; i<p->iLevel && i<(int)sizeof(p->bLine)-1; i++){ in sqlite3TreeViewLine()
H A DwhereInt.h549 int iLevel, /* Which level of pWInfo->a[] should be coded */
555 int iLevel,
H A Dpragma.c1096 int iLevel = (getSafetyLevel(zRight,0,1)+1) & PAGER_SYNCHRONOUS_MASK; in sqlite3Pragma() local
1097 if( iLevel==0 ) iLevel = 1; in sqlite3Pragma()
1098 pDb->safety_level = iLevel; in sqlite3Pragma()
H A Dwhere.c1056 int iLevel, /* Index in pWInfo->a[] that is pLevel */ in sqlite3ConstructBloomFilter() argument
1138 while( ++iLevel < pWInfo->nLevel ){ in sqlite3ConstructBloomFilter()
1140 pLevel = &pWInfo->a[iLevel]; in sqlite3ConstructBloomFilter()
1156 }while( iLevel < pWInfo->nLevel ); in sqlite3ConstructBloomFilter()
H A DsqliteInt.h4210 int iLevel; /* Which level of the tree we are on */ member
/sqlite-3.40.0/ext/fts3/
H A Dfts3_write.c577 return iBase + iLevel; in getAbsoluteLevel()
607 assert( iLevel==FTS3_SEGCURSOR_ALL || iLevel>=0 ); in sqlite3Fts3AllSegdirs()
608 assert( iLevel<FTS3_SEGDIR_MAXLEVEL ); in sqlite3Fts3AllSegdirs()
611 if( iLevel<0 ){ in sqlite3Fts3AllSegdirs()
1130 int iLevel, in fts3AllocateSegdirIdx() argument
2582 assert( iLevel>=0 || iLevel==FTS3_SEGCURSOR_ALL ); in fts3DeleteSegdir()
2583 if( iLevel==FTS3_SEGCURSOR_ALL ){ in fts3DeleteSegdir()
3234 assert( iLevel==FTS3_SEGCURSOR_ALL in fts3SegmentMerge()
3236 || iLevel>=0 in fts3SegmentMerge()
3244 if( iLevel!=FTS3_SEGCURSOR_PENDING ){ in fts3SegmentMerge()
[all …]
H A Dfts3.c2970 int iLevel, /* Level of segments to scan */ in fts3SegReaderCursor() argument
2987 if( iLevel<0 && p->aIndex && p->iPrevLangid==iLangid ){ in fts3SegReaderCursor()
2995 if( iLevel!=FTS3_SEGCURSOR_PENDING ){ in fts3SegReaderCursor()
2997 rc = sqlite3Fts3AllSegdirs(p, iLangid, iIndex, iLevel, &pStmt); in fts3SegReaderCursor()
3044 int iLevel, /* Level of segments to scan */ in sqlite3Fts3SegReaderCursor() argument
3052 assert( iLevel==FTS3_SEGCURSOR_ALL in sqlite3Fts3SegReaderCursor()
3053 || iLevel==FTS3_SEGCURSOR_PENDING in sqlite3Fts3SegReaderCursor()
3054 || iLevel>=0 in sqlite3Fts3SegReaderCursor()
3056 assert( iLevel<FTS3_SEGDIR_MAXLEVEL ); in sqlite3Fts3SegReaderCursor()
3062 p, iLangid, iIndex, iLevel, zTerm, nTerm, isPrefix, isScan, pCsr in sqlite3Fts3SegReaderCursor()
/sqlite-3.40.0/ext/fts3/tool/
H A Dfts3view.c491 int iLevel = sqlite3_column_int(pStmt, 0)%1024; in showSegdirMap() local
497 if( iLevel!=prevLevel ){ in showSegdirMap()
498 printf("level %2d idx %2d", iLevel, iIdx); in showSegdirMap()
499 prevLevel = iLevel; in showSegdirMap()
/sqlite-3.40.0/ext/fts2/
H A Dfts2.c2181 rc = sqlite3_bind_int(s, 1, iLevel); in segdir_max_index()
2221 rc = sqlite3_bind_int(s, 1, iLevel); in segdir_set()
2253 rc = sqlite3_bind_int(s, 1, iLevel); in segdir_span()
2298 rc = sqlite3_bind_int64(s, 1, iLevel); in segdir_delete()
4467 int iLevel; member
4486 pWriter->iLevel = iLevel; in leafWriterInit()
5192 rc = sqlite3_bind_int(s, 1, iLevel); in leavesReadersInit()
5261 rc = segmentMerge(v, iLevel); in segdirNextIndex()
5285 rc = segdirNextIndex(v, iLevel+1, &idx); in segmentMerge()
5298 leafWriterInit(iLevel+1, idx, &writer); in segmentMerge()
[all …]
/sqlite-3.40.0/ext/fts5/
H A Dfts5_index.c3452 int iLevel, /* Level to iterate (-1 for all) */ in fts5MultiIterNew() argument
3462 assert( (pTerm==0 && nTerm==0) || iLevel<0 ); in fts5MultiIterNew()
3466 if( iLevel<0 ){ in fts5MultiIterNew()
3471 nSeg = MIN(pStruct->aLevel[iLevel].nSeg, nSegment); in fts5MultiIterNew()
3488 if( iLevel<0 ){ in fts5MultiIterNew()
3507 pLvl = &pStruct->aLevel[iLevel]; in fts5MultiIterNew()