Thu, 05 Sep 2019 18:52:27 +0800
Merge
1 /*
2 * Copyright (c) 1997, 2016, 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 /*
26 * This file has been modified by Loongson Technology in 2015. These
27 * modifications are Copyright (c) 2015 Loongson Technology, and are made
28 * available on the same license terms set forth above.
29 */
31 #ifndef SHARE_VM_UTILITIES_GLOBALDEFINITIONS_HPP
32 #define SHARE_VM_UTILITIES_GLOBALDEFINITIONS_HPP
34 #ifndef __STDC_FORMAT_MACROS
35 #define __STDC_FORMAT_MACROS
36 #endif
38 #ifdef TARGET_COMPILER_gcc
39 # include "utilities/globalDefinitions_gcc.hpp"
40 #endif
41 #ifdef TARGET_COMPILER_visCPP
42 # include "utilities/globalDefinitions_visCPP.hpp"
43 #endif
44 #ifdef TARGET_COMPILER_sparcWorks
45 # include "utilities/globalDefinitions_sparcWorks.hpp"
46 #endif
47 #ifdef TARGET_COMPILER_xlc
48 # include "utilities/globalDefinitions_xlc.hpp"
49 #endif
51 #ifndef PRAGMA_DIAG_PUSH
52 #define PRAGMA_DIAG_PUSH
53 #endif
54 #ifndef PRAGMA_DIAG_POP
55 #define PRAGMA_DIAG_POP
56 #endif
57 #ifndef PRAGMA_FORMAT_NONLITERAL_IGNORED
58 #define PRAGMA_FORMAT_NONLITERAL_IGNORED
59 #endif
60 #ifndef PRAGMA_FORMAT_IGNORED
61 #define PRAGMA_FORMAT_IGNORED
62 #endif
63 #ifndef PRAGMA_FORMAT_NONLITERAL_IGNORED_INTERNAL
64 #define PRAGMA_FORMAT_NONLITERAL_IGNORED_INTERNAL
65 #endif
66 #ifndef PRAGMA_FORMAT_NONLITERAL_IGNORED_EXTERNAL
67 #define PRAGMA_FORMAT_NONLITERAL_IGNORED_EXTERNAL
68 #endif
69 #ifndef PRAGMA_FORMAT_MUTE_WARNINGS_FOR_GCC
70 #define PRAGMA_FORMAT_MUTE_WARNINGS_FOR_GCC
71 #endif
72 #ifndef ATTRIBUTE_PRINTF
73 #define ATTRIBUTE_PRINTF(fmt, vargs)
74 #endif
77 #include "utilities/macros.hpp"
79 // This file holds all globally used constants & types, class (forward)
80 // declarations and a few frequently used utility functions.
82 //----------------------------------------------------------------------------------------------------
83 // Constants
85 const int LogBytesPerShort = 1;
86 const int LogBytesPerInt = 2;
87 #ifdef _LP64
88 const int LogBytesPerWord = 3;
89 #else
90 const int LogBytesPerWord = 2;
91 #endif
92 const int LogBytesPerLong = 3;
94 const int BytesPerShort = 1 << LogBytesPerShort;
95 const int BytesPerInt = 1 << LogBytesPerInt;
96 const int BytesPerWord = 1 << LogBytesPerWord;
97 const int BytesPerLong = 1 << LogBytesPerLong;
99 const int LogBitsPerByte = 3;
100 const int LogBitsPerShort = LogBitsPerByte + LogBytesPerShort;
101 const int LogBitsPerInt = LogBitsPerByte + LogBytesPerInt;
102 const int LogBitsPerWord = LogBitsPerByte + LogBytesPerWord;
103 const int LogBitsPerLong = LogBitsPerByte + LogBytesPerLong;
105 const int BitsPerByte = 1 << LogBitsPerByte;
106 const int BitsPerShort = 1 << LogBitsPerShort;
107 const int BitsPerInt = 1 << LogBitsPerInt;
108 const int BitsPerWord = 1 << LogBitsPerWord;
109 const int BitsPerLong = 1 << LogBitsPerLong;
111 const int WordAlignmentMask = (1 << LogBytesPerWord) - 1;
112 const int LongAlignmentMask = (1 << LogBytesPerLong) - 1;
114 const int WordsPerLong = 2; // Number of stack entries for longs
116 const int oopSize = sizeof(char*); // Full-width oop
117 extern int heapOopSize; // Oop within a java object
118 const int wordSize = sizeof(char*);
119 const int longSize = sizeof(jlong);
120 const int jintSize = sizeof(jint);
121 const int size_tSize = sizeof(size_t);
123 const int BytesPerOop = BytesPerWord; // Full-width oop
125 extern int LogBytesPerHeapOop; // Oop within a java object
126 extern int LogBitsPerHeapOop;
127 extern int BytesPerHeapOop;
128 extern int BitsPerHeapOop;
130 // Oop encoding heap max
131 extern uint64_t OopEncodingHeapMax;
133 const int BitsPerJavaInteger = 32;
134 const int BitsPerJavaLong = 64;
135 const int BitsPerSize_t = size_tSize * BitsPerByte;
137 // Size of a char[] needed to represent a jint as a string in decimal.
138 const int jintAsStringSize = 12;
140 // In fact this should be
141 // log2_intptr(sizeof(class JavaThread)) - log2_intptr(64);
142 // see os::set_memory_serialize_page()
143 #ifdef _LP64
144 const int SerializePageShiftCount = 4;
145 #else
146 const int SerializePageShiftCount = 3;
147 #endif
149 // An opaque struct of heap-word width, so that HeapWord* can be a generic
150 // pointer into the heap. We require that object sizes be measured in
151 // units of heap words, so that that
152 // HeapWord* hw;
153 // hw += oop(hw)->foo();
154 // works, where foo is a method (like size or scavenge) that returns the
155 // object size.
156 class HeapWord {
157 friend class VMStructs;
158 private:
159 char* i;
160 #ifndef PRODUCT
161 public:
162 char* value() { return i; }
163 #endif
164 };
166 // Analogous opaque struct for metadata allocated from
167 // metaspaces.
168 class MetaWord {
169 friend class VMStructs;
170 private:
171 char* i;
172 };
174 // HeapWordSize must be 2^LogHeapWordSize.
175 const int HeapWordSize = sizeof(HeapWord);
176 #ifdef _LP64
177 const int LogHeapWordSize = 3;
178 #else
179 const int LogHeapWordSize = 2;
180 #endif
181 const int HeapWordsPerLong = BytesPerLong / HeapWordSize;
182 const int LogHeapWordsPerLong = LogBytesPerLong - LogHeapWordSize;
184 // The larger HeapWordSize for 64bit requires larger heaps
185 // for the same application running in 64bit. See bug 4967770.
186 // The minimum alignment to a heap word size is done. Other
187 // parts of the memory system may required additional alignment
188 // and are responsible for those alignments.
189 #ifdef _LP64
190 #define ScaleForWordSize(x) align_size_down_((x) * 13 / 10, HeapWordSize)
191 #else
192 #define ScaleForWordSize(x) (x)
193 #endif
195 // The minimum number of native machine words necessary to contain "byte_size"
196 // bytes.
197 inline size_t heap_word_size(size_t byte_size) {
198 return (byte_size + (HeapWordSize-1)) >> LogHeapWordSize;
199 }
202 const size_t K = 1024;
203 const size_t M = K*K;
204 const size_t G = M*K;
205 const size_t HWperKB = K / sizeof(HeapWord);
207 const jint min_jint = (jint)1 << (sizeof(jint)*BitsPerByte-1); // 0x80000000 == smallest jint
208 const jint max_jint = (juint)min_jint - 1; // 0x7FFFFFFF == largest jint
210 // Constants for converting from a base unit to milli-base units. For
211 // example from seconds to milliseconds and microseconds
213 const int MILLIUNITS = 1000; // milli units per base unit
214 const int MICROUNITS = 1000000; // micro units per base unit
215 const int NANOUNITS = 1000000000; // nano units per base unit
217 const jlong NANOSECS_PER_SEC = CONST64(1000000000);
218 const jint NANOSECS_PER_MILLISEC = 1000000;
220 // Proper units routines try to maintain at least three significant digits.
221 // In worst case, it would print five significant digits with lower prefix.
222 // G is close to MAX_SIZE on 32-bit platforms, so its product can easily overflow,
223 // and therefore we need to be careful.
225 inline const char* proper_unit_for_byte_size(size_t s) {
226 #ifdef _LP64
227 if (s >= 100*G) {
228 return "G";
229 }
230 #endif
231 if (s >= 100*M) {
232 return "M";
233 } else if (s >= 100*K) {
234 return "K";
235 } else {
236 return "B";
237 }
238 }
240 template <class T>
241 inline T byte_size_in_proper_unit(T s) {
242 #ifdef _LP64
243 if (s >= 100*G) {
244 return (T)(s/G);
245 }
246 #endif
247 if (s >= 100*M) {
248 return (T)(s/M);
249 } else if (s >= 100*K) {
250 return (T)(s/K);
251 } else {
252 return s;
253 }
254 }
256 //----------------------------------------------------------------------------------------------------
257 // VM type definitions
259 // intx and uintx are the 'extended' int and 'extended' unsigned int types;
260 // they are 32bit wide on a 32-bit platform, and 64bit wide on a 64bit platform.
262 typedef intptr_t intx;
263 typedef uintptr_t uintx;
265 const intx min_intx = (intx)1 << (sizeof(intx)*BitsPerByte-1);
266 const intx max_intx = (uintx)min_intx - 1;
267 const uintx max_uintx = (uintx)-1;
269 // Table of values:
270 // sizeof intx 4 8
271 // min_intx 0x80000000 0x8000000000000000
272 // max_intx 0x7FFFFFFF 0x7FFFFFFFFFFFFFFF
273 // max_uintx 0xFFFFFFFF 0xFFFFFFFFFFFFFFFF
275 typedef unsigned int uint; NEEDS_CLEANUP
278 //----------------------------------------------------------------------------------------------------
279 // Java type definitions
281 // All kinds of 'plain' byte addresses
282 typedef signed char s_char;
283 typedef unsigned char u_char;
284 typedef u_char* address;
285 typedef uintptr_t address_word; // unsigned integer which will hold a pointer
286 // except for some implementations of a C++
287 // linkage pointer to function. Should never
288 // need one of those to be placed in this
289 // type anyway.
291 // Utility functions to "portably" (?) bit twiddle pointers
292 // Where portable means keep ANSI C++ compilers quiet
294 inline address set_address_bits(address x, int m) { return address(intptr_t(x) | m); }
295 inline address clear_address_bits(address x, int m) { return address(intptr_t(x) & ~m); }
297 // Utility functions to "portably" make cast to/from function pointers.
299 inline address_word mask_address_bits(address x, int m) { return address_word(x) & m; }
300 inline address_word castable_address(address x) { return address_word(x) ; }
301 inline address_word castable_address(void* x) { return address_word(x) ; }
303 // Pointer subtraction.
304 // The idea here is to avoid ptrdiff_t, which is signed and so doesn't have
305 // the range we might need to find differences from one end of the heap
306 // to the other.
307 // A typical use might be:
308 // if (pointer_delta(end(), top()) >= size) {
309 // // enough room for an object of size
310 // ...
311 // and then additions like
312 // ... top() + size ...
313 // are safe because we know that top() is at least size below end().
314 inline size_t pointer_delta(const void* left,
315 const void* right,
316 size_t element_size) {
317 return (((uintptr_t) left) - ((uintptr_t) right)) / element_size;
318 }
319 // A version specialized for HeapWord*'s.
320 inline size_t pointer_delta(const HeapWord* left, const HeapWord* right) {
321 return pointer_delta(left, right, sizeof(HeapWord));
322 }
323 // A version specialized for MetaWord*'s.
324 inline size_t pointer_delta(const MetaWord* left, const MetaWord* right) {
325 return pointer_delta(left, right, sizeof(MetaWord));
326 }
328 //
329 // ANSI C++ does not allow casting from one pointer type to a function pointer
330 // directly without at best a warning. This macro accomplishes it silently
331 // In every case that is present at this point the value be cast is a pointer
332 // to a C linkage function. In somecase the type used for the cast reflects
333 // that linkage and a picky compiler would not complain. In other cases because
334 // there is no convenient place to place a typedef with extern C linkage (i.e
335 // a platform dependent header file) it doesn't. At this point no compiler seems
336 // picky enough to catch these instances (which are few). It is possible that
337 // using templates could fix these for all cases. This use of templates is likely
338 // so far from the middle of the road that it is likely to be problematic in
339 // many C++ compilers.
340 //
341 #define CAST_TO_FN_PTR(func_type, value) (reinterpret_cast<func_type>(value))
342 #define CAST_FROM_FN_PTR(new_type, func_ptr) ((new_type)((address_word)(func_ptr)))
344 // Unsigned byte types for os and stream.hpp
346 // Unsigned one, two, four and eigth byte quantities used for describing
347 // the .class file format. See JVM book chapter 4.
349 typedef jubyte u1;
350 typedef jushort u2;
351 typedef juint u4;
352 typedef julong u8;
354 const jubyte max_jubyte = (jubyte)-1; // 0xFF largest jubyte
355 const jushort max_jushort = (jushort)-1; // 0xFFFF largest jushort
356 const juint max_juint = (juint)-1; // 0xFFFFFFFF largest juint
357 const julong max_julong = (julong)-1; // 0xFF....FF largest julong
359 typedef jbyte s1;
360 typedef jshort s2;
361 typedef jint s4;
362 typedef jlong s8;
364 //----------------------------------------------------------------------------------------------------
365 // JVM spec restrictions
367 const int max_method_code_size = 64*K - 1; // JVM spec, 2nd ed. section 4.8.1 (p.134)
369 // Default ProtectionDomainCacheSize values
371 const int defaultProtectionDomainCacheSize = NOT_LP64(137) LP64_ONLY(2017);
373 //----------------------------------------------------------------------------------------------------
374 // Default and minimum StringTableSize values
376 const int defaultStringTableSize = NOT_LP64(1009) LP64_ONLY(60013);
377 const int minimumStringTableSize = 1009;
379 const int defaultSymbolTableSize = 20011;
380 const int minimumSymbolTableSize = 1009;
383 //----------------------------------------------------------------------------------------------------
384 // HotSwap - for JVMTI aka Class File Replacement and PopFrame
385 //
386 // Determines whether on-the-fly class replacement and frame popping are enabled.
388 #define HOTSWAP
390 //----------------------------------------------------------------------------------------------------
391 // Object alignment, in units of HeapWords.
392 //
393 // Minimum is max(BytesPerLong, BytesPerDouble, BytesPerOop) / HeapWordSize, so jlong, jdouble and
394 // reference fields can be naturally aligned.
396 extern int MinObjAlignment;
397 extern int MinObjAlignmentInBytes;
398 extern int MinObjAlignmentInBytesMask;
400 extern int LogMinObjAlignment;
401 extern int LogMinObjAlignmentInBytes;
403 const int LogKlassAlignmentInBytes = 3;
404 const int LogKlassAlignment = LogKlassAlignmentInBytes - LogHeapWordSize;
405 const int KlassAlignmentInBytes = 1 << LogKlassAlignmentInBytes;
406 const int KlassAlignment = KlassAlignmentInBytes / HeapWordSize;
408 // Klass encoding metaspace max size
409 const uint64_t KlassEncodingMetaspaceMax = (uint64_t(max_juint) + 1) << LogKlassAlignmentInBytes;
411 // Machine dependent stuff
413 #if defined(X86) && defined(COMPILER2) && !defined(JAVASE_EMBEDDED)
414 // Include Restricted Transactional Memory lock eliding optimization
415 #define INCLUDE_RTM_OPT 1
416 #define RTM_OPT_ONLY(code) code
417 #else
418 #define INCLUDE_RTM_OPT 0
419 #define RTM_OPT_ONLY(code)
420 #endif
421 // States of Restricted Transactional Memory usage.
422 enum RTMState {
423 NoRTM = 0x2, // Don't use RTM
424 UseRTM = 0x1, // Use RTM
425 ProfileRTM = 0x0 // Use RTM with abort ratio calculation
426 };
428 #ifdef TARGET_ARCH_x86
429 # include "globalDefinitions_x86.hpp"
430 #endif
431 #ifdef TARGET_ARCH_sparc
432 # include "globalDefinitions_sparc.hpp"
433 #endif
434 #ifdef TARGET_ARCH_zero
435 # include "globalDefinitions_zero.hpp"
436 #endif
437 #ifdef TARGET_ARCH_arm
438 # include "globalDefinitions_arm.hpp"
439 #endif
440 #ifdef TARGET_ARCH_ppc
441 # include "globalDefinitions_ppc.hpp"
442 #endif
443 #ifdef TARGET_ARCH_mips
444 # include "globalDefinitions_mips.hpp"
445 #endif
447 /*
448 * If a platform does not support native stack walking
449 * the platform specific globalDefinitions (above)
450 * can set PLATFORM_NATIVE_STACK_WALKING_SUPPORTED to 0
451 */
452 #ifndef PLATFORM_NATIVE_STACK_WALKING_SUPPORTED
453 #define PLATFORM_NATIVE_STACK_WALKING_SUPPORTED 1
454 #endif
456 // To assure the IRIW property on processors that are not multiple copy
457 // atomic, sync instructions must be issued between volatile reads to
458 // assure their ordering, instead of after volatile stores.
459 // (See "A Tutorial Introduction to the ARM and POWER Relaxed Memory Models"
460 // by Luc Maranget, Susmit Sarkar and Peter Sewell, INRIA/Cambridge)
461 #ifdef CPU_NOT_MULTIPLE_COPY_ATOMIC
462 const bool support_IRIW_for_not_multiple_copy_atomic_cpu = true;
463 #else
464 const bool support_IRIW_for_not_multiple_copy_atomic_cpu = false;
465 #endif
467 // The byte alignment to be used by Arena::Amalloc. See bugid 4169348.
468 // Note: this value must be a power of 2
470 #define ARENA_AMALLOC_ALIGNMENT (2*BytesPerWord)
472 // Signed variants of alignment helpers. There are two versions of each, a macro
473 // for use in places like enum definitions that require compile-time constant
474 // expressions and a function for all other places so as to get type checking.
476 #define align_size_up_(size, alignment) (((size) + ((alignment) - 1)) & ~((alignment) - 1))
478 inline bool is_size_aligned(size_t size, size_t alignment) {
479 return align_size_up_(size, alignment) == size;
480 }
482 inline bool is_ptr_aligned(void* ptr, size_t alignment) {
483 return align_size_up_((intptr_t)ptr, (intptr_t)alignment) == (intptr_t)ptr;
484 }
486 inline intptr_t align_size_up(intptr_t size, intptr_t alignment) {
487 return align_size_up_(size, alignment);
488 }
490 #define align_size_down_(size, alignment) ((size) & ~((alignment) - 1))
492 inline intptr_t align_size_down(intptr_t size, intptr_t alignment) {
493 return align_size_down_(size, alignment);
494 }
496 #define is_size_aligned_(size, alignment) ((size) == (align_size_up_(size, alignment)))
498 inline void* align_ptr_up(void* ptr, size_t alignment) {
499 return (void*)align_size_up((intptr_t)ptr, (intptr_t)alignment);
500 }
502 inline void* align_ptr_down(void* ptr, size_t alignment) {
503 return (void*)align_size_down((intptr_t)ptr, (intptr_t)alignment);
504 }
506 // Align objects by rounding up their size, in HeapWord units.
508 #define align_object_size_(size) align_size_up_(size, MinObjAlignment)
510 inline intptr_t align_object_size(intptr_t size) {
511 return align_size_up(size, MinObjAlignment);
512 }
514 inline bool is_object_aligned(intptr_t addr) {
515 return addr == align_object_size(addr);
516 }
518 // Pad out certain offsets to jlong alignment, in HeapWord units.
520 inline intptr_t align_object_offset(intptr_t offset) {
521 return align_size_up(offset, HeapWordsPerLong);
522 }
524 inline void* align_pointer_up(const void* addr, size_t size) {
525 return (void*) align_size_up_((uintptr_t)addr, size);
526 }
528 // Align down with a lower bound. If the aligning results in 0, return 'alignment'.
530 inline size_t align_size_down_bounded(size_t size, size_t alignment) {
531 size_t aligned_size = align_size_down_(size, alignment);
532 return aligned_size > 0 ? aligned_size : alignment;
533 }
535 // Clamp an address to be within a specific page
536 // 1. If addr is on the page it is returned as is
537 // 2. If addr is above the page_address the start of the *next* page will be returned
538 // 3. Otherwise, if addr is below the page_address the start of the page will be returned
539 inline address clamp_address_in_page(address addr, address page_address, intptr_t page_size) {
540 if (align_size_down(intptr_t(addr), page_size) == align_size_down(intptr_t(page_address), page_size)) {
541 // address is in the specified page, just return it as is
542 return addr;
543 } else if (addr > page_address) {
544 // address is above specified page, return start of next page
545 return (address)align_size_down(intptr_t(page_address), page_size) + page_size;
546 } else {
547 // address is below specified page, return start of page
548 return (address)align_size_down(intptr_t(page_address), page_size);
549 }
550 }
553 // The expected size in bytes of a cache line, used to pad data structures.
554 #define DEFAULT_CACHE_LINE_SIZE 64
557 //----------------------------------------------------------------------------------------------------
558 // Utility macros for compilers
559 // used to silence compiler warnings
561 #define Unused_Variable(var) var
564 //----------------------------------------------------------------------------------------------------
565 // Miscellaneous
567 // 6302670 Eliminate Hotspot __fabsf dependency
568 // All fabs() callers should call this function instead, which will implicitly
569 // convert the operand to double, avoiding a dependency on __fabsf which
570 // doesn't exist in early versions of Solaris 8.
571 inline double fabsd(double value) {
572 return fabs(value);
573 }
575 //----------------------------------------------------------------------------------------------------
576 // Special casts
577 // Cast floats into same-size integers and vice-versa w/o changing bit-pattern
578 typedef union {
579 jfloat f;
580 jint i;
581 } FloatIntConv;
583 typedef union {
584 jdouble d;
585 jlong l;
586 julong ul;
587 } DoubleLongConv;
589 inline jint jint_cast (jfloat x) { return ((FloatIntConv*)&x)->i; }
590 inline jfloat jfloat_cast (jint x) { return ((FloatIntConv*)&x)->f; }
592 inline jlong jlong_cast (jdouble x) { return ((DoubleLongConv*)&x)->l; }
593 inline julong julong_cast (jdouble x) { return ((DoubleLongConv*)&x)->ul; }
594 inline jdouble jdouble_cast (jlong x) { return ((DoubleLongConv*)&x)->d; }
596 inline jint low (jlong value) { return jint(value); }
597 inline jint high(jlong value) { return jint(value >> 32); }
599 // the fancy casts are a hopefully portable way
600 // to do unsigned 32 to 64 bit type conversion
601 inline void set_low (jlong* value, jint low ) { *value &= (jlong)0xffffffff << 32;
602 *value |= (jlong)(julong)(juint)low; }
604 inline void set_high(jlong* value, jint high) { *value &= (jlong)(julong)(juint)0xffffffff;
605 *value |= (jlong)high << 32; }
607 inline jlong jlong_from(jint h, jint l) {
608 jlong result = 0; // initialization to avoid warning
609 set_high(&result, h);
610 set_low(&result, l);
611 return result;
612 }
614 union jlong_accessor {
615 jint words[2];
616 jlong long_value;
617 };
619 void basic_types_init(); // cannot define here; uses assert
622 // NOTE: replicated in SA in vm/agent/sun/jvm/hotspot/runtime/BasicType.java
623 enum BasicType {
624 T_BOOLEAN = 4,
625 T_CHAR = 5,
626 T_FLOAT = 6,
627 T_DOUBLE = 7,
628 T_BYTE = 8,
629 T_SHORT = 9,
630 T_INT = 10,
631 T_LONG = 11,
632 T_OBJECT = 12,
633 T_ARRAY = 13,
634 T_VOID = 14,
635 T_ADDRESS = 15,
636 T_NARROWOOP = 16,
637 T_METADATA = 17,
638 T_NARROWKLASS = 18,
639 T_CONFLICT = 19, // for stack value type with conflicting contents
640 T_ILLEGAL = 99
641 };
643 inline bool is_java_primitive(BasicType t) {
644 return T_BOOLEAN <= t && t <= T_LONG;
645 }
647 inline bool is_subword_type(BasicType t) {
648 // these guys are processed exactly like T_INT in calling sequences:
649 return (t == T_BOOLEAN || t == T_CHAR || t == T_BYTE || t == T_SHORT);
650 }
652 inline bool is_signed_subword_type(BasicType t) {
653 return (t == T_BYTE || t == T_SHORT);
654 }
656 // Convert a char from a classfile signature to a BasicType
657 inline BasicType char2type(char c) {
658 switch( c ) {
659 case 'B': return T_BYTE;
660 case 'C': return T_CHAR;
661 case 'D': return T_DOUBLE;
662 case 'F': return T_FLOAT;
663 case 'I': return T_INT;
664 case 'J': return T_LONG;
665 case 'S': return T_SHORT;
666 case 'Z': return T_BOOLEAN;
667 case 'V': return T_VOID;
668 case 'L': return T_OBJECT;
669 case '[': return T_ARRAY;
670 }
671 return T_ILLEGAL;
672 }
674 extern char type2char_tab[T_CONFLICT+1]; // Map a BasicType to a jchar
675 inline char type2char(BasicType t) { return (uint)t < T_CONFLICT+1 ? type2char_tab[t] : 0; }
676 extern int type2size[T_CONFLICT+1]; // Map BasicType to result stack elements
677 extern const char* type2name_tab[T_CONFLICT+1]; // Map a BasicType to a jchar
678 inline const char* type2name(BasicType t) { return (uint)t < T_CONFLICT+1 ? type2name_tab[t] : NULL; }
679 extern BasicType name2type(const char* name);
681 // Auxilary math routines
682 // least common multiple
683 extern size_t lcm(size_t a, size_t b);
686 // NOTE: replicated in SA in vm/agent/sun/jvm/hotspot/runtime/BasicType.java
687 enum BasicTypeSize {
688 T_BOOLEAN_size = 1,
689 T_CHAR_size = 1,
690 T_FLOAT_size = 1,
691 T_DOUBLE_size = 2,
692 T_BYTE_size = 1,
693 T_SHORT_size = 1,
694 T_INT_size = 1,
695 T_LONG_size = 2,
696 T_OBJECT_size = 1,
697 T_ARRAY_size = 1,
698 T_NARROWOOP_size = 1,
699 T_NARROWKLASS_size = 1,
700 T_VOID_size = 0
701 };
704 // maps a BasicType to its instance field storage type:
705 // all sub-word integral types are widened to T_INT
706 extern BasicType type2field[T_CONFLICT+1];
707 extern BasicType type2wfield[T_CONFLICT+1];
710 // size in bytes
711 enum ArrayElementSize {
712 T_BOOLEAN_aelem_bytes = 1,
713 T_CHAR_aelem_bytes = 2,
714 T_FLOAT_aelem_bytes = 4,
715 T_DOUBLE_aelem_bytes = 8,
716 T_BYTE_aelem_bytes = 1,
717 T_SHORT_aelem_bytes = 2,
718 T_INT_aelem_bytes = 4,
719 T_LONG_aelem_bytes = 8,
720 #ifdef _LP64
721 T_OBJECT_aelem_bytes = 8,
722 T_ARRAY_aelem_bytes = 8,
723 #else
724 T_OBJECT_aelem_bytes = 4,
725 T_ARRAY_aelem_bytes = 4,
726 #endif
727 T_NARROWOOP_aelem_bytes = 4,
728 T_NARROWKLASS_aelem_bytes = 4,
729 T_VOID_aelem_bytes = 0
730 };
732 extern int _type2aelembytes[T_CONFLICT+1]; // maps a BasicType to nof bytes used by its array element
733 #ifdef ASSERT
734 extern int type2aelembytes(BasicType t, bool allow_address = false); // asserts
735 #else
736 inline int type2aelembytes(BasicType t, bool allow_address = false) { return _type2aelembytes[t]; }
737 #endif
740 // JavaValue serves as a container for arbitrary Java values.
742 class JavaValue {
744 public:
745 typedef union JavaCallValue {
746 jfloat f;
747 jdouble d;
748 jint i;
749 jlong l;
750 jobject h;
751 } JavaCallValue;
753 private:
754 BasicType _type;
755 JavaCallValue _value;
757 public:
758 JavaValue(BasicType t = T_ILLEGAL) { _type = t; }
760 JavaValue(jfloat value) {
761 _type = T_FLOAT;
762 _value.f = value;
763 }
765 JavaValue(jdouble value) {
766 _type = T_DOUBLE;
767 _value.d = value;
768 }
770 jfloat get_jfloat() const { return _value.f; }
771 jdouble get_jdouble() const { return _value.d; }
772 jint get_jint() const { return _value.i; }
773 jlong get_jlong() const { return _value.l; }
774 jobject get_jobject() const { return _value.h; }
775 JavaCallValue* get_value_addr() { return &_value; }
776 BasicType get_type() const { return _type; }
778 void set_jfloat(jfloat f) { _value.f = f;}
779 void set_jdouble(jdouble d) { _value.d = d;}
780 void set_jint(jint i) { _value.i = i;}
781 void set_jlong(jlong l) { _value.l = l;}
782 void set_jobject(jobject h) { _value.h = h;}
783 void set_type(BasicType t) { _type = t; }
785 jboolean get_jboolean() const { return (jboolean) (_value.i);}
786 jbyte get_jbyte() const { return (jbyte) (_value.i);}
787 jchar get_jchar() const { return (jchar) (_value.i);}
788 jshort get_jshort() const { return (jshort) (_value.i);}
790 };
793 #define STACK_BIAS 0
794 // V9 Sparc CPU's running in 64 Bit mode use a stack bias of 7ff
795 // in order to extend the reach of the stack pointer.
796 #if defined(SPARC) && defined(_LP64)
797 #undef STACK_BIAS
798 #define STACK_BIAS 0x7ff
799 #endif
802 // TosState describes the top-of-stack state before and after the execution of
803 // a bytecode or method. The top-of-stack value may be cached in one or more CPU
804 // registers. The TosState corresponds to the 'machine represention' of this cached
805 // value. There's 4 states corresponding to the JAVA types int, long, float & double
806 // as well as a 5th state in case the top-of-stack value is actually on the top
807 // of stack (in memory) and thus not cached. The atos state corresponds to the itos
808 // state when it comes to machine representation but is used separately for (oop)
809 // type specific operations (e.g. verification code).
811 enum TosState { // describes the tos cache contents
812 btos = 0, // byte, bool tos cached
813 ztos = 1, // byte, bool tos cached
814 ctos = 2, // char tos cached
815 stos = 3, // short tos cached
816 itos = 4, // int tos cached
817 ltos = 5, // long tos cached
818 ftos = 6, // float tos cached
819 dtos = 7, // double tos cached
820 atos = 8, // object cached
821 vtos = 9, // tos not cached
822 number_of_states,
823 ilgl // illegal state: should not occur
824 };
827 inline TosState as_TosState(BasicType type) {
828 switch (type) {
829 case T_BYTE : return btos;
830 case T_BOOLEAN: return ztos;
831 case T_CHAR : return ctos;
832 case T_SHORT : return stos;
833 case T_INT : return itos;
834 case T_LONG : return ltos;
835 case T_FLOAT : return ftos;
836 case T_DOUBLE : return dtos;
837 case T_VOID : return vtos;
838 case T_ARRAY : // fall through
839 case T_OBJECT : return atos;
840 }
841 return ilgl;
842 }
844 inline BasicType as_BasicType(TosState state) {
845 switch (state) {
846 case btos : return T_BYTE;
847 case ztos : return T_BOOLEAN;
848 case ctos : return T_CHAR;
849 case stos : return T_SHORT;
850 case itos : return T_INT;
851 case ltos : return T_LONG;
852 case ftos : return T_FLOAT;
853 case dtos : return T_DOUBLE;
854 case atos : return T_OBJECT;
855 case vtos : return T_VOID;
856 }
857 return T_ILLEGAL;
858 }
861 // Helper function to convert BasicType info into TosState
862 // Note: Cannot define here as it uses global constant at the time being.
863 TosState as_TosState(BasicType type);
866 // JavaThreadState keeps track of which part of the code a thread is executing in. This
867 // information is needed by the safepoint code.
868 //
869 // There are 4 essential states:
870 //
871 // _thread_new : Just started, but not executed init. code yet (most likely still in OS init code)
872 // _thread_in_native : In native code. This is a safepoint region, since all oops will be in jobject handles
873 // _thread_in_vm : Executing in the vm
874 // _thread_in_Java : Executing either interpreted or compiled Java code (or could be in a stub)
875 //
876 // Each state has an associated xxxx_trans state, which is an intermediate state used when a thread is in
877 // a transition from one state to another. These extra states makes it possible for the safepoint code to
878 // handle certain thread_states without having to suspend the thread - making the safepoint code faster.
879 //
880 // Given a state, the xxx_trans state can always be found by adding 1.
881 //
882 enum JavaThreadState {
883 _thread_uninitialized = 0, // should never happen (missing initialization)
884 _thread_new = 2, // just starting up, i.e., in process of being initialized
885 _thread_new_trans = 3, // corresponding transition state (not used, included for completness)
886 _thread_in_native = 4, // running in native code
887 _thread_in_native_trans = 5, // corresponding transition state
888 _thread_in_vm = 6, // running in VM
889 _thread_in_vm_trans = 7, // corresponding transition state
890 _thread_in_Java = 8, // running in Java or in stub code
891 _thread_in_Java_trans = 9, // corresponding transition state (not used, included for completness)
892 _thread_blocked = 10, // blocked in vm
893 _thread_blocked_trans = 11, // corresponding transition state
894 _thread_max_state = 12 // maximum thread state+1 - used for statistics allocation
895 };
898 // Handy constants for deciding which compiler mode to use.
899 enum MethodCompilation {
900 InvocationEntryBci = -1, // i.e., not a on-stack replacement compilation
901 InvalidOSREntryBci = -2
902 };
904 // Enumeration to distinguish tiers of compilation
905 enum CompLevel {
906 CompLevel_any = -1,
907 CompLevel_all = -1,
908 CompLevel_none = 0, // Interpreter
909 CompLevel_simple = 1, // C1
910 CompLevel_limited_profile = 2, // C1, invocation & backedge counters
911 CompLevel_full_profile = 3, // C1, invocation & backedge counters + mdo
912 CompLevel_full_optimization = 4, // C2 or Shark
914 #if defined(COMPILER2) || defined(SHARK)
915 CompLevel_highest_tier = CompLevel_full_optimization, // pure C2 and tiered
916 #elif defined(COMPILER1)
917 CompLevel_highest_tier = CompLevel_simple, // pure C1
918 #else
919 CompLevel_highest_tier = CompLevel_none,
920 #endif
922 #if defined(TIERED)
923 CompLevel_initial_compile = CompLevel_full_profile // tiered
924 #elif defined(COMPILER1)
925 CompLevel_initial_compile = CompLevel_simple // pure C1
926 #elif defined(COMPILER2) || defined(SHARK)
927 CompLevel_initial_compile = CompLevel_full_optimization // pure C2
928 #else
929 CompLevel_initial_compile = CompLevel_none
930 #endif
931 };
933 inline bool is_c1_compile(int comp_level) {
934 return comp_level > CompLevel_none && comp_level < CompLevel_full_optimization;
935 }
937 inline bool is_c2_compile(int comp_level) {
938 return comp_level == CompLevel_full_optimization;
939 }
941 inline bool is_highest_tier_compile(int comp_level) {
942 return comp_level == CompLevel_highest_tier;
943 }
945 inline bool is_compile(int comp_level) {
946 return is_c1_compile(comp_level) || is_c2_compile(comp_level);
947 }
949 //----------------------------------------------------------------------------------------------------
950 // 'Forward' declarations of frequently used classes
951 // (in order to reduce interface dependencies & reduce
952 // number of unnecessary compilations after changes)
954 class symbolTable;
955 class ClassFileStream;
957 class Event;
959 class Thread;
960 class VMThread;
961 class JavaThread;
962 class Threads;
964 class VM_Operation;
965 class VMOperationQueue;
967 class CodeBlob;
968 class nmethod;
969 class OSRAdapter;
970 class I2CAdapter;
971 class C2IAdapter;
972 class CompiledIC;
973 class relocInfo;
974 class ScopeDesc;
975 class PcDesc;
977 class Recompiler;
978 class Recompilee;
979 class RecompilationPolicy;
980 class RFrame;
981 class CompiledRFrame;
982 class InterpretedRFrame;
984 class frame;
986 class vframe;
987 class javaVFrame;
988 class interpretedVFrame;
989 class compiledVFrame;
990 class deoptimizedVFrame;
991 class externalVFrame;
992 class entryVFrame;
994 class RegisterMap;
996 class Mutex;
997 class Monitor;
998 class BasicLock;
999 class BasicObjectLock;
1001 class PeriodicTask;
1003 class JavaCallWrapper;
1005 class oopDesc;
1006 class metaDataOopDesc;
1008 class NativeCall;
1010 class zone;
1012 class StubQueue;
1014 class outputStream;
1016 class ResourceArea;
1018 class DebugInformationRecorder;
1019 class ScopeValue;
1020 class CompressedStream;
1021 class DebugInfoReadStream;
1022 class DebugInfoWriteStream;
1023 class LocationValue;
1024 class ConstantValue;
1025 class IllegalValue;
1027 class PrivilegedElement;
1028 class MonitorArray;
1030 class MonitorInfo;
1032 class OffsetClosure;
1033 class OopMapCache;
1034 class InterpreterOopMap;
1035 class OopMapCacheEntry;
1036 class OSThread;
1038 typedef int (*OSThreadStartFunc)(void*);
1040 class Space;
1042 class JavaValue;
1043 class methodHandle;
1044 class JavaCallArguments;
1046 // Basic support for errors (general debug facilities not defined at this point fo the include phase)
1048 extern void basic_fatal(const char* msg);
1051 //----------------------------------------------------------------------------------------------------
1052 // Special constants for debugging
1054 const jint badInt = -3; // generic "bad int" value
1055 const intptr_t badAddressVal = -2; // generic "bad address" value
1056 const intptr_t badOopVal = -1; // generic "bad oop" value
1057 const intptr_t badHeapOopVal = (intptr_t) CONST64(0x2BAD4B0BBAADBABE); // value used to zap heap after GC
1058 const int badHandleValue = 0xBC; // value used to zap vm handle area
1059 const int badResourceValue = 0xAB; // value used to zap resource area
1060 const int freeBlockPad = 0xBA; // value used to pad freed blocks.
1061 const int uninitBlockPad = 0xF1; // value used to zap newly malloc'd blocks.
1062 const intptr_t badJNIHandleVal = (intptr_t) CONST64(0xFEFEFEFEFEFEFEFE); // value used to zap jni handle area
1063 const juint badHeapWordVal = 0xBAADBABE; // value used to zap heap after GC
1064 const juint badMetaWordVal = 0xBAADFADE; // value used to zap metadata heap after GC
1065 const int badCodeHeapNewVal= 0xCC; // value used to zap Code heap at allocation
1066 const int badCodeHeapFreeVal = 0xDD; // value used to zap Code heap at deallocation
1069 // (These must be implemented as #defines because C++ compilers are
1070 // not obligated to inline non-integral constants!)
1071 #define badAddress ((address)::badAddressVal)
1072 #define badOop (cast_to_oop(::badOopVal))
1073 #define badHeapWord (::badHeapWordVal)
1074 #define badJNIHandle (cast_to_oop(::badJNIHandleVal))
1076 // Default TaskQueue size is 16K (32-bit) or 128K (64-bit)
1077 #define TASKQUEUE_SIZE (NOT_LP64(1<<14) LP64_ONLY(1<<17))
1079 //----------------------------------------------------------------------------------------------------
1080 // Utility functions for bitfield manipulations
1082 const intptr_t AllBits = ~0; // all bits set in a word
1083 const intptr_t NoBits = 0; // no bits set in a word
1084 const jlong NoLongBits = 0; // no bits set in a long
1085 const intptr_t OneBit = 1; // only right_most bit set in a word
1087 // get a word with the n.th or the right-most or left-most n bits set
1088 // (note: #define used only so that they can be used in enum constant definitions)
1089 #define nth_bit(n) (n >= BitsPerWord ? 0 : OneBit << (n))
1090 #define right_n_bits(n) (nth_bit(n) - 1)
1091 #define left_n_bits(n) (right_n_bits(n) << (n >= BitsPerWord ? 0 : (BitsPerWord - n)))
1093 // bit-operations using a mask m
1094 inline void set_bits (intptr_t& x, intptr_t m) { x |= m; }
1095 inline void clear_bits (intptr_t& x, intptr_t m) { x &= ~m; }
1096 inline intptr_t mask_bits (intptr_t x, intptr_t m) { return x & m; }
1097 inline jlong mask_long_bits (jlong x, jlong m) { return x & m; }
1098 inline bool mask_bits_are_true (intptr_t flags, intptr_t mask) { return (flags & mask) == mask; }
1100 // bit-operations using the n.th bit
1101 inline void set_nth_bit(intptr_t& x, int n) { set_bits (x, nth_bit(n)); }
1102 inline void clear_nth_bit(intptr_t& x, int n) { clear_bits(x, nth_bit(n)); }
1103 inline bool is_set_nth_bit(intptr_t x, int n) { return mask_bits (x, nth_bit(n)) != NoBits; }
1105 // returns the bitfield of x starting at start_bit_no with length field_length (no sign-extension!)
1106 inline intptr_t bitfield(intptr_t x, int start_bit_no, int field_length) {
1107 return mask_bits(x >> start_bit_no, right_n_bits(field_length));
1108 }
1111 //----------------------------------------------------------------------------------------------------
1112 // Utility functions for integers
1114 // Avoid use of global min/max macros which may cause unwanted double
1115 // evaluation of arguments.
1116 #ifdef max
1117 #undef max
1118 #endif
1120 #ifdef min
1121 #undef min
1122 #endif
1124 #define max(a,b) Do_not_use_max_use_MAX2_instead
1125 #define min(a,b) Do_not_use_min_use_MIN2_instead
1127 // It is necessary to use templates here. Having normal overloaded
1128 // functions does not work because it is necessary to provide both 32-
1129 // and 64-bit overloaded functions, which does not work, and having
1130 // explicitly-typed versions of these routines (i.e., MAX2I, MAX2L)
1131 // will be even more error-prone than macros.
1132 template<class T> inline T MAX2(T a, T b) { return (a > b) ? a : b; }
1133 template<class T> inline T MIN2(T a, T b) { return (a < b) ? a : b; }
1134 template<class T> inline T MAX3(T a, T b, T c) { return MAX2(MAX2(a, b), c); }
1135 template<class T> inline T MIN3(T a, T b, T c) { return MIN2(MIN2(a, b), c); }
1136 template<class T> inline T MAX4(T a, T b, T c, T d) { return MAX2(MAX3(a, b, c), d); }
1137 template<class T> inline T MIN4(T a, T b, T c, T d) { return MIN2(MIN3(a, b, c), d); }
1139 template<class T> inline T ABS(T x) { return (x > 0) ? x : -x; }
1141 // true if x is a power of 2, false otherwise
1142 inline bool is_power_of_2(intptr_t x) {
1143 return ((x != NoBits) && (mask_bits(x, x - 1) == NoBits));
1144 }
1146 // long version of is_power_of_2
1147 inline bool is_power_of_2_long(jlong x) {
1148 return ((x != NoLongBits) && (mask_long_bits(x, x - 1) == NoLongBits));
1149 }
1151 //* largest i such that 2^i <= x
1152 // A negative value of 'x' will return '31'
1153 inline int log2_intptr(uintptr_t x) {
1154 int i = -1;
1155 uintptr_t p = 1;
1156 while (p != 0 && p <= x) {
1157 // p = 2^(i+1) && p <= x (i.e., 2^(i+1) <= x)
1158 i++; p *= 2;
1159 }
1160 // p = 2^(i+1) && x < p (i.e., 2^i <= x < 2^(i+1))
1161 // (if p = 0 then overflow occurred and i = 31)
1162 return i;
1163 }
1165 //* largest i such that 2^i <= x
1166 inline int log2_long(julong x) {
1167 int i = -1;
1168 julong p = 1;
1169 while (p != 0 && p <= x) {
1170 // p = 2^(i+1) && p <= x (i.e., 2^(i+1) <= x)
1171 i++; p *= 2;
1172 }
1173 // p = 2^(i+1) && x < p (i.e., 2^i <= x < 2^(i+1))
1174 // (if p = 0 then overflow occurred and i = 63)
1175 return i;
1176 }
1178 inline int log2_intptr(intptr_t x) {
1179 return log2_intptr((uintptr_t)x);
1180 }
1182 inline int log2_int(int x) {
1183 return log2_intptr((uintptr_t)x);
1184 }
1186 inline int log2_jint(jint x) {
1187 return log2_intptr((uintptr_t)x);
1188 }
1190 inline int log2_uint(uint x) {
1191 return log2_intptr((uintptr_t)x);
1192 }
1194 // A negative value of 'x' will return '63'
1195 inline int log2_jlong(jlong x) {
1196 return log2_long((julong)x);
1197 }
1199 //* the argument must be exactly a power of 2
1200 inline int exact_log2(intptr_t x) {
1201 #ifdef ASSERT
1202 if (!is_power_of_2(x)) basic_fatal("x must be a power of 2");
1203 #endif
1204 return log2_intptr(x);
1205 }
1207 //* the argument must be exactly a power of 2
1208 inline int exact_log2_long(jlong x) {
1209 #ifdef ASSERT
1210 if (!is_power_of_2_long(x)) basic_fatal("x must be a power of 2");
1211 #endif
1212 return log2_long(x);
1213 }
1216 // returns integer round-up to the nearest multiple of s (s must be a power of two)
1217 inline intptr_t round_to(intptr_t x, uintx s) {
1218 #ifdef ASSERT
1219 if (!is_power_of_2(s)) basic_fatal("s must be a power of 2");
1220 #endif
1221 const uintx m = s - 1;
1222 return mask_bits(x + m, ~m);
1223 }
1225 // returns integer round-down to the nearest multiple of s (s must be a power of two)
1226 inline intptr_t round_down(intptr_t x, uintx s) {
1227 #ifdef ASSERT
1228 if (!is_power_of_2(s)) basic_fatal("s must be a power of 2");
1229 #endif
1230 const uintx m = s - 1;
1231 return mask_bits(x, ~m);
1232 }
1235 inline bool is_odd (intx x) { return x & 1; }
1236 inline bool is_even(intx x) { return !is_odd(x); }
1238 // abs methods which cannot overflow and so are well-defined across
1239 // the entire domain of integer types.
1240 static inline unsigned int uabs(unsigned int n) {
1241 union {
1242 unsigned int result;
1243 int value;
1244 };
1245 result = n;
1246 if (value < 0) result = 0-result;
1247 return result;
1248 }
1249 static inline julong uabs(julong n) {
1250 union {
1251 julong result;
1252 jlong value;
1253 };
1254 result = n;
1255 if (value < 0) result = 0-result;
1256 return result;
1257 }
1258 static inline julong uabs(jlong n) { return uabs((julong)n); }
1259 static inline unsigned int uabs(int n) { return uabs((unsigned int)n); }
1261 // "to" should be greater than "from."
1262 inline intx byte_size(void* from, void* to) {
1263 return (address)to - (address)from;
1264 }
1266 //----------------------------------------------------------------------------------------------------
1267 // Avoid non-portable casts with these routines (DEPRECATED)
1269 // NOTE: USE Bytes class INSTEAD WHERE POSSIBLE
1270 // Bytes is optimized machine-specifically and may be much faster then the portable routines below.
1272 // Given sequence of four bytes, build into a 32-bit word
1273 // following the conventions used in class files.
1274 // On the 386, this could be realized with a simple address cast.
1275 //
1277 // This routine takes eight bytes:
1278 inline u8 build_u8_from( u1 c1, u1 c2, u1 c3, u1 c4, u1 c5, u1 c6, u1 c7, u1 c8 ) {
1279 return (( u8(c1) << 56 ) & ( u8(0xff) << 56 ))
1280 | (( u8(c2) << 48 ) & ( u8(0xff) << 48 ))
1281 | (( u8(c3) << 40 ) & ( u8(0xff) << 40 ))
1282 | (( u8(c4) << 32 ) & ( u8(0xff) << 32 ))
1283 | (( u8(c5) << 24 ) & ( u8(0xff) << 24 ))
1284 | (( u8(c6) << 16 ) & ( u8(0xff) << 16 ))
1285 | (( u8(c7) << 8 ) & ( u8(0xff) << 8 ))
1286 | (( u8(c8) << 0 ) & ( u8(0xff) << 0 ));
1287 }
1289 // This routine takes four bytes:
1290 inline u4 build_u4_from( u1 c1, u1 c2, u1 c3, u1 c4 ) {
1291 return (( u4(c1) << 24 ) & 0xff000000)
1292 | (( u4(c2) << 16 ) & 0x00ff0000)
1293 | (( u4(c3) << 8 ) & 0x0000ff00)
1294 | (( u4(c4) << 0 ) & 0x000000ff);
1295 }
1297 // And this one works if the four bytes are contiguous in memory:
1298 inline u4 build_u4_from( u1* p ) {
1299 return build_u4_from( p[0], p[1], p[2], p[3] );
1300 }
1302 // Ditto for two-byte ints:
1303 inline u2 build_u2_from( u1 c1, u1 c2 ) {
1304 return u2((( u2(c1) << 8 ) & 0xff00)
1305 | (( u2(c2) << 0 ) & 0x00ff));
1306 }
1308 // And this one works if the two bytes are contiguous in memory:
1309 inline u2 build_u2_from( u1* p ) {
1310 return build_u2_from( p[0], p[1] );
1311 }
1313 // Ditto for floats:
1314 inline jfloat build_float_from( u1 c1, u1 c2, u1 c3, u1 c4 ) {
1315 u4 u = build_u4_from( c1, c2, c3, c4 );
1316 return *(jfloat*)&u;
1317 }
1319 inline jfloat build_float_from( u1* p ) {
1320 u4 u = build_u4_from( p );
1321 return *(jfloat*)&u;
1322 }
1325 // now (64-bit) longs
1327 inline jlong build_long_from( u1 c1, u1 c2, u1 c3, u1 c4, u1 c5, u1 c6, u1 c7, u1 c8 ) {
1328 return (( jlong(c1) << 56 ) & ( jlong(0xff) << 56 ))
1329 | (( jlong(c2) << 48 ) & ( jlong(0xff) << 48 ))
1330 | (( jlong(c3) << 40 ) & ( jlong(0xff) << 40 ))
1331 | (( jlong(c4) << 32 ) & ( jlong(0xff) << 32 ))
1332 | (( jlong(c5) << 24 ) & ( jlong(0xff) << 24 ))
1333 | (( jlong(c6) << 16 ) & ( jlong(0xff) << 16 ))
1334 | (( jlong(c7) << 8 ) & ( jlong(0xff) << 8 ))
1335 | (( jlong(c8) << 0 ) & ( jlong(0xff) << 0 ));
1336 }
1338 inline jlong build_long_from( u1* p ) {
1339 return build_long_from( p[0], p[1], p[2], p[3], p[4], p[5], p[6], p[7] );
1340 }
1343 // Doubles, too!
1344 inline jdouble build_double_from( u1 c1, u1 c2, u1 c3, u1 c4, u1 c5, u1 c6, u1 c7, u1 c8 ) {
1345 jlong u = build_long_from( c1, c2, c3, c4, c5, c6, c7, c8 );
1346 return *(jdouble*)&u;
1347 }
1349 inline jdouble build_double_from( u1* p ) {
1350 jlong u = build_long_from( p );
1351 return *(jdouble*)&u;
1352 }
1355 // Portable routines to go the other way:
1357 inline void explode_short_to( u2 x, u1& c1, u1& c2 ) {
1358 c1 = u1(x >> 8);
1359 c2 = u1(x);
1360 }
1362 inline void explode_short_to( u2 x, u1* p ) {
1363 explode_short_to( x, p[0], p[1]);
1364 }
1366 inline void explode_int_to( u4 x, u1& c1, u1& c2, u1& c3, u1& c4 ) {
1367 c1 = u1(x >> 24);
1368 c2 = u1(x >> 16);
1369 c3 = u1(x >> 8);
1370 c4 = u1(x);
1371 }
1373 inline void explode_int_to( u4 x, u1* p ) {
1374 explode_int_to( x, p[0], p[1], p[2], p[3]);
1375 }
1378 // Pack and extract shorts to/from ints:
1380 inline int extract_low_short_from_int(jint x) {
1381 return x & 0xffff;
1382 }
1384 inline int extract_high_short_from_int(jint x) {
1385 return (x >> 16) & 0xffff;
1386 }
1388 inline int build_int_from_shorts( jushort low, jushort high ) {
1389 return ((int)((unsigned int)high << 16) | (unsigned int)low);
1390 }
1392 // Convert pointer to intptr_t, for use in printing pointers.
1393 inline intptr_t p2i(const void * p) {
1394 return (intptr_t) p;
1395 }
1397 // Printf-style formatters for fixed- and variable-width types as pointers and
1398 // integers. These are derived from the definitions in inttypes.h. If the platform
1399 // doesn't provide appropriate definitions, they should be provided in
1400 // the compiler-specific definitions file (e.g., globalDefinitions_gcc.hpp)
1402 #define BOOL_TO_STR(_b_) ((_b_) ? "true" : "false")
1404 // Format 32-bit quantities.
1405 #define INT32_FORMAT "%" PRId32
1406 #define UINT32_FORMAT "%" PRIu32
1407 #define INT32_FORMAT_W(width) "%" #width PRId32
1408 #define UINT32_FORMAT_W(width) "%" #width PRIu32
1410 #define PTR32_FORMAT "0x%08" PRIx32
1412 // Format 64-bit quantities.
1413 #define INT64_FORMAT "%" PRId64
1414 #define UINT64_FORMAT "%" PRIu64
1415 #define UINT64_FORMAT_X "%" PRIx64
1416 #define INT64_FORMAT_W(width) "%" #width PRId64
1417 #define UINT64_FORMAT_W(width) "%" #width PRIu64
1419 #define PTR64_FORMAT "0x%016" PRIx64
1421 // Format jlong, if necessary
1422 #ifndef JLONG_FORMAT
1423 #define JLONG_FORMAT INT64_FORMAT
1424 #endif
1425 #ifndef JULONG_FORMAT
1426 #define JULONG_FORMAT UINT64_FORMAT
1427 #endif
1429 // Format pointers which change size between 32- and 64-bit.
1430 #ifdef _LP64
1431 #define INTPTR_FORMAT "0x%016" PRIxPTR
1432 #define PTR_FORMAT "0x%016" PRIxPTR
1433 #else // !_LP64
1434 #define INTPTR_FORMAT "0x%08" PRIxPTR
1435 #define PTR_FORMAT "0x%08" PRIxPTR
1436 #endif // _LP64
1438 #define INTPTR_FORMAT_W(width) "%" #width PRIxPTR
1440 #define SSIZE_FORMAT "%" PRIdPTR
1441 #define SIZE_FORMAT "%" PRIuPTR
1442 #define SIZE_FORMAT_HEX "0x%" PRIxPTR
1443 #define SSIZE_FORMAT_W(width) "%" #width PRIdPTR
1444 #define SIZE_FORMAT_W(width) "%" #width PRIuPTR
1445 #define SIZE_FORMAT_HEX_W(width) "0x%" #width PRIxPTR
1447 #define INTX_FORMAT "%" PRIdPTR
1448 #define UINTX_FORMAT "%" PRIuPTR
1449 #define INTX_FORMAT_W(width) "%" #width PRIdPTR
1450 #define UINTX_FORMAT_W(width) "%" #width PRIuPTR
1453 // Enable zap-a-lot if in debug version.
1455 # ifdef ASSERT
1456 # ifdef COMPILER2
1457 # define ENABLE_ZAP_DEAD_LOCALS
1458 #endif /* COMPILER2 */
1459 # endif /* ASSERT */
1461 #define ARRAY_SIZE(array) (sizeof(array)/sizeof((array)[0]))
1463 //----------------------------------------------------------------------------------------------------
1464 // Sum and product which can never overflow: they wrap, just like the
1465 // Java operations. Note that we don't intend these to be used for
1466 // general-purpose arithmetic: their purpose is to emulate Java
1467 // operations.
1469 // The goal of this code to avoid undefined or implementation-defined
1470 // behaviour. The use of an lvalue to reference cast is explicitly
1471 // permitted by Lvalues and rvalues [basic.lval]. [Section 3.10 Para
1472 // 15 in C++03]
1473 #define JAVA_INTEGER_OP(OP, NAME, TYPE, UNSIGNED_TYPE) \
1474 inline TYPE NAME (TYPE in1, TYPE in2) { \
1475 UNSIGNED_TYPE ures = static_cast<UNSIGNED_TYPE>(in1); \
1476 ures OP ## = static_cast<UNSIGNED_TYPE>(in2); \
1477 return reinterpret_cast<TYPE&>(ures); \
1478 }
1480 JAVA_INTEGER_OP(+, java_add, jint, juint)
1481 JAVA_INTEGER_OP(-, java_subtract, jint, juint)
1482 JAVA_INTEGER_OP(*, java_multiply, jint, juint)
1483 JAVA_INTEGER_OP(+, java_add, jlong, julong)
1484 JAVA_INTEGER_OP(-, java_subtract, jlong, julong)
1485 JAVA_INTEGER_OP(*, java_multiply, jlong, julong)
1487 #undef JAVA_INTEGER_OP
1489 // Dereference vptr
1490 // All C++ compilers that we know of have the vtbl pointer in the first
1491 // word. If there are exceptions, this function needs to be made compiler
1492 // specific.
1493 static inline void* dereference_vptr(const void* addr) {
1494 return *(void**)addr;
1495 }
1497 #ifndef PRODUCT
1499 // For unit testing only
1500 class GlobalDefinitions {
1501 public:
1502 static void test_globals();
1503 static void test_proper_unit();
1504 };
1506 #endif // PRODUCT
1508 #endif // SHARE_VM_UTILITIES_GLOBALDEFINITIONS_HPP