Searched refs:nTree (Results 1 – 2 of 2) sorted by relevance
1189 pNew->nTree = N; in vdbeMergeEngineNew()1203 for(i=0; i<pMerger->nTree; i++){ in vdbeMergeEngineFree()1635 for(i=(pMerger->nTree+iPrev)/2; i>0; i=i/2){ in vdbeMergeEngineStep()2042 assert( iOut<pMerger->nTree && iOut>0 ); in vdbeMergeEngineCompare()2044 if( iOut>=(pMerger->nTree/2) ){ in vdbeMergeEngineCompare()2045 i1 = (iOut - pMerger->nTree/2) * 2; in vdbeMergeEngineCompare()2121 int nTree; /* Number of subtrees to merge */ in vdbeMergeEngineInit() local2134 nTree = pMerger->nTree; in vdbeMergeEngineInit()2135 for(i=0; i<nTree; i++){ in vdbeMergeEngineInit()2144 rc = vdbePmaReaderNext(&pMerger->aReadr[nTree-i-1]); in vdbeMergeEngineInit()[all …]
2120 if( iOut>=(pCsr->nTree/2) ){ in multiCursorDoCompare()2227 for(i=pCsr->nTree-1; i>0; i--){ in segmentCursorAdvance()2260 pCsr->nTree = 0; in mcursorFreeComponents()2698 pCsr->nTree = 2; in multiCursorAllocTree()2699 while( pCsr->nTree<nMin ){ in multiCursorAllocTree()2700 pCsr->nTree = pCsr->nTree*2; in multiCursorAllocTree()2722 int nSave = pCsr->nTree; in assertCursorTree()2726 pCsr->nTree = 0; in assertCursorTree()2730 for(i=pCsr->nTree-1; i>0; i--){ in assertCursorTree()2734 assert( nSave==pCsr->nTree in assertCursorTree()[all …]