6502/llvm-6502
1
0
Fork 0
mirror of https://github.com/c64scene-ar/llvm-6502.git synced 2025-06-18 11:24:01 +00:00
Code Issues Projects Releases Wiki Activity

Avoid exponential growth of a table. It feels like

Browse Source 
there should be a better way to do this.  PR 8679.



git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@120457 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
Dale Johannesen
2010-11-30 20:23:21 +00:00
parent c7373f8158
commit f619b5a665
1 changed files with 22 additions and 5 deletions
Download Patch File Download Diff File Expand all files Collapse all files

27
lib/Transforms/Scalar/SCCP.cpp
View File

@ -481,6 +481,23 @@ private:
} }
} }
/// InsertInOverdefinedPHIs - Insert an entry in the UsersOfOverdefinedPHIS
/// map for I and PN, but if one is there already, do not create another.
/// (Duplicate entries do not break anything directly, but can lead to
/// exponential growth of the table in rare cases.)
void InsertInOverdefinedPHIs(Instruction *I, PHINode *PN) {
std::multimap<PHINode*, Instruction*>::iterator J, E;
bool found = false;
tie(J, E) = UsersOfOverdefinedPHIs.equal_range(PN);
for (; J != E; ++J)
if (J->second == I) {
found = true;
break;
}
if (!found)
UsersOfOverdefinedPHIs.insert(std::make_pair(PN, I));
}
private: private:
friend class InstVisitor<SCCPSolver>; friend class InstVisitor<SCCPSolver>;
@ -973,9 +990,9 @@ void SCCPSolver::visitBinaryOperator(Instruction &I) {
if (Result.isConstant()) { if (Result.isConstant()) {
markConstant(IV, &I, Result.getConstant()); markConstant(IV, &I, Result.getConstant());
// Remember that this instruction is virtually using the PHI node // Remember that this instruction is virtually using the PHI node
// operands. // operands.
UsersOfOverdefinedPHIs.insert(std::make_pair(PN1, &I)); InsertInOverdefinedPHIs(&I, PN1);
UsersOfOverdefinedPHIs.insert(std::make_pair(PN2, &I)); InsertInOverdefinedPHIs(&I, PN2);
return; return;
} }
@ -1056,8 +1073,8 @@ void SCCPSolver::visitCmpInst(CmpInst &I) {
markConstant(&I, Result.getConstant()); markConstant(&I, Result.getConstant());
// Remember that this instruction is virtually using the PHI node // Remember that this instruction is virtually using the PHI node
// operands. // operands.
UsersOfOverdefinedPHIs.insert(std::make_pair(PN1, &I)); InsertInOverdefinedPHIs(&I, PN1);
UsersOfOverdefinedPHIs.insert(std::make_pair(PN2, &I)); InsertInOverdefinedPHIs(&I, PN2);
return; return;
} }