src/share/vm/opto/loopPredicate.cpp

*** 1,7 ****
  /*
!  * Copyright (c) 2011, 2014, Oracle and/or its affiliates. All rights reserved.
   * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
   *
   * This code is free software; you can redistribute it and/or modify it
   * under the terms of the GNU General Public License version 2 only, as
   * published by the Free Software Foundation.
--- 1,7 ----
  /*
!  * Copyright (c) 2011, 2017, Oracle and/or its affiliates. All rights reserved.
   * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
   *
   * This code is free software; you can redistribute it and/or modify it
   * under the terms of the GNU General Public License version 2 only, as
   * published by the Free Software Foundation.
*** 660,672 ****
    }
  
    if (offset && (!offset->is_Con() || offset->get_int() != 0)){
      max_idx_expr = new AddINode(max_idx_expr, offset);
      register_new_node(max_idx_expr, ctrl);
!     if (TraceLoopPredicate)
!       if (offset->is_Con()) predString->print("+ %d ", offset->get_int());
!       else predString->print("+ offset ");
    }
  
    CmpUNode* cmp = new CmpUNode(max_idx_expr, range);
    register_new_node(cmp, ctrl);
    BoolNode* bol = new BoolNode(cmp, BoolTest::lt);
--- 660,676 ----
    }
  
    if (offset && (!offset->is_Con() || offset->get_int() != 0)){
      max_idx_expr = new AddINode(max_idx_expr, offset);
      register_new_node(max_idx_expr, ctrl);
!     if (TraceLoopPredicate) {
!       if (offset->is_Con()) {
!         predString->print("+ %d ", offset->get_int());
!       } else {
!         predString->print("+ offset ");
!       }
!     }
    }
  
    CmpUNode* cmp = new CmpUNode(max_idx_expr, range);
    register_new_node(cmp, ctrl);
    BoolNode* bol = new BoolNode(cmp, BoolTest::lt);