nPMA 78199 ext/sqlite3/libsqlite/sqlite3.c int nPMA; /* Number of PMAs currently in file */ nPMA 79453 ext/sqlite3/libsqlite/sqlite3.c assert( pTask->nPMA==0 ); nPMA 79472 ext/sqlite3/libsqlite/sqlite3.c pTask->nPMA++; nPMA 79659 ext/sqlite3/libsqlite/sqlite3.c int nPMA; /* Bytes of PMA space required */ nPMA 79690 ext/sqlite3/libsqlite/sqlite3.c nPMA = pVal->n + sqlite3VarintLen(pVal->n); nPMA 79708 ext/sqlite3/libsqlite/sqlite3.c pSorter->list.szPMA += nPMA; nPMA 79709 ext/sqlite3/libsqlite/sqlite3.c if( nPMA>pSorter->mxKeysize ){ nPMA 79710 ext/sqlite3/libsqlite/sqlite3.c pSorter->mxKeysize = nPMA; nPMA 80180 ext/sqlite3/libsqlite/sqlite3.c int nPMA, /* Number of PMAs to read */ nPMA 80189 ext/sqlite3/libsqlite/sqlite3.c *ppOut = pNew = vdbeMergeEngineNew(nPMA); nPMA 80192 ext/sqlite3/libsqlite/sqlite3.c for(i=0; i<nPMA && rc==SQLITE_OK; i++){ nPMA 80217 ext/sqlite3/libsqlite/sqlite3.c static int vdbeSorterTreeDepth(int nPMA){ nPMA 80220 ext/sqlite3/libsqlite/sqlite3.c while( nDiv < (i64)nPMA ){ nPMA 80312 ext/sqlite3/libsqlite/sqlite3.c assert( pTask->nPMA>0 || SQLITE_MAX_WORKER_THREADS>0 ); nPMA 80313 ext/sqlite3/libsqlite/sqlite3.c if( SQLITE_MAX_WORKER_THREADS==0 || pTask->nPMA ){ nPMA 80315 ext/sqlite3/libsqlite/sqlite3.c int nDepth = vdbeSorterTreeDepth(pTask->nPMA); nPMA 80318 ext/sqlite3/libsqlite/sqlite3.c if( pTask->nPMA<=SORTER_MAX_MERGE_COUNT ){ nPMA 80319 ext/sqlite3/libsqlite/sqlite3.c rc = vdbeMergeEngineLevel0(pTask, pTask->nPMA, &iReadOff, &pRoot); nPMA 80325 ext/sqlite3/libsqlite/sqlite3.c for(i=0; i<pTask->nPMA && rc==SQLITE_OK; i += SORTER_MAX_MERGE_COUNT){ nPMA 80329 ext/sqlite3/libsqlite/sqlite3.c nReader = MIN(pTask->nPMA - i, SORTER_MAX_MERGE_COUNT);