Lines Matching defs:aTask
80411 u8 nTask; /* Size of aTask[] array */
80413 SortSubtask aTask[1]; /* One or more subtasks */
81011 int i; /* Used to iterate through aTask[] */
81063 SortSubtask *pTask = &pSorter->aTask[i];
81138 int iTask = (pTask - pTask->pSorter->aTask);
81152 int iTask = (pTask - pTask->pSorter->aTask);
81219 ** it is possible that thread pSorter->aTask[pSorter->nTask-1].pThread
81222 ** thread pSorter->aTask[pSorter->nTask-1].pThread first. */
81224 SortSubtask *pTask = &pSorter->aTask[i];
81310 SortSubtask *pTask = &pSorter->aTask[i];
81765 return vdbeSorterListToPMA(&pSorter->aTask[0], &pSorter->list);
81786 pTask = &pSorter->aTask[iTest];
81796 rc = vdbeSorterListToPMA(&pSorter->aTask[nWorker], &pSorter->list);
81806 pSorter->iPrev = (u8)(pTask - pSorter->aTask);
82491 SortSubtask *pTask = &pSorter->aTask[iTask];
82552 SortSubtask *pTask0 = &pSorter->aTask[0];
82559 pSorter->aTask[i].xCompare = xCompare;
82570 SortSubtask *pLast = &pSorter->aTask[pSorter->nTask-1];
82600 (p->pIncr->pTask==&pSorter->aTask[iTask]) /* a */
82644 rc = vdbeSorterSort(&pSorter->aTask[0], &pSorter->list);
82695 assert( pSorter->pMerger->pTask==(&pSorter->aTask[0]) );
