src/share/vm/utilities/globalDefinitions.cpp

Thu, 27 May 2010 18:01:56 -0700

author
kvn
date
Thu, 27 May 2010 18:01:56 -0700
changeset 1926
2d127394260e
parent 631
d1605aabd0a1
child 1934
e9ff18c4ace7
permissions
-rw-r--r--

6916623: Align object to 16 bytes to use Compressed Oops with java heap up to 64Gb
Summary: Added new product ObjectAlignmentInBytes flag to control object alignment.
Reviewed-by: twisti, ysr, iveresov

duke@435 1 /*
xdono@631 2 * Copyright 1997-2008 Sun Microsystems, Inc. All Rights Reserved.
duke@435 3 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
duke@435 4 *
duke@435 5 * This code is free software; you can redistribute it and/or modify it
duke@435 6 * under the terms of the GNU General Public License version 2 only, as
duke@435 7 * published by the Free Software Foundation.
duke@435 8 *
duke@435 9 * This code is distributed in the hope that it will be useful, but WITHOUT
duke@435 10 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
duke@435 11 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
duke@435 12 * version 2 for more details (a copy is included in the LICENSE file that
duke@435 13 * accompanied this code).
duke@435 14 *
duke@435 15 * You should have received a copy of the GNU General Public License version
duke@435 16 * 2 along with this work; if not, write to the Free Software Foundation,
duke@435 17 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
duke@435 18 *
duke@435 19 * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara,
duke@435 20 * CA 95054 USA or visit www.sun.com if you need additional information or
duke@435 21 * have any questions.
duke@435 22 *
duke@435 23 */
duke@435 24
duke@435 25 # include "incls/_precompiled.incl"
duke@435 26 # include "incls/_globalDefinitions.cpp.incl"
coleenp@548 27 // Basic error support
duke@435 28
coleenp@548 29 // Info for oops within a java object. Defaults are zero so
coleenp@548 30 // things will break badly if incorrectly initialized.
coleenp@548 31 int heapOopSize = 0;
coleenp@548 32 int LogBytesPerHeapOop = 0;
coleenp@548 33 int LogBitsPerHeapOop = 0;
coleenp@548 34 int BytesPerHeapOop = 0;
coleenp@548 35 int BitsPerHeapOop = 0;
duke@435 36
kvn@1926 37 // Object alignment, in units of HeapWords.
kvn@1926 38 // Defaults are -1 so things will break badly if incorrectly initialized.
kvn@1926 39 int MinObjAlignment = -1;
kvn@1926 40 int MinObjAlignmentInBytes = -1;
kvn@1926 41 int MinObjAlignmentInBytesMask = 0;
kvn@1926 42
kvn@1926 43 int LogMinObjAlignment = -1;
kvn@1926 44 int LogMinObjAlignmentInBytes = -1;
kvn@1926 45
kvn@1926 46 // Oop encoding heap max
kvn@1926 47 uint64_t OopEncodingHeapMax = 0;
kvn@1926 48
duke@435 49 void basic_fatal(const char* msg) {
duke@435 50 fatal(msg);
duke@435 51 }
duke@435 52
duke@435 53 // Something to help porters sleep at night
duke@435 54
coleenp@548 55 void basic_types_init() {
duke@435 56 #ifdef ASSERT
duke@435 57 #ifdef _LP64
duke@435 58 assert(min_intx == (intx)CONST64(0x8000000000000000), "correct constant");
duke@435 59 assert(max_intx == CONST64(0x7FFFFFFFFFFFFFFF), "correct constant");
duke@435 60 assert(max_uintx == CONST64(0xFFFFFFFFFFFFFFFF), "correct constant");
duke@435 61 assert( 8 == sizeof( intx), "wrong size for basic type");
duke@435 62 assert( 8 == sizeof( jobject), "wrong size for basic type");
duke@435 63 #else
duke@435 64 assert(min_intx == (intx)0x80000000, "correct constant");
duke@435 65 assert(max_intx == 0x7FFFFFFF, "correct constant");
duke@435 66 assert(max_uintx == 0xFFFFFFFF, "correct constant");
duke@435 67 assert( 4 == sizeof( intx), "wrong size for basic type");
duke@435 68 assert( 4 == sizeof( jobject), "wrong size for basic type");
duke@435 69 #endif
duke@435 70 assert( (~max_juint) == 0, "max_juint has all its bits");
duke@435 71 assert( (~max_uintx) == 0, "max_uintx has all its bits");
duke@435 72 assert( (~max_julong) == 0, "max_julong has all its bits");
duke@435 73 assert( 1 == sizeof( jbyte), "wrong size for basic type");
duke@435 74 assert( 2 == sizeof( jchar), "wrong size for basic type");
duke@435 75 assert( 2 == sizeof( jshort), "wrong size for basic type");
duke@435 76 assert( 4 == sizeof( juint), "wrong size for basic type");
duke@435 77 assert( 4 == sizeof( jint), "wrong size for basic type");
duke@435 78 assert( 1 == sizeof( jboolean), "wrong size for basic type");
duke@435 79 assert( 8 == sizeof( jlong), "wrong size for basic type");
duke@435 80 assert( 4 == sizeof( jfloat), "wrong size for basic type");
duke@435 81 assert( 8 == sizeof( jdouble), "wrong size for basic type");
duke@435 82 assert( 1 == sizeof( u1), "wrong size for basic type");
duke@435 83 assert( 2 == sizeof( u2), "wrong size for basic type");
duke@435 84 assert( 4 == sizeof( u4), "wrong size for basic type");
duke@435 85
duke@435 86 int num_type_chars = 0;
duke@435 87 for (int i = 0; i < 99; i++) {
duke@435 88 if (type2char((BasicType)i) != 0) {
duke@435 89 assert(char2type(type2char((BasicType)i)) == i, "proper inverses");
duke@435 90 num_type_chars++;
duke@435 91 }
duke@435 92 }
duke@435 93 assert(num_type_chars == 11, "must have tested the right number of mappings");
duke@435 94 assert(char2type(0) == T_ILLEGAL, "correct illegality");
duke@435 95
duke@435 96 {
duke@435 97 for (int i = T_BOOLEAN; i <= T_CONFLICT; i++) {
duke@435 98 BasicType vt = (BasicType)i;
duke@435 99 BasicType ft = type2field[vt];
duke@435 100 switch (vt) {
duke@435 101 // the following types might plausibly show up in memory layouts:
duke@435 102 case T_BOOLEAN:
duke@435 103 case T_BYTE:
duke@435 104 case T_CHAR:
duke@435 105 case T_SHORT:
duke@435 106 case T_INT:
duke@435 107 case T_FLOAT:
duke@435 108 case T_DOUBLE:
duke@435 109 case T_LONG:
duke@435 110 case T_OBJECT:
duke@435 111 case T_ADDRESS: // random raw pointer
coleenp@548 112 case T_NARROWOOP: // compressed pointer
duke@435 113 case T_CONFLICT: // might as well support a bottom type
duke@435 114 case T_VOID: // padding or other unaddressed word
duke@435 115 // layout type must map to itself
duke@435 116 assert(vt == ft, "");
duke@435 117 break;
duke@435 118 default:
duke@435 119 // non-layout type must map to a (different) layout type
duke@435 120 assert(vt != ft, "");
duke@435 121 assert(ft == type2field[ft], "");
duke@435 122 }
duke@435 123 // every type must map to same-sized layout type:
duke@435 124 assert(type2size[vt] == type2size[ft], "");
duke@435 125 }
duke@435 126 }
duke@435 127 // These are assumed, e.g., when filling HeapWords with juints.
duke@435 128 assert(is_power_of_2(sizeof(juint)), "juint must be power of 2");
duke@435 129 assert(is_power_of_2(HeapWordSize), "HeapWordSize must be power of 2");
duke@435 130 assert((size_t)HeapWordSize >= sizeof(juint),
duke@435 131 "HeapWord should be at least as large as juint");
duke@435 132 assert(sizeof(NULL) == sizeof(char*), "NULL must be same size as pointer");
duke@435 133 #endif
duke@435 134
duke@435 135 if( JavaPriority1_To_OSPriority != -1 )
duke@435 136 os::java_to_os_priority[1] = JavaPriority1_To_OSPriority;
duke@435 137 if( JavaPriority2_To_OSPriority != -1 )
duke@435 138 os::java_to_os_priority[2] = JavaPriority2_To_OSPriority;
duke@435 139 if( JavaPriority3_To_OSPriority != -1 )
duke@435 140 os::java_to_os_priority[3] = JavaPriority3_To_OSPriority;
duke@435 141 if( JavaPriority4_To_OSPriority != -1 )
duke@435 142 os::java_to_os_priority[4] = JavaPriority4_To_OSPriority;
duke@435 143 if( JavaPriority5_To_OSPriority != -1 )
duke@435 144 os::java_to_os_priority[5] = JavaPriority5_To_OSPriority;
duke@435 145 if( JavaPriority6_To_OSPriority != -1 )
duke@435 146 os::java_to_os_priority[6] = JavaPriority6_To_OSPriority;
duke@435 147 if( JavaPriority7_To_OSPriority != -1 )
duke@435 148 os::java_to_os_priority[7] = JavaPriority7_To_OSPriority;
duke@435 149 if( JavaPriority8_To_OSPriority != -1 )
duke@435 150 os::java_to_os_priority[8] = JavaPriority8_To_OSPriority;
duke@435 151 if( JavaPriority9_To_OSPriority != -1 )
duke@435 152 os::java_to_os_priority[9] = JavaPriority9_To_OSPriority;
duke@435 153 if(JavaPriority10_To_OSPriority != -1 )
duke@435 154 os::java_to_os_priority[10] = JavaPriority10_To_OSPriority;
coleenp@548 155
coleenp@548 156 // Set the size of basic types here (after argument parsing but before
coleenp@548 157 // stub generation).
coleenp@548 158 if (UseCompressedOops) {
coleenp@548 159 // Size info for oops within java objects is fixed
coleenp@548 160 heapOopSize = jintSize;
coleenp@548 161 LogBytesPerHeapOop = LogBytesPerInt;
coleenp@548 162 LogBitsPerHeapOop = LogBitsPerInt;
coleenp@548 163 BytesPerHeapOop = BytesPerInt;
coleenp@548 164 BitsPerHeapOop = BitsPerInt;
coleenp@548 165 } else {
coleenp@548 166 heapOopSize = oopSize;
coleenp@548 167 LogBytesPerHeapOop = LogBytesPerWord;
coleenp@548 168 LogBitsPerHeapOop = LogBitsPerWord;
coleenp@548 169 BytesPerHeapOop = BytesPerWord;
coleenp@548 170 BitsPerHeapOop = BitsPerWord;
coleenp@548 171 }
coleenp@548 172 _type2aelembytes[T_OBJECT] = heapOopSize;
coleenp@548 173 _type2aelembytes[T_ARRAY] = heapOopSize;
duke@435 174 }
duke@435 175
duke@435 176
duke@435 177 // Map BasicType to signature character
coleenp@548 178 char type2char_tab[T_CONFLICT+1]={ 0, 0, 0, 0, 'Z', 'C', 'F', 'D', 'B', 'S', 'I', 'J', 'L', '[', 'V', 0, 0, 0};
duke@435 179
duke@435 180 // Map BasicType to Java type name
duke@435 181 const char* type2name_tab[T_CONFLICT+1] = {
duke@435 182 NULL, NULL, NULL, NULL,
duke@435 183 "boolean",
duke@435 184 "char",
duke@435 185 "float",
duke@435 186 "double",
duke@435 187 "byte",
duke@435 188 "short",
duke@435 189 "int",
duke@435 190 "long",
duke@435 191 "object",
duke@435 192 "array",
duke@435 193 "void",
duke@435 194 "*address*",
coleenp@548 195 "*narrowoop*",
duke@435 196 "*conflict*"
duke@435 197 };
duke@435 198
duke@435 199
duke@435 200 BasicType name2type(const char* name) {
duke@435 201 for (int i = T_BOOLEAN; i <= T_VOID; i++) {
duke@435 202 BasicType t = (BasicType)i;
duke@435 203 if (type2name_tab[t] != NULL && 0 == strcmp(type2name_tab[t], name))
duke@435 204 return t;
duke@435 205 }
duke@435 206 return T_ILLEGAL;
duke@435 207 }
duke@435 208
duke@435 209
duke@435 210 // Map BasicType to size in words
coleenp@548 211 int type2size[T_CONFLICT+1]={ -1, 0, 0, 0, 1, 1, 1, 2, 1, 1, 1, 2, 1, 1, 0, 1, 1, -1};
duke@435 212
duke@435 213 BasicType type2field[T_CONFLICT+1] = {
duke@435 214 (BasicType)0, // 0,
duke@435 215 (BasicType)0, // 1,
duke@435 216 (BasicType)0, // 2,
duke@435 217 (BasicType)0, // 3,
duke@435 218 T_BOOLEAN, // T_BOOLEAN = 4,
duke@435 219 T_CHAR, // T_CHAR = 5,
duke@435 220 T_FLOAT, // T_FLOAT = 6,
duke@435 221 T_DOUBLE, // T_DOUBLE = 7,
duke@435 222 T_BYTE, // T_BYTE = 8,
duke@435 223 T_SHORT, // T_SHORT = 9,
duke@435 224 T_INT, // T_INT = 10,
duke@435 225 T_LONG, // T_LONG = 11,
duke@435 226 T_OBJECT, // T_OBJECT = 12,
duke@435 227 T_OBJECT, // T_ARRAY = 13,
duke@435 228 T_VOID, // T_VOID = 14,
duke@435 229 T_ADDRESS, // T_ADDRESS = 15,
coleenp@548 230 T_NARROWOOP, // T_NARROWOOP= 16,
coleenp@548 231 T_CONFLICT // T_CONFLICT = 17,
duke@435 232 };
duke@435 233
duke@435 234
duke@435 235 BasicType type2wfield[T_CONFLICT+1] = {
duke@435 236 (BasicType)0, // 0,
duke@435 237 (BasicType)0, // 1,
duke@435 238 (BasicType)0, // 2,
duke@435 239 (BasicType)0, // 3,
duke@435 240 T_INT, // T_BOOLEAN = 4,
duke@435 241 T_INT, // T_CHAR = 5,
duke@435 242 T_FLOAT, // T_FLOAT = 6,
duke@435 243 T_DOUBLE, // T_DOUBLE = 7,
duke@435 244 T_INT, // T_BYTE = 8,
duke@435 245 T_INT, // T_SHORT = 9,
duke@435 246 T_INT, // T_INT = 10,
duke@435 247 T_LONG, // T_LONG = 11,
duke@435 248 T_OBJECT, // T_OBJECT = 12,
duke@435 249 T_OBJECT, // T_ARRAY = 13,
duke@435 250 T_VOID, // T_VOID = 14,
duke@435 251 T_ADDRESS, // T_ADDRESS = 15,
coleenp@548 252 T_NARROWOOP, // T_NARROWOOP = 16,
coleenp@548 253 T_CONFLICT // T_CONFLICT = 17,
duke@435 254 };
duke@435 255
duke@435 256
kvn@464 257 int _type2aelembytes[T_CONFLICT+1] = {
duke@435 258 0, // 0
duke@435 259 0, // 1
duke@435 260 0, // 2
duke@435 261 0, // 3
duke@435 262 T_BOOLEAN_aelem_bytes, // T_BOOLEAN = 4,
duke@435 263 T_CHAR_aelem_bytes, // T_CHAR = 5,
duke@435 264 T_FLOAT_aelem_bytes, // T_FLOAT = 6,
duke@435 265 T_DOUBLE_aelem_bytes, // T_DOUBLE = 7,
duke@435 266 T_BYTE_aelem_bytes, // T_BYTE = 8,
duke@435 267 T_SHORT_aelem_bytes, // T_SHORT = 9,
duke@435 268 T_INT_aelem_bytes, // T_INT = 10,
duke@435 269 T_LONG_aelem_bytes, // T_LONG = 11,
duke@435 270 T_OBJECT_aelem_bytes, // T_OBJECT = 12,
duke@435 271 T_ARRAY_aelem_bytes, // T_ARRAY = 13,
duke@435 272 0, // T_VOID = 14,
kvn@464 273 T_OBJECT_aelem_bytes, // T_ADDRESS = 15,
coleenp@548 274 T_NARROWOOP_aelem_bytes,// T_NARROWOOP= 16,
coleenp@548 275 0 // T_CONFLICT = 17,
duke@435 276 };
duke@435 277
kvn@464 278 #ifdef ASSERT
kvn@464 279 int type2aelembytes(BasicType t, bool allow_address) {
kvn@464 280 assert(allow_address || t != T_ADDRESS, " ");
kvn@464 281 return _type2aelembytes[t];
kvn@464 282 }
kvn@464 283 #endif
duke@435 284
duke@435 285 // Support for 64-bit integer arithmetic
duke@435 286
duke@435 287 // The following code is mostly taken from JVM typedefs_md.h and system_md.c
duke@435 288
coleenp@548 289 static const jlong high_bit = (jlong)1 << (jlong)63;
duke@435 290 static const jlong other_bits = ~high_bit;
duke@435 291
duke@435 292 jlong float2long(jfloat f) {
duke@435 293 jlong tmp = (jlong) f;
duke@435 294 if (tmp != high_bit) {
duke@435 295 return tmp;
duke@435 296 } else {
duke@435 297 if (g_isnan((jdouble)f)) {
duke@435 298 return 0;
duke@435 299 }
duke@435 300 if (f < 0) {
duke@435 301 return high_bit;
duke@435 302 } else {
duke@435 303 return other_bits;
duke@435 304 }
duke@435 305 }
duke@435 306 }
duke@435 307
duke@435 308
duke@435 309 jlong double2long(jdouble f) {
duke@435 310 jlong tmp = (jlong) f;
duke@435 311 if (tmp != high_bit) {
duke@435 312 return tmp;
duke@435 313 } else {
duke@435 314 if (g_isnan(f)) {
duke@435 315 return 0;
duke@435 316 }
duke@435 317 if (f < 0) {
duke@435 318 return high_bit;
duke@435 319 } else {
duke@435 320 return other_bits;
duke@435 321 }
duke@435 322 }
duke@435 323 }
duke@435 324
duke@435 325 // least common multiple
duke@435 326 size_t lcm(size_t a, size_t b) {
duke@435 327 size_t cur, div, next;
duke@435 328
duke@435 329 cur = MAX2(a, b);
duke@435 330 div = MIN2(a, b);
duke@435 331
duke@435 332 assert(div != 0, "lcm requires positive arguments");
duke@435 333
duke@435 334
duke@435 335 while ((next = cur % div) != 0) {
duke@435 336 cur = div; div = next;
duke@435 337 }
duke@435 338
duke@435 339
duke@435 340 julong result = julong(a) * b / div;
duke@435 341 assert(result <= (size_t)max_uintx, "Integer overflow in lcm");
duke@435 342
duke@435 343 return size_t(result);
duke@435 344 }

mercurial