diff graal/com.oracle.graal.loop/src/com/oracle/graal/loop/LoopFragmentInside.java @ 18743:220d7f242e57

use deterministic iteration-order data structures
author Doug Simon <doug.simon@oracle.com>
date Sun, 21 Dec 2014 13:56:31 +1000
parents 1518c3296cc8
children f57d86eb036f
line wrap: on
line diff
--- a/graal/com.oracle.graal.loop/src/com/oracle/graal/loop/LoopFragmentInside.java	Sun Dec 21 13:53:15 2014 +1000
+++ b/graal/com.oracle.graal.loop/src/com/oracle/graal/loop/LoopFragmentInside.java	Sun Dec 21 13:56:31 2014 +1000
@@ -294,8 +294,8 @@
     private BeginNode mergeEnds() {
         assert isDuplicate();
         List<AbstractEndNode> endsToMerge = new LinkedList<>();
-        Map<AbstractEndNode, LoopEndNode> reverseEnds = new HashMap<>(); // map peel's exit to the
-        // corresponding loop exits
+        // map peel exits to the corresponding loop exits
+        Map<AbstractEndNode, LoopEndNode> reverseEnds = CollectionsFactory.newMap();
         LoopBeginNode loopBegin = original().loop().loopBegin();
         for (LoopEndNode le : loopBegin.loopEnds()) {
             AbstractEndNode duplicate = getDuplicatedNode(le);