diff options
author | Bill Wendling <isanbard@gmail.com> | 2008-02-26 10:51:52 +0000 |
---|---|---|
committer | Bill Wendling <isanbard@gmail.com> | 2008-02-26 10:51:52 +0000 |
commit | 059e62c8b6a5833a8d7d91c0591184c5d020e310 (patch) | |
tree | 9ac2d6e74bc6c90b58620fb3e0463434b422dd77 /lib/Analysis | |
parent | 68ca1825b78b7cd8b980e7ab28bfe4f1b8135dda (diff) | |
download | external_llvm-059e62c8b6a5833a8d7d91c0591184c5d020e310.zip external_llvm-059e62c8b6a5833a8d7d91c0591184c5d020e310.tar.gz external_llvm-059e62c8b6a5833a8d7d91c0591184c5d020e310.tar.bz2 |
De-tabify.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@47598 91177308-0d34-0410-b5e6-96231b3b80d8
Diffstat (limited to 'lib/Analysis')
-rw-r--r-- | lib/Analysis/IPA/Andersens.cpp | 16 |
1 files changed, 8 insertions, 8 deletions
diff --git a/lib/Analysis/IPA/Andersens.cpp b/lib/Analysis/IPA/Andersens.cpp index 22f151b..345b8bd 100644 --- a/lib/Analysis/IPA/Andersens.cpp +++ b/lib/Analysis/IPA/Andersens.cpp @@ -2347,15 +2347,15 @@ void Andersens::SolveConstraints() { unsigned DestVar = *bi; unsigned Rep = FindNode(DestVar); - // If we ended up with this node as our destination, or we've already - // got an edge for the representative, delete the current edge. - if (Rep == CurrNodeIndex || - (Rep != DestVar && NewEdges.test(Rep))) { - ToErase.set(DestVar); - continue; - } + // If we ended up with this node as our destination, or we've already + // got an edge for the representative, delete the current edge. + if (Rep == CurrNodeIndex || + (Rep != DestVar && NewEdges.test(Rep))) { + ToErase.set(DestVar); + continue; + } - std::pair<unsigned,unsigned> edge(CurrNodeIndex,Rep); + std::pair<unsigned,unsigned> edge(CurrNodeIndex,Rep); // This is where we do lazy cycle detection. // If this is a cycle candidate (equal points-to sets and this |