6502/llvm-6502
1
0
Fork 0
mirror of https://github.com/c64scene-ar/llvm-6502.git synced 2025-03-03 14:31:10 +00:00
Code Issues Projects Releases Wiki Activity

Approved by Evan

Browse Source 
$ svn merge -c 114220 https://llvm.org/svn/llvm-project/llvm/trunk
--- Merging r114220 into '.':
U    lib/CodeGen/MachineCSE.cpp
$ svn merge -c 114222 https://llvm.org/svn/llvm-project/llvm/trunk
--- Merging r114222 into '.':
G    lib/CodeGen/MachineCSE.cpp



git-svn-id: https://llvm.org/svn/llvm-project/llvm/branches/release_28@114224 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
Bill Wendling 2010-09-17 22:09:07 +00:00
parent 19a50033ee
commit 71f7f73dfa
1 changed files with 8 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

9
lib/CodeGen/MachineCSE.cpp
View File

@ -54,6 +54,11 @@ namespace {
AU.addPreserved<MachineDominatorTree>(); AU.addPreserved<MachineDominatorTree>();
} }
virtual void releaseMemory() {
ScopeMap.clear();
Exps.clear();
}
private: private:
const unsigned LookAheadLimit; const unsigned LookAheadLimit;
typedef ScopedHashTableScope<MachineInstr*, unsigned, typedef ScopedHashTableScope<MachineInstr*, unsigned,
@ -101,7 +106,7 @@ bool MachineCSE::PerformTrivialCoalescing(MachineInstr *MI,
unsigned Reg = MO.getReg(); unsigned Reg = MO.getReg();
if (!Reg || TargetRegisterInfo::isPhysicalRegister(Reg)) if (!Reg || TargetRegisterInfo::isPhysicalRegister(Reg))
continue; continue;
if (!MRI->hasOneUse(Reg)) if (!MRI->hasOneNonDBGUse(Reg))
// Only coalesce single use copies. This ensure the copy will be // Only coalesce single use copies. This ensure the copy will be
// deleted. // deleted.
continue; continue;
@ -469,6 +474,8 @@ bool MachineCSE::PerformCSE(MachineDomTreeNode *Node) {
DenseMap<MachineDomTreeNode*, MachineDomTreeNode*> ParentMap; DenseMap<MachineDomTreeNode*, MachineDomTreeNode*> ParentMap;
DenseMap<MachineDomTreeNode*, unsigned> OpenChildren; DenseMap<MachineDomTreeNode*, unsigned> OpenChildren;
CurrVN = 0;
// Perform a DFS walk to determine the order of visit. // Perform a DFS walk to determine the order of visit.
WorkList.push_back(Node); WorkList.push_back(Node);
do { do {