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