259   int *aTree;                /* Current state of incremental merge */  member
1192     pNew->aTree = (int*)&pNew->aReadr[N];  in vdbeMergeEngineNew()
1617   int iPrev = pMerger->aTree[1];/* Index of PmaReader to advance */  in vdbeMergeEngineStep()
1664         pMerger->aTree[i] = (int)(pReadr1 - pMerger->aReadr);  in vdbeMergeEngineStep()
1665         pReadr2 = &pMerger->aReadr[ pMerger->aTree[i ^ 0x0001] ];  in vdbeMergeEngineStep()
1669         pMerger->aTree[i] = (int)(pReadr2 - pMerger->aReadr);  in vdbeMergeEngineStep()
1670         pReadr1 = &pMerger->aReadr[ pMerger->aTree[i ^ 0x0001] ];  in vdbeMergeEngineStep()
1673     *pbEof = (pMerger->aReadr[pMerger->aTree[1]].pFd==0);  in vdbeMergeEngineStep()
1894     PmaReader *pReader = &pMerger->aReadr[ pMerger->aTree[1] ];  in vdbeIncrPopulate()
2048     i1 = pMerger->aTree[iOut*2];  in vdbeMergeEngineCompare()
2049     i2 = pMerger->aTree[iOut*2+1];  in vdbeMergeEngineCompare()
2074   pMerger->aTree[iOut] = iRes;  in vdbeMergeEngineCompare()
2685       pReader = &pSorter->pMerger->aReadr[pSorter->pMerger->aTree[1]];  in vdbeSorterRowkey()