*** old/src/jdk.internal.vm.compiler/share/classes/org.graalvm.compiler.graph/src/org/graalvm/compiler/graph/NodeWorkList.java	Fri Jul  7 09:29:59 2017
--- new/src/jdk.internal.vm.compiler/share/classes/org.graalvm.compiler.graph/src/org/graalvm/compiler/graph/NodeWorkList.java	Fri Jul  7 09:29:59 2017

*** 25,35 ****
--- 25,35 ----
  import java.util.ArrayDeque;
  import java.util.Iterator;
  import java.util.NoSuchElementException;
  import java.util.Queue;
  
! import org.graalvm.compiler.debug.DebugContext;
  
  public abstract class NodeWorkList implements Iterable<Node> {
  
      protected final Queue<Node> worklist;
  

*** 73,89 ****
--- 73,91 ----
  
      public static final class IterativeNodeWorkList extends NodeWorkList {
          private static final int EXPLICIT_BITMAP_THRESHOLD = 10;
          protected NodeBitMap inQueue;
  
+         private final DebugContext debug;
          private int iterationLimit;
          private Node firstNoChange;
          private Node lastPull;
          private Node lastChain;
  
          public IterativeNodeWorkList(Graph graph, boolean fill, int iterationLimitPerNode) {
              super(graph, fill);
+             debug = graph.getDebug();
              assert iterationLimitPerNode > 0;
              long limit = (long) iterationLimitPerNode * graph.getNodeCount();
              iterationLimit = (int) Long.min(Integer.MAX_VALUE, limit);
          }
  

*** 92,102 ****
--- 94,104 ----
              return new QueueConsumingIterator() {
                  @Override
                  public boolean hasNext() {
                      dropDeleted();
                      if (iterationLimit <= 0) {
!                         Debug.log(Debug.INFO_LEVEL, "Exceeded iteration limit in IterativeNodeWorkList");
!                         debug.log(DebugContext.INFO_LEVEL, "Exceeded iteration limit in IterativeNodeWorkList");
                          return false;
                      }
                      return !worklist.isEmpty();
                  }