OpenGrok
Home
Sort by:
relevance
|
last modified time
|
path
Full Search
in project(s):
src
xsrc
Definition
Symbol
File Path
History
|
|
Help
Searched
refs:AvailableQueue
(Results
1 - 4
of
4
) sorted by relevancy
/src/external/apache2/llvm/dist/llvm/lib/CodeGen/SelectionDAG/
ScheduleDAGVLIW.cpp
53
///
AvailableQueue
- The priority queue to use for the available SUnits.
55
SchedulingPriorityQueue *
AvailableQueue
;
60
/// added to the
AvailableQueue
.
72
: ScheduleDAGSDNodes(mf),
AvailableQueue
(availqueue), AA(aa) {
79
delete
AvailableQueue
;
100
AvailableQueue
->initNodes(SUnits);
104
AvailableQueue
->releaseState();
160
AvailableQueue
->scheduledNode(SU);
171
// All leaves to
AvailableQueue
.
175
AvailableQueue
->push(&SUnits[i])
[
all
...]
ScheduleDAGRRList.cpp
143
///
AvailableQueue
- The priority queue to use for the available SUnits.
144
SchedulingPriorityQueue *
AvailableQueue
;
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
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
;
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
.push(NotReady[i])
[
all
...]
/src/external/apache2/llvm/dist/llvm/lib/CodeGen/
PostRASchedulerList.cpp
113
///
AvailableQueue
- The priority queue to use for the available SUnits.
115
LatencyPriorityQueue
AvailableQueue
;
120
/// added to the
AvailableQueue
.
417
AvailableQueue
.initNodes(SUnits);
419
AvailableQueue
.releaseState();
508
AvailableQueue
.scheduledNode(SU);
537
AvailableQueue
.push(&SUnits[i]);
550
while (!
AvailableQueue
.empty() || !PendingQueue.empty()) {
556
AvailableQueue
.push(PendingQueue[i]);
566
AvailableQueue
.dump(this))
[
all
...]
Completed in 76 milliseconds
Indexes created Sun Jun 07 00:24:08 UTC 2026