OpenGrok
Home
Sort by relevance
Sort by last modified time
Full Search
Definition
Symbol
File Path
History
|
|
Help
Searched
refs:SUnit
(Results
26 - 40
of
40
) sorted by null
1
2
/external/llvm/lib/CodeGen/
AntiDepBreaker.h
45
virtual unsigned BreakAntiDependencies(const std::vector<
SUnit
>& SUnits,
MachineScheduler.cpp
499
bool ScheduleDAGMI::canAddEdge(
SUnit
*SuccSU,
SUnit
*PredSU) {
503
bool ScheduleDAGMI::addEdge(
SUnit
*SuccSU, const SDep &PredDep) {
520
void ScheduleDAGMI::releaseSucc(
SUnit
*SU, SDep *SuccEdge) {
521
SUnit
*SuccSU = SuccEdge->getSUnit();
548
void ScheduleDAGMI::releaseSuccessors(
SUnit
*SU) {
549
for (
SUnit
::succ_iterator I = SU->Succs.begin(), E = SU->Succs.end();
559
void ScheduleDAGMI::releasePred(
SUnit
*SU, SDep *PredEdge) {
560
SUnit
*PredSU = PredEdge->getSUnit();
587
void ScheduleDAGMI::releasePredecessors(
SUnit
*SU)
[
all
...]
PostRASchedulerList.cpp
113
std::vector<
SUnit
*> PendingQueue;
124
/// The schedule. Null
SUnit
*'s represent noop instructions.
125
std::vector<
SUnit
*> Sequence;
175
void ReleaseSucc(
SUnit
*SU, SDep *SuccEdge);
176
void ReleaseSuccessors(
SUnit
*SU);
177
void ScheduleNodeTopDown(
SUnit
*SU, unsigned CurCycle);
240
if (
SUnit
*SU = Sequence[i])
421
void SchedulePostRATDList::ReleaseSucc(
SUnit
*SU, SDep *SuccEdge) {
422
SUnit
*SuccSU = SuccEdge->getSUnit();
456
void SchedulePostRATDList::ReleaseSuccessors(
SUnit
*SU)
[
all
...]
DFAPacketizer.cpp
170
SUnit
*SU = &VLIWScheduler->SUnits[i];
190
SUnit
*SUI = MIToSUnit[MI];
191
assert(SUI && "Missing
SUnit
Info!");
200
SUnit
*SUJ = MIToSUnit[MJ];
201
assert(SUJ && "Missing
SUnit
Info!");
CriticalAntiDepBreaker.cpp
132
/// CriticalPathStep - Return the next
SUnit
after SU on the bottom-up
134
static const SDep *CriticalPathStep(const
SUnit
*SU) {
138
for (
SUnit
::const_pred_iterator P = SU->Preds.begin(), PE = SU->Preds.end();
140
const
SUnit
*PredSU = P->getSUnit();
446
BreakAntiDependencies(const std::vector<
SUnit
>& SUnits,
455
// Keep a map of the MachineInstr*'s back to the
SUnit
representing them.
459
DenseMap<MachineInstr*,const
SUnit
*> MISUnitMap;
462
const
SUnit
*Max = nullptr;
464
const
SUnit
*SU = &SUnits[i];
483
// Track progress along the critical path through the
SUnit
graph as we wal
[
all
...]
AggressiveAntiDepBreaker.cpp
260
static void AntiDepEdges(const
SUnit
*SU, std::vector<const SDep*>& Edges) {
262
for (
SUnit
::const_pred_iterator P = SU->Preds.begin(), PE = SU->Preds.end();
274
/// CriticalPathStep - Return the next
SUnit
after SU on the bottom-up
276
static const
SUnit
*CriticalPathStep(const
SUnit
*SU) {
281
for (
SUnit
::const_pred_iterator P = SU->Preds.begin(), PE = SU->Preds.end();
283
const
SUnit
*PredSU = P->getSUnit();
709
const std::vector<
SUnit
>& SUnits,
727
// ...need a map from MI to
SUnit
.
728
std::map<MachineInstr *, const
SUnit
*> MISUnitMap
[
all
...]
CriticalAntiDepBreaker.h
81
unsigned BreakAntiDependencies(const std::vector<
SUnit
>& SUnits,
ScoreboardHazardRecognizer.cpp
119
ScoreboardHazardRecognizer::getHazardType(
SUnit
*SU, int Stalls) {
179
void ScoreboardHazardRecognizer::EmitInstruction(
SUnit
*SU) {
AggressiveAntiDepBreaker.h
145
unsigned BreakAntiDependencies(const std::vector<
SUnit
>& SUnits,
/external/llvm/lib/Target/Hexagon/
HexagonVLIWPacketizer.cpp
137
bool isLegalToPacketizeTogether(
SUnit
*SUI,
SUnit
*SUJ) override;
141
bool isLegalToPruneDependencies(
SUnit
*SUI,
SUnit
*SUJ) override;
149
bool CanPromoteToDotNew(MachineInstr* MI,
SUnit
* PacketSU,
151
std::map <MachineInstr*,
SUnit
*> MIToSUnit,
154
bool CanPromoteToNewValue(MachineInstr* MI,
SUnit
* PacketSU,
156
std::map <MachineInstr*,
SUnit
*> MIToSUnit,
160
std::map <MachineInstr*,
SUnit
*> MIToSUnit);
163
std::map <MachineInstr*,
SUnit
*> MIToSUnit)
[
all
...]
/external/llvm/lib/CodeGen/SelectionDAG/
ScheduleDAGSDNodes.cpp
59
// Clear the scheduler's
SUnit
DAG.
67
/// NewSUnit - Creates a new
SUnit
and return a ptr to it.
69
SUnit
*ScheduleDAGSDNodes::newSUnit(SDNode *N) {
71
const
SUnit
*Addr = nullptr;
75
SUnits.push_back(
SUnit
(N, (unsigned)SUnits.size()));
79
SUnit
*SU = &SUnits.back();
90
SUnit
*ScheduleDAGSDNodes::Clone(
SUnit
*Old) {
91
SUnit
*SU = newSUnit(Old->getNode());
315
// of -1 means the SDNode does not yet have an associated
SUnit
[
all
...]
SelectionDAGPrinter.cpp
270
std::string ScheduleDAGSDNodes::getGraphNodeLabel(const
SUnit
*SU) const {
/external/llvm/lib/Target/PowerPC/
PPCHazardRecognizers.cpp
26
bool PPCDispatchGroupSBHazardRecognizer::isLoadAfterStore(
SUnit
*SU) {
56
bool PPCDispatchGroupSBHazardRecognizer::isBCTRAfterSet(
SUnit
*SU) {
141
PPCDispatchGroupSBHazardRecognizer::getHazardType(
SUnit
*SU, int Stalls) {
148
bool PPCDispatchGroupSBHazardRecognizer::ShouldPreferAnother(
SUnit
*SU) {
157
unsigned PPCDispatchGroupSBHazardRecognizer::PreEmitNoops(
SUnit
*SU) {
175
void PPCDispatchGroupSBHazardRecognizer::EmitInstruction(
SUnit
*SU) {
325
getHazardType(
SUnit
*SU, int Stalls) {
385
void PPCHazardRecognizer970::EmitInstruction(
SUnit
*SU) {
/external/llvm/lib/Target/ARM/
ARMHazardRecognizer.cpp
35
ARMHazardRecognizer::getHazardType(
SUnit
*SU, int Stalls) {
85
void ARMHazardRecognizer::EmitInstruction(
SUnit
*SU) {
/external/llvm/lib/Target/R600/
R600Packetizer.cpp
188
bool isLegalToPacketizeTogether(
SUnit
*SUI,
SUnit
*SUJ) override {
225
bool isLegalToPruneDependencies(
SUnit
*SUI,
SUnit
*SUJ) override {
Completed in 2281 milliseconds
1
2