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