1 /* 2 * Copyright (c) 1997, 2013, Oracle and/or its affiliates. All rights reserved. 3 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. 4 * 5 * This code is free software; you can redistribute it and/or modify it 6 * under the terms of the GNU General Public License version 2 only, as 7 * published by the Free Software Foundation. 8 * 9 * This code is distributed in the hope that it will be useful, but WITHOUT 10 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or 11 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License 12 * version 2 for more details (a copy is included in the LICENSE file that 13 * accompanied this code). 14 * 15 * You should have received a copy of the GNU General Public License version 16 * 2 along with this work; if not, write to the Free Software Foundation, 17 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. 18 * 19 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA 20 * or visit www.oracle.com if you need additional information or have any 21 * questions. 22 * 23 */ 24 25 #ifndef SHARE_VM_UTILITIES_GLOBALDEFINITIONS_HPP 26 #define SHARE_VM_UTILITIES_GLOBALDEFINITIONS_HPP 27 28 #ifndef __STDC_FORMAT_MACROS 29 #define __STDC_FORMAT_MACROS 30 #endif 31 32 #ifdef TARGET_COMPILER_gcc 33 # include "utilities/globalDefinitions_gcc.hpp" 34 #endif 35 #ifdef TARGET_COMPILER_visCPP 36 # include "utilities/globalDefinitions_visCPP.hpp" 37 #endif 38 #ifdef TARGET_COMPILER_sparcWorks 39 # include "utilities/globalDefinitions_sparcWorks.hpp" 40 #endif 41 42 #include "utilities/macros.hpp" 43 44 // This file holds all globally used constants & types, class (forward) 45 // declarations and a few frequently used utility functions. 46 47 //---------------------------------------------------------------------------------------------------- 48 // Constants 49 50 const int LogBytesPerShort = 1; 51 const int LogBytesPerInt = 2; 52 #ifdef _LP64 53 const int LogBytesPerWord = 3; 54 #else 55 const int LogBytesPerWord = 2; 56 #endif 57 const int LogBytesPerLong = 3; 58 59 const int BytesPerShort = 1 << LogBytesPerShort; 60 const int BytesPerInt = 1 << LogBytesPerInt; 61 const int BytesPerWord = 1 << LogBytesPerWord; 62 const int BytesPerLong = 1 << LogBytesPerLong; 63 64 const int LogBitsPerByte = 3; 65 const int LogBitsPerShort = LogBitsPerByte + LogBytesPerShort; 66 const int LogBitsPerInt = LogBitsPerByte + LogBytesPerInt; 67 const int LogBitsPerWord = LogBitsPerByte + LogBytesPerWord; 68 const int LogBitsPerLong = LogBitsPerByte + LogBytesPerLong; 69 70 const int BitsPerByte = 1 << LogBitsPerByte; 71 const int BitsPerShort = 1 << LogBitsPerShort; 72 const int BitsPerInt = 1 << LogBitsPerInt; 73 const int BitsPerWord = 1 << LogBitsPerWord; 74 const int BitsPerLong = 1 << LogBitsPerLong; 75 76 const int WordAlignmentMask = (1 << LogBytesPerWord) - 1; 77 const int LongAlignmentMask = (1 << LogBytesPerLong) - 1; 78 79 const int WordsPerLong = 2; // Number of stack entries for longs 80 81 const int oopSize = sizeof(char*); // Full-width oop 82 extern int heapOopSize; // Oop within a java object 83 const int wordSize = sizeof(char*); 84 const int longSize = sizeof(jlong); 85 const int jintSize = sizeof(jint); 86 const int size_tSize = sizeof(size_t); 87 88 const int BytesPerOop = BytesPerWord; // Full-width oop 89 90 extern int LogBytesPerHeapOop; // Oop within a java object 91 extern int LogBitsPerHeapOop; 92 extern int BytesPerHeapOop; 93 extern int BitsPerHeapOop; 94 95 // Oop encoding heap max 96 extern uint64_t OopEncodingHeapMax; 97 98 const int BitsPerJavaInteger = 32; 99 const int BitsPerJavaLong = 64; 100 const int BitsPerSize_t = size_tSize * BitsPerByte; 101 102 // Size of a char[] needed to represent a jint as a string in decimal. 103 const int jintAsStringSize = 12; 104 105 // In fact this should be 106 // log2_intptr(sizeof(class JavaThread)) - log2_intptr(64); 107 // see os::set_memory_serialize_page() 108 #ifdef _LP64 109 const int SerializePageShiftCount = 4; 110 #else 111 const int SerializePageShiftCount = 3; 112 #endif 113 114 // An opaque struct of heap-word width, so that HeapWord* can be a generic 115 // pointer into the heap. We require that object sizes be measured in 116 // units of heap words, so that that 117 // HeapWord* hw; 118 // hw += oop(hw)->foo(); 119 // works, where foo is a method (like size or scavenge) that returns the 120 // object size. 121 class HeapWord { 122 friend class VMStructs; 123 private: 124 char* i; 125 #ifndef PRODUCT 126 public: 127 char* value() { return i; } 128 #endif 129 }; 130 131 // Analogous opaque struct for metadata allocated from 132 // metaspaces. 133 class MetaWord { 134 friend class VMStructs; 135 private: 136 char* i; 137 }; 138 139 // HeapWordSize must be 2^LogHeapWordSize. 140 const int HeapWordSize = sizeof(HeapWord); 141 #ifdef _LP64 142 const int LogHeapWordSize = 3; 143 #else 144 const int LogHeapWordSize = 2; 145 #endif 146 const int HeapWordsPerLong = BytesPerLong / HeapWordSize; 147 const int LogHeapWordsPerLong = LogBytesPerLong - LogHeapWordSize; 148 149 // The larger HeapWordSize for 64bit requires larger heaps 150 // for the same application running in 64bit. See bug 4967770. 151 // The minimum alignment to a heap word size is done. Other 152 // parts of the memory system may required additional alignment 153 // and are responsible for those alignments. 154 #ifdef _LP64 155 #define ScaleForWordSize(x) align_size_down_((x) * 13 / 10, HeapWordSize) 156 #else 157 #define ScaleForWordSize(x) (x) 158 #endif 159 160 // The minimum number of native machine words necessary to contain "byte_size" 161 // bytes. 162 inline size_t heap_word_size(size_t byte_size) { 163 return (byte_size + (HeapWordSize-1)) >> LogHeapWordSize; 164 } 165 166 167 const size_t K = 1024; 168 const size_t M = K*K; 169 const size_t G = M*K; 170 const size_t HWperKB = K / sizeof(HeapWord); 171 172 const jint min_jint = (jint)1 << (sizeof(jint)*BitsPerByte-1); // 0x80000000 == smallest jint 173 const jint max_jint = (juint)min_jint - 1; // 0x7FFFFFFF == largest jint 174 175 // Constants for converting from a base unit to milli-base units. For 176 // example from seconds to milliseconds and microseconds 177 178 const int MILLIUNITS = 1000; // milli units per base unit 179 const int MICROUNITS = 1000000; // micro units per base unit 180 const int NANOUNITS = 1000000000; // nano units per base unit 181 182 const jlong NANOSECS_PER_SEC = CONST64(1000000000); 183 const jint NANOSECS_PER_MILLISEC = 1000000; 184 185 inline const char* proper_unit_for_byte_size(size_t s) { 186 #ifdef _LP64 187 if (s >= 10*G) { 188 return "G"; 189 } 190 #endif 191 if (s >= 10*M) { 192 return "M"; 193 } else if (s >= 10*K) { 194 return "K"; 195 } else { 196 return "B"; 197 } 198 } 199 200 template <class T> 201 inline T byte_size_in_proper_unit(T s) { 202 #ifdef _LP64 203 if (s >= 10*G) { 204 return (T)(s/G); 205 } 206 #endif 207 if (s >= 10*M) { 208 return (T)(s/M); 209 } else if (s >= 10*K) { 210 return (T)(s/K); 211 } else { 212 return s; 213 } 214 } 215 216 //---------------------------------------------------------------------------------------------------- 217 // VM type definitions 218 219 // intx and uintx are the 'extended' int and 'extended' unsigned int types; 220 // they are 32bit wide on a 32-bit platform, and 64bit wide on a 64bit platform. 221 222 typedef intptr_t intx; 223 typedef uintptr_t uintx; 224 225 const intx min_intx = (intx)1 << (sizeof(intx)*BitsPerByte-1); 226 const intx max_intx = (uintx)min_intx - 1; 227 const uintx max_uintx = (uintx)-1; 228 229 // Table of values: 230 // sizeof intx 4 8 231 // min_intx 0x80000000 0x8000000000000000 232 // max_intx 0x7FFFFFFF 0x7FFFFFFFFFFFFFFF 233 // max_uintx 0xFFFFFFFF 0xFFFFFFFFFFFFFFFF 234 235 typedef unsigned int uint; NEEDS_CLEANUP 236 237 238 //---------------------------------------------------------------------------------------------------- 239 // Java type definitions 240 241 // All kinds of 'plain' byte addresses 242 typedef signed char s_char; 243 typedef unsigned char u_char; 244 typedef u_char* address; 245 typedef uintptr_t address_word; // unsigned integer which will hold a pointer 246 // except for some implementations of a C++ 247 // linkage pointer to function. Should never 248 // need one of those to be placed in this 249 // type anyway. 250 251 // Utility functions to "portably" (?) bit twiddle pointers 252 // Where portable means keep ANSI C++ compilers quiet 253 254 inline address set_address_bits(address x, int m) { return address(intptr_t(x) | m); } 255 inline address clear_address_bits(address x, int m) { return address(intptr_t(x) & ~m); } 256 257 // Utility functions to "portably" make cast to/from function pointers. 258 259 inline address_word mask_address_bits(address x, int m) { return address_word(x) & m; } 260 inline address_word castable_address(address x) { return address_word(x) ; } 261 inline address_word castable_address(void* x) { return address_word(x) ; } 262 263 // Pointer subtraction. 264 // The idea here is to avoid ptrdiff_t, which is signed and so doesn't have 265 // the range we might need to find differences from one end of the heap 266 // to the other. 267 // A typical use might be: 268 // if (pointer_delta(end(), top()) >= size) { 269 // // enough room for an object of size 270 // ... 271 // and then additions like 272 // ... top() + size ... 273 // are safe because we know that top() is at least size below end(). 274 inline size_t pointer_delta(const void* left, 275 const void* right, 276 size_t element_size) { 277 return (((uintptr_t) left) - ((uintptr_t) right)) / element_size; 278 } 279 // A version specialized for HeapWord*'s. 280 inline size_t pointer_delta(const HeapWord* left, const HeapWord* right) { 281 return pointer_delta(left, right, sizeof(HeapWord)); 282 } 283 // A version specialized for MetaWord*'s. 284 inline size_t pointer_delta(const MetaWord* left, const MetaWord* right) { 285 return pointer_delta(left, right, sizeof(MetaWord)); 286 } 287 288 // 289 // ANSI C++ does not allow casting from one pointer type to a function pointer 290 // directly without at best a warning. This macro accomplishes it silently 291 // In every case that is present at this point the value be cast is a pointer 292 // to a C linkage function. In somecase the type used for the cast reflects 293 // that linkage and a picky compiler would not complain. In other cases because 294 // there is no convenient place to place a typedef with extern C linkage (i.e 295 // a platform dependent header file) it doesn't. At this point no compiler seems 296 // picky enough to catch these instances (which are few). It is possible that 297 // using templates could fix these for all cases. This use of templates is likely 298 // so far from the middle of the road that it is likely to be problematic in 299 // many C++ compilers. 300 // 301 #define CAST_TO_FN_PTR(func_type, value) ((func_type)(castable_address(value))) 302 #define CAST_FROM_FN_PTR(new_type, func_ptr) ((new_type)((address_word)(func_ptr))) 303 304 // Unsigned byte types for os and stream.hpp 305 306 // Unsigned one, two, four and eigth byte quantities used for describing 307 // the .class file format. See JVM book chapter 4. 308 309 typedef jubyte u1; 310 typedef jushort u2; 311 typedef juint u4; 312 typedef julong u8; 313 314 const jubyte max_jubyte = (jubyte)-1; // 0xFF largest jubyte 315 const jushort max_jushort = (jushort)-1; // 0xFFFF largest jushort 316 const juint max_juint = (juint)-1; // 0xFFFFFFFF largest juint 317 const julong max_julong = (julong)-1; // 0xFF....FF largest julong 318 319 typedef jbyte s1; 320 typedef jshort s2; 321 typedef jint s4; 322 typedef jlong s8; 323 324 //---------------------------------------------------------------------------------------------------- 325 // JVM spec restrictions 326 327 const int max_method_code_size = 64*K - 1; // JVM spec, 2nd ed. section 4.8.1 (p.134) 328 329 330 //---------------------------------------------------------------------------------------------------- 331 // Default and minimum StringTableSize values 332 333 const int defaultStringTableSize = NOT_LP64(1009) LP64_ONLY(60013); 334 const int minimumStringTableSize=1009; 335 336 337 //---------------------------------------------------------------------------------------------------- 338 // HotSwap - for JVMTI aka Class File Replacement and PopFrame 339 // 340 // Determines whether on-the-fly class replacement and frame popping are enabled. 341 342 #define HOTSWAP 343 344 //---------------------------------------------------------------------------------------------------- 345 // Object alignment, in units of HeapWords. 346 // 347 // Minimum is max(BytesPerLong, BytesPerDouble, BytesPerOop) / HeapWordSize, so jlong, jdouble and 348 // reference fields can be naturally aligned. 349 350 extern int MinObjAlignment; 351 extern int MinObjAlignmentInBytes; 352 extern int MinObjAlignmentInBytesMask; 353 354 extern int LogMinObjAlignment; 355 extern int LogMinObjAlignmentInBytes; 356 357 const int LogKlassAlignmentInBytes = 3; 358 const int LogKlassAlignment = LogKlassAlignmentInBytes - LogHeapWordSize; 359 const int KlassAlignmentInBytes = 1 << LogKlassAlignmentInBytes; 360 const int KlassAlignment = KlassAlignmentInBytes / HeapWordSize; 361 362 // Klass encoding metaspace max size 363 const uint64_t KlassEncodingMetaspaceMax = (uint64_t(max_juint) + 1) << LogKlassAlignmentInBytes; 364 365 const jlong CompressedKlassPointersBase = NOT_LP64(0) LP64_ONLY(CONST64(0x800000000)); // 32*G 366 367 // Machine dependent stuff 368 369 #ifdef TARGET_ARCH_x86 370 # include "globalDefinitions_x86.hpp" 371 #endif 372 #ifdef TARGET_ARCH_sparc 373 # include "globalDefinitions_sparc.hpp" 374 #endif 375 #ifdef TARGET_ARCH_zero 376 # include "globalDefinitions_zero.hpp" 377 #endif 378 #ifdef TARGET_ARCH_arm 379 # include "globalDefinitions_arm.hpp" 380 #endif 381 #ifdef TARGET_ARCH_ppc 382 # include "globalDefinitions_ppc.hpp" 383 #endif 384 385 /* 386 * If a platform does not support native stack walking 387 * the platform specific globalDefinitions (above) 388 * can set PLATFORM_NATIVE_STACK_WALKING_SUPPORTED to 0 389 */ 390 #ifndef PLATFORM_NATIVE_STACK_WALKING_SUPPORTED 391 #define PLATFORM_NATIVE_STACK_WALKING_SUPPORTED 1 392 #endif 393 394 // The byte alignment to be used by Arena::Amalloc. See bugid 4169348. 395 // Note: this value must be a power of 2 396 397 #define ARENA_AMALLOC_ALIGNMENT (2*BytesPerWord) 398 399 // Signed variants of alignment helpers. There are two versions of each, a macro 400 // for use in places like enum definitions that require compile-time constant 401 // expressions and a function for all other places so as to get type checking. 402 403 #define align_size_up_(size, alignment) (((size) + ((alignment) - 1)) & ~((alignment) - 1)) 404 405 inline intptr_t align_size_up(intptr_t size, intptr_t alignment) { 406 return align_size_up_(size, alignment); 407 } 408 409 #define align_size_down_(size, alignment) ((size) & ~((alignment) - 1)) 410 411 inline intptr_t align_size_down(intptr_t size, intptr_t alignment) { 412 return align_size_down_(size, alignment); 413 } 414 415 #define is_size_aligned_(size, alignment) ((size) == (align_size_up_(size, alignment))) 416 417 // Align objects by rounding up their size, in HeapWord units. 418 419 #define align_object_size_(size) align_size_up_(size, MinObjAlignment) 420 421 inline intptr_t align_object_size(intptr_t size) { 422 return align_size_up(size, MinObjAlignment); 423 } 424 425 inline bool is_object_aligned(intptr_t addr) { 426 return addr == align_object_size(addr); 427 } 428 429 // Pad out certain offsets to jlong alignment, in HeapWord units. 430 431 inline intptr_t align_object_offset(intptr_t offset) { 432 return align_size_up(offset, HeapWordsPerLong); 433 } 434 435 inline void* align_pointer_up(const void* addr, size_t size) { 436 return (void*) align_size_up_((uintptr_t)addr, size); 437 } 438 439 // Clamp an address to be within a specific page 440 // 1. If addr is on the page it is returned as is 441 // 2. If addr is above the page_address the start of the *next* page will be returned 442 // 3. Otherwise, if addr is below the page_address the start of the page will be returned 443 inline address clamp_address_in_page(address addr, address page_address, intptr_t page_size) { 444 if (align_size_down(intptr_t(addr), page_size) == align_size_down(intptr_t(page_address), page_size)) { 445 // address is in the specified page, just return it as is 446 return addr; 447 } else if (addr > page_address) { 448 // address is above specified page, return start of next page 449 return (address)align_size_down(intptr_t(page_address), page_size) + page_size; 450 } else { 451 // address is below specified page, return start of page 452 return (address)align_size_down(intptr_t(page_address), page_size); 453 } 454 } 455 456 457 // The expected size in bytes of a cache line, used to pad data structures. 458 #define DEFAULT_CACHE_LINE_SIZE 64 459 460 461 //---------------------------------------------------------------------------------------------------- 462 // Utility macros for compilers 463 // used to silence compiler warnings 464 465 #define Unused_Variable(var) var 466 467 468 //---------------------------------------------------------------------------------------------------- 469 // Miscellaneous 470 471 // 6302670 Eliminate Hotspot __fabsf dependency 472 // All fabs() callers should call this function instead, which will implicitly 473 // convert the operand to double, avoiding a dependency on __fabsf which 474 // doesn't exist in early versions of Solaris 8. 475 inline double fabsd(double value) { 476 return fabs(value); 477 } 478 479 inline jint low (jlong value) { return jint(value); } 480 inline jint high(jlong value) { return jint(value >> 32); } 481 482 // the fancy casts are a hopefully portable way 483 // to do unsigned 32 to 64 bit type conversion 484 inline void set_low (jlong* value, jint low ) { *value &= (jlong)0xffffffff << 32; 485 *value |= (jlong)(julong)(juint)low; } 486 487 inline void set_high(jlong* value, jint high) { *value &= (jlong)(julong)(juint)0xffffffff; 488 *value |= (jlong)high << 32; } 489 490 inline jlong jlong_from(jint h, jint l) { 491 jlong result = 0; // initialization to avoid warning 492 set_high(&result, h); 493 set_low(&result, l); 494 return result; 495 } 496 497 union jlong_accessor { 498 jint words[2]; 499 jlong long_value; 500 }; 501 502 void basic_types_init(); // cannot define here; uses assert 503 504 505 // NOTE: replicated in SA in vm/agent/sun/jvm/hotspot/runtime/BasicType.java 506 enum BasicType { 507 T_BOOLEAN = 4, 508 T_CHAR = 5, 509 T_FLOAT = 6, 510 T_DOUBLE = 7, 511 T_BYTE = 8, 512 T_SHORT = 9, 513 T_INT = 10, 514 T_LONG = 11, 515 T_OBJECT = 12, 516 T_ARRAY = 13, 517 T_VOID = 14, 518 T_ADDRESS = 15, 519 T_NARROWOOP = 16, 520 T_METADATA = 17, 521 T_NARROWKLASS = 18, 522 T_CONFLICT = 19, // for stack value type with conflicting contents 523 T_ILLEGAL = 99 524 }; 525 526 inline bool is_java_primitive(BasicType t) { 527 return T_BOOLEAN <= t && t <= T_LONG; 528 } 529 530 inline bool is_subword_type(BasicType t) { 531 // these guys are processed exactly like T_INT in calling sequences: 532 return (t == T_BOOLEAN || t == T_CHAR || t == T_BYTE || t == T_SHORT); 533 } 534 535 inline bool is_signed_subword_type(BasicType t) { 536 return (t == T_BYTE || t == T_SHORT); 537 } 538 539 // Convert a char from a classfile signature to a BasicType 540 inline BasicType char2type(char c) { 541 switch( c ) { 542 case 'B': return T_BYTE; 543 case 'C': return T_CHAR; 544 case 'D': return T_DOUBLE; 545 case 'F': return T_FLOAT; 546 case 'I': return T_INT; 547 case 'J': return T_LONG; 548 case 'S': return T_SHORT; 549 case 'Z': return T_BOOLEAN; 550 case 'V': return T_VOID; 551 case 'L': return T_OBJECT; 552 case '[': return T_ARRAY; 553 } 554 return T_ILLEGAL; 555 } 556 557 extern char type2char_tab[T_CONFLICT+1]; // Map a BasicType to a jchar 558 inline char type2char(BasicType t) { return (uint)t < T_CONFLICT+1 ? type2char_tab[t] : 0; } 559 extern int type2size[T_CONFLICT+1]; // Map BasicType to result stack elements 560 extern const char* type2name_tab[T_CONFLICT+1]; // Map a BasicType to a jchar 561 inline const char* type2name(BasicType t) { return (uint)t < T_CONFLICT+1 ? type2name_tab[t] : NULL; } 562 extern BasicType name2type(const char* name); 563 564 // Auxilary math routines 565 // least common multiple 566 extern size_t lcm(size_t a, size_t b); 567 568 569 // NOTE: replicated in SA in vm/agent/sun/jvm/hotspot/runtime/BasicType.java 570 enum BasicTypeSize { 571 T_BOOLEAN_size = 1, 572 T_CHAR_size = 1, 573 T_FLOAT_size = 1, 574 T_DOUBLE_size = 2, 575 T_BYTE_size = 1, 576 T_SHORT_size = 1, 577 T_INT_size = 1, 578 T_LONG_size = 2, 579 T_OBJECT_size = 1, 580 T_ARRAY_size = 1, 581 T_NARROWOOP_size = 1, 582 T_NARROWKLASS_size = 1, 583 T_VOID_size = 0 584 }; 585 586 587 // maps a BasicType to its instance field storage type: 588 // all sub-word integral types are widened to T_INT 589 extern BasicType type2field[T_CONFLICT+1]; 590 extern BasicType type2wfield[T_CONFLICT+1]; 591 592 593 // size in bytes 594 enum ArrayElementSize { 595 T_BOOLEAN_aelem_bytes = 1, 596 T_CHAR_aelem_bytes = 2, 597 T_FLOAT_aelem_bytes = 4, 598 T_DOUBLE_aelem_bytes = 8, 599 T_BYTE_aelem_bytes = 1, 600 T_SHORT_aelem_bytes = 2, 601 T_INT_aelem_bytes = 4, 602 T_LONG_aelem_bytes = 8, 603 #ifdef _LP64 604 T_OBJECT_aelem_bytes = 8, 605 T_ARRAY_aelem_bytes = 8, 606 #else 607 T_OBJECT_aelem_bytes = 4, 608 T_ARRAY_aelem_bytes = 4, 609 #endif 610 T_NARROWOOP_aelem_bytes = 4, 611 T_NARROWKLASS_aelem_bytes = 4, 612 T_VOID_aelem_bytes = 0 613 }; 614 615 extern int _type2aelembytes[T_CONFLICT+1]; // maps a BasicType to nof bytes used by its array element 616 #ifdef ASSERT 617 extern int type2aelembytes(BasicType t, bool allow_address = false); // asserts 618 #else 619 inline int type2aelembytes(BasicType t, bool allow_address = false) { return _type2aelembytes[t]; } 620 #endif 621 622 623 // JavaValue serves as a container for arbitrary Java values. 624 625 class JavaValue { 626 627 public: 628 typedef union JavaCallValue { 629 jfloat f; 630 jdouble d; 631 jint i; 632 jlong l; 633 jobject h; 634 } JavaCallValue; 635 636 private: 637 BasicType _type; 638 JavaCallValue _value; 639 640 public: 641 JavaValue(BasicType t = T_ILLEGAL) { _type = t; } 642 643 JavaValue(jfloat value) { 644 _type = T_FLOAT; 645 _value.f = value; 646 } 647 648 JavaValue(jdouble value) { 649 _type = T_DOUBLE; 650 _value.d = value; 651 } 652 653 jfloat get_jfloat() const { return _value.f; } 654 jdouble get_jdouble() const { return _value.d; } 655 jint get_jint() const { return _value.i; } 656 jlong get_jlong() const { return _value.l; } 657 jobject get_jobject() const { return _value.h; } 658 JavaCallValue* get_value_addr() { return &_value; } 659 BasicType get_type() const { return _type; } 660 661 void set_jfloat(jfloat f) { _value.f = f;} 662 void set_jdouble(jdouble d) { _value.d = d;} 663 void set_jint(jint i) { _value.i = i;} 664 void set_jlong(jlong l) { _value.l = l;} 665 void set_jobject(jobject h) { _value.h = h;} 666 void set_type(BasicType t) { _type = t; } 667 668 jboolean get_jboolean() const { return (jboolean) (_value.i);} 669 jbyte get_jbyte() const { return (jbyte) (_value.i);} 670 jchar get_jchar() const { return (jchar) (_value.i);} 671 jshort get_jshort() const { return (jshort) (_value.i);} 672 673 }; 674 675 676 #define STACK_BIAS 0 677 // V9 Sparc CPU's running in 64 Bit mode use a stack bias of 7ff 678 // in order to extend the reach of the stack pointer. 679 #if defined(SPARC) && defined(_LP64) 680 #undef STACK_BIAS 681 #define STACK_BIAS 0x7ff 682 #endif 683 684 685 // TosState describes the top-of-stack state before and after the execution of 686 // a bytecode or method. The top-of-stack value may be cached in one or more CPU 687 // registers. The TosState corresponds to the 'machine represention' of this cached 688 // value. There's 4 states corresponding to the JAVA types int, long, float & double 689 // as well as a 5th state in case the top-of-stack value is actually on the top 690 // of stack (in memory) and thus not cached. The atos state corresponds to the itos 691 // state when it comes to machine representation but is used separately for (oop) 692 // type specific operations (e.g. verification code). 693 694 enum TosState { // describes the tos cache contents 695 btos = 0, // byte, bool tos cached 696 ctos = 1, // char tos cached 697 stos = 2, // short tos cached 698 itos = 3, // int tos cached 699 ltos = 4, // long tos cached 700 ftos = 5, // float tos cached 701 dtos = 6, // double tos cached 702 atos = 7, // object cached 703 vtos = 8, // tos not cached 704 number_of_states, 705 ilgl // illegal state: should not occur 706 }; 707 708 709 inline TosState as_TosState(BasicType type) { 710 switch (type) { 711 case T_BYTE : return btos; 712 case T_BOOLEAN: return btos; // FIXME: Add ztos 713 case T_CHAR : return ctos; 714 case T_SHORT : return stos; 715 case T_INT : return itos; 716 case T_LONG : return ltos; 717 case T_FLOAT : return ftos; 718 case T_DOUBLE : return dtos; 719 case T_VOID : return vtos; 720 case T_ARRAY : // fall through 721 case T_OBJECT : return atos; 722 } 723 return ilgl; 724 } 725 726 inline BasicType as_BasicType(TosState state) { 727 switch (state) { 728 //case ztos: return T_BOOLEAN;//FIXME 729 case btos : return T_BYTE; 730 case ctos : return T_CHAR; 731 case stos : return T_SHORT; 732 case itos : return T_INT; 733 case ltos : return T_LONG; 734 case ftos : return T_FLOAT; 735 case dtos : return T_DOUBLE; 736 case atos : return T_OBJECT; 737 case vtos : return T_VOID; 738 } 739 return T_ILLEGAL; 740 } 741 742 743 // Helper function to convert BasicType info into TosState 744 // Note: Cannot define here as it uses global constant at the time being. 745 TosState as_TosState(BasicType type); 746 747 748 // JavaThreadState keeps track of which part of the code a thread is executing in. This 749 // information is needed by the safepoint code. 750 // 751 // There are 4 essential states: 752 // 753 // _thread_new : Just started, but not executed init. code yet (most likely still in OS init code) 754 // _thread_in_native : In native code. This is a safepoint region, since all oops will be in jobject handles 755 // _thread_in_vm : Executing in the vm 756 // _thread_in_Java : Executing either interpreted or compiled Java code (or could be in a stub) 757 // 758 // Each state has an associated xxxx_trans state, which is an intermediate state used when a thread is in 759 // a transition from one state to another. These extra states makes it possible for the safepoint code to 760 // handle certain thread_states without having to suspend the thread - making the safepoint code faster. 761 // 762 // Given a state, the xxx_trans state can always be found by adding 1. 763 // 764 enum JavaThreadState { 765 _thread_uninitialized = 0, // should never happen (missing initialization) 766 _thread_new = 2, // just starting up, i.e., in process of being initialized 767 _thread_new_trans = 3, // corresponding transition state (not used, included for completness) 768 _thread_in_native = 4, // running in native code 769 _thread_in_native_trans = 5, // corresponding transition state 770 _thread_in_vm = 6, // running in VM 771 _thread_in_vm_trans = 7, // corresponding transition state 772 _thread_in_Java = 8, // running in Java or in stub code 773 _thread_in_Java_trans = 9, // corresponding transition state (not used, included for completness) 774 _thread_blocked = 10, // blocked in vm 775 _thread_blocked_trans = 11, // corresponding transition state 776 _thread_max_state = 12 // maximum thread state+1 - used for statistics allocation 777 }; 778 779 780 // Handy constants for deciding which compiler mode to use. 781 enum MethodCompilation { 782 InvocationEntryBci = -1, // i.e., not a on-stack replacement compilation 783 InvalidOSREntryBci = -2 784 }; 785 786 // Enumeration to distinguish tiers of compilation 787 enum CompLevel { 788 CompLevel_any = -1, 789 CompLevel_all = -1, 790 CompLevel_none = 0, // Interpreter 791 CompLevel_simple = 1, // C1 792 CompLevel_limited_profile = 2, // C1, invocation & backedge counters 793 CompLevel_full_profile = 3, // C1, invocation & backedge counters + mdo 794 CompLevel_full_optimization = 4, // C2 or Shark 795 796 #if defined(COMPILER2) || defined(SHARK) 797 CompLevel_highest_tier = CompLevel_full_optimization, // pure C2 and tiered 798 #elif defined(COMPILER1) 799 CompLevel_highest_tier = CompLevel_simple, // pure C1 800 #else 801 CompLevel_highest_tier = CompLevel_none, 802 #endif 803 804 #if defined(TIERED) 805 CompLevel_initial_compile = CompLevel_full_profile // tiered 806 #elif defined(COMPILER1) 807 CompLevel_initial_compile = CompLevel_simple // pure C1 808 #elif defined(COMPILER2) || defined(SHARK) 809 CompLevel_initial_compile = CompLevel_full_optimization // pure C2 810 #else 811 CompLevel_initial_compile = CompLevel_none 812 #endif 813 }; 814 815 inline bool is_c1_compile(int comp_level) { 816 return comp_level > CompLevel_none && comp_level < CompLevel_full_optimization; 817 } 818 819 inline bool is_c2_compile(int comp_level) { 820 return comp_level == CompLevel_full_optimization; 821 } 822 823 inline bool is_highest_tier_compile(int comp_level) { 824 return comp_level == CompLevel_highest_tier; 825 } 826 827 inline bool is_compile(int comp_level) { 828 return is_c1_compile(comp_level) || is_c2_compile(comp_level); 829 } 830 831 //---------------------------------------------------------------------------------------------------- 832 // 'Forward' declarations of frequently used classes 833 // (in order to reduce interface dependencies & reduce 834 // number of unnecessary compilations after changes) 835 836 class symbolTable; 837 class ClassFileStream; 838 839 class Event; 840 841 class Thread; 842 class VMThread; 843 class JavaThread; 844 class Threads; 845 846 class VM_Operation; 847 class VMOperationQueue; 848 849 class CodeBlob; 850 class nmethod; 851 class OSRAdapter; 852 class I2CAdapter; 853 class C2IAdapter; 854 class CompiledIC; 855 class relocInfo; 856 class ScopeDesc; 857 class PcDesc; 858 859 class Recompiler; 860 class Recompilee; 861 class RecompilationPolicy; 862 class RFrame; 863 class CompiledRFrame; 864 class InterpretedRFrame; 865 866 class frame; 867 868 class vframe; 869 class javaVFrame; 870 class interpretedVFrame; 871 class compiledVFrame; 872 class deoptimizedVFrame; 873 class externalVFrame; 874 class entryVFrame; 875 876 class RegisterMap; 877 878 class Mutex; 879 class Monitor; 880 class BasicLock; 881 class BasicObjectLock; 882 883 class PeriodicTask; 884 885 class JavaCallWrapper; 886 887 class oopDesc; 888 class metaDataOopDesc; 889 890 class NativeCall; 891 892 class zone; 893 894 class StubQueue; 895 896 class outputStream; 897 898 class ResourceArea; 899 900 class DebugInformationRecorder; 901 class ScopeValue; 902 class CompressedStream; 903 class DebugInfoReadStream; 904 class DebugInfoWriteStream; 905 class LocationValue; 906 class ConstantValue; 907 class IllegalValue; 908 909 class PrivilegedElement; 910 class MonitorArray; 911 912 class MonitorInfo; 913 914 class OffsetClosure; 915 class OopMapCache; 916 class InterpreterOopMap; 917 class OopMapCacheEntry; 918 class OSThread; 919 920 typedef int (*OSThreadStartFunc)(void*); 921 922 class Space; 923 924 class JavaValue; 925 class methodHandle; 926 class JavaCallArguments; 927 928 // Basic support for errors (general debug facilities not defined at this point fo the include phase) 929 930 extern void basic_fatal(const char* msg); 931 932 933 //---------------------------------------------------------------------------------------------------- 934 // Special constants for debugging 935 936 const jint badInt = -3; // generic "bad int" value 937 const long badAddressVal = -2; // generic "bad address" value 938 const long badOopVal = -1; // generic "bad oop" value 939 const intptr_t badHeapOopVal = (intptr_t) CONST64(0x2BAD4B0BBAADBABE); // value used to zap heap after GC 940 const int badHandleValue = 0xBC; // value used to zap vm handle area 941 const int badResourceValue = 0xAB; // value used to zap resource area 942 const int freeBlockPad = 0xBA; // value used to pad freed blocks. 943 const int uninitBlockPad = 0xF1; // value used to zap newly malloc'd blocks. 944 const intptr_t badJNIHandleVal = (intptr_t) CONST64(0xFEFEFEFEFEFEFEFE); // value used to zap jni handle area 945 const juint badHeapWordVal = 0xBAADBABE; // value used to zap heap after GC 946 const juint badMetaWordVal = 0xBAADFADE; // value used to zap metadata heap after GC 947 const int badCodeHeapNewVal= 0xCC; // value used to zap Code heap at allocation 948 const int badCodeHeapFreeVal = 0xDD; // value used to zap Code heap at deallocation 949 950 951 // (These must be implemented as #defines because C++ compilers are 952 // not obligated to inline non-integral constants!) 953 #define badAddress ((address)::badAddressVal) 954 #define badOop ((oop)::badOopVal) 955 #define badHeapWord (::badHeapWordVal) 956 #define badJNIHandle ((oop)::badJNIHandleVal) 957 958 // Default TaskQueue size is 16K (32-bit) or 128K (64-bit) 959 #define TASKQUEUE_SIZE (NOT_LP64(1<<14) LP64_ONLY(1<<17)) 960 961 //---------------------------------------------------------------------------------------------------- 962 // Utility functions for bitfield manipulations 963 964 const intptr_t AllBits = ~0; // all bits set in a word 965 const intptr_t NoBits = 0; // no bits set in a word 966 const jlong NoLongBits = 0; // no bits set in a long 967 const intptr_t OneBit = 1; // only right_most bit set in a word 968 969 // get a word with the n.th or the right-most or left-most n bits set 970 // (note: #define used only so that they can be used in enum constant definitions) 971 #define nth_bit(n) (n >= BitsPerWord ? 0 : OneBit << (n)) 972 #define right_n_bits(n) (nth_bit(n) - 1) 973 #define left_n_bits(n) (right_n_bits(n) << (n >= BitsPerWord ? 0 : (BitsPerWord - n))) 974 975 // bit-operations using a mask m 976 inline void set_bits (intptr_t& x, intptr_t m) { x |= m; } 977 inline void clear_bits (intptr_t& x, intptr_t m) { x &= ~m; } 978 inline intptr_t mask_bits (intptr_t x, intptr_t m) { return x & m; } 979 inline jlong mask_long_bits (jlong x, jlong m) { return x & m; } 980 inline bool mask_bits_are_true (intptr_t flags, intptr_t mask) { return (flags & mask) == mask; } 981 982 // bit-operations using the n.th bit 983 inline void set_nth_bit(intptr_t& x, int n) { set_bits (x, nth_bit(n)); } 984 inline void clear_nth_bit(intptr_t& x, int n) { clear_bits(x, nth_bit(n)); } 985 inline bool is_set_nth_bit(intptr_t x, int n) { return mask_bits (x, nth_bit(n)) != NoBits; } 986 987 // returns the bitfield of x starting at start_bit_no with length field_length (no sign-extension!) 988 inline intptr_t bitfield(intptr_t x, int start_bit_no, int field_length) { 989 return mask_bits(x >> start_bit_no, right_n_bits(field_length)); 990 } 991 992 993 //---------------------------------------------------------------------------------------------------- 994 // Utility functions for integers 995 996 // Avoid use of global min/max macros which may cause unwanted double 997 // evaluation of arguments. 998 #ifdef max 999 #undef max 1000 #endif 1001 1002 #ifdef min 1003 #undef min 1004 #endif 1005 1006 #define max(a,b) Do_not_use_max_use_MAX2_instead 1007 #define min(a,b) Do_not_use_min_use_MIN2_instead 1008 1009 // It is necessary to use templates here. Having normal overloaded 1010 // functions does not work because it is necessary to provide both 32- 1011 // and 64-bit overloaded functions, which does not work, and having 1012 // explicitly-typed versions of these routines (i.e., MAX2I, MAX2L) 1013 // will be even more error-prone than macros. 1014 template<class T> inline T MAX2(T a, T b) { return (a > b) ? a : b; } 1015 template<class T> inline T MIN2(T a, T b) { return (a < b) ? a : b; } 1016 template<class T> inline T MAX3(T a, T b, T c) { return MAX2(MAX2(a, b), c); } 1017 template<class T> inline T MIN3(T a, T b, T c) { return MIN2(MIN2(a, b), c); } 1018 template<class T> inline T MAX4(T a, T b, T c, T d) { return MAX2(MAX3(a, b, c), d); } 1019 template<class T> inline T MIN4(T a, T b, T c, T d) { return MIN2(MIN3(a, b, c), d); } 1020 1021 template<class T> inline T ABS(T x) { return (x > 0) ? x : -x; } 1022 1023 // true if x is a power of 2, false otherwise 1024 inline bool is_power_of_2(intptr_t x) { 1025 return ((x != NoBits) && (mask_bits(x, x - 1) == NoBits)); 1026 } 1027 1028 // long version of is_power_of_2 1029 inline bool is_power_of_2_long(jlong x) { 1030 return ((x != NoLongBits) && (mask_long_bits(x, x - 1) == NoLongBits)); 1031 } 1032 1033 //* largest i such that 2^i <= x 1034 // A negative value of 'x' will return '31' 1035 inline int log2_intptr(intptr_t x) { 1036 int i = -1; 1037 uintptr_t p = 1; 1038 while (p != 0 && p <= (uintptr_t)x) { 1039 // p = 2^(i+1) && p <= x (i.e., 2^(i+1) <= x) 1040 i++; p *= 2; 1041 } 1042 // p = 2^(i+1) && x < p (i.e., 2^i <= x < 2^(i+1)) 1043 // (if p = 0 then overflow occurred and i = 31) 1044 return i; 1045 } 1046 1047 //* largest i such that 2^i <= x 1048 // A negative value of 'x' will return '63' 1049 inline int log2_long(jlong x) { 1050 int i = -1; 1051 julong p = 1; 1052 while (p != 0 && p <= (julong)x) { 1053 // p = 2^(i+1) && p <= x (i.e., 2^(i+1) <= x) 1054 i++; p *= 2; 1055 } 1056 // p = 2^(i+1) && x < p (i.e., 2^i <= x < 2^(i+1)) 1057 // (if p = 0 then overflow occurred and i = 63) 1058 return i; 1059 } 1060 1061 //* the argument must be exactly a power of 2 1062 inline int exact_log2(intptr_t x) { 1063 #ifdef ASSERT 1064 if (!is_power_of_2(x)) basic_fatal("x must be a power of 2"); 1065 #endif 1066 return log2_intptr(x); 1067 } 1068 1069 //* the argument must be exactly a power of 2 1070 inline int exact_log2_long(jlong x) { 1071 #ifdef ASSERT 1072 if (!is_power_of_2_long(x)) basic_fatal("x must be a power of 2"); 1073 #endif 1074 return log2_long(x); 1075 } 1076 1077 1078 // returns integer round-up to the nearest multiple of s (s must be a power of two) 1079 inline intptr_t round_to(intptr_t x, uintx s) { 1080 #ifdef ASSERT 1081 if (!is_power_of_2(s)) basic_fatal("s must be a power of 2"); 1082 #endif 1083 const uintx m = s - 1; 1084 return mask_bits(x + m, ~m); 1085 } 1086 1087 // returns integer round-down to the nearest multiple of s (s must be a power of two) 1088 inline intptr_t round_down(intptr_t x, uintx s) { 1089 #ifdef ASSERT 1090 if (!is_power_of_2(s)) basic_fatal("s must be a power of 2"); 1091 #endif 1092 const uintx m = s - 1; 1093 return mask_bits(x, ~m); 1094 } 1095 1096 1097 inline bool is_odd (intx x) { return x & 1; } 1098 inline bool is_even(intx x) { return !is_odd(x); } 1099 1100 // "to" should be greater than "from." 1101 inline intx byte_size(void* from, void* to) { 1102 return (address)to - (address)from; 1103 } 1104 1105 //---------------------------------------------------------------------------------------------------- 1106 // Avoid non-portable casts with these routines (DEPRECATED) 1107 1108 // NOTE: USE Bytes class INSTEAD WHERE POSSIBLE 1109 // Bytes is optimized machine-specifically and may be much faster then the portable routines below. 1110 1111 // Given sequence of four bytes, build into a 32-bit word 1112 // following the conventions used in class files. 1113 // On the 386, this could be realized with a simple address cast. 1114 // 1115 1116 // This routine takes eight bytes: 1117 inline u8 build_u8_from( u1 c1, u1 c2, u1 c3, u1 c4, u1 c5, u1 c6, u1 c7, u1 c8 ) { 1118 return (( u8(c1) << 56 ) & ( u8(0xff) << 56 )) 1119 | (( u8(c2) << 48 ) & ( u8(0xff) << 48 )) 1120 | (( u8(c3) << 40 ) & ( u8(0xff) << 40 )) 1121 | (( u8(c4) << 32 ) & ( u8(0xff) << 32 )) 1122 | (( u8(c5) << 24 ) & ( u8(0xff) << 24 )) 1123 | (( u8(c6) << 16 ) & ( u8(0xff) << 16 )) 1124 | (( u8(c7) << 8 ) & ( u8(0xff) << 8 )) 1125 | (( u8(c8) << 0 ) & ( u8(0xff) << 0 )); 1126 } 1127 1128 // This routine takes four bytes: 1129 inline u4 build_u4_from( u1 c1, u1 c2, u1 c3, u1 c4 ) { 1130 return (( u4(c1) << 24 ) & 0xff000000) 1131 | (( u4(c2) << 16 ) & 0x00ff0000) 1132 | (( u4(c3) << 8 ) & 0x0000ff00) 1133 | (( u4(c4) << 0 ) & 0x000000ff); 1134 } 1135 1136 // And this one works if the four bytes are contiguous in memory: 1137 inline u4 build_u4_from( u1* p ) { 1138 return build_u4_from( p[0], p[1], p[2], p[3] ); 1139 } 1140 1141 // Ditto for two-byte ints: 1142 inline u2 build_u2_from( u1 c1, u1 c2 ) { 1143 return u2((( u2(c1) << 8 ) & 0xff00) 1144 | (( u2(c2) << 0 ) & 0x00ff)); 1145 } 1146 1147 // And this one works if the two bytes are contiguous in memory: 1148 inline u2 build_u2_from( u1* p ) { 1149 return build_u2_from( p[0], p[1] ); 1150 } 1151 1152 // Ditto for floats: 1153 inline jfloat build_float_from( u1 c1, u1 c2, u1 c3, u1 c4 ) { 1154 u4 u = build_u4_from( c1, c2, c3, c4 ); 1155 return *(jfloat*)&u; 1156 } 1157 1158 inline jfloat build_float_from( u1* p ) { 1159 u4 u = build_u4_from( p ); 1160 return *(jfloat*)&u; 1161 } 1162 1163 1164 // now (64-bit) longs 1165 1166 inline jlong build_long_from( u1 c1, u1 c2, u1 c3, u1 c4, u1 c5, u1 c6, u1 c7, u1 c8 ) { 1167 return (( jlong(c1) << 56 ) & ( jlong(0xff) << 56 )) 1168 | (( jlong(c2) << 48 ) & ( jlong(0xff) << 48 )) 1169 | (( jlong(c3) << 40 ) & ( jlong(0xff) << 40 )) 1170 | (( jlong(c4) << 32 ) & ( jlong(0xff) << 32 )) 1171 | (( jlong(c5) << 24 ) & ( jlong(0xff) << 24 )) 1172 | (( jlong(c6) << 16 ) & ( jlong(0xff) << 16 )) 1173 | (( jlong(c7) << 8 ) & ( jlong(0xff) << 8 )) 1174 | (( jlong(c8) << 0 ) & ( jlong(0xff) << 0 )); 1175 } 1176 1177 inline jlong build_long_from( u1* p ) { 1178 return build_long_from( p[0], p[1], p[2], p[3], p[4], p[5], p[6], p[7] ); 1179 } 1180 1181 1182 // Doubles, too! 1183 inline jdouble build_double_from( u1 c1, u1 c2, u1 c3, u1 c4, u1 c5, u1 c6, u1 c7, u1 c8 ) { 1184 jlong u = build_long_from( c1, c2, c3, c4, c5, c6, c7, c8 ); 1185 return *(jdouble*)&u; 1186 } 1187 1188 inline jdouble build_double_from( u1* p ) { 1189 jlong u = build_long_from( p ); 1190 return *(jdouble*)&u; 1191 } 1192 1193 1194 // Portable routines to go the other way: 1195 1196 inline void explode_short_to( u2 x, u1& c1, u1& c2 ) { 1197 c1 = u1(x >> 8); 1198 c2 = u1(x); 1199 } 1200 1201 inline void explode_short_to( u2 x, u1* p ) { 1202 explode_short_to( x, p[0], p[1]); 1203 } 1204 1205 inline void explode_int_to( u4 x, u1& c1, u1& c2, u1& c3, u1& c4 ) { 1206 c1 = u1(x >> 24); 1207 c2 = u1(x >> 16); 1208 c3 = u1(x >> 8); 1209 c4 = u1(x); 1210 } 1211 1212 inline void explode_int_to( u4 x, u1* p ) { 1213 explode_int_to( x, p[0], p[1], p[2], p[3]); 1214 } 1215 1216 1217 // Pack and extract shorts to/from ints: 1218 1219 inline int extract_low_short_from_int(jint x) { 1220 return x & 0xffff; 1221 } 1222 1223 inline int extract_high_short_from_int(jint x) { 1224 return (x >> 16) & 0xffff; 1225 } 1226 1227 inline int build_int_from_shorts( jushort low, jushort high ) { 1228 return ((int)((unsigned int)high << 16) | (unsigned int)low); 1229 } 1230 1231 // Printf-style formatters for fixed- and variable-width types as pointers and 1232 // integers. These are derived from the definitions in inttypes.h. If the platform 1233 // doesn't provide appropriate definitions, they should be provided in 1234 // the compiler-specific definitions file (e.g., globalDefinitions_gcc.hpp) 1235 1236 #define BOOL_TO_STR(_b_) ((_b_) ? "true" : "false") 1237 1238 // Format 32-bit quantities. 1239 #define INT32_FORMAT "%" PRId32 1240 #define UINT32_FORMAT "%" PRIu32 1241 #define INT32_FORMAT_W(width) "%" #width PRId32 1242 #define UINT32_FORMAT_W(width) "%" #width PRIu32 1243 1244 #define PTR32_FORMAT "0x%08" PRIx32 1245 1246 // Format 64-bit quantities. 1247 #define INT64_FORMAT "%" PRId64 1248 #define UINT64_FORMAT "%" PRIu64 1249 #define INT64_FORMAT_W(width) "%" #width PRId64 1250 #define UINT64_FORMAT_W(width) "%" #width PRIu64 1251 1252 #define PTR64_FORMAT "0x%016" PRIx64 1253 1254 // Format jlong, if necessary 1255 #ifndef JLONG_FORMAT 1256 #define JLONG_FORMAT INT64_FORMAT 1257 #endif 1258 #ifndef JULONG_FORMAT 1259 #define JULONG_FORMAT UINT64_FORMAT 1260 #endif 1261 1262 // Format pointers which change size between 32- and 64-bit. 1263 #ifdef _LP64 1264 #define INTPTR_FORMAT "0x%016" PRIxPTR 1265 #define PTR_FORMAT "0x%016" PRIxPTR 1266 #else // !_LP64 1267 #define INTPTR_FORMAT "0x%08" PRIxPTR 1268 #define PTR_FORMAT "0x%08" PRIxPTR 1269 #endif // _LP64 1270 1271 #define SSIZE_FORMAT "%" PRIdPTR 1272 #define SIZE_FORMAT "%" PRIuPTR 1273 #define SSIZE_FORMAT_W(width) "%" #width PRIdPTR 1274 #define SIZE_FORMAT_W(width) "%" #width PRIuPTR 1275 1276 #define INTX_FORMAT "%" PRIdPTR 1277 #define UINTX_FORMAT "%" PRIuPTR 1278 #define INTX_FORMAT_W(width) "%" #width PRIdPTR 1279 #define UINTX_FORMAT_W(width) "%" #width PRIuPTR 1280 1281 1282 // Enable zap-a-lot if in debug version. 1283 1284 # ifdef ASSERT 1285 # ifdef COMPILER2 1286 # define ENABLE_ZAP_DEAD_LOCALS 1287 #endif /* COMPILER2 */ 1288 # endif /* ASSERT */ 1289 1290 #define ARRAY_SIZE(array) (sizeof(array)/sizeof((array)[0])) 1291 1292 // Dereference vptr 1293 // All C++ compilers that we know of have the vtbl pointer in the first 1294 // word. If there are exceptions, this function needs to be made compiler 1295 // specific. 1296 static inline void* dereference_vptr(void* addr) { 1297 return *(void**)addr; 1298 } 1299 1300 1301 #ifndef PRODUCT 1302 1303 // For unit testing only 1304 class GlobalDefinitions { 1305 public: 1306 static void test_globals(); 1307 }; 1308 1309 #endif // PRODUCT 1310 1311 #endif // SHARE_VM_UTILITIES_GLOBALDEFINITIONS_HPP