Lines Matching refs:nPMA
301 int nPMA; /* Number of PMAs currently in file */ member
1568 assert( pTask->nPMA==0 ); in vdbeSorterListToPMA()
1587 pTask->nPMA++; in vdbeSorterListToPMA()
1776 int nPMA; /* Bytes of PMA space required */ in sqlite3VdbeSorterWrite() local
1809 nPMA = pVal->n + sqlite3VarintLen(pVal->n); in sqlite3VdbeSorterWrite()
1827 pSorter->list.szPMA += nPMA; in sqlite3VdbeSorterWrite()
1828 if( nPMA>pSorter->mxKeysize ){ in sqlite3VdbeSorterWrite()
1829 pSorter->mxKeysize = nPMA; in sqlite3VdbeSorterWrite()
2310 int nPMA, /* Number of PMAs to read */ in vdbeMergeEngineLevel0() argument
2319 *ppOut = pNew = vdbeMergeEngineNew(nPMA); in vdbeMergeEngineLevel0()
2322 for(i=0; i<nPMA && rc==SQLITE_OK; i++){ in vdbeMergeEngineLevel0()
2347 static int vdbeSorterTreeDepth(int nPMA){ in vdbeSorterTreeDepth() argument
2350 while( nDiv < (i64)nPMA ){ in vdbeSorterTreeDepth()
2442 assert( pTask->nPMA>0 || SQLITE_MAX_WORKER_THREADS>0 ); in vdbeSorterMergeTreeBuild()
2443 if( SQLITE_MAX_WORKER_THREADS==0 || pTask->nPMA ){ in vdbeSorterMergeTreeBuild()
2445 int nDepth = vdbeSorterTreeDepth(pTask->nPMA); in vdbeSorterMergeTreeBuild()
2448 if( pTask->nPMA<=SORTER_MAX_MERGE_COUNT ){ in vdbeSorterMergeTreeBuild()
2449 rc = vdbeMergeEngineLevel0(pTask, pTask->nPMA, &iReadOff, &pRoot); 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()