diff --git a/lib/Analysis/DataStructure/Steensgaard.cpp b/lib/Analysis/DataStructure/Steensgaard.cpp index 88ebdb72b97..24765228001 100644 --- a/lib/Analysis/DataStructure/Steensgaard.cpp +++ b/lib/Analysis/DataStructure/Steensgaard.cpp @@ -209,17 +209,17 @@ bool Steens::run(Module &M) { AliasAnalysis::Result Steens::alias(const Value *V1, const Value *V2) { assert(ResultGraph && "Result graph has not been computed yet!"); - hash_map &GVM = ResultGraph->getScalarMap(); + hash_map &GSM = ResultGraph->getScalarMap(); - hash_map::iterator I = GVM.find(const_cast(V1)); - if (I != GVM.end() && I->second.getNode()) { + hash_map::iterator I = GSM.find(const_cast(V1)); + if (I != GSM.end() && I->second.getNode()) { DSNodeHandle &V1H = I->second; - hash_map::iterator J=GVM.find(const_cast(V2)); - if (J != GVM.end() && J->second.getNode()) { + hash_map::iterator J=GSM.find(const_cast(V2)); + if (J != GSM.end() && J->second.getNode()) { DSNodeHandle &V2H = J->second; // If the two pointers point to different data structure graph nodes, they // cannot alias! - if (V1H.getNode() != V2H.getNode()) { + if (V1H.getNode() != V2H.getNode()) { // FIXME: Handle incompleteness! ++NumNoAlias; return NoAlias; }