Home
last modified time | relevance | path

Searched refs:nDepth (Results 1 – 3 of 3) sorted by relevance

/sqlite-3.40.0/test/
H A Dfts3expr3.test186 proc create_toggle_tree {nDepth} {
187 if {$nDepth == 0} { return xxx }
188 set nNew [expr $nDepth-1]
189 if {$nDepth % 2} {
/sqlite-3.40.0/ext/lsm1/
H A Dlsm_sorted.c768 if( (pCsr->nDepth % 8)==0 ){ in btreeCursorFirst()
781 pCsr->nDepth++; in btreeCursorFirst()
787 pCsr->iPg = pCsr->nDepth-1; in btreeCursorFirst()
851 nDepth = (p->iCell & 0x00FF); in btreeCursorRestore()
861 pCsr->iPg = nDepth-1; in btreeCursorRestore()
862 pCsr->nDepth = nDepth; in btreeCursorRestore()
868 if( rc==LSM_OK && nDepth>1 ){ in btreeCursorRestore()
940 assert( iPg!=nDepth-1 in btreeCursorRestore()
5406 nDepth += 1; in lsmSortedAutoWork()
5409 nDepth += 1; in lsmSortedAutoWork()
[all …]
/sqlite-3.40.0/src/
H A Dvdbesort.c2348 int nDepth = 0; in vdbeSorterTreeDepth() local
2352 nDepth++; in vdbeSorterTreeDepth()
2354 return nDepth; in vdbeSorterTreeDepth()
2367 int nDepth, /* Depth of tree according to TreeDepth() */ in vdbeSorterAddToTree() argument
2380 for(i=1; i<nDepth; i++){ in vdbeSorterAddToTree()
2384 for(i=1; i<nDepth && rc==SQLITE_OK; i++){ in vdbeSorterAddToTree()
2445 int nDepth = vdbeSorterTreeDepth(pTask->nPMA); in vdbeSorterMergeTreeBuild() local
2462 rc = vdbeSorterAddToTree(pTask, nDepth, iSeq++, pRoot, pMerger); in vdbeSorterMergeTreeBuild()