Lines Matching defs:aTask
80429 u8 nTask; /* Size of aTask[] array */
80431 SortSubtask aTask[1]; /* One or more subtasks */
81029 int i; /* Used to iterate through aTask[] */
81081 SortSubtask *pTask = &pSorter->aTask[i];
81156 int iTask = (pTask - pTask->pSorter->aTask);
81170 int iTask = (pTask - pTask->pSorter->aTask);
81237 ** it is possible that thread pSorter->aTask[pSorter->nTask-1].pThread
81240 ** thread pSorter->aTask[pSorter->nTask-1].pThread first. */
81242 SortSubtask *pTask = &pSorter->aTask[i];
81328 SortSubtask *pTask = &pSorter->aTask[i];
81783 return vdbeSorterListToPMA(&pSorter->aTask[0], &pSorter->list);
81804 pTask = &pSorter->aTask[iTest];
81814 rc = vdbeSorterListToPMA(&pSorter->aTask[nWorker], &pSorter->list);
81824 pSorter->iPrev = (u8)(pTask - pSorter->aTask);
82509 SortSubtask *pTask = &pSorter->aTask[iTask];
82570 SortSubtask *pTask0 = &pSorter->aTask[0];
82577 pSorter->aTask[i].xCompare = xCompare;
82588 SortSubtask *pLast = &pSorter->aTask[pSorter->nTask-1];
82618 (p->pIncr->pTask==&pSorter->aTask[iTask]) /* a */
82662 rc = vdbeSorterSort(&pSorter->aTask[0], &pSorter->list);
82713 assert( pSorter->pMerger->pTask==(&pSorter->aTask[0]) );
