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