src/share/vm/opto/mulnode.cpp

*** 1,7 ****
  /*
!  * Copyright (c) 1997, 2012, 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) 1997, 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.
*** 86,98 ****
      Node *mul1 = in(1);
  #ifdef ASSERT
      // Check for dead loop
      int   op1 = mul1->Opcode();
      if( phase->eqv( mul1, this ) || phase->eqv( in(2), this ) ||
!         ( op1 == mul_opcode() || op1 == add_opcode() ) &&
          ( phase->eqv( mul1->in(1), this ) || phase->eqv( mul1->in(2), this ) ||
!           phase->eqv( mul1->in(1), mul1 ) || phase->eqv( mul1->in(2), mul1 ) ) )
        assert(false, "dead loop in MulNode::Ideal");
  #endif
  
      if( mul1->Opcode() == mul_opcode() ) {  // Left input is a multiply?
        // Mul of a constant?
--- 86,98 ----
      Node *mul1 = in(1);
  #ifdef ASSERT
      // Check for dead loop
      int   op1 = mul1->Opcode();
      if( phase->eqv( mul1, this ) || phase->eqv( in(2), this ) ||
!         ( ( op1 == mul_opcode() || op1 == add_opcode() ) &&
            ( phase->eqv( mul1->in(1), this ) || phase->eqv( mul1->in(2), this ) ||
!             phase->eqv( mul1->in(1), mul1 ) || phase->eqv( mul1->in(2), mul1 ) ) ) )
        assert(false, "dead loop in MulNode::Ideal");
  #endif
  
      if( mul1->Opcode() == mul_opcode() ) {  // Left input is a multiply?
        // Mul of a constant?