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

  /external/llvm/lib/CodeGen/SelectionDAG/
ScheduleDAGVLIW.cpp 54 /// AvailableQueue - The priority queue to use for the available SUnits.
56 SchedulingPriorityQueue *AvailableQueue;
61 /// added to the AvailableQueue.
74 : ScheduleDAGSDNodes(mf), AvailableQueue(availqueue), AA(aa) {
81 delete AvailableQueue;
103 AvailableQueue->initNodes(SUnits);
107 AvailableQueue->releaseState();
164 AvailableQueue->scheduledNode(SU);
175 // All leaves to AvailableQueue.
179 AvailableQueue->push(&SUnits[i])
    [all...]
ScheduleDAGRRList.cpp 118 /// AvailableQueue - The priority queue to use for the available SUnits.
119 SchedulingPriorityQueue *AvailableQueue;
124 /// added to the AvailableQueue.
166 NeedLatency(needlatency), AvailableQueue(availqueue), CurCycle(0),
178 delete AvailableQueue;
214 return DisableSchedCycles || !AvailableQueue->hasReadyFilter() ||
215 AvailableQueue->isReady(SU);
343 AvailableQueue->initNodes(SUnits);
350 AvailableQueue->releaseState();
364 /// the AvailableQueue if the count reaches zero. Also update its cycle bound
    [all...]
ScheduleDAGFast.cpp 70 /// AvailableQueue - The priority queue to use for the available SUnits.
71 FastPriorityQueue AvailableQueue;
139 /// the AvailableQueue if the count reaches zero. Also update its cycle bound.
157 AvailableQueue.push(PredSU);
543 AvailableQueue.push(RootSU);
551 while (!AvailableQueue.empty()) {
554 SUnit *CurSU = AvailableQueue.pop();
562 CurSU->isPending = true; // This SU is not in AvailableQueue right now.
564 CurSU = AvailableQueue.pop();
627 AvailableQueue.push(NotReady[i])
    [all...]
  /external/swiftshader/third_party/LLVM/lib/CodeGen/SelectionDAG/
ScheduleDAGList.cpp 51 /// AvailableQueue - The priority queue to use for the available SUnits.
53 SchedulingPriorityQueue *AvailableQueue;
58 /// added to the AvailableQueue.
67 : ScheduleDAGSDNodes(mf), AvailableQueue(availqueue) {
75 delete AvailableQueue;
95 AvailableQueue->initNodes(SUnits);
99 AvailableQueue->releaseState();
153 AvailableQueue->ScheduledNode(SU);
168 AvailableQueue->push(&SUnits[i]);
177 while (!AvailableQueue->empty() || !PendingQueue.empty())
    [all...]
ScheduleDAGRRList.cpp 132 /// AvailableQueue - The priority queue to use for the available SUnits.
133 SchedulingPriorityQueue *AvailableQueue;
138 /// added to the AvailableQueue.
170 NeedLatency(needlatency), AvailableQueue(availqueue), CurCycle(0),
182 delete AvailableQueue;
218 return DisableSchedCycles || !AvailableQueue->hasReadyFilter() ||
219 AvailableQueue->isReady(SU);
342 AvailableQueue->initNodes(SUnits);
357 AvailableQueue->releaseState();
365 /// the AvailableQueue if the count reaches zero. Also update its cycle bound
    [all...]
ScheduleDAGFast.cpp 64 /// AvailableQueue - The priority queue to use for the available SUnits.
65 FastPriorityQueue AvailableQueue;
133 /// the AvailableQueue if the count reaches zero. Also update its cycle bound.
151 AvailableQueue.push(PredSU);
532 AvailableQueue.push(RootSU);
540 while (!AvailableQueue.empty()) {
543 SUnit *CurSU = AvailableQueue.pop();
551 CurSU->isPending = true; // This SU is not in AvailableQueue right now.
553 CurSU = AvailableQueue.pop();
620 AvailableQueue.push(NotReady[i])
    [all...]
  /external/llvm/lib/CodeGen/
PostRASchedulerList.cpp 115 /// AvailableQueue - The priority queue to use for the available SUnits.
117 LatencyPriorityQueue AvailableQueue;
122 /// added to the AvailableQueue.
424 AvailableQueue.initNodes(SUnits);
426 AvailableQueue.releaseState();
515 AvailableQueue.scheduledNode(SU);
544 AvailableQueue.push(&SUnits[i]);
557 while (!AvailableQueue.empty() || !PendingQueue.empty()) {
563 AvailableQueue.push(PendingQueue[i]);
572 DEBUG(dbgs() << "\n*** Examining Available\n"; AvailableQueue.dump(this))
    [all...]
  /external/swiftshader/third_party/LLVM/lib/CodeGen/
PostRASchedulerList.cpp 111 /// AvailableQueue - The priority queue to use for the available SUnits.
113 LatencyPriorityQueue AvailableQueue;
118 /// added to the AvailableQueue.
336 AvailableQueue.initNodes(SUnits);
338 AvailableQueue.releaseState();
588 AvailableQueue.ScheduledNode(SU);
610 AvailableQueue.push(&SUnits[i]);
623 while (!AvailableQueue.empty() || !PendingQueue.empty()) {
629 AvailableQueue.push(PendingQueue[i]);
638 DEBUG(dbgs() << "\n*** Examining Available\n"; AvailableQueue.dump(this))
    [all...]

Completed in 87 milliseconds