Lines Matching refs:SORTER_MAX_MERGE_COUNT
460 #define SORTER_MAX_MERGE_COUNT 16 macro
957 #if SQLITE_MAX_WORKER_THREADS>=SORTER_MAX_MERGE_COUNT in sqlite3VdbeSorterInit()
958 if( nWorker>=SORTER_MAX_MERGE_COUNT ){ in sqlite3VdbeSorterInit()
959 nWorker = SORTER_MAX_MERGE_COUNT-1; in sqlite3VdbeSorterInit()
1182 assert( nReader<=SORTER_MAX_MERGE_COUNT ); in vdbeMergeEngineNew()
2349 i64 nDiv = SORTER_MAX_MERGE_COUNT; in vdbeSorterTreeDepth()
2351 nDiv = nDiv * SORTER_MAX_MERGE_COUNT; in vdbeSorterTreeDepth()
2381 nDiv = nDiv * SORTER_MAX_MERGE_COUNT; in vdbeSorterAddToTree()
2385 int iIter = (iSeq / nDiv) % SORTER_MAX_MERGE_COUNT; in vdbeSorterAddToTree()
2389 MergeEngine *pNew = vdbeMergeEngineNew(SORTER_MAX_MERGE_COUNT); in vdbeSorterAddToTree()
2398 nDiv = nDiv / SORTER_MAX_MERGE_COUNT; in vdbeSorterAddToTree()
2403 p->aReadr[iSeq % SORTER_MAX_MERGE_COUNT].pIncr = pIncr; in vdbeSorterAddToTree()
2448 if( pTask->nPMA<=SORTER_MAX_MERGE_COUNT ){ in vdbeSorterMergeTreeBuild()
2453 pRoot = vdbeMergeEngineNew(SORTER_MAX_MERGE_COUNT); in vdbeSorterMergeTreeBuild()
2455 for(i=0; i<pTask->nPMA && rc==SQLITE_OK; i += SORTER_MAX_MERGE_COUNT){ in vdbeSorterMergeTreeBuild()
2459 nReader = MIN(pTask->nPMA - i, SORTER_MAX_MERGE_COUNT); in vdbeSorterMergeTreeBuild()