RPCSX/llvm
1
0
Fork 0
mirror of https://github.com/RPCSX/llvm.git synced 2024-12-02 08:46:23 +00:00
Code Issues Actions Packages Projects Releases Wiki Activity

Check in the rest of this change. The isAntiDep flag needs to be passed

Browse Source 
to removePred because an SUnit can both data-depend and anti-depend
on the same SUnit.


git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@59969 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
Dan Gohman 2008-11-24 17:33:52 +00:00
parent 974b5f53f7
commit 942b8c8533
3 changed files with 5 additions and 4 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

5
include/llvm/CodeGen/ScheduleDAG.h
View File

@ -164,7 +164,7 @@ namespace llvm {
return true;
}
bool removePred(SUnit *N, bool isCtrl, bool isArtificial) {
bool removePred(SUnit *N, bool isCtrl, bool isArtificial, bool isAntiDep) {
for (SmallVector<SDep, 4>::iterator I = Preds.begin(), E = Preds.end();
I != E; ++I)
if (I->Dep == N && I->isCtrl == isCtrl && I->isArtificial == isArtificial) {
@ -172,7 +172,8 @@ namespace llvm {
for (SmallVector<SDep, 4>::iterator II = N->Succs.begin(),
EE = N->Succs.end(); II != EE; ++II)
if (II->Dep == this &&
II->isCtrl == isCtrl && II->isArtificial == isArtificial) {
II->isCtrl == isCtrl && II->isArtificial == isArtificial &&
II->isAntiDep == isAntiDep) {
FoundSucc = true;
N->Succs.erase(II);
break;

2
lib/CodeGen/SelectionDAG/ScheduleDAGFast.cpp
View File

@ -198,7 +198,7 @@ bool ScheduleDAGFast::AddPred(SUnit *Y, SUnit *X, bool isCtrl,
/// the current node M.
bool ScheduleDAGFast::RemovePred(SUnit *M, SUnit *N,
bool isCtrl, bool isArtificial) {
return M->removePred(N, isCtrl, isArtificial);
return M->removePred(N, isCtrl, isArtificial, false);
}
/// CopyAndMoveSuccessors - Clone the specified node and move its scheduled

2
lib/CodeGen/SelectionDAG/ScheduleDAGRRList.cpp
View File

@ -506,7 +506,7 @@ bool ScheduleDAGRRList::AddPred(SUnit *Y, SUnit *X, bool isCtrl,
bool ScheduleDAGRRList::RemovePred(SUnit *M, SUnit *N,
bool isCtrl, bool isArtificial) {
// InitDAGTopologicalSorting();
return M->removePred(N, isCtrl, isArtificial);
return M->removePred(N, isCtrl, isArtificial, false);
}
/// DFS - Make a DFS traversal to mark all nodes reachable from SU and mark