Searched refs:aTree (Results 1 – 2 of 2) sorted by relevance
2261 pCsr->aTree = 0; in mcursorFreeComponents()2693 if( pCsr->aTree==0 ){ in multiCursorAllocTree()2725 pCsr->aTree = 0; in assertCursorTree()2741 pCsr->aTree = aSave; in assertCursorTree()2825 iKey = pCsr->aTree[1]; in mcursorLocationOk()2938 if( pCsr->aTree ){ in mcursorSave()3124 }else if( pCsr->aTree ){ in lsmMCursorValid()3328 assert( pCsr->aTree ); in lsmMCursorValue()3348 assert( pCsr->aTree ); in lsmMCursorType()4259 iVal = pCsr->aTree[1]; in mergeWorkerStep()[all …]
259 int *aTree; /* Current state of incremental merge */ member1192 pNew->aTree = (int*)&pNew->aReadr[N]; in vdbeMergeEngineNew()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()[all …]