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

/external/llvm/lib/CodeGen/SelectionDAG/
H A DScheduleDAGVLIW.cpp53 /// AvailableQueue - The priority queue to use for the available SUnits.
55 SchedulingPriorityQueue *AvailableQueue; member in class:__anon25811::ScheduleDAGVLIW
60 /// added to the AvailableQueue.
73 : ScheduleDAGSDNodes(mf), AvailableQueue(availqueue), AA(aa) {
82 delete AvailableQueue;
104 AvailableQueue->initNodes(SUnits);
108 AvailableQueue->releaseState();
165 AvailableQueue->scheduledNode(SU);
176 // All leaves to AvailableQueue.
180 AvailableQueue
[all...]
H A DScheduleDAGRRList.cpp118 /// AvailableQueue - The priority queue to use for the available SUnits.
119 SchedulingPriorityQueue *AvailableQueue; member in class:__anon25810::ScheduleDAGRRList
124 /// added to the AvailableQueue.
166 NeedLatency(needlatency), AvailableQueue(availqueue), CurCycle(0),
179 delete AvailableQueue;
215 return DisableSchedCycles || !AvailableQueue->hasReadyFilter() ||
216 AvailableQueue->isReady(SU);
344 AvailableQueue->initNodes(SUnits);
351 AvailableQueue->releaseState();
365 /// the AvailableQueue i
[all...]
H A DScheduleDAGFast.cpp70 /// AvailableQueue - The priority queue to use for the available SUnits.
71 FastPriorityQueue AvailableQueue; member in class:__anon25807::ScheduleDAGFast
139 /// the AvailableQueue if the count reaches zero. Also update its cycle bound.
157 AvailableQueue.push(PredSU);
538 AvailableQueue.push(RootSU);
546 while (!AvailableQueue.empty()) {
549 SUnit *CurSU = AvailableQueue.pop();
557 CurSU->isPending = true; // This SU is not in AvailableQueue right now.
559 CurSU = AvailableQueue.pop();
622 AvailableQueue
[all...]
/external/llvm/lib/CodeGen/
H A DPostRASchedulerList.cpp105 /// AvailableQueue - The priority queue to use for the available SUnits.
107 LatencyPriorityQueue AvailableQueue; member in class:__anon25784::SchedulePostRATDList
112 /// added to the AvailableQueue.
392 AvailableQueue.initNodes(SUnits);
394 AvailableQueue.releaseState();
477 AvailableQueue.scheduledNode(SU);
506 AvailableQueue.push(&SUnits[i]);
519 while (!AvailableQueue.empty() || !PendingQueue.empty()) {
525 AvailableQueue.push(PendingQueue[i]);
534 DEBUG(dbgs() << "\n*** Examining Available\n"; AvailableQueue
[all...]

Completed in 82 milliseconds