OpenGrok
Home
Sort by relevance
Sort by last modified time
Full Search
Definition
Symbol
File Path
History
|
|
Help
Searched
defs:SUnits
(Results
1 - 5
of
5
) sorted by null
/external/llvm/include/llvm/CodeGen/
LatencyPriorityQueue.h
33
//
SUnits
- The
SUnits
for the current graph.
34
std::vector<SUnit> *
SUnits
;
52
void initNodes(std::vector<SUnit> &
sunits
) {
53
SUnits
= &
sunits
;
54
NumNodesSolelyBlocking.resize(
SUnits
->size(), 0);
58
NumNodesSolelyBlocking.resize(
SUnits
->size(), 0);
65
SUnits
= 0;
69
assert(NodeNum < (*
SUnits
).size())
[
all
...]
DFAPacketizer.h
103
std::vector<SUnit>
SUnits
;
ResourcePriorityQueue.h
39
///
SUnits
- The
SUnits
for the current graph.
40
std::vector<SUnit> *
SUnits
;
86
void initNodes(std::vector<SUnit> &
sunits
);
89
NumNodesSolelyBlocking.resize(
SUnits
->size(), 0);
95
SUnits
= 0;
99
assert(NodeNum < (*
SUnits
).size());
100
return (*
SUnits
)[NodeNum].getHeight();
ScheduleDAGInstrs.h
121
std::vector<std::vector<SUnit*> >
SUnits
;
126
// can provide an iterator over
SUnits
(values) as well.
143
/// If this register is mapped, return its existing
SUnits
vector.
144
/// Otherwise map the register and return an empty
SUnits
vector.
147
assert((!New ||
SUnits
[Reg].empty()) && "stale
SUnits
vector");
149
return
SUnits
[Reg];
155
SUnits
[Reg].clear();
276
/// buildSchedGraph - Build
SUnits
from the MachineBasicBlock that we are
333
const SUnit *Addr =
SUnits
.empty() ? 0 : &SUnits[0]
[
all
...]
ScheduleDAG.h
91
/// classes which require default constructors.
SUnits
may not
181
/// as "must alias", meaning that the
SUnits
at either end of the edge
237
// Preds/Succs - The
SUnits
before/after us in the graph.
448
virtual void initNodes(std::vector<SUnit> &
SUnits
) = 0;
501
std::vector<SUnit>
SUnits
; // The scheduling units.
545
/// VerifyScheduledDAG - Verify that all
SUnits
were scheduled and that
546
/// their state is consistent. Return the number of scheduled
SUnits
.
636
return G->
SUnits
.begin();
639
return G->
SUnits
.end();
644
/// ordering for
SUnits
and provides methods for dynamically updatin
[
all
...]
Completed in 66 milliseconds