src/share/vm/utilities/globalDefinitions.cpp

Sat, 18 May 2013 20:41:01 -0700

author
iklam
date
Sat, 18 May 2013 20:41:01 -0700
changeset 5144
a5d6f0c3585f
parent 4889
cc32ccaaf47f
child 6198
55fb97c4c58d
permissions
-rw-r--r--

8014262: PrintStringTableStatistics should include more footprint info
Summary: Added info for the string/symbol objects and the hash entries
Reviewed-by: coleenp, rbackman

duke@435 1 /*
coleenp@4037 2 * Copyright (c) 1997, 2012, Oracle and/or its affiliates. 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 *
trims@1907 19 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
trims@1907 20 * or visit www.oracle.com if you need additional information or have any
trims@1907 21 * questions.
duke@435 22 *
duke@435 23 */
duke@435 24
stefank@2314 25 #include "precompiled.hpp"
stefank@2314 26 #include "runtime/os.hpp"
stefank@2314 27 #include "utilities/globalDefinitions.hpp"
stefank@2314 28 #include "utilities/top.hpp"
stefank@2314 29
coleenp@548 30 // Basic error support
duke@435 31
coleenp@548 32 // Info for oops within a java object. Defaults are zero so
coleenp@548 33 // things will break badly if incorrectly initialized.
coleenp@548 34 int heapOopSize = 0;
coleenp@548 35 int LogBytesPerHeapOop = 0;
coleenp@548 36 int LogBitsPerHeapOop = 0;
coleenp@548 37 int BytesPerHeapOop = 0;
coleenp@548 38 int BitsPerHeapOop = 0;
duke@435 39
kvn@1926 40 // Object alignment, in units of HeapWords.
kvn@1926 41 // Defaults are -1 so things will break badly if incorrectly initialized.
kvn@1926 42 int MinObjAlignment = -1;
kvn@1926 43 int MinObjAlignmentInBytes = -1;
kvn@1926 44 int MinObjAlignmentInBytesMask = 0;
kvn@1926 45
kvn@1926 46 int LogMinObjAlignment = -1;
kvn@1926 47 int LogMinObjAlignmentInBytes = -1;
kvn@1926 48
kvn@1926 49 // Oop encoding heap max
kvn@1926 50 uint64_t OopEncodingHeapMax = 0;
kvn@1926 51
duke@435 52 void basic_fatal(const char* msg) {
duke@435 53 fatal(msg);
duke@435 54 }
duke@435 55
duke@435 56 // Something to help porters sleep at night
duke@435 57
coleenp@548 58 void basic_types_init() {
duke@435 59 #ifdef ASSERT
duke@435 60 #ifdef _LP64
duke@435 61 assert(min_intx == (intx)CONST64(0x8000000000000000), "correct constant");
duke@435 62 assert(max_intx == CONST64(0x7FFFFFFFFFFFFFFF), "correct constant");
duke@435 63 assert(max_uintx == CONST64(0xFFFFFFFFFFFFFFFF), "correct constant");
duke@435 64 assert( 8 == sizeof( intx), "wrong size for basic type");
duke@435 65 assert( 8 == sizeof( jobject), "wrong size for basic type");
duke@435 66 #else
duke@435 67 assert(min_intx == (intx)0x80000000, "correct constant");
duke@435 68 assert(max_intx == 0x7FFFFFFF, "correct constant");
duke@435 69 assert(max_uintx == 0xFFFFFFFF, "correct constant");
duke@435 70 assert( 4 == sizeof( intx), "wrong size for basic type");
duke@435 71 assert( 4 == sizeof( jobject), "wrong size for basic type");
duke@435 72 #endif
duke@435 73 assert( (~max_juint) == 0, "max_juint has all its bits");
duke@435 74 assert( (~max_uintx) == 0, "max_uintx has all its bits");
duke@435 75 assert( (~max_julong) == 0, "max_julong has all its bits");
duke@435 76 assert( 1 == sizeof( jbyte), "wrong size for basic type");
duke@435 77 assert( 2 == sizeof( jchar), "wrong size for basic type");
duke@435 78 assert( 2 == sizeof( jshort), "wrong size for basic type");
duke@435 79 assert( 4 == sizeof( juint), "wrong size for basic type");
duke@435 80 assert( 4 == sizeof( jint), "wrong size for basic type");
duke@435 81 assert( 1 == sizeof( jboolean), "wrong size for basic type");
duke@435 82 assert( 8 == sizeof( jlong), "wrong size for basic type");
duke@435 83 assert( 4 == sizeof( jfloat), "wrong size for basic type");
duke@435 84 assert( 8 == sizeof( jdouble), "wrong size for basic type");
duke@435 85 assert( 1 == sizeof( u1), "wrong size for basic type");
duke@435 86 assert( 2 == sizeof( u2), "wrong size for basic type");
duke@435 87 assert( 4 == sizeof( u4), "wrong size for basic type");
duke@435 88
duke@435 89 int num_type_chars = 0;
duke@435 90 for (int i = 0; i < 99; i++) {
duke@435 91 if (type2char((BasicType)i) != 0) {
duke@435 92 assert(char2type(type2char((BasicType)i)) == i, "proper inverses");
duke@435 93 num_type_chars++;
duke@435 94 }
duke@435 95 }
duke@435 96 assert(num_type_chars == 11, "must have tested the right number of mappings");
duke@435 97 assert(char2type(0) == T_ILLEGAL, "correct illegality");
duke@435 98
duke@435 99 {
duke@435 100 for (int i = T_BOOLEAN; i <= T_CONFLICT; i++) {
duke@435 101 BasicType vt = (BasicType)i;
duke@435 102 BasicType ft = type2field[vt];
duke@435 103 switch (vt) {
duke@435 104 // the following types might plausibly show up in memory layouts:
duke@435 105 case T_BOOLEAN:
duke@435 106 case T_BYTE:
duke@435 107 case T_CHAR:
duke@435 108 case T_SHORT:
duke@435 109 case T_INT:
duke@435 110 case T_FLOAT:
duke@435 111 case T_DOUBLE:
duke@435 112 case T_LONG:
duke@435 113 case T_OBJECT:
roland@4159 114 case T_ADDRESS: // random raw pointer
roland@4159 115 case T_METADATA: // metadata pointer
roland@4159 116 case T_NARROWOOP: // compressed pointer
roland@4159 117 case T_NARROWKLASS: // compressed klass pointer
roland@4159 118 case T_CONFLICT: // might as well support a bottom type
roland@4159 119 case T_VOID: // padding or other unaddressed word
duke@435 120 // layout type must map to itself
duke@435 121 assert(vt == ft, "");
duke@435 122 break;
duke@435 123 default:
duke@435 124 // non-layout type must map to a (different) layout type
duke@435 125 assert(vt != ft, "");
duke@435 126 assert(ft == type2field[ft], "");
duke@435 127 }
duke@435 128 // every type must map to same-sized layout type:
duke@435 129 assert(type2size[vt] == type2size[ft], "");
duke@435 130 }
duke@435 131 }
duke@435 132 // These are assumed, e.g., when filling HeapWords with juints.
duke@435 133 assert(is_power_of_2(sizeof(juint)), "juint must be power of 2");
duke@435 134 assert(is_power_of_2(HeapWordSize), "HeapWordSize must be power of 2");
duke@435 135 assert((size_t)HeapWordSize >= sizeof(juint),
duke@435 136 "HeapWord should be at least as large as juint");
duke@435 137 assert(sizeof(NULL) == sizeof(char*), "NULL must be same size as pointer");
duke@435 138 #endif
duke@435 139
duke@435 140 if( JavaPriority1_To_OSPriority != -1 )
duke@435 141 os::java_to_os_priority[1] = JavaPriority1_To_OSPriority;
duke@435 142 if( JavaPriority2_To_OSPriority != -1 )
duke@435 143 os::java_to_os_priority[2] = JavaPriority2_To_OSPriority;
duke@435 144 if( JavaPriority3_To_OSPriority != -1 )
duke@435 145 os::java_to_os_priority[3] = JavaPriority3_To_OSPriority;
duke@435 146 if( JavaPriority4_To_OSPriority != -1 )
duke@435 147 os::java_to_os_priority[4] = JavaPriority4_To_OSPriority;
duke@435 148 if( JavaPriority5_To_OSPriority != -1 )
duke@435 149 os::java_to_os_priority[5] = JavaPriority5_To_OSPriority;
duke@435 150 if( JavaPriority6_To_OSPriority != -1 )
duke@435 151 os::java_to_os_priority[6] = JavaPriority6_To_OSPriority;
duke@435 152 if( JavaPriority7_To_OSPriority != -1 )
duke@435 153 os::java_to_os_priority[7] = JavaPriority7_To_OSPriority;
duke@435 154 if( JavaPriority8_To_OSPriority != -1 )
duke@435 155 os::java_to_os_priority[8] = JavaPriority8_To_OSPriority;
duke@435 156 if( JavaPriority9_To_OSPriority != -1 )
duke@435 157 os::java_to_os_priority[9] = JavaPriority9_To_OSPriority;
duke@435 158 if(JavaPriority10_To_OSPriority != -1 )
duke@435 159 os::java_to_os_priority[10] = JavaPriority10_To_OSPriority;
coleenp@548 160
coleenp@548 161 // Set the size of basic types here (after argument parsing but before
coleenp@548 162 // stub generation).
coleenp@548 163 if (UseCompressedOops) {
coleenp@548 164 // Size info for oops within java objects is fixed
coleenp@548 165 heapOopSize = jintSize;
coleenp@548 166 LogBytesPerHeapOop = LogBytesPerInt;
coleenp@548 167 LogBitsPerHeapOop = LogBitsPerInt;
coleenp@548 168 BytesPerHeapOop = BytesPerInt;
coleenp@548 169 BitsPerHeapOop = BitsPerInt;
coleenp@548 170 } else {
coleenp@548 171 heapOopSize = oopSize;
coleenp@548 172 LogBytesPerHeapOop = LogBytesPerWord;
coleenp@548 173 LogBitsPerHeapOop = LogBitsPerWord;
coleenp@548 174 BytesPerHeapOop = BytesPerWord;
coleenp@548 175 BitsPerHeapOop = BitsPerWord;
coleenp@548 176 }
coleenp@548 177 _type2aelembytes[T_OBJECT] = heapOopSize;
coleenp@548 178 _type2aelembytes[T_ARRAY] = heapOopSize;
duke@435 179 }
duke@435 180
duke@435 181
duke@435 182 // Map BasicType to signature character
roland@4159 183 char type2char_tab[T_CONFLICT+1]={ 0, 0, 0, 0, 'Z', 'C', 'F', 'D', 'B', 'S', 'I', 'J', 'L', '[', 'V', 0, 0, 0, 0, 0};
duke@435 184
duke@435 185 // Map BasicType to Java type name
duke@435 186 const char* type2name_tab[T_CONFLICT+1] = {
duke@435 187 NULL, NULL, NULL, NULL,
duke@435 188 "boolean",
duke@435 189 "char",
duke@435 190 "float",
duke@435 191 "double",
duke@435 192 "byte",
duke@435 193 "short",
duke@435 194 "int",
duke@435 195 "long",
duke@435 196 "object",
duke@435 197 "array",
duke@435 198 "void",
duke@435 199 "*address*",
coleenp@548 200 "*narrowoop*",
coleenp@4037 201 "*metadata*",
roland@4159 202 "*narrowklass*",
duke@435 203 "*conflict*"
duke@435 204 };
duke@435 205
duke@435 206
duke@435 207 BasicType name2type(const char* name) {
duke@435 208 for (int i = T_BOOLEAN; i <= T_VOID; i++) {
duke@435 209 BasicType t = (BasicType)i;
duke@435 210 if (type2name_tab[t] != NULL && 0 == strcmp(type2name_tab[t], name))
duke@435 211 return t;
duke@435 212 }
duke@435 213 return T_ILLEGAL;
duke@435 214 }
duke@435 215
duke@435 216
duke@435 217 // Map BasicType to size in words
roland@4159 218 int type2size[T_CONFLICT+1]={ -1, 0, 0, 0, 1, 1, 1, 2, 1, 1, 1, 2, 1, 1, 0, 1, 1, 1, 1, -1};
duke@435 219
duke@435 220 BasicType type2field[T_CONFLICT+1] = {
duke@435 221 (BasicType)0, // 0,
duke@435 222 (BasicType)0, // 1,
duke@435 223 (BasicType)0, // 2,
duke@435 224 (BasicType)0, // 3,
duke@435 225 T_BOOLEAN, // T_BOOLEAN = 4,
duke@435 226 T_CHAR, // T_CHAR = 5,
duke@435 227 T_FLOAT, // T_FLOAT = 6,
duke@435 228 T_DOUBLE, // T_DOUBLE = 7,
duke@435 229 T_BYTE, // T_BYTE = 8,
duke@435 230 T_SHORT, // T_SHORT = 9,
duke@435 231 T_INT, // T_INT = 10,
duke@435 232 T_LONG, // T_LONG = 11,
duke@435 233 T_OBJECT, // T_OBJECT = 12,
duke@435 234 T_OBJECT, // T_ARRAY = 13,
duke@435 235 T_VOID, // T_VOID = 14,
duke@435 236 T_ADDRESS, // T_ADDRESS = 15,
coleenp@548 237 T_NARROWOOP, // T_NARROWOOP= 16,
coleenp@4037 238 T_METADATA, // T_METADATA = 17,
roland@4159 239 T_NARROWKLASS, // T_NARROWKLASS = 18,
roland@4159 240 T_CONFLICT // T_CONFLICT = 19,
duke@435 241 };
duke@435 242
duke@435 243
duke@435 244 BasicType type2wfield[T_CONFLICT+1] = {
duke@435 245 (BasicType)0, // 0,
duke@435 246 (BasicType)0, // 1,
duke@435 247 (BasicType)0, // 2,
duke@435 248 (BasicType)0, // 3,
duke@435 249 T_INT, // T_BOOLEAN = 4,
duke@435 250 T_INT, // T_CHAR = 5,
duke@435 251 T_FLOAT, // T_FLOAT = 6,
duke@435 252 T_DOUBLE, // T_DOUBLE = 7,
duke@435 253 T_INT, // T_BYTE = 8,
duke@435 254 T_INT, // T_SHORT = 9,
duke@435 255 T_INT, // T_INT = 10,
duke@435 256 T_LONG, // T_LONG = 11,
duke@435 257 T_OBJECT, // T_OBJECT = 12,
duke@435 258 T_OBJECT, // T_ARRAY = 13,
duke@435 259 T_VOID, // T_VOID = 14,
duke@435 260 T_ADDRESS, // T_ADDRESS = 15,
coleenp@548 261 T_NARROWOOP, // T_NARROWOOP = 16,
coleenp@4037 262 T_METADATA, // T_METADATA = 17,
roland@4159 263 T_NARROWKLASS, // T_NARROWKLASS = 18,
roland@4159 264 T_CONFLICT // T_CONFLICT = 19,
duke@435 265 };
duke@435 266
duke@435 267
kvn@464 268 int _type2aelembytes[T_CONFLICT+1] = {
roland@4159 269 0, // 0
roland@4159 270 0, // 1
roland@4159 271 0, // 2
roland@4159 272 0, // 3
roland@4159 273 T_BOOLEAN_aelem_bytes, // T_BOOLEAN = 4,
roland@4159 274 T_CHAR_aelem_bytes, // T_CHAR = 5,
roland@4159 275 T_FLOAT_aelem_bytes, // T_FLOAT = 6,
roland@4159 276 T_DOUBLE_aelem_bytes, // T_DOUBLE = 7,
roland@4159 277 T_BYTE_aelem_bytes, // T_BYTE = 8,
roland@4159 278 T_SHORT_aelem_bytes, // T_SHORT = 9,
roland@4159 279 T_INT_aelem_bytes, // T_INT = 10,
roland@4159 280 T_LONG_aelem_bytes, // T_LONG = 11,
roland@4159 281 T_OBJECT_aelem_bytes, // T_OBJECT = 12,
roland@4159 282 T_ARRAY_aelem_bytes, // T_ARRAY = 13,
roland@4159 283 0, // T_VOID = 14,
roland@4159 284 T_OBJECT_aelem_bytes, // T_ADDRESS = 15,
roland@4159 285 T_NARROWOOP_aelem_bytes, // T_NARROWOOP= 16,
roland@4159 286 T_OBJECT_aelem_bytes, // T_METADATA = 17,
roland@4159 287 T_NARROWKLASS_aelem_bytes, // T_NARROWKLASS= 18,
roland@4159 288 0 // T_CONFLICT = 19,
duke@435 289 };
duke@435 290
kvn@464 291 #ifdef ASSERT
kvn@464 292 int type2aelembytes(BasicType t, bool allow_address) {
kvn@464 293 assert(allow_address || t != T_ADDRESS, " ");
kvn@464 294 return _type2aelembytes[t];
kvn@464 295 }
kvn@464 296 #endif
duke@435 297
duke@435 298 // Support for 64-bit integer arithmetic
duke@435 299
duke@435 300 // The following code is mostly taken from JVM typedefs_md.h and system_md.c
duke@435 301
coleenp@548 302 static const jlong high_bit = (jlong)1 << (jlong)63;
duke@435 303 static const jlong other_bits = ~high_bit;
duke@435 304
duke@435 305 jlong float2long(jfloat f) {
duke@435 306 jlong tmp = (jlong) f;
duke@435 307 if (tmp != high_bit) {
duke@435 308 return tmp;
duke@435 309 } else {
duke@435 310 if (g_isnan((jdouble)f)) {
duke@435 311 return 0;
duke@435 312 }
duke@435 313 if (f < 0) {
duke@435 314 return high_bit;
duke@435 315 } else {
duke@435 316 return other_bits;
duke@435 317 }
duke@435 318 }
duke@435 319 }
duke@435 320
duke@435 321
duke@435 322 jlong double2long(jdouble f) {
duke@435 323 jlong tmp = (jlong) f;
duke@435 324 if (tmp != high_bit) {
duke@435 325 return tmp;
duke@435 326 } else {
duke@435 327 if (g_isnan(f)) {
duke@435 328 return 0;
duke@435 329 }
duke@435 330 if (f < 0) {
duke@435 331 return high_bit;
duke@435 332 } else {
duke@435 333 return other_bits;
duke@435 334 }
duke@435 335 }
duke@435 336 }
duke@435 337
duke@435 338 // least common multiple
duke@435 339 size_t lcm(size_t a, size_t b) {
duke@435 340 size_t cur, div, next;
duke@435 341
duke@435 342 cur = MAX2(a, b);
duke@435 343 div = MIN2(a, b);
duke@435 344
duke@435 345 assert(div != 0, "lcm requires positive arguments");
duke@435 346
duke@435 347
duke@435 348 while ((next = cur % div) != 0) {
duke@435 349 cur = div; div = next;
duke@435 350 }
duke@435 351
duke@435 352
duke@435 353 julong result = julong(a) * b / div;
duke@435 354 assert(result <= (size_t)max_uintx, "Integer overflow in lcm");
duke@435 355
duke@435 356 return size_t(result);
duke@435 357 }
mikael@4889 358
mikael@4889 359 #ifndef PRODUCT
mikael@4889 360
mikael@4889 361 void GlobalDefinitions::test_globals() {
mikael@4889 362 intptr_t page_sizes[] = { os::vm_page_size(), 4096, 8192, 65536, 2*1024*1024 };
mikael@4889 363 const int num_page_sizes = sizeof(page_sizes) / sizeof(page_sizes[0]);
mikael@4889 364
mikael@4889 365 for (int i = 0; i < num_page_sizes; i++) {
mikael@4889 366 intptr_t page_size = page_sizes[i];
mikael@4889 367
mikael@4889 368 address a_page = (address)(10*page_size);
mikael@4889 369
mikael@4889 370 // Check that address within page is returned as is
mikael@4889 371 assert(clamp_address_in_page(a_page, a_page, page_size) == a_page, "incorrect");
mikael@4889 372 assert(clamp_address_in_page(a_page + 128, a_page, page_size) == a_page + 128, "incorrect");
mikael@4889 373 assert(clamp_address_in_page(a_page + page_size - 1, a_page, page_size) == a_page + page_size - 1, "incorrect");
mikael@4889 374
mikael@4889 375 // Check that address above page returns start of next page
mikael@4889 376 assert(clamp_address_in_page(a_page + page_size, a_page, page_size) == a_page + page_size, "incorrect");
mikael@4889 377 assert(clamp_address_in_page(a_page + page_size + 1, a_page, page_size) == a_page + page_size, "incorrect");
mikael@4889 378 assert(clamp_address_in_page(a_page + page_size*5 + 1, a_page, page_size) == a_page + page_size, "incorrect");
mikael@4889 379
mikael@4889 380 // Check that address below page returns start of page
mikael@4889 381 assert(clamp_address_in_page(a_page - 1, a_page, page_size) == a_page, "incorrect");
mikael@4889 382 assert(clamp_address_in_page(a_page - 2*page_size - 1, a_page, page_size) == a_page, "incorrect");
mikael@4889 383 assert(clamp_address_in_page(a_page - 5*page_size - 1, a_page, page_size) == a_page, "incorrect");
mikael@4889 384 }
mikael@4889 385 }
mikael@4889 386
mikael@4889 387 #endif // PRODUCT

mercurial