Author: dannyb Date: Fri Sep 28 19:50:40 2007 New Revision: 42462 URL: http://llvm.org/viewvc/llvm-project?rev=42462&view=rev Log: Switch to densemap rather than std::set
Modified: llvm/trunk/lib/Analysis/IPA/Andersens.cpp Modified: llvm/trunk/lib/Analysis/IPA/Andersens.cpp URL: http://llvm.org/viewvc/llvm-project/llvm/trunk/lib/Analysis/IPA/Andersens.cpp?rev=42462&r1=42461&r2=42462&view=diff ============================================================================== --- llvm/trunk/lib/Analysis/IPA/Andersens.cpp (original) +++ llvm/trunk/lib/Analysis/IPA/Andersens.cpp Fri Sep 28 19:50:40 2007 @@ -134,12 +134,18 @@ assert(Offset == 0 || Ty != AddressOf && "Offset is illegal on addressof constraints"); } + bool operator==(const Constraint &RHS) const { return RHS.Type == Type && RHS.Dest == Dest && RHS.Src == Src && RHS.Offset == Offset; } + + bool operator!=(const Constraint &RHS) const { + return !(*this == RHS); + } + bool operator<(const Constraint &RHS) const { if (RHS.Type != Type) return RHS.Type < Type; @@ -151,6 +157,23 @@ } }; + struct ConstraintKeyInfo { + static inline Constraint getEmptyKey() { + return Constraint(Constraint::Copy, ~0UL, ~0UL, ~0UL); + } + static inline Constraint getTombstoneKey() { + return Constraint(Constraint::Copy, ~0UL - 1, ~0UL - 1, ~0UL - 1); + } + static unsigned getHashValue(const Constraint &C) { + return C.Src ^ C.Dest ^ C.Type ^ C.Offset; + } + static bool isEqual(const Constraint &LHS, + const Constraint &RHS) { + return LHS.Type == RHS.Type && LHS.Dest == RHS.Dest + && LHS.Src == RHS.Src && LHS.Offset == RHS.Offset; + } + }; + // Node class - This class is used to represent a node in the constraint // graph. Due to various optimizations, it is not always the case that // there is a mapping from a Node to a Value. In particular, we add @@ -1750,7 +1773,7 @@ /// replaced by their the pointer equivalence class representative. void Andersens::RewriteConstraints() { std::vector<Constraint> NewConstraints; - std::set<Constraint> Seen; + DenseMap<Constraint, bool, ConstraintKeyInfo> Seen; PEClass2Node.clear(); PENLEClass2Node.clear(); @@ -1788,10 +1811,10 @@ C.Src = FindEquivalentNode(RHSNode, RHSLabel); C.Dest = FindEquivalentNode(FindNode(LHSNode), LHSLabel); if (C.Src == C.Dest && C.Type == Constraint::Copy - || Seen.count(C) != 0) + || Seen[C] == true) continue; - Seen.insert(C); + Seen[C] = true; NewConstraints.push_back(C); } Constraints.swap(NewConstraints); _______________________________________________ llvm-commits mailing list llvm-commits@cs.uiuc.edu http://lists.cs.uiuc.edu/mailman/listinfo/llvm-commits