*** old/src/jdk.internal.vm.compiler/share/classes/org.graalvm.compiler.core.test/src/org/graalvm/compiler/core/test/NodePropertiesTest.java	Fri Jul  7 09:29:36 2017
--- new/src/jdk.internal.vm.compiler/share/classes/org.graalvm.compiler.core.test/src/org/graalvm/compiler/core/test/NodePropertiesTest.java	Fri Jul  7 09:29:36 2017

*** 21,31 ****
--- 21,30 ----
   * questions.
   */
  package org.graalvm.compiler.core.test;
  
  import org.graalvm.compiler.api.directives.GraalDirectives;
  import org.graalvm.compiler.debug.Debug;
  import org.graalvm.compiler.graph.Node;
  import org.graalvm.compiler.graph.iterators.NodeIterable;
  import org.graalvm.compiler.graph.spi.Canonicalizable;
  import org.graalvm.compiler.graph.spi.SimplifierTool;
  import org.graalvm.compiler.java.ComputeLoopFrequenciesClosure;

*** 194,204 ****
--- 193,203 ----
          assertFrequency(g2, ITERATIONS_LOOP_1);
          GraphCostPhase gc1 = new GraphCostPhase();
          GraphCostPhase gc2 = new GraphCostPhase();
          gc1.apply(g1, htc);
          gc2.apply(g2, htc);
!         g1.getDebug().log("Test testDifferentLoopFaster --> 1.Graph cycles:%f size:%f vs. 2.Graph cycles:%f size:%f\n", gc1.finalCycles, gc1.finalSize, gc2.finalCycles, gc2.finalSize);
          Assert.assertTrue(gc2.finalCycles > gc1.finalCycles);
          Assert.assertTrue(gc2.finalSize == gc1.finalSize);
      }
  
      @Test

*** 212,222 ****
--- 211,221 ----
          assertFrequency(g2, ITERATIONS_LOOP_2);
          GraphCostPhase gc1 = new GraphCostPhase();
          GraphCostPhase gc2 = new GraphCostPhase();
          gc1.apply(g1, htc);
          gc2.apply(g2, htc);
!         g1.getDebug().log("Test testSameLoopMoreIterationsCostlier --> 1.Graph cycles:%f size:%f vs. 2.Graph cycles:%f size:%f\n", gc1.finalCycles, gc1.finalSize, gc2.finalCycles, gc2.finalSize);
          Assert.assertTrue(gc2.finalCycles > gc1.finalCycles);
          Assert.assertTrue(gc2.finalSize == gc1.finalSize);
      }
  
      @Test

*** 229,239 ****
--- 228,238 ----
          assertFrequency(g1, ITERATIONS_LOOP_1 * ITERATIONS_LOOP_2);
          GraphCostPhase gc1 = new GraphCostPhase();
          GraphCostPhase gc2 = new GraphCostPhase();
          gc1.apply(g1, htc);
          gc2.apply(g2, htc);
!         g1.getDebug().log("Test testDifferentLoopsInnerOuter --> 1.Graph cycles:%f size:%f vs. 2.Graph cycles:%f size:%f\n", gc1.finalCycles, gc1.finalSize, gc2.finalCycles, gc2.finalSize);
          Assert.assertTrue(gc2.finalSize > gc1.finalSize);
      }
  
      @Test
      public void testGraphCost() {

*** 244,254 ****
--- 243,253 ----
          new CanonicalizerPhase().apply(g2, htc);
          GraphCostPhase gc1 = new GraphCostPhase();
          GraphCostPhase gc2 = new GraphCostPhase();
          gc1.apply(g1, htc);
          gc2.apply(g2, htc);
!         g1.getDebug().log("Test Graph Cost --> 1.Graph cost:%f vs. 2.Graph cost:%f\n", gc1.finalCycles, gc2.finalCycles);
          Assert.assertTrue(gc2.finalCycles > gc1.finalCycles);
          Assert.assertTrue(gc2.finalSize == gc1.finalSize);
      }
  
      @Test