Lines Matching refs:aTask

106706   SortSubtask aTask[FLEXARRAY];   /* One or more subtasks */  member
106710 #define SZ_VDBESORTER(N)  (offsetof(VdbeSorter,aTask)+(N)*sizeof(SortSubtask))
107375       SortSubtask *pTask = &pSorter->aTask[i];
107458   int iTask = (pTask - pTask->pSorter->aTask);
107473   int iTask = (pTask - pTask->pSorter->aTask);
107545     SortSubtask *pTask = &pSorter->aTask[i];
107631     SortSubtask *pTask = &pSorter->aTask[i];
107659       db->nSpill += pSorter->aTask[ii].nSpill;
108100   return vdbeSorterListToPMA(&pSorter->aTask[0], &pSorter->list);
108121     pTask = &pSorter->aTask[iTest];
108131       rc = vdbeSorterListToPMA(&pSorter->aTask[nWorker], &pSorter->list);
108144       pSorter->iPrev = (u8)(pTask - pSorter->aTask);
108841     SortSubtask *pTask = &pSorter->aTask[iTask];
108902   SortSubtask *pTask0 = &pSorter->aTask[0];
108909     pSorter->aTask[i].xCompare = xCompare;
108920       SortSubtask *pLast = &pSorter->aTask[pSorter->nTask-1];
108950                 (p->pIncr->pTask==&pSorter->aTask[iTask])             /* a */
108996       rc = vdbeSorterSort(&pSorter->aTask[0], &pSorter->list);
109054       assert( pSorter->pMerger->pTask==(&pSorter->aTask[0]) );