src/share/vm/opto/phaseX.cpp

@@ -1,7 +1,7 @@
 /*
- * Copyright (c) 1997, 2016, Oracle and/or its affiliates. All rights reserved.
+ * 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.

@@ -393,11 +393,11 @@
 
 void NodeHash::operator=(const NodeHash& nh) {
   // Unlock all nodes upon replacement of table.
   if (&nh == this)  return;
   if (_table != (Node**)badAddress)  clear();
-  memcpy(this, &nh, sizeof(*this));
+  memcpy((void*)this, (void*)&nh, sizeof(*this));
   // Do not increment hash_lock counts again.
   // Instead, be sure we never again use the source table.
   ((NodeHash*)&nh)->_table = (Node**)badAddress;
 }
 

@@ -692,10 +692,11 @@
   switch (t->base()) {  // fast paths
   case Type::Half:
   case Type::Top:  return (ConNode*) C->top();
   case Type::Int:  return intcon( t->is_int()->get_con() );
   case Type::Long: return longcon( t->is_long()->get_con() );
+  default:         break;
   }
   if (t->is_zero_type())
     return zerocon(t->basic_type());
   return uncached_makecon(t);
 }

@@ -1673,10 +1674,12 @@
     assert(t0->isa_int()->_widen <= t->isa_int()->_widen, "widen increases");
     break;
   case Type::Long:
     assert(t0->isa_long()->_widen <= t->isa_long()->_widen, "widen increases");
     break;
+  default:
+    break;
   }
   return true;
 }
 #endif //ASSERT