73 assert( 2 == sizeof( jshort), "wrong size for basic type");
74 assert( 4 == sizeof( juint), "wrong size for basic type");
75 assert( 4 == sizeof( jint), "wrong size for basic type");
76 assert( 1 == sizeof( jboolean), "wrong size for basic type");
77 assert( 8 == sizeof( jlong), "wrong size for basic type");
78 assert( 4 == sizeof( jfloat), "wrong size for basic type");
79 assert( 8 == sizeof( jdouble), "wrong size for basic type");
80 assert( 1 == sizeof( u1), "wrong size for basic type");
81 assert( 2 == sizeof( u2), "wrong size for basic type");
82 assert( 4 == sizeof( u4), "wrong size for basic type");
83 assert(wordSize == BytesPerWord, "should be the same since they're used interchangeably");
84 assert(wordSize == HeapWordSize, "should be the same since they're also used interchangeably");
85
86 int num_type_chars = 0;
87 for (int i = 0; i < 99; i++) {
88 if (type2char((BasicType)i) != 0) {
89 assert(char2type(type2char((BasicType)i)) == i, "proper inverses");
90 num_type_chars++;
91 }
92 }
93 assert(num_type_chars == 11, "must have tested the right number of mappings");
94 assert(char2type(0) == T_ILLEGAL, "correct illegality");
95
96 {
97 for (int i = T_BOOLEAN; i <= T_CONFLICT; i++) {
98 BasicType vt = (BasicType)i;
99 BasicType ft = type2field[vt];
100 switch (vt) {
101 // the following types might plausibly show up in memory layouts:
102 case T_BOOLEAN:
103 case T_BYTE:
104 case T_CHAR:
105 case T_SHORT:
106 case T_INT:
107 case T_FLOAT:
108 case T_DOUBLE:
109 case T_LONG:
110 case T_OBJECT:
111 case T_ADDRESS: // random raw pointer
112 case T_METADATA: // metadata pointer
113 case T_NARROWOOP: // compressed pointer
114 case T_NARROWKLASS: // compressed klass pointer
115 case T_CONFLICT: // might as well support a bottom type
116 case T_VOID: // padding or other unaddressed word
117 // layout type must map to itself
118 assert(vt == ft, "");
119 break;
120 default:
121 // non-layout type must map to a (different) layout type
122 assert(vt != ft, "");
123 assert(ft == type2field[ft], "");
124 }
125 // every type must map to same-sized layout type:
126 assert(type2size[vt] == type2size[ft], "");
127 }
128 }
129 // These are assumed, e.g., when filling HeapWords with juints.
130 assert(is_power_of_2(sizeof(juint)), "juint must be power of 2");
156 os::java_to_os_priority[10] = JavaPriority10_To_OSPriority;
157
158 // Set the size of basic types here (after argument parsing but before
159 // stub generation).
160 if (UseCompressedOops) {
161 // Size info for oops within java objects is fixed
162 heapOopSize = jintSize;
163 LogBytesPerHeapOop = LogBytesPerInt;
164 LogBitsPerHeapOop = LogBitsPerInt;
165 BytesPerHeapOop = BytesPerInt;
166 BitsPerHeapOop = BitsPerInt;
167 } else {
168 heapOopSize = oopSize;
169 LogBytesPerHeapOop = LogBytesPerWord;
170 LogBitsPerHeapOop = LogBitsPerWord;
171 BytesPerHeapOop = BytesPerWord;
172 BitsPerHeapOop = BitsPerWord;
173 }
174 _type2aelembytes[T_OBJECT] = heapOopSize;
175 _type2aelembytes[T_ARRAY] = heapOopSize;
176 }
177
178
179 // Map BasicType to signature character
180 char type2char_tab[T_CONFLICT+1]={ 0, 0, 0, 0, 'Z', 'C', 'F', 'D', 'B', 'S', 'I', 'J', 'L', '[', 'V', 0, 0, 0, 0, 0};
181
182 // Map BasicType to Java type name
183 const char* type2name_tab[T_CONFLICT+1] = {
184 NULL, NULL, NULL, NULL,
185 "boolean",
186 "char",
187 "float",
188 "double",
189 "byte",
190 "short",
191 "int",
192 "long",
193 "object",
194 "array",
195 "void",
196 "*address*",
197 "*narrowoop*",
198 "*metadata*",
199 "*narrowklass*",
200 "*conflict*"
201 };
202
203
204 BasicType name2type(const char* name) {
205 for (int i = T_BOOLEAN; i <= T_VOID; i++) {
206 BasicType t = (BasicType)i;
207 if (type2name_tab[t] != NULL && 0 == strcmp(type2name_tab[t], name))
208 return t;
209 }
210 return T_ILLEGAL;
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, 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_METADATA, // T_METADATA = 17,
235 T_NARROWKLASS, // T_NARROWKLASS = 18,
236 T_CONFLICT // T_CONFLICT = 19,
237 };
238
239
240 BasicType type2wfield[T_CONFLICT+1] = {
241 (BasicType)0, // 0,
242 (BasicType)0, // 1,
243 (BasicType)0, // 2,
244 (BasicType)0, // 3,
245 T_INT, // T_BOOLEAN = 4,
246 T_INT, // T_CHAR = 5,
247 T_FLOAT, // T_FLOAT = 6,
248 T_DOUBLE, // T_DOUBLE = 7,
249 T_INT, // T_BYTE = 8,
250 T_INT, // T_SHORT = 9,
251 T_INT, // T_INT = 10,
252 T_LONG, // T_LONG = 11,
253 T_OBJECT, // T_OBJECT = 12,
254 T_OBJECT, // T_ARRAY = 13,
255 T_VOID, // T_VOID = 14,
256 T_ADDRESS, // T_ADDRESS = 15,
257 T_NARROWOOP, // T_NARROWOOP = 16,
258 T_METADATA, // T_METADATA = 17,
259 T_NARROWKLASS, // T_NARROWKLASS = 18,
260 T_CONFLICT // T_CONFLICT = 19,
261 };
262
263
264 int _type2aelembytes[T_CONFLICT+1] = {
265 0, // 0
266 0, // 1
267 0, // 2
268 0, // 3
269 T_BOOLEAN_aelem_bytes, // T_BOOLEAN = 4,
270 T_CHAR_aelem_bytes, // T_CHAR = 5,
271 T_FLOAT_aelem_bytes, // T_FLOAT = 6,
272 T_DOUBLE_aelem_bytes, // T_DOUBLE = 7,
273 T_BYTE_aelem_bytes, // T_BYTE = 8,
274 T_SHORT_aelem_bytes, // T_SHORT = 9,
275 T_INT_aelem_bytes, // T_INT = 10,
276 T_LONG_aelem_bytes, // T_LONG = 11,
277 T_OBJECT_aelem_bytes, // T_OBJECT = 12,
278 T_ARRAY_aelem_bytes, // T_ARRAY = 13,
279 0, // T_VOID = 14,
280 T_OBJECT_aelem_bytes, // T_ADDRESS = 15,
281 T_NARROWOOP_aelem_bytes, // T_NARROWOOP= 16,
282 T_OBJECT_aelem_bytes, // T_METADATA = 17,
283 T_NARROWKLASS_aelem_bytes, // T_NARROWKLASS= 18,
284 0 // T_CONFLICT = 19,
285 };
286
287 #ifdef ASSERT
288 int type2aelembytes(BasicType t, bool allow_address) {
289 assert(allow_address || t != T_ADDRESS, " ");
290 return _type2aelembytes[t];
291 }
292 #endif
293
294 // Support for 64-bit integer arithmetic
295
296 // The following code is mostly taken from JVM typedefs_md.h and system_md.c
297
298 static const jlong high_bit = (jlong)1 << (jlong)63;
299 static const jlong other_bits = ~high_bit;
300
301 jlong float2long(jfloat f) {
302 jlong tmp = (jlong) f;
303 if (tmp != high_bit) {
304 return tmp;
|
73 assert( 2 == sizeof( jshort), "wrong size for basic type");
74 assert( 4 == sizeof( juint), "wrong size for basic type");
75 assert( 4 == sizeof( jint), "wrong size for basic type");
76 assert( 1 == sizeof( jboolean), "wrong size for basic type");
77 assert( 8 == sizeof( jlong), "wrong size for basic type");
78 assert( 4 == sizeof( jfloat), "wrong size for basic type");
79 assert( 8 == sizeof( jdouble), "wrong size for basic type");
80 assert( 1 == sizeof( u1), "wrong size for basic type");
81 assert( 2 == sizeof( u2), "wrong size for basic type");
82 assert( 4 == sizeof( u4), "wrong size for basic type");
83 assert(wordSize == BytesPerWord, "should be the same since they're used interchangeably");
84 assert(wordSize == HeapWordSize, "should be the same since they're also used interchangeably");
85
86 int num_type_chars = 0;
87 for (int i = 0; i < 99; i++) {
88 if (type2char((BasicType)i) != 0) {
89 assert(char2type(type2char((BasicType)i)) == i, "proper inverses");
90 num_type_chars++;
91 }
92 }
93 assert(num_type_chars == 12, "must have tested the right number of mappings");
94 assert(char2type(0) == T_ILLEGAL, "correct illegality");
95
96 {
97 for (int i = T_BOOLEAN; i <= T_CONFLICT; i++) {
98 BasicType vt = (BasicType)i;
99 BasicType ft = type2field[vt];
100 switch (vt) {
101 // the following types might plausibly show up in memory layouts:
102 case T_BOOLEAN:
103 case T_BYTE:
104 case T_CHAR:
105 case T_SHORT:
106 case T_INT:
107 case T_FLOAT:
108 case T_DOUBLE:
109 case T_LONG:
110 case T_OBJECT:
111 case T_VALUETYPE:
112 case T_ADDRESS: // random raw pointer
113 case T_METADATA: // metadata pointer
114 case T_NARROWOOP: // compressed pointer
115 case T_NARROWKLASS: // compressed klass 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");
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 _type2aelembytes[T_VALUETYPE] = heapOopSize;
178 }
179
180
181 // Map BasicType to signature character
182 char type2char_tab[T_CONFLICT+1]={ 0, 0, 0, 0, 'Z', 'C', 'F', 'D', 'B', 'S', 'I', 'J', 'L', '[', 'Q', 'V', 0, 0, 0, 0, 0};
183
184 // Map BasicType to Java type name
185 const char* type2name_tab[T_CONFLICT+1] = {
186 NULL, NULL, NULL, NULL,
187 "boolean",
188 "char",
189 "float",
190 "double",
191 "byte",
192 "short",
193 "int",
194 "long",
195 "object",
196 "array",
197 "valuetype",
198 "void",
199 "*address*",
200 "*narrowoop*",
201 "*metadata*",
202 "*narrowklass*",
203 "*conflict*"
204 };
205
206
207 BasicType name2type(const char* name) {
208 for (int i = T_BOOLEAN; i <= T_VOID; i++) {
209 BasicType t = (BasicType)i;
210 if (type2name_tab[t] != NULL && 0 == strcmp(type2name_tab[t], name))
211 return t;
212 }
213 return T_ILLEGAL;
214 }
215
216 // Map BasicType to size in words
217 int type2size[T_CONFLICT+1]={ -1, 0, 0, 0, 1, 1, 1, 2, 1, 1, 1, 2, 1, 1, 1, 0, 1, 1, 1, 1, -1};
218
219 BasicType type2field[T_CONFLICT+1] = {
220 (BasicType)0, // 0,
221 (BasicType)0, // 1,
222 (BasicType)0, // 2,
223 (BasicType)0, // 3,
224 T_BOOLEAN, // T_BOOLEAN = 4,
225 T_CHAR, // T_CHAR = 5,
226 T_FLOAT, // T_FLOAT = 6,
227 T_DOUBLE, // T_DOUBLE = 7,
228 T_BYTE, // T_BYTE = 8,
229 T_SHORT, // T_SHORT = 9,
230 T_INT, // T_INT = 10,
231 T_LONG, // T_LONG = 11,
232 T_OBJECT, // T_OBJECT = 12,
233 T_OBJECT, // T_ARRAY = 13,
234 T_VALUETYPE, // T_VALUETYPE = 14,
235 T_VOID, // T_VOID = 15,
236 T_ADDRESS, // T_ADDRESS = 16,
237 T_NARROWOOP, // T_NARROWOOP= 17,
238 T_METADATA, // T_METADATA = 18,
239 T_NARROWKLASS, // T_NARROWKLASS = 19,
240 T_CONFLICT // T_CONFLICT = 20
241 };
242
243
244 BasicType type2wfield[T_CONFLICT+1] = {
245 (BasicType)0, // 0,
246 (BasicType)0, // 1,
247 (BasicType)0, // 2,
248 (BasicType)0, // 3,
249 T_INT, // T_BOOLEAN = 4,
250 T_INT, // T_CHAR = 5,
251 T_FLOAT, // T_FLOAT = 6,
252 T_DOUBLE, // T_DOUBLE = 7,
253 T_INT, // T_BYTE = 8,
254 T_INT, // T_SHORT = 9,
255 T_INT, // T_INT = 10,
256 T_LONG, // T_LONG = 11,
257 T_OBJECT, // T_OBJECT = 12,
258 T_OBJECT, // T_ARRAY = 13,
259 T_OBJECT, // T_VALUETYPE = 14,
260 T_VOID, // T_VOID = 15,
261 T_ADDRESS, // T_ADDRESS = 16,
262 T_NARROWOOP, // T_NARROWOOP = 17,
263 T_METADATA, // T_METADATA = 18,
264 T_NARROWKLASS, // T_NARROWKLASS = 19,
265 T_CONFLICT // T_CONFLICT = 20
266 };
267
268
269 int _type2aelembytes[T_CONFLICT+1] = {
270 0, // 0
271 0, // 1
272 0, // 2
273 0, // 3
274 T_BOOLEAN_aelem_bytes, // T_BOOLEAN = 4,
275 T_CHAR_aelem_bytes, // T_CHAR = 5,
276 T_FLOAT_aelem_bytes, // T_FLOAT = 6,
277 T_DOUBLE_aelem_bytes, // T_DOUBLE = 7,
278 T_BYTE_aelem_bytes, // T_BYTE = 8,
279 T_SHORT_aelem_bytes, // T_SHORT = 9,
280 T_INT_aelem_bytes, // T_INT = 10,
281 T_LONG_aelem_bytes, // T_LONG = 11,
282 T_OBJECT_aelem_bytes, // T_OBJECT = 12,
283 T_ARRAY_aelem_bytes, // T_ARRAY = 13,
284 T_VALUETYPE_aelem_bytes, // T_VALUETYPE = 14,
285 0, // T_VOID = 15,
286 T_OBJECT_aelem_bytes, // T_ADDRESS = 16,
287 T_NARROWOOP_aelem_bytes, // T_NARROWOOP= 17,
288 T_OBJECT_aelem_bytes, // T_METADATA = 18,
289 T_NARROWKLASS_aelem_bytes, // T_NARROWKLASS= 19,
290 0 // T_CONFLICT = 20
291 };
292
293 #ifdef ASSERT
294 int type2aelembytes(BasicType t, bool allow_address) {
295 assert(allow_address || t != T_ADDRESS, " ");
296 return _type2aelembytes[t];
297 }
298 #endif
299
300 // Support for 64-bit integer arithmetic
301
302 // The following code is mostly taken from JVM typedefs_md.h and system_md.c
303
304 static const jlong high_bit = (jlong)1 << (jlong)63;
305 static const jlong other_bits = ~high_bit;
306
307 jlong float2long(jfloat f) {
308 jlong tmp = (jlong) f;
309 if (tmp != high_bit) {
310 return tmp;
|