Searched refs:AvailableQueue (Results 1 - 4 of 4) sorted by relevance

/freebsd-12-stable/contrib/llvm-project/llvm/lib/CodeGen/SelectionDAG/
H A DScheduleDAGVLIW.cpp53 /// AvailableQueue - The priority queue to use for the available SUnits.
55 SchedulingPriorityQueue *AvailableQueue; member in class:__anon4654::ScheduleDAGVLIW
60 /// added to the AvailableQueue.
72 : ScheduleDAGSDNodes(mf), AvailableQueue(availqueue), AA(aa) {
79 delete AvailableQueue;
100 AvailableQueue->initNodes(SUnits);
104 AvailableQueue->releaseState();
161 AvailableQueue->scheduledNode(SU);
172 // All leaves to AvailableQueue.
176 AvailableQueue
[all...]
H A DScheduleDAGRRList.cpp143 /// AvailableQueue - The priority queue to use for the available SUnits.
144 SchedulingPriorityQueue *AvailableQueue; member in class:__anon4653::ScheduleDAGRRList
149 /// added to the AvailableQueue.
193 NeedLatency(needlatency), AvailableQueue(availqueue),
204 delete AvailableQueue;
248 return DisableSchedCycles || !AvailableQueue->hasReadyFilter() ||
249 AvailableQueue->isReady(SU);
376 AvailableQueue->initNodes(SUnits);
383 AvailableQueue->releaseState();
397 /// the AvailableQueue i
[all...]
H A DScheduleDAGFast.cpp70 /// AvailableQueue - The priority queue to use for the available SUnits.
71 FastPriorityQueue AvailableQueue; member in class:__anon4650::ScheduleDAGFast
138 /// the AvailableQueue if the count reaches zero. Also update its cycle bound.
156 AvailableQueue.push(PredSU);
535 AvailableQueue.push(RootSU);
543 while (!AvailableQueue.empty()) {
546 SUnit *CurSU = AvailableQueue.pop();
554 CurSU->isPending = true; // This SU is not in AvailableQueue right now.
556 CurSU = AvailableQueue.pop();
619 AvailableQueue
[all...]
/freebsd-12-stable/contrib/llvm-project/llvm/lib/CodeGen/
H A DPostRASchedulerList.cpp115 /// AvailableQueue - The priority queue to use for the available SUnits.
117 LatencyPriorityQueue AvailableQueue; member in class:__anon4615::SchedulePostRATDList
122 /// added to the AvailableQueue.
419 AvailableQueue.initNodes(SUnits);
421 AvailableQueue.releaseState();
510 AvailableQueue.scheduledNode(SU);
539 AvailableQueue.push(&SUnits[i]);
552 while (!AvailableQueue.empty() || !PendingQueue.empty()) {
558 AvailableQueue.push(PendingQueue[i]);
568 AvailableQueue
[all...]

Completed in 95 milliseconds