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