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

/macosx-10.10.1/llvmCore-3425.0.34/lib/CodeGen/SelectionDAG/
H A DScheduleDAGVLIW.cpp52 /// AvailableQueue - The priority queue to use for the available SUnits.
54 SchedulingPriorityQueue *AvailableQueue; member in class:__anon10010::ScheduleDAGVLIW
59 /// added to the AvailableQueue.
72 : ScheduleDAGSDNodes(mf), AvailableQueue(availqueue), AA(aa) {
80 delete AvailableQueue;
102 AvailableQueue->initNodes(SUnits);
106 AvailableQueue->releaseState();
161 AvailableQueue->scheduledNode(SU);
172 // All leaves to AvailableQueue.
176 AvailableQueue
[all...]
H A DScheduleDAGRRList.cpp116 /// AvailableQueue - The priority queue to use for the available SUnits.
117 SchedulingPriorityQueue *AvailableQueue; member in class:__anon10009::ScheduleDAGRRList
122 /// added to the AvailableQueue.
158 NeedLatency(needlatency), AvailableQueue(availqueue), CurCycle(0),
170 delete AvailableQueue;
206 return DisableSchedCycles || !AvailableQueue->hasReadyFilter() ||
207 AvailableQueue->isReady(SU);
323 AvailableQueue->initNodes(SUnits);
330 AvailableQueue->releaseState();
344 /// the AvailableQueue i
[all...]
H A DScheduleDAGFast.cpp64 /// AvailableQueue - The priority queue to use for the available SUnits.
65 FastPriorityQueue AvailableQueue; member in class:__anon10007::ScheduleDAGFast
133 /// the AvailableQueue if the count reaches zero. Also update its cycle bound.
151 AvailableQueue.push(PredSU);
527 AvailableQueue.push(RootSU);
535 while (!AvailableQueue.empty()) {
538 SUnit *CurSU = AvailableQueue.pop();
546 CurSU->isPending = true; // This SU is not in AvailableQueue right now.
548 CurSU = AvailableQueue.pop();
615 AvailableQueue
[all...]
/macosx-10.10.1/llvmCore-3425.0.34/lib/CodeGen/
H A DPostRASchedulerList.cpp104 /// AvailableQueue - The priority queue to use for the available SUnits.
106 LatencyPriorityQueue AvailableQueue; member in class:__anon9983::SchedulePostRATDList
111 /// added to the AvailableQueue.
394 AvailableQueue.initNodes(SUnits);
396 AvailableQueue.releaseState();
636 AvailableQueue.scheduledNode(SU);
658 AvailableQueue.push(&SUnits[i]);
671 while (!AvailableQueue.empty() || !PendingQueue.empty()) {
677 AvailableQueue.push(PendingQueue[i]);
686 DEBUG(dbgs() << "\n*** Examining Available\n"; AvailableQueue
[all...]

Completed in 174 milliseconds