compute dominator tree children in a deterministic order that does not depend
authorChris Lattner <sabre@nondot.org>
Sat, 19 Jun 2004 20:13:48 +0000 (20:13 +0000)
committerChris Lattner <sabre@nondot.org>
Sat, 19 Jun 2004 20:13:48 +0000 (20:13 +0000)
commitfab8596459305f8017ccf92131e76c65dd2f6a94
tree1479ebd352f8d37d1c3b4e104939d41694efec67
parentf6437a3023c704e9cb4488b2fb58494a81e2a259
compute dominator tree children in a deterministic order that does not depend
on the address of BasicBlock objects in memory.  This eliminates stuff like this:

 Inorder Dominator Tree:
   [1]  %entry
     [2]  %loopentry
-      [3]  %loopexit
       [3]  %no_exit
-        [4]  %endif
         [4]  %then
+        [4]  %endif
+      [3]  %loopexit
       [3]  %return

git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@14253 91177308-0d34-0410-b5e6-96231b3b80d8
lib/VMCore/Dominators.cpp