--- a/hotspot/src/share/vm/libadt/vectset.cpp	Thu Apr 07 10:50:08 2016 +0000
+++ b/hotspot/src/share/vm/libadt/vectset.cpp	Thu Apr 07 12:16:03 2016 +0000
@@ -31,7 +31,7 @@
 // BitsInByte is a lookup table which tells the number of bits that
 // are in the looked-up number.  It is very useful in VectorSet_Size.
 
-uint8_t bitsInByte[256] = {
+uint8_t bitsInByte[BITS_IN_BYTE_ARRAY_SIZE] = {
   0, 1, 1, 2, 1, 2, 2, 3, 1, 2, 2, 3, 2, 3, 3, 4,
   1, 2, 2, 3, 2, 3, 3, 4, 2, 3, 3, 4, 3, 4, 4, 5,
   1, 2, 2, 3, 2, 3, 3, 4, 2, 3, 3, 4, 3, 4, 4, 5,

--- a/hotspot/src/share/vm/libadt/vectset.hpp	Thu Apr 07 10:50:08 2016 +0000
+++ b/hotspot/src/share/vm/libadt/vectset.hpp	Thu Apr 07 12:16:03 2016 +0000
@@ -27,6 +27,8 @@
 
 #include "libadt/set.hpp"
 
+#define BITS_IN_BYTE_ARRAY_SIZE 256
+
 // Vector Sets - An Abstract Data Type
 //INTERFACE
 

--- a/hotspot/src/share/vm/opto/regmask.cpp	Thu Apr 07 10:50:08 2016 +0000
+++ b/hotspot/src/share/vm/opto/regmask.cpp	Thu Apr 07 12:16:03 2016 +0000
@@ -389,7 +389,7 @@
 //------------------------------Size-------------------------------------------
 // Compute size of register mask in bits
 uint RegMask::Size() const {
-  extern uint8_t bitsInByte[512];
+  extern uint8_t bitsInByte[BITS_IN_BYTE_ARRAY_SIZE];
   uint sum = 0;
   for( int i = 0; i < RM_SIZE; i++ )
     sum +=