HomeSort by relevance Sort by last modified time
    Searched refs:AvailableQueue (Results 1 - 4 of 4) sorted by null

  /external/llvm/lib/CodeGen/SelectionDAG/
ScheduleDAGVLIW.cpp 52 /// AvailableQueue - The priority queue to use for the available SUnits.
54 SchedulingPriorityQueue *AvailableQueue;
59 /// added to the AvailableQueue.
72 : ScheduleDAGSDNodes(mf), AvailableQueue(availqueue), AA(aa) {
80 delete AvailableQueue;
102 AvailableQueue->initNodes(SUnits);
106 AvailableQueue->releaseState();
163 AvailableQueue->scheduledNode(SU);
174 // All leaves to AvailableQueue.
178 AvailableQueue->push(&SUnits[i])
    [all...]
ScheduleDAGRRList.cpp 117 /// AvailableQueue - The priority queue to use for the available SUnits.
118 SchedulingPriorityQueue *AvailableQueue;
123 /// added to the AvailableQueue.
165 NeedLatency(needlatency), AvailableQueue(availqueue), CurCycle(0),
177 delete AvailableQueue;
213 return DisableSchedCycles || !AvailableQueue->hasReadyFilter() ||
214 AvailableQueue->isReady(SU);
342 AvailableQueue->initNodes(SUnits);
349 AvailableQueue->releaseState();
363 /// the AvailableQueue if the count reaches zero. Also update its cycle bound
    [all...]
ScheduleDAGFast.cpp 69 /// AvailableQueue - The priority queue to use for the available SUnits.
70 FastPriorityQueue AvailableQueue;
138 /// the AvailableQueue if the count reaches zero. Also update its cycle bound.
156 AvailableQueue.push(PredSU);
537 AvailableQueue.push(RootSU);
545 while (!AvailableQueue.empty()) {
548 SUnit *CurSU = AvailableQueue.pop();
556 CurSU->isPending = true; // This SU is not in AvailableQueue right now.
558 CurSU = AvailableQueue.pop();
621 AvailableQueue.push(NotReady[i])
    [all...]
  /external/llvm/lib/CodeGen/
PostRASchedulerList.cpp 105 /// AvailableQueue - The priority queue to use for the available SUnits.
107 LatencyPriorityQueue AvailableQueue;
112 /// added to the AvailableQueue.
392 AvailableQueue.initNodes(SUnits);
394 AvailableQueue.releaseState();
619 AvailableQueue.scheduledNode(SU);
640 AvailableQueue.push(&SUnits[i]);
653 while (!AvailableQueue.empty() || !PendingQueue.empty()) {
659 AvailableQueue.push(PendingQueue[i]);
668 DEBUG(dbgs() << "\n*** Examining Available\n"; AvailableQueue.dump(this))
    [all...]

Completed in 60 milliseconds