• file
• revisions
• annotate
• diff
• comparison
• raw

src/share/vm/utilities/globalDefinitions.cpp@a61af66fc99e (annotated)

src/share/vm/utilities/globalDefinitions.cpp

Sat, 01 Dec 2007 00:00:00 +0000

author

duke

date

Sat, 01 Dec 2007 00:00:00 +0000

changeset 435

a61af66fc99e

child 464

d5fc211aea19

permissions

-rw-r--r--

Initial load

duke@435	1	/*
duke@435	2	* Copyright 1997-2006 Sun Microsystems, Inc. All Rights Reserved.
duke@435	3	* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
duke@435	4	*
duke@435	5	* This code is free software; you can redistribute it and/or modify it
duke@435	6	* under the terms of the GNU General Public License version 2 only, as
duke@435	7	* published by the Free Software Foundation.
duke@435	8	*
duke@435	9	* This code is distributed in the hope that it will be useful, but WITHOUT
duke@435	10	* ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
duke@435	11	* FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
duke@435	12	* version 2 for more details (a copy is included in the LICENSE file that
duke@435	13	* accompanied this code).
duke@435	14	*
duke@435	15	* You should have received a copy of the GNU General Public License version
duke@435	16	* 2 along with this work; if not, write to the Free Software Foundation,
duke@435	17	* Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
duke@435	18	*
duke@435	19	* Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara,
duke@435	20	* CA 95054 USA or visit www.sun.com if you need additional information or
duke@435	21	* have any questions.
duke@435	22	*
duke@435	23	*/
duke@435	24
duke@435	25	# include "incls/_precompiled.incl"
duke@435	26	# include "incls/_globalDefinitions.cpp.incl"
duke@435	27
duke@435	28
duke@435	29	// Basic error support
duke@435	30
duke@435	31	void basic_fatal(const char* msg) {
duke@435	32	fatal(msg);
duke@435	33	}
duke@435	34
duke@435	35
duke@435	36	// Something to help porters sleep at night
duke@435	37
duke@435	38	void check_basic_types() {
duke@435	39	#ifdef ASSERT
duke@435	40	#ifdef _LP64
duke@435	41	assert(min_intx == (intx)CONST64(0x8000000000000000), "correct constant");
duke@435	42	assert(max_intx == CONST64(0x7FFFFFFFFFFFFFFF), "correct constant");
duke@435	43	assert(max_uintx == CONST64(0xFFFFFFFFFFFFFFFF), "correct constant");
duke@435	44	assert( 8 == sizeof( intx), "wrong size for basic type");
duke@435	45	assert( 8 == sizeof( jobject), "wrong size for basic type");
duke@435	46	#else
duke@435	47	assert(min_intx == (intx)0x80000000, "correct constant");
duke@435	48	assert(max_intx == 0x7FFFFFFF, "correct constant");
duke@435	49	assert(max_uintx == 0xFFFFFFFF, "correct constant");
duke@435	50	assert( 4 == sizeof( intx), "wrong size for basic type");
duke@435	51	assert( 4 == sizeof( jobject), "wrong size for basic type");
duke@435	52	#endif
duke@435	53	assert( (~max_juint) == 0, "max_juint has all its bits");
duke@435	54	assert( (~max_uintx) == 0, "max_uintx has all its bits");
duke@435	55	assert( (~max_julong) == 0, "max_julong has all its bits");
duke@435	56	assert( 1 == sizeof( jbyte), "wrong size for basic type");
duke@435	57	assert( 2 == sizeof( jchar), "wrong size for basic type");
duke@435	58	assert( 2 == sizeof( jshort), "wrong size for basic type");
duke@435	59	assert( 4 == sizeof( juint), "wrong size for basic type");
duke@435	60	assert( 4 == sizeof( jint), "wrong size for basic type");
duke@435	61	assert( 1 == sizeof( jboolean), "wrong size for basic type");
duke@435	62	assert( 8 == sizeof( jlong), "wrong size for basic type");
duke@435	63	assert( 4 == sizeof( jfloat), "wrong size for basic type");
duke@435	64	assert( 8 == sizeof( jdouble), "wrong size for basic type");
duke@435	65	assert( 1 == sizeof( u1), "wrong size for basic type");
duke@435	66	assert( 2 == sizeof( u2), "wrong size for basic type");
duke@435	67	assert( 4 == sizeof( u4), "wrong size for basic type");
duke@435	68
duke@435	69	int num_type_chars = 0;
duke@435	70	for (int i = 0; i < 99; i++) {
duke@435	71	if (type2char((BasicType)i) != 0) {
duke@435	72	assert(char2type(type2char((BasicType)i)) == i, "proper inverses");
duke@435	73	num_type_chars++;
duke@435	74	}
duke@435	75	}
duke@435	76	assert(num_type_chars == 11, "must have tested the right number of mappings");
duke@435	77	assert(char2type(0) == T_ILLEGAL, "correct illegality");
duke@435	78
duke@435	79	{
duke@435	80	for (int i = T_BOOLEAN; i <= T_CONFLICT; i++) {
duke@435	81	BasicType vt = (BasicType)i;
duke@435	82	BasicType ft = type2field[vt];
duke@435	83	switch (vt) {
duke@435	84	// the following types might plausibly show up in memory layouts:
duke@435	85	case T_BOOLEAN:
duke@435	86	case T_BYTE:
duke@435	87	case T_CHAR:
duke@435	88	case T_SHORT:
duke@435	89	case T_INT:
duke@435	90	case T_FLOAT:
duke@435	91	case T_DOUBLE:
duke@435	92	case T_LONG:
duke@435	93	case T_OBJECT:
duke@435	94	case T_ADDRESS: // random raw pointer
duke@435	95	case T_CONFLICT: // might as well support a bottom type
duke@435	96	case T_VOID: // padding or other unaddressed word
duke@435	97	// layout type must map to itself
duke@435	98	assert(vt == ft, "");
duke@435	99	break;
duke@435	100	default:
duke@435	101	// non-layout type must map to a (different) layout type
duke@435	102	assert(vt != ft, "");
duke@435	103	assert(ft == type2field[ft], "");
duke@435	104	}
duke@435	105	// every type must map to same-sized layout type:
duke@435	106	assert(type2size[vt] == type2size[ft], "");
duke@435	107	}
duke@435	108	}
duke@435	109	// These are assumed, e.g., when filling HeapWords with juints.
duke@435	110	assert(is_power_of_2(sizeof(juint)), "juint must be power of 2");
duke@435	111	assert(is_power_of_2(HeapWordSize), "HeapWordSize must be power of 2");
duke@435	112	assert((size_t)HeapWordSize >= sizeof(juint),
duke@435	113	"HeapWord should be at least as large as juint");
duke@435	114	assert(sizeof(NULL) == sizeof(char*), "NULL must be same size as pointer");
duke@435	115	#endif
duke@435	116
duke@435	117	if( JavaPriority1_To_OSPriority != -1 )
duke@435	118	os::java_to_os_priority[1] = JavaPriority1_To_OSPriority;
duke@435	119	if( JavaPriority2_To_OSPriority != -1 )
duke@435	120	os::java_to_os_priority[2] = JavaPriority2_To_OSPriority;
duke@435	121	if( JavaPriority3_To_OSPriority != -1 )
duke@435	122	os::java_to_os_priority[3] = JavaPriority3_To_OSPriority;
duke@435	123	if( JavaPriority4_To_OSPriority != -1 )
duke@435	124	os::java_to_os_priority[4] = JavaPriority4_To_OSPriority;
duke@435	125	if( JavaPriority5_To_OSPriority != -1 )
duke@435	126	os::java_to_os_priority[5] = JavaPriority5_To_OSPriority;
duke@435	127	if( JavaPriority6_To_OSPriority != -1 )
duke@435	128	os::java_to_os_priority[6] = JavaPriority6_To_OSPriority;
duke@435	129	if( JavaPriority7_To_OSPriority != -1 )
duke@435	130	os::java_to_os_priority[7] = JavaPriority7_To_OSPriority;
duke@435	131	if( JavaPriority8_To_OSPriority != -1 )
duke@435	132	os::java_to_os_priority[8] = JavaPriority8_To_OSPriority;
duke@435	133	if( JavaPriority9_To_OSPriority != -1 )
duke@435	134	os::java_to_os_priority[9] = JavaPriority9_To_OSPriority;
duke@435	135	if(JavaPriority10_To_OSPriority != -1 )
duke@435	136	os::java_to_os_priority[10] = JavaPriority10_To_OSPriority;
duke@435	137	}
duke@435	138
duke@435	139
duke@435	140	// Map BasicType to signature character
duke@435	141	char type2char_tab[T_CONFLICT+1]={ 0, 0, 0, 0, 'Z', 'C', 'F', 'D', 'B', 'S', 'I', 'J', 'L', '[', 'V', 0, 0};
duke@435	142
duke@435	143	// Map BasicType to Java type name
duke@435	144	const char* type2name_tab[T_CONFLICT+1] = {
duke@435	145	NULL, NULL, NULL, NULL,
duke@435	146	"boolean",
duke@435	147	"char",
duke@435	148	"float",
duke@435	149	"double",
duke@435	150	"byte",
duke@435	151	"short",
duke@435	152	"int",
duke@435	153	"long",
duke@435	154	"object",
duke@435	155	"array",
duke@435	156	"void",
duke@435	157	"*address*",
duke@435	158	"*conflict*"
duke@435	159	};
duke@435	160
duke@435	161
duke@435	162	BasicType name2type(const char* name) {
duke@435	163	for (int i = T_BOOLEAN; i <= T_VOID; i++) {
duke@435	164	BasicType t = (BasicType)i;
duke@435	165	if (type2name_tab[t] != NULL && 0 == strcmp(type2name_tab[t], name))
duke@435	166	return t;
duke@435	167	}
duke@435	168	return T_ILLEGAL;
duke@435	169	}
duke@435	170
duke@435	171
duke@435	172	// Map BasicType to size in words
duke@435	173	int type2size[T_CONFLICT+1]={ -1, 0, 0, 0, 1, 1, 1, 2, 1, 1, 1, 2, 1, 1, 0, 1, -1};
duke@435	174
duke@435	175	BasicType type2field[T_CONFLICT+1] = {
duke@435	176	(BasicType)0, // 0,
duke@435	177	(BasicType)0, // 1,
duke@435	178	(BasicType)0, // 2,
duke@435	179	(BasicType)0, // 3,
duke@435	180	T_BOOLEAN, // T_BOOLEAN = 4,
duke@435	181	T_CHAR, // T_CHAR = 5,
duke@435	182	T_FLOAT, // T_FLOAT = 6,
duke@435	183	T_DOUBLE, // T_DOUBLE = 7,
duke@435	184	T_BYTE, // T_BYTE = 8,
duke@435	185	T_SHORT, // T_SHORT = 9,
duke@435	186	T_INT, // T_INT = 10,
duke@435	187	T_LONG, // T_LONG = 11,
duke@435	188	T_OBJECT, // T_OBJECT = 12,
duke@435	189	T_OBJECT, // T_ARRAY = 13,
duke@435	190	T_VOID, // T_VOID = 14,
duke@435	191	T_ADDRESS, // T_ADDRESS = 15,
duke@435	192	T_CONFLICT // T_CONFLICT = 16,
duke@435	193	};
duke@435	194
duke@435	195
duke@435	196	BasicType type2wfield[T_CONFLICT+1] = {
duke@435	197	(BasicType)0, // 0,
duke@435	198	(BasicType)0, // 1,
duke@435	199	(BasicType)0, // 2,
duke@435	200	(BasicType)0, // 3,
duke@435	201	T_INT, // T_BOOLEAN = 4,
duke@435	202	T_INT, // T_CHAR = 5,
duke@435	203	T_FLOAT, // T_FLOAT = 6,
duke@435	204	T_DOUBLE, // T_DOUBLE = 7,
duke@435	205	T_INT, // T_BYTE = 8,
duke@435	206	T_INT, // T_SHORT = 9,
duke@435	207	T_INT, // T_INT = 10,
duke@435	208	T_LONG, // T_LONG = 11,
duke@435	209	T_OBJECT, // T_OBJECT = 12,
duke@435	210	T_OBJECT, // T_ARRAY = 13,
duke@435	211	T_VOID, // T_VOID = 14,
duke@435	212	T_ADDRESS, // T_ADDRESS = 15,
duke@435	213	T_CONFLICT // T_CONFLICT = 16,
duke@435	214	};
duke@435	215
duke@435	216
duke@435	217	int type2aelembytes[T_CONFLICT+1] = {
duke@435	218	0, // 0
duke@435	219	0, // 1
duke@435	220	0, // 2
duke@435	221	0, // 3
duke@435	222	T_BOOLEAN_aelem_bytes, // T_BOOLEAN = 4,
duke@435	223	T_CHAR_aelem_bytes, // T_CHAR = 5,
duke@435	224	T_FLOAT_aelem_bytes, // T_FLOAT = 6,
duke@435	225	T_DOUBLE_aelem_bytes, // T_DOUBLE = 7,
duke@435	226	T_BYTE_aelem_bytes, // T_BYTE = 8,
duke@435	227	T_SHORT_aelem_bytes, // T_SHORT = 9,
duke@435	228	T_INT_aelem_bytes, // T_INT = 10,
duke@435	229	T_LONG_aelem_bytes, // T_LONG = 11,
duke@435	230	T_OBJECT_aelem_bytes, // T_OBJECT = 12,
duke@435	231	T_ARRAY_aelem_bytes, // T_ARRAY = 13,
duke@435	232	0, // T_VOID = 14,
duke@435	233	T_INT_aelem_bytes, // T_ADDRESS = 15,
duke@435	234	0 // T_CONFLICT = 16,
duke@435	235	};
duke@435	236
duke@435	237
duke@435	238	// Support for 64-bit integer arithmetic
duke@435	239
duke@435	240	// The following code is mostly taken from JVM typedefs_md.h and system_md.c
duke@435	241
duke@435	242	static const jlong high_bit = (jlong)1 << (jlong)63;
duke@435	243	static const jlong other_bits = ~high_bit;
duke@435	244
duke@435	245	jlong float2long(jfloat f) {
duke@435	246	jlong tmp = (jlong) f;
duke@435	247	if (tmp != high_bit) {
duke@435	248	return tmp;
duke@435	249	} else {
duke@435	250	if (g_isnan((jdouble)f)) {
duke@435	251	return 0;
duke@435	252	}
duke@435	253	if (f < 0) {
duke@435	254	return high_bit;
duke@435	255	} else {
duke@435	256	return other_bits;
duke@435	257	}
duke@435	258	}
duke@435	259	}
duke@435	260
duke@435	261
duke@435	262	jlong double2long(jdouble f) {
duke@435	263	jlong tmp = (jlong) f;
duke@435	264	if (tmp != high_bit) {
duke@435	265	return tmp;
duke@435	266	} else {
duke@435	267	if (g_isnan(f)) {
duke@435	268	return 0;
duke@435	269	}
duke@435	270	if (f < 0) {
duke@435	271	return high_bit;
duke@435	272	} else {
duke@435	273	return other_bits;
duke@435	274	}
duke@435	275	}
duke@435	276	}
duke@435	277
duke@435	278	// least common multiple
duke@435	279	size_t lcm(size_t a, size_t b) {
duke@435	280	size_t cur, div, next;
duke@435	281
duke@435	282	cur = MAX2(a, b);
duke@435	283	div = MIN2(a, b);
duke@435	284
duke@435	285	assert(div != 0, "lcm requires positive arguments");
duke@435	286
duke@435	287
duke@435	288	while ((next = cur % div) != 0) {
duke@435	289	cur = div; div = next;
duke@435	290	}
duke@435	291
duke@435	292
duke@435	293	julong result = julong(a) * b / div;
duke@435	294	assert(result <= (size_t)max_uintx, "Integer overflow in lcm");
duke@435	295
duke@435	296	return size_t(result);
duke@435	297	}