src/share/vm/opto/gcm.cpp

*** 1,7 ****
  /*
!  * Copyright (c) 1997, 2016, 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.
*** 929,939 ****
  
    Node_Backward_Iterator iter((Node *)_root, visited, stack, *this);
    Node *n;
  
    // Walk over all the nodes from last to first
!   while (n = iter.next()) {
      // Set the latency for the definitions of this instruction
      partial_latency_of_defs(n);
    }
  } // end ComputeLatenciesBackwards
  
--- 929,939 ----
  
    Node_Backward_Iterator iter((Node *)_root, visited, stack, *this);
    Node *n;
  
    // Walk over all the nodes from last to first
!   while ((n = iter.next())) {
      // Set the latency for the definitions of this instruction
      partial_latency_of_defs(n);
    }
  } // end ComputeLatenciesBackwards
  
*** 1204,1214 ****
  
    Node_Backward_Iterator iter((Node *)_root, visited, stack, *this);
    Node *self;
  
    // Walk over all the nodes from last to first
!   while (self = iter.next()) {
      Block* early = get_block_for_node(self); // Earliest legal placement
  
      if (self->is_top()) {
        // Top node goes in bb #2 with other constants.
        // It must be special-cased, because it has no out edges.
--- 1204,1214 ----
  
    Node_Backward_Iterator iter((Node *)_root, visited, stack, *this);
    Node *self;
  
    // Walk over all the nodes from last to first
!   while ((self = iter.next())) {
      Block* early = get_block_for_node(self); // Earliest legal placement
  
      if (self->is_top()) {
        // Top node goes in bb #2 with other constants.
        // It must be special-cased, because it has no out edges.
*** 1232,1242 ****
        case Op_CreateEx:
          // Don't move exception creation
          early->add_inst(self);
          continue;
          break;
!       case Op_CheckCastPP:
          // Don't move CheckCastPP nodes away from their input, if the input
          // is a rawptr (5071820).
          Node *def = self->in(1);
          if (def != NULL && def->bottom_type()->base() == Type::RawPtr) {
            early->add_inst(self);
--- 1232,1242 ----
        case Op_CreateEx:
          // Don't move exception creation
          early->add_inst(self);
          continue;
          break;
!       case Op_CheckCastPP: {
          // Don't move CheckCastPP nodes away from their input, if the input
          // is a rawptr (5071820).
          Node *def = self->in(1);
          if (def != NULL && def->bottom_type()->base() == Type::RawPtr) {
            early->add_inst(self);
*** 1245,1254 ****
--- 1245,1257 ----
  #endif
            continue;
          }
          break;
        }
+       default:
+         break;
+       }
      }
  
      // Gather LCA of all uses
      Block *LCA = NULL;
      {