Chris Lattner fab8596459 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
2004-06-19 20:13:48 +00:00
..
2004-06-05 17:43:52 +00:00
2004-06-08 17:53:24 +00:00
2004-06-08 17:53:24 +00:00
2004-03-30 00:20:08 +00:00
2004-06-15 21:52:58 +00:00
2004-05-26 22:07:18 +00:00
2004-06-10 01:57:38 +00:00
2004-05-26 22:07:18 +00:00
2004-06-05 00:03:27 +00:00
2003-11-21 20:23:48 +00:00
2004-06-17 17:56:54 +00:00