mirror of
https://github.com/RPCS3/llvm-mirror.git
synced 2024-11-25 20:23:11 +01:00
whitespace
llvm-svn: 130942
This commit is contained in:
parent
ab39b8319b
commit
5946376390
@ -120,7 +120,7 @@ static const Value *getUnderlyingObjectForInstr(const MachineInstr *MI,
|
||||
// such aliases.
|
||||
if (PSV->isAliased(MFI))
|
||||
return 0;
|
||||
|
||||
|
||||
MayAlias = PSV->mayAlias(MFI);
|
||||
return V;
|
||||
}
|
||||
@ -174,7 +174,7 @@ void ScheduleDAGInstrs::AddSchedBarrierDeps() {
|
||||
for (MachineBasicBlock::succ_iterator SI = BB->succ_begin(),
|
||||
SE = BB->succ_end(); SI != SE; ++SI)
|
||||
for (MachineBasicBlock::livein_iterator I = (*SI)->livein_begin(),
|
||||
E = (*SI)->livein_end(); I != E; ++I) {
|
||||
E = (*SI)->livein_end(); I != E; ++I) {
|
||||
unsigned Reg = *I;
|
||||
if (Seen.insert(Reg))
|
||||
Uses[Reg].push_back(&ExitSU);
|
||||
@ -411,11 +411,11 @@ void ScheduleDAGInstrs::BuildSchedGraph(AliasAnalysis *AA) {
|
||||
#define STORE_LOAD_LATENCY 1
|
||||
unsigned TrueMemOrderLatency = 0;
|
||||
if (TID.isCall() || MI->hasUnmodeledSideEffects() ||
|
||||
(MI->hasVolatileMemoryRef() &&
|
||||
(MI->hasVolatileMemoryRef() &&
|
||||
(!TID.mayLoad() || !MI->isInvariantLoad(AA)))) {
|
||||
// Be conservative with these and add dependencies on all memory
|
||||
// references, even those that are known to not alias.
|
||||
for (std::map<const Value *, SUnit *>::iterator I =
|
||||
for (std::map<const Value *, SUnit *>::iterator I =
|
||||
NonAliasMemDefs.begin(), E = NonAliasMemDefs.end(); I != E; ++I) {
|
||||
I->second->addPred(SDep(SU, SDep::Order, /*Latency=*/0));
|
||||
}
|
||||
@ -458,9 +458,9 @@ void ScheduleDAGInstrs::BuildSchedGraph(AliasAnalysis *AA) {
|
||||
// A store to a specific PseudoSourceValue. Add precise dependencies.
|
||||
// Record the def in MemDefs, first adding a dep if there is
|
||||
// an existing def.
|
||||
std::map<const Value *, SUnit *>::iterator I =
|
||||
std::map<const Value *, SUnit *>::iterator I =
|
||||
((MayAlias) ? AliasMemDefs.find(V) : NonAliasMemDefs.find(V));
|
||||
std::map<const Value *, SUnit *>::iterator IE =
|
||||
std::map<const Value *, SUnit *>::iterator IE =
|
||||
((MayAlias) ? AliasMemDefs.end() : NonAliasMemDefs.end());
|
||||
if (I != IE) {
|
||||
I->second->addPred(SDep(SU, SDep::Order, /*Latency=*/0, /*Reg=*/0,
|
||||
@ -513,37 +513,37 @@ void ScheduleDAGInstrs::BuildSchedGraph(AliasAnalysis *AA) {
|
||||
if (MI->isInvariantLoad(AA)) {
|
||||
// Invariant load, no chain dependencies needed!
|
||||
} else {
|
||||
if (const Value *V =
|
||||
if (const Value *V =
|
||||
getUnderlyingObjectForInstr(MI, MFI, MayAlias)) {
|
||||
// A load from a specific PseudoSourceValue. Add precise dependencies.
|
||||
std::map<const Value *, SUnit *>::iterator I =
|
||||
std::map<const Value *, SUnit *>::iterator I =
|
||||
((MayAlias) ? AliasMemDefs.find(V) : NonAliasMemDefs.find(V));
|
||||
std::map<const Value *, SUnit *>::iterator IE =
|
||||
std::map<const Value *, SUnit *>::iterator IE =
|
||||
((MayAlias) ? AliasMemDefs.end() : NonAliasMemDefs.end());
|
||||
if (I != IE)
|
||||
I->second->addPred(SDep(SU, SDep::Order, /*Latency=*/0, /*Reg=*/0,
|
||||
/*isNormalMemory=*/true));
|
||||
if (MayAlias)
|
||||
AliasMemUses[V].push_back(SU);
|
||||
else
|
||||
else
|
||||
NonAliasMemUses[V].push_back(SU);
|
||||
} else {
|
||||
// A load with no underlying object. Depend on all
|
||||
// potentially aliasing stores.
|
||||
for (std::map<const Value *, SUnit *>::iterator I =
|
||||
for (std::map<const Value *, SUnit *>::iterator I =
|
||||
AliasMemDefs.begin(), E = AliasMemDefs.end(); I != E; ++I)
|
||||
I->second->addPred(SDep(SU, SDep::Order, /*Latency=*/0));
|
||||
|
||||
|
||||
PendingLoads.push_back(SU);
|
||||
MayAlias = true;
|
||||
}
|
||||
|
||||
|
||||
// Add dependencies on alias and barrier chains, if needed.
|
||||
if (MayAlias && AliasChain)
|
||||
AliasChain->addPred(SDep(SU, SDep::Order, /*Latency=*/0));
|
||||
if (BarrierChain)
|
||||
BarrierChain->addPred(SDep(SU, SDep::Order, /*Latency=*/0));
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
@ -572,11 +572,11 @@ void ScheduleDAGInstrs::ComputeLatency(SUnit *SU) {
|
||||
}
|
||||
}
|
||||
|
||||
void ScheduleDAGInstrs::ComputeOperandLatency(SUnit *Def, SUnit *Use,
|
||||
void ScheduleDAGInstrs::ComputeOperandLatency(SUnit *Def, SUnit *Use,
|
||||
SDep& dep) const {
|
||||
if (!InstrItins || InstrItins->isEmpty())
|
||||
return;
|
||||
|
||||
|
||||
// For a data dependency with a known register...
|
||||
if ((dep.getKind() != SDep::Data) || (dep.getReg() == 0))
|
||||
return;
|
||||
|
Loading…
Reference in New Issue
Block a user