1 /*
2 * Copyright (c) 1997, 2010, 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 #include "precompiled.hpp"
26 #include "runtime/os.hpp"
27 #include "utilities/globalDefinitions.hpp"
28 #include "utilities/top.hpp"
29
30 // Basic error support
31
32 // Info for oops within a java object. Defaults are zero so
33 // things will break badly if incorrectly initialized.
34 int heapOopSize = 0;
35 int LogBytesPerHeapOop = 0;
36 int LogBitsPerHeapOop = 0;
37 int BytesPerHeapOop = 0;
38 int BitsPerHeapOop = 0;
39
40 // Object alignment, in units of HeapWords.
41 // Defaults are -1 so things will break badly if incorrectly initialized.
42 int MinObjAlignment = -1;
43 int MinObjAlignmentInBytes = -1;
44 int MinObjAlignmentInBytesMask = 0;
45
46 int LogMinObjAlignment = -1;
47 int LogMinObjAlignmentInBytes = -1;
48
49 // Oop encoding heap max
50 uint64_t OopEncodingHeapMax = 0;
51
52 void basic_fatal(const char* msg) {
53 fatal(msg);
54 }
55
56 // Something to help porters sleep at night
57
58 void basic_types_init() {
59 #ifdef ASSERT
60 #ifdef _LP64
61 assert(min_intx == (intx)CONST64(0x8000000000000000), "correct constant");
62 assert(max_intx == CONST64(0x7FFFFFFFFFFFFFFF), "correct constant");
63 assert(max_uintx == CONST64(0xFFFFFFFFFFFFFFFF), "correct constant");
64 assert( 8 == sizeof( intx), "wrong size for basic type");
65 assert( 8 == sizeof( jobject), "wrong size for basic type");
66 #else
67 assert(min_intx == (intx)0x80000000, "correct constant");
68 assert(max_intx == 0x7FFFFFFF, "correct constant");
69 assert(max_uintx == 0xFFFFFFFF, "correct constant");
70 assert( 4 == sizeof( intx), "wrong size for basic type");
71 assert( 4 == sizeof( jobject), "wrong size for basic type");
72 #endif
73 assert( (~max_juint) == 0, "max_juint has all its bits");
74 assert( (~max_uintx) == 0, "max_uintx has all its bits");
75 assert( (~max_julong) == 0, "max_julong has all its bits");
76 assert( 1 == sizeof( jbyte), "wrong size for basic type");
77 assert( 2 == sizeof( jchar), "wrong size for basic type");
78 assert( 2 == sizeof( jshort), "wrong size for basic type");
79 assert( 4 == sizeof( juint), "wrong size for basic type");
80 assert( 4 == sizeof( jint), "wrong size for basic type");
81 assert( 1 == sizeof( jboolean), "wrong size for basic type");
82 assert( 8 == sizeof( jlong), "wrong size for basic type");
83 assert( 4 == sizeof( jfloat), "wrong size for basic type");
84 assert( 8 == sizeof( jdouble), "wrong size for basic type");
85 assert( 1 == sizeof( u1), "wrong size for basic type");
86 assert( 2 == sizeof( u2), "wrong size for basic type");
87 assert( 4 == sizeof( u4), "wrong size for basic type");
88
89 int num_type_chars = 0;
90 for (int i = 0; i < 99; i++) {
91 if (type2char((BasicType)i) != 0) {
92 assert(char2type(type2char((BasicType)i)) == i, "proper inverses");
93 num_type_chars++;
94 }
95 }
96 assert(num_type_chars == 11, "must have tested the right number of mappings");
97 assert(char2type(0) == T_ILLEGAL, "correct illegality");
98
99 {
100 for (int i = T_BOOLEAN; i <= T_CONFLICT; i++) {
101 BasicType vt = (BasicType)i;
102 BasicType ft = type2field[vt];
103 switch (vt) {
104 // the following types might plausibly show up in memory layouts:
105 case T_BOOLEAN:
106 case T_BYTE:
107 case T_CHAR:
108 case T_SHORT:
109 case T_INT:
110 case T_FLOAT:
111 case T_DOUBLE:
112 case T_LONG:
113 case T_OBJECT:
114 case T_ADDRESS: // random raw pointer
115 case T_NARROWOOP: // compressed pointer
116 case T_CONFLICT: // might as well support a bottom type
117 case T_VOID: // padding or other unaddressed word
118 // layout type must map to itself
119 assert(vt == ft, "");
120 break;
121 default:
122 // non-layout type must map to a (different) layout type
123 assert(vt != ft, "");
124 assert(ft == type2field[ft], "");
125 }
126 // every type must map to same-sized layout type:
127 assert(type2size[vt] == type2size[ft], "");
128 }
129 }
130 // These are assumed, e.g., when filling HeapWords with juints.
131 assert(is_power_of_2(sizeof(juint)), "juint must be power of 2");
132 assert(is_power_of_2(HeapWordSize), "HeapWordSize must be power of 2");
133 assert((size_t)HeapWordSize >= sizeof(juint),
134 "HeapWord should be at least as large as juint");
135 assert(sizeof(NULL) == sizeof(char*), "NULL must be same size as pointer");
136 #endif
137
138 if( JavaPriority1_To_OSPriority != -1 )
139 os::java_to_os_priority[1] = JavaPriority1_To_OSPriority;
140 if( JavaPriority2_To_OSPriority != -1 )
141 os::java_to_os_priority[2] = JavaPriority2_To_OSPriority;
142 if( JavaPriority3_To_OSPriority != -1 )
143 os::java_to_os_priority[3] = JavaPriority3_To_OSPriority;
144 if( JavaPriority4_To_OSPriority != -1 )
145 os::java_to_os_priority[4] = JavaPriority4_To_OSPriority;
146 if( JavaPriority5_To_OSPriority != -1 )
147 os::java_to_os_priority[5] = JavaPriority5_To_OSPriority;
148 if( JavaPriority6_To_OSPriority != -1 )
149 os::java_to_os_priority[6] = JavaPriority6_To_OSPriority;
150 if( JavaPriority7_To_OSPriority != -1 )
151 os::java_to_os_priority[7] = JavaPriority7_To_OSPriority;
152 if( JavaPriority8_To_OSPriority != -1 )
153 os::java_to_os_priority[8] = JavaPriority8_To_OSPriority;
154 if( JavaPriority9_To_OSPriority != -1 )
155 os::java_to_os_priority[9] = JavaPriority9_To_OSPriority;
156 if(JavaPriority10_To_OSPriority != -1 )
157 os::java_to_os_priority[10] = JavaPriority10_To_OSPriority;
158
159 // Set the size of basic types here (after argument parsing but before
160 // stub generation).
161 if (UseCompressedOops) {
162 // Size info for oops within java objects is fixed
163 heapOopSize = jintSize;
164 LogBytesPerHeapOop = LogBytesPerInt;
165 LogBitsPerHeapOop = LogBitsPerInt;
166 BytesPerHeapOop = BytesPerInt;
167 BitsPerHeapOop = BitsPerInt;
168 } else {
169 heapOopSize = oopSize;
170 LogBytesPerHeapOop = LogBytesPerWord;
171 LogBitsPerHeapOop = LogBitsPerWord;
172 BytesPerHeapOop = BytesPerWord;
173 BitsPerHeapOop = BitsPerWord;
174 }
175 _type2aelembytes[T_OBJECT] = heapOopSize;
176 _type2aelembytes[T_ARRAY] = heapOopSize;
177 }
178
179
180 // Map BasicType to signature character
181 char type2char_tab[T_CONFLICT+1]={ 0, 0, 0, 0, 'Z', 'C', 'F', 'D', 'B', 'S', 'I', 'J', 'L', '[', 'V', 0, 0, 0};
182
183 // Map BasicType to Java type name
184 const char* type2name_tab[T_CONFLICT+1] = {
185 NULL, NULL, NULL, NULL,
186 "boolean",
187 "char",
188 "float",
189 "double",
190 "byte",
191 "short",
192 "int",
193 "long",
194 "object",
195 "array",
196 "void",
197 "*address*",
198 "*narrowoop*",
199 "*conflict*"
200 };
201
202
203 BasicType name2type(const char* name) {
204 for (int i = T_BOOLEAN; i <= T_VOID; i++) {
205 BasicType t = (BasicType)i;
206 if (type2name_tab[t] != NULL && 0 == strcmp(type2name_tab[t], name))
207 return t;
208 }
209 return T_ILLEGAL;
210 }
211
212
213 // Map BasicType to size in words
214 int type2size[T_CONFLICT+1]={ -1, 0, 0, 0, 1, 1, 1, 2, 1, 1, 1, 2, 1, 1, 0, 1, 1, -1};
215
216 BasicType type2field[T_CONFLICT+1] = {
217 (BasicType)0, // 0,
218 (BasicType)0, // 1,
219 (BasicType)0, // 2,
220 (BasicType)0, // 3,
221 T_BOOLEAN, // T_BOOLEAN = 4,
222 T_CHAR, // T_CHAR = 5,
223 T_FLOAT, // T_FLOAT = 6,
224 T_DOUBLE, // T_DOUBLE = 7,
225 T_BYTE, // T_BYTE = 8,
226 T_SHORT, // T_SHORT = 9,
227 T_INT, // T_INT = 10,
228 T_LONG, // T_LONG = 11,
229 T_OBJECT, // T_OBJECT = 12,
230 T_OBJECT, // T_ARRAY = 13,
231 T_VOID, // T_VOID = 14,
232 T_ADDRESS, // T_ADDRESS = 15,
233 T_NARROWOOP, // T_NARROWOOP= 16,
234 T_CONFLICT // T_CONFLICT = 17,
235 };
236
237
238 BasicType type2wfield[T_CONFLICT+1] = {
239 (BasicType)0, // 0,
240 (BasicType)0, // 1,
241 (BasicType)0, // 2,
242 (BasicType)0, // 3,
243 T_INT, // T_BOOLEAN = 4,
244 T_INT, // T_CHAR = 5,
245 T_FLOAT, // T_FLOAT = 6,
246 T_DOUBLE, // T_DOUBLE = 7,
247 T_INT, // T_BYTE = 8,
248 T_INT, // T_SHORT = 9,
249 T_INT, // T_INT = 10,
250 T_LONG, // T_LONG = 11,
251 T_OBJECT, // T_OBJECT = 12,
252 T_OBJECT, // T_ARRAY = 13,
253 T_VOID, // T_VOID = 14,
254 T_ADDRESS, // T_ADDRESS = 15,
255 T_NARROWOOP, // T_NARROWOOP = 16,
256 T_CONFLICT // T_CONFLICT = 17,
257 };
258
259
260 int _type2aelembytes[T_CONFLICT+1] = {
261 0, // 0
262 0, // 1
263 0, // 2
264 0, // 3
265 T_BOOLEAN_aelem_bytes, // T_BOOLEAN = 4,
266 T_CHAR_aelem_bytes, // T_CHAR = 5,
267 T_FLOAT_aelem_bytes, // T_FLOAT = 6,
268 T_DOUBLE_aelem_bytes, // T_DOUBLE = 7,
269 T_BYTE_aelem_bytes, // T_BYTE = 8,
270 T_SHORT_aelem_bytes, // T_SHORT = 9,
271 T_INT_aelem_bytes, // T_INT = 10,
272 T_LONG_aelem_bytes, // T_LONG = 11,
273 T_OBJECT_aelem_bytes, // T_OBJECT = 12,
274 T_ARRAY_aelem_bytes, // T_ARRAY = 13,
275 0, // T_VOID = 14,
276 T_OBJECT_aelem_bytes, // T_ADDRESS = 15,
277 T_NARROWOOP_aelem_bytes,// T_NARROWOOP= 16,
278 0 // T_CONFLICT = 17,
279 };
280
281 #ifdef ASSERT
282 int type2aelembytes(BasicType t, bool allow_address) {
283 assert(allow_address || t != T_ADDRESS, " ");
284 return _type2aelembytes[t];
285 }
286 #endif
287
288 // Support for 64-bit integer arithmetic
289
290 // The following code is mostly taken from JVM typedefs_md.h and system_md.c
291
292 static const jlong high_bit = (jlong)1 << (jlong)63;
293 static const jlong other_bits = ~high_bit;
294
295 jlong float2long(jfloat f) {
296 jlong tmp = (jlong) f;
297 if (tmp != high_bit) {
298 return tmp;
299 } else {
300 if (g_isnan((jdouble)f)) {
301 return 0;
302 }
303 if (f < 0) {
304 return high_bit;
305 } else {
306 return other_bits;
307 }
308 }
309 }
310
311
312 jlong double2long(jdouble f) {
313 jlong tmp = (jlong) f;
314 if (tmp != high_bit) {
315 return tmp;
316 } else {
317 if (g_isnan(f)) {
318 return 0;
319 }
320 if (f < 0) {
321 return high_bit;
322 } else {
323 return other_bits;
324 }
325 }
326 }
327
328 // least common multiple
329 size_t lcm(size_t a, size_t b) {
330 size_t cur, div, next;
331
332 cur = MAX2(a, b);
333 div = MIN2(a, b);
334
335 assert(div != 0, "lcm requires positive arguments");
336
337
338 while ((next = cur % div) != 0) {
339 cur = div; div = next;
340 }
341
342
343 julong result = julong(a) * b / div;
344 assert(result <= (size_t)max_uintx, "Integer overflow in lcm");
345
346 return size_t(result);
347 }