257   int nTree;                 /* Used size of aTree/aReadr (power of 2) */  member
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()  local
2134   nTree = pMerger->nTree;  in vdbeMergeEngineInit()
2135   for(i=0; i<nTree; i++){  in vdbeMergeEngineInit()
2144       rc = vdbePmaReaderNext(&pMerger->aReadr[nTree-i-1]);  in vdbeMergeEngineInit()
2151   for(i=pMerger->nTree-1; i>0; i--){  in vdbeMergeEngineInit()