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

Switch this back to using an std::map. DenseMap entries are getting invalidated

Browse Source 
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@33799 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
Chris Lattner 2007-02-02 22:36:16 +00:00
parent e3770db707
commit c1ec780d1e
1 changed files with 5 additions and 5 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

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

@ -138,7 +138,7 @@ public:
/// ///
class SCCPSolver : public InstVisitor<SCCPSolver> { class SCCPSolver : public InstVisitor<SCCPSolver> {
SmallSet<BasicBlock*, 16> BBExecutable;// The basic blocks that are executable SmallSet<BasicBlock*, 16> BBExecutable;// The basic blocks that are executable
DenseMap<Value*, LatticeVal> ValueState; // The state each value is in. std::map<Value*, LatticeVal> ValueState; // The state each value is in.
/// GlobalValue - If we are tracking any values for the contents of a global /// GlobalValue - If we are tracking any values for the contents of a global
/// variable, we keep a mapping from the constant accessor to the element of /// variable, we keep a mapping from the constant accessor to the element of
@ -222,7 +222,7 @@ public:
/// getValueMapping - Once we have solved for constants, return the mapping of /// getValueMapping - Once we have solved for constants, return the mapping of
/// LLVM values to LatticeVals. /// LLVM values to LatticeVals.
DenseMap<Value*, LatticeVal> &getValueMapping() { std::map<Value*, LatticeVal> &getValueMapping() {
return ValueState; return ValueState;
} }
@ -303,7 +303,7 @@ private:
// Instruction object, then use this accessor to get its value from the map. // Instruction object, then use this accessor to get its value from the map.
// //
inline LatticeVal &getValueState(Value *V) { inline LatticeVal &getValueState(Value *V) {
DenseMap<Value*, LatticeVal>::iterator I = ValueState.find(V); std::map<Value*, LatticeVal>::iterator I = ValueState.find(V);
if (I != ValueState.end()) return I->second; // Common case, in the map if (I != ValueState.end()) return I->second; // Common case, in the map
if (Constant *C = dyn_cast<Constant>(V)) { if (Constant *C = dyn_cast<Constant>(V)) {
@ -1364,7 +1364,7 @@ bool SCCP::runOnFunction(Function &F) {
Solver.MarkBlockExecutable(F.begin()); Solver.MarkBlockExecutable(F.begin());
// Mark all arguments to the function as being overdefined. // Mark all arguments to the function as being overdefined.
DenseMap<Value*, LatticeVal> &Values = Solver.getValueMapping(); std::map<Value*, LatticeVal> &Values = Solver.getValueMapping();
for (Function::arg_iterator AI = F.arg_begin(), E = F.arg_end(); AI != E; ++AI) for (Function::arg_iterator AI = F.arg_begin(), E = F.arg_end(); AI != E; ++AI)
Values[AI].markOverdefined(); Values[AI].markOverdefined();
@ -1485,7 +1485,7 @@ bool IPSCCP::runOnModule(Module &M) {
// Loop over all functions, marking arguments to those with their addresses // Loop over all functions, marking arguments to those with their addresses
// taken or that are external as overdefined. // taken or that are external as overdefined.
// //
DenseMap<Value*, LatticeVal> &Values = Solver.getValueMapping(); std::map<Value*, LatticeVal> &Values = Solver.getValueMapping();
for (Module::iterator F = M.begin(), E = M.end(); F != E; ++F) for (Module::iterator F = M.begin(), E = M.end(); F != E; ++F)
if (!F->hasInternalLinkage() || AddressIsTaken(F)) { if (!F->hasInternalLinkage() || AddressIsTaken(F)) {
if (!F->isDeclaration()) if (!F->isDeclaration())