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

src/share/vm/opto/type.cpp@d4dbd9f91680 (annotated)

src/share/vm/opto/type.cpp

Thu, 05 Jun 2008 15:43:18 -0700

author

never

date

Thu, 05 Jun 2008 15:43:18 -0700

changeset 618

d4dbd9f91680

parent 598

885ed790ecf0

child 631

d1605aabd0a1

child 656

1e026f8da827

permissions

-rw-r--r--

6711083: 64bit JVM crashes with Internal Error (type.cpp:763) - ShouldNotReachHere() with enabled COOPs
Summary: Add NarrowOop to various xmeet routines
Reviewed-by: kvn, sgoldman, jrose, rasbold

duke@435	1	/*
duke@435	2	* Copyright 1997-2007 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	// Portions of code courtesy of Clifford Click
duke@435	26
duke@435	27	// Optimization - Graph Style
duke@435	28
duke@435	29	#include "incls/_precompiled.incl"
duke@435	30	#include "incls/_type.cpp.incl"
duke@435	31
duke@435	32	// Dictionary of types shared among compilations.
duke@435	33	Dict* Type::_shared_type_dict = NULL;
duke@435	34
duke@435	35	// Array which maps compiler types to Basic Types
duke@435	36	const BasicType Type::_basic_type[Type::lastype] = {
duke@435	37	T_ILLEGAL, // Bad
duke@435	38	T_ILLEGAL, // Control
duke@435	39	T_VOID, // Top
duke@435	40	T_INT, // Int
duke@435	41	T_LONG, // Long
duke@435	42	T_VOID, // Half
coleenp@548	43	T_NARROWOOP, // NarrowOop
duke@435	44
duke@435	45	T_ILLEGAL, // Tuple
duke@435	46	T_ARRAY, // Array
duke@435	47
duke@435	48	T_ADDRESS, // AnyPtr // shows up in factory methods for NULL_PTR
duke@435	49	T_ADDRESS, // RawPtr
duke@435	50	T_OBJECT, // OopPtr
duke@435	51	T_OBJECT, // InstPtr
duke@435	52	T_OBJECT, // AryPtr
duke@435	53	T_OBJECT, // KlassPtr
duke@435	54
duke@435	55	T_OBJECT, // Function
duke@435	56	T_ILLEGAL, // Abio
duke@435	57	T_ADDRESS, // Return_Address
duke@435	58	T_ILLEGAL, // Memory
duke@435	59	T_FLOAT, // FloatTop
duke@435	60	T_FLOAT, // FloatCon
duke@435	61	T_FLOAT, // FloatBot
duke@435	62	T_DOUBLE, // DoubleTop
duke@435	63	T_DOUBLE, // DoubleCon
duke@435	64	T_DOUBLE, // DoubleBot
duke@435	65	T_ILLEGAL, // Bottom
duke@435	66	};
duke@435	67
duke@435	68	// Map ideal registers (machine types) to ideal types
duke@435	69	const Type *Type::mreg2type[_last_machine_leaf];
duke@435	70
duke@435	71	// Map basic types to canonical Type* pointers.
duke@435	72	const Type* Type:: _const_basic_type[T_CONFLICT+1];
duke@435	73
duke@435	74	// Map basic types to constant-zero Types.
duke@435	75	const Type* Type:: _zero_type[T_CONFLICT+1];
duke@435	76
duke@435	77	// Map basic types to array-body alias types.
duke@435	78	const TypeAryPtr* TypeAryPtr::_array_body_type[T_CONFLICT+1];
duke@435	79
duke@435	80	//=============================================================================
duke@435	81	// Convenience common pre-built types.
duke@435	82	const Type *Type::ABIO; // State-of-machine only
duke@435	83	const Type *Type::BOTTOM; // All values
duke@435	84	const Type *Type::CONTROL; // Control only
duke@435	85	const Type *Type::DOUBLE; // All doubles
duke@435	86	const Type *Type::FLOAT; // All floats
duke@435	87	const Type *Type::HALF; // Placeholder half of doublewide type
duke@435	88	const Type *Type::MEMORY; // Abstract store only
duke@435	89	const Type *Type::RETURN_ADDRESS;
duke@435	90	const Type *Type::TOP; // No values in set
duke@435	91
duke@435	92	//------------------------------get_const_type---------------------------
duke@435	93	const Type* Type::get_const_type(ciType* type) {
duke@435	94	if (type == NULL) {
duke@435	95	return NULL;
duke@435	96	} else if (type->is_primitive_type()) {
duke@435	97	return get_const_basic_type(type->basic_type());
duke@435	98	} else {
duke@435	99	return TypeOopPtr::make_from_klass(type->as_klass());
duke@435	100	}
duke@435	101	}
duke@435	102
duke@435	103	//---------------------------array_element_basic_type---------------------------------
duke@435	104	// Mapping to the array element's basic type.
duke@435	105	BasicType Type::array_element_basic_type() const {
duke@435	106	BasicType bt = basic_type();
duke@435	107	if (bt == T_INT) {
duke@435	108	if (this == TypeInt::INT) return T_INT;
duke@435	109	if (this == TypeInt::CHAR) return T_CHAR;
duke@435	110	if (this == TypeInt::BYTE) return T_BYTE;
duke@435	111	if (this == TypeInt::BOOL) return T_BOOLEAN;
duke@435	112	if (this == TypeInt::SHORT) return T_SHORT;
duke@435	113	return T_VOID;
duke@435	114	}
duke@435	115	return bt;
duke@435	116	}
duke@435	117
duke@435	118	//---------------------------get_typeflow_type---------------------------------
duke@435	119	// Import a type produced by ciTypeFlow.
duke@435	120	const Type* Type::get_typeflow_type(ciType* type) {
duke@435	121	switch (type->basic_type()) {
duke@435	122
duke@435	123	case ciTypeFlow::StateVector::T_BOTTOM:
duke@435	124	assert(type == ciTypeFlow::StateVector::bottom_type(), "");
duke@435	125	return Type::BOTTOM;
duke@435	126
duke@435	127	case ciTypeFlow::StateVector::T_TOP:
duke@435	128	assert(type == ciTypeFlow::StateVector::top_type(), "");
duke@435	129	return Type::TOP;
duke@435	130
duke@435	131	case ciTypeFlow::StateVector::T_NULL:
duke@435	132	assert(type == ciTypeFlow::StateVector::null_type(), "");
duke@435	133	return TypePtr::NULL_PTR;
duke@435	134
duke@435	135	case ciTypeFlow::StateVector::T_LONG2:
duke@435	136	// The ciTypeFlow pass pushes a long, then the half.
duke@435	137	// We do the same.
duke@435	138	assert(type == ciTypeFlow::StateVector::long2_type(), "");
duke@435	139	return TypeInt::TOP;
duke@435	140
duke@435	141	case ciTypeFlow::StateVector::T_DOUBLE2:
duke@435	142	// The ciTypeFlow pass pushes double, then the half.
duke@435	143	// Our convention is the same.
duke@435	144	assert(type == ciTypeFlow::StateVector::double2_type(), "");
duke@435	145	return Type::TOP;
duke@435	146
duke@435	147	case T_ADDRESS:
duke@435	148	assert(type->is_return_address(), "");
duke@435	149	return TypeRawPtr::make((address)(intptr_t)type->as_return_address()->bci());
duke@435	150
duke@435	151	default:
duke@435	152	// make sure we did not mix up the cases:
duke@435	153	assert(type != ciTypeFlow::StateVector::bottom_type(), "");
duke@435	154	assert(type != ciTypeFlow::StateVector::top_type(), "");
duke@435	155	assert(type != ciTypeFlow::StateVector::null_type(), "");
duke@435	156	assert(type != ciTypeFlow::StateVector::long2_type(), "");
duke@435	157	assert(type != ciTypeFlow::StateVector::double2_type(), "");
duke@435	158	assert(!type->is_return_address(), "");
duke@435	159
duke@435	160	return Type::get_const_type(type);
duke@435	161	}
duke@435	162	}
duke@435	163
duke@435	164
duke@435	165	//------------------------------make-------------------------------------------
duke@435	166	// Create a simple Type, with default empty symbol sets. Then hashcons it
duke@435	167	// and look for an existing copy in the type dictionary.
duke@435	168	const Type *Type::make( enum TYPES t ) {
duke@435	169	return (new Type(t))->hashcons();
duke@435	170	}
duke@435	171
duke@435	172	//------------------------------cmp--------------------------------------------
duke@435	173	int Type::cmp( const Type *const t1, const Type *const t2 ) {
duke@435	174	if( t1->_base != t2->_base )
duke@435	175	return 1; // Missed badly
duke@435	176	assert(t1 != t2 || t1->eq(t2), "eq must be reflexive");
duke@435	177	return !t1->eq(t2); // Return ZERO if equal
duke@435	178	}
duke@435	179
duke@435	180	//------------------------------hash-------------------------------------------
duke@435	181	int Type::uhash( const Type *const t ) {
duke@435	182	return t->hash();
duke@435	183	}
duke@435	184
duke@435	185	//--------------------------Initialize_shared----------------------------------
duke@435	186	void Type::Initialize_shared(Compile* current) {
duke@435	187	// This method does not need to be locked because the first system
duke@435	188	// compilations (stub compilations) occur serially. If they are
duke@435	189	// changed to proceed in parallel, then this section will need
duke@435	190	// locking.
duke@435	191
duke@435	192	Arena* save = current->type_arena();
duke@435	193	Arena* shared_type_arena = new Arena();
duke@435	194
duke@435	195	current->set_type_arena(shared_type_arena);
duke@435	196	_shared_type_dict =
duke@435	197	new (shared_type_arena) Dict( (CmpKey)Type::cmp, (Hash)Type::uhash,
duke@435	198	shared_type_arena, 128 );
duke@435	199	current->set_type_dict(_shared_type_dict);
duke@435	200
duke@435	201	// Make shared pre-built types.
duke@435	202	CONTROL = make(Control); // Control only
duke@435	203	TOP = make(Top); // No values in set
duke@435	204	MEMORY = make(Memory); // Abstract store only
duke@435	205	ABIO = make(Abio); // State-of-machine only
duke@435	206	RETURN_ADDRESS=make(Return_Address);
duke@435	207	FLOAT = make(FloatBot); // All floats
duke@435	208	DOUBLE = make(DoubleBot); // All doubles
duke@435	209	BOTTOM = make(Bottom); // Everything
duke@435	210	HALF = make(Half); // Placeholder half of doublewide type
duke@435	211
duke@435	212	TypeF::ZERO = TypeF::make(0.0); // Float 0 (positive zero)
duke@435	213	TypeF::ONE = TypeF::make(1.0); // Float 1
duke@435	214
duke@435	215	TypeD::ZERO = TypeD::make(0.0); // Double 0 (positive zero)
duke@435	216	TypeD::ONE = TypeD::make(1.0); // Double 1
duke@435	217
duke@435	218	TypeInt::MINUS_1 = TypeInt::make(-1); // -1
duke@435	219	TypeInt::ZERO = TypeInt::make( 0); // 0
duke@435	220	TypeInt::ONE = TypeInt::make( 1); // 1
duke@435	221	TypeInt::BOOL = TypeInt::make(0,1, WidenMin); // 0 or 1, FALSE or TRUE.
duke@435	222	TypeInt::CC = TypeInt::make(-1, 1, WidenMin); // -1, 0 or 1, condition codes
duke@435	223	TypeInt::CC_LT = TypeInt::make(-1,-1, WidenMin); // == TypeInt::MINUS_1
duke@435	224	TypeInt::CC_GT = TypeInt::make( 1, 1, WidenMin); // == TypeInt::ONE
duke@435	225	TypeInt::CC_EQ = TypeInt::make( 0, 0, WidenMin); // == TypeInt::ZERO
duke@435	226	TypeInt::CC_LE = TypeInt::make(-1, 0, WidenMin);
duke@435	227	TypeInt::CC_GE = TypeInt::make( 0, 1, WidenMin); // == TypeInt::BOOL
duke@435	228	TypeInt::BYTE = TypeInt::make(-128,127, WidenMin); // Bytes
duke@435	229	TypeInt::CHAR = TypeInt::make(0,65535, WidenMin); // Java chars
duke@435	230	TypeInt::SHORT = TypeInt::make(-32768,32767, WidenMin); // Java shorts
duke@435	231	TypeInt::POS = TypeInt::make(0,max_jint, WidenMin); // Non-neg values
duke@435	232	TypeInt::POS1 = TypeInt::make(1,max_jint, WidenMin); // Positive values
duke@435	233	TypeInt::INT = TypeInt::make(min_jint,max_jint, WidenMax); // 32-bit integers
duke@435	234	TypeInt::SYMINT = TypeInt::make(-max_jint,max_jint,WidenMin); // symmetric range
duke@435	235	// CmpL is overloaded both as the bytecode computation returning
duke@435	236	// a trinary (-1,0,+1) integer result AND as an efficient long
duke@435	237	// compare returning optimizer ideal-type flags.
duke@435	238	assert( TypeInt::CC_LT == TypeInt::MINUS_1, "types must match for CmpL to work" );
duke@435	239	assert( TypeInt::CC_GT == TypeInt::ONE, "types must match for CmpL to work" );
duke@435	240	assert( TypeInt::CC_EQ == TypeInt::ZERO, "types must match for CmpL to work" );
duke@435	241	assert( TypeInt::CC_GE == TypeInt::BOOL, "types must match for CmpL to work" );
duke@435	242
duke@435	243	TypeLong::MINUS_1 = TypeLong::make(-1); // -1
duke@435	244	TypeLong::ZERO = TypeLong::make( 0); // 0
duke@435	245	TypeLong::ONE = TypeLong::make( 1); // 1
duke@435	246	TypeLong::POS = TypeLong::make(0,max_jlong, WidenMin); // Non-neg values
duke@435	247	TypeLong::LONG = TypeLong::make(min_jlong,max_jlong,WidenMax); // 64-bit integers
duke@435	248	TypeLong::INT = TypeLong::make((jlong)min_jint,(jlong)max_jint,WidenMin);
duke@435	249	TypeLong::UINT = TypeLong::make(0,(jlong)max_juint,WidenMin);
duke@435	250
duke@435	251	const Type **fboth =(const Type**)shared_type_arena->Amalloc_4(2*sizeof(Type*));
duke@435	252	fboth[0] = Type::CONTROL;
duke@435	253	fboth[1] = Type::CONTROL;
duke@435	254	TypeTuple::IFBOTH = TypeTuple::make( 2, fboth );
duke@435	255
duke@435	256	const Type **ffalse =(const Type**)shared_type_arena->Amalloc_4(2*sizeof(Type*));
duke@435	257	ffalse[0] = Type::CONTROL;
duke@435	258	ffalse[1] = Type::TOP;
duke@435	259	TypeTuple::IFFALSE = TypeTuple::make( 2, ffalse );
duke@435	260
duke@435	261	const Type **fneither =(const Type**)shared_type_arena->Amalloc_4(2*sizeof(Type*));
duke@435	262	fneither[0] = Type::TOP;
duke@435	263	fneither[1] = Type::TOP;
duke@435	264	TypeTuple::IFNEITHER = TypeTuple::make( 2, fneither );
duke@435	265
duke@435	266	const Type **ftrue =(const Type**)shared_type_arena->Amalloc_4(2*sizeof(Type*));
duke@435	267	ftrue[0] = Type::TOP;
duke@435	268	ftrue[1] = Type::CONTROL;
duke@435	269	TypeTuple::IFTRUE = TypeTuple::make( 2, ftrue );
duke@435	270
duke@435	271	const Type **floop =(const Type**)shared_type_arena->Amalloc_4(2*sizeof(Type*));
duke@435	272	floop[0] = Type::CONTROL;
duke@435	273	floop[1] = TypeInt::INT;
duke@435	274	TypeTuple::LOOPBODY = TypeTuple::make( 2, floop );
duke@435	275
duke@435	276	TypePtr::NULL_PTR= TypePtr::make( AnyPtr, TypePtr::Null, 0 );
duke@435	277	TypePtr::NOTNULL = TypePtr::make( AnyPtr, TypePtr::NotNull, OffsetBot );
duke@435	278	TypePtr::BOTTOM = TypePtr::make( AnyPtr, TypePtr::BotPTR, OffsetBot );
duke@435	279
duke@435	280	TypeRawPtr::BOTTOM = TypeRawPtr::make( TypePtr::BotPTR );
duke@435	281	TypeRawPtr::NOTNULL= TypeRawPtr::make( TypePtr::NotNull );
duke@435	282
duke@435	283	const Type **fmembar = TypeTuple::fields(0);
duke@435	284	TypeTuple::MEMBAR = TypeTuple::make(TypeFunc::Parms+0, fmembar);
duke@435	285
duke@435	286	const Type **fsc = (const Type**)shared_type_arena->Amalloc_4(2*sizeof(Type*));
duke@435	287	fsc[0] = TypeInt::CC;
duke@435	288	fsc[1] = Type::MEMORY;
duke@435	289	TypeTuple::STORECONDITIONAL = TypeTuple::make(2, fsc);
duke@435	290
duke@435	291	TypeInstPtr::NOTNULL = TypeInstPtr::make(TypePtr::NotNull, current->env()->Object_klass());
duke@435	292	TypeInstPtr::BOTTOM = TypeInstPtr::make(TypePtr::BotPTR, current->env()->Object_klass());
duke@435	293	TypeInstPtr::MIRROR = TypeInstPtr::make(TypePtr::NotNull, current->env()->Class_klass());
duke@435	294	TypeInstPtr::MARK = TypeInstPtr::make(TypePtr::BotPTR, current->env()->Object_klass(),
duke@435	295	false, 0, oopDesc::mark_offset_in_bytes());
duke@435	296	TypeInstPtr::KLASS = TypeInstPtr::make(TypePtr::BotPTR, current->env()->Object_klass(),
duke@435	297	false, 0, oopDesc::klass_offset_in_bytes());
duke@435	298	TypeOopPtr::BOTTOM = TypeOopPtr::make(TypePtr::BotPTR, OffsetBot);
duke@435	299
coleenp@548	300	TypeNarrowOop::NULL_PTR = TypeNarrowOop::make( TypePtr::NULL_PTR );
coleenp@548	301	TypeNarrowOop::BOTTOM = TypeNarrowOop::make( TypeInstPtr::BOTTOM );
coleenp@548	302
coleenp@548	303	mreg2type[Op_Node] = Type::BOTTOM;
coleenp@548	304	mreg2type[Op_Set ] = 0;
coleenp@548	305	mreg2type[Op_RegN] = TypeNarrowOop::BOTTOM;
coleenp@548	306	mreg2type[Op_RegI] = TypeInt::INT;
coleenp@548	307	mreg2type[Op_RegP] = TypePtr::BOTTOM;
coleenp@548	308	mreg2type[Op_RegF] = Type::FLOAT;
coleenp@548	309	mreg2type[Op_RegD] = Type::DOUBLE;
coleenp@548	310	mreg2type[Op_RegL] = TypeLong::LONG;
coleenp@548	311	mreg2type[Op_RegFlags] = TypeInt::CC;
coleenp@548	312
duke@435	313	TypeAryPtr::RANGE = TypeAryPtr::make( TypePtr::BotPTR, TypeAry::make(Type::BOTTOM,TypeInt::POS), current->env()->Object_klass(), false, arrayOopDesc::length_offset_in_bytes());
kvn@598	314
kvn@598	315	TypeAryPtr::NARROWOOPS = TypeAryPtr::make(TypePtr::BotPTR, TypeAry::make(TypeNarrowOop::BOTTOM, TypeInt::POS), NULL /*ciArrayKlass::make(o)*/, false, Type::OffsetBot);
kvn@598	316
kvn@598	317	#ifdef _LP64
kvn@598	318	if (UseCompressedOops) {
kvn@598	319	TypeAryPtr::OOPS = TypeAryPtr::NARROWOOPS;
kvn@598	320	} else
kvn@598	321	#endif
kvn@598	322	{
kvn@598	323	// There is no shared klass for Object[]. See note in TypeAryPtr::klass().
kvn@598	324	TypeAryPtr::OOPS = TypeAryPtr::make(TypePtr::BotPTR, TypeAry::make(TypeInstPtr::BOTTOM,TypeInt::POS), NULL /*ciArrayKlass::make(o)*/, false, Type::OffsetBot);
kvn@598	325	}
duke@435	326	TypeAryPtr::BYTES = TypeAryPtr::make(TypePtr::BotPTR, TypeAry::make(TypeInt::BYTE ,TypeInt::POS), ciTypeArrayKlass::make(T_BYTE), true, Type::OffsetBot);
duke@435	327	TypeAryPtr::SHORTS = TypeAryPtr::make(TypePtr::BotPTR, TypeAry::make(TypeInt::SHORT ,TypeInt::POS), ciTypeArrayKlass::make(T_SHORT), true, Type::OffsetBot);
duke@435	328	TypeAryPtr::CHARS = TypeAryPtr::make(TypePtr::BotPTR, TypeAry::make(TypeInt::CHAR ,TypeInt::POS), ciTypeArrayKlass::make(T_CHAR), true, Type::OffsetBot);
duke@435	329	TypeAryPtr::INTS = TypeAryPtr::make(TypePtr::BotPTR, TypeAry::make(TypeInt::INT ,TypeInt::POS), ciTypeArrayKlass::make(T_INT), true, Type::OffsetBot);
duke@435	330	TypeAryPtr::LONGS = TypeAryPtr::make(TypePtr::BotPTR, TypeAry::make(TypeLong::LONG ,TypeInt::POS), ciTypeArrayKlass::make(T_LONG), true, Type::OffsetBot);
duke@435	331	TypeAryPtr::FLOATS = TypeAryPtr::make(TypePtr::BotPTR, TypeAry::make(Type::FLOAT ,TypeInt::POS), ciTypeArrayKlass::make(T_FLOAT), true, Type::OffsetBot);
duke@435	332	TypeAryPtr::DOUBLES = TypeAryPtr::make(TypePtr::BotPTR, TypeAry::make(Type::DOUBLE ,TypeInt::POS), ciTypeArrayKlass::make(T_DOUBLE), true, Type::OffsetBot);
duke@435	333
kvn@598	334	// Nobody should ask _array_body_type[T_NARROWOOP]. Use NULL as assert.
kvn@598	335	TypeAryPtr::_array_body_type[T_NARROWOOP] = NULL;
duke@435	336	TypeAryPtr::_array_body_type[T_OBJECT] = TypeAryPtr::OOPS;
kvn@598	337	TypeAryPtr::_array_body_type[T_ARRAY] = TypeAryPtr::OOPS; // arrays are stored in oop arrays
duke@435	338	TypeAryPtr::_array_body_type[T_BYTE] = TypeAryPtr::BYTES;
duke@435	339	TypeAryPtr::_array_body_type[T_BOOLEAN] = TypeAryPtr::BYTES; // boolean[] is a byte array
duke@435	340	TypeAryPtr::_array_body_type[T_SHORT] = TypeAryPtr::SHORTS;
duke@435	341	TypeAryPtr::_array_body_type[T_CHAR] = TypeAryPtr::CHARS;
duke@435	342	TypeAryPtr::_array_body_type[T_INT] = TypeAryPtr::INTS;
duke@435	343	TypeAryPtr::_array_body_type[T_LONG] = TypeAryPtr::LONGS;
duke@435	344	TypeAryPtr::_array_body_type[T_FLOAT] = TypeAryPtr::FLOATS;
duke@435	345	TypeAryPtr::_array_body_type[T_DOUBLE] = TypeAryPtr::DOUBLES;
duke@435	346
duke@435	347	TypeKlassPtr::OBJECT = TypeKlassPtr::make( TypePtr::NotNull, current->env()->Object_klass(), 0 );
duke@435	348	TypeKlassPtr::OBJECT_OR_NULL = TypeKlassPtr::make( TypePtr::BotPTR, current->env()->Object_klass(), 0 );
duke@435	349
duke@435	350	const Type **fi2c = TypeTuple::fields(2);
duke@435	351	fi2c[TypeFunc::Parms+0] = TypeInstPtr::BOTTOM; // methodOop
duke@435	352	fi2c[TypeFunc::Parms+1] = TypeRawPtr::BOTTOM; // argument pointer
duke@435	353	TypeTuple::START_I2C = TypeTuple::make(TypeFunc::Parms+2, fi2c);
duke@435	354
duke@435	355	const Type **intpair = TypeTuple::fields(2);
duke@435	356	intpair[0] = TypeInt::INT;
duke@435	357	intpair[1] = TypeInt::INT;
duke@435	358	TypeTuple::INT_PAIR = TypeTuple::make(2, intpair);
duke@435	359
duke@435	360	const Type **longpair = TypeTuple::fields(2);
duke@435	361	longpair[0] = TypeLong::LONG;
duke@435	362	longpair[1] = TypeLong::LONG;
duke@435	363	TypeTuple::LONG_PAIR = TypeTuple::make(2, longpair);
duke@435	364
coleenp@548	365	_const_basic_type[T_NARROWOOP] = TypeNarrowOop::BOTTOM;
duke@435	366	_const_basic_type[T_BOOLEAN] = TypeInt::BOOL;
duke@435	367	_const_basic_type[T_CHAR] = TypeInt::CHAR;
duke@435	368	_const_basic_type[T_BYTE] = TypeInt::BYTE;
duke@435	369	_const_basic_type[T_SHORT] = TypeInt::SHORT;
duke@435	370	_const_basic_type[T_INT] = TypeInt::INT;
duke@435	371	_const_basic_type[T_LONG] = TypeLong::LONG;
duke@435	372	_const_basic_type[T_FLOAT] = Type::FLOAT;
duke@435	373	_const_basic_type[T_DOUBLE] = Type::DOUBLE;
duke@435	374	_const_basic_type[T_OBJECT] = TypeInstPtr::BOTTOM;
duke@435	375	_const_basic_type[T_ARRAY] = TypeInstPtr::BOTTOM; // there is no separate bottom for arrays
duke@435	376	_const_basic_type[T_VOID] = TypePtr::NULL_PTR; // reflection represents void this way
duke@435	377	_const_basic_type[T_ADDRESS] = TypeRawPtr::BOTTOM; // both interpreter return addresses & random raw ptrs
duke@435	378	_const_basic_type[T_CONFLICT]= Type::BOTTOM; // why not?
duke@435	379
coleenp@548	380	_zero_type[T_NARROWOOP] = TypeNarrowOop::NULL_PTR;
duke@435	381	_zero_type[T_BOOLEAN] = TypeInt::ZERO; // false == 0
duke@435	382	_zero_type[T_CHAR] = TypeInt::ZERO; // '\0' == 0
duke@435	383	_zero_type[T_BYTE] = TypeInt::ZERO; // 0x00 == 0
duke@435	384	_zero_type[T_SHORT] = TypeInt::ZERO; // 0x0000 == 0
duke@435	385	_zero_type[T_INT] = TypeInt::ZERO;
duke@435	386	_zero_type[T_LONG] = TypeLong::ZERO;
duke@435	387	_zero_type[T_FLOAT] = TypeF::ZERO;
duke@435	388	_zero_type[T_DOUBLE] = TypeD::ZERO;
duke@435	389	_zero_type[T_OBJECT] = TypePtr::NULL_PTR;
duke@435	390	_zero_type[T_ARRAY] = TypePtr::NULL_PTR; // null array is null oop
duke@435	391	_zero_type[T_ADDRESS] = TypePtr::NULL_PTR; // raw pointers use the same null
duke@435	392	_zero_type[T_VOID] = Type::TOP; // the only void value is no value at all
duke@435	393
duke@435	394	// get_zero_type() should not happen for T_CONFLICT
duke@435	395	_zero_type[T_CONFLICT]= NULL;
duke@435	396
duke@435	397	// Restore working type arena.
duke@435	398	current->set_type_arena(save);
duke@435	399	current->set_type_dict(NULL);
duke@435	400	}
duke@435	401
duke@435	402	//------------------------------Initialize-------------------------------------
duke@435	403	void Type::Initialize(Compile* current) {
duke@435	404	assert(current->type_arena() != NULL, "must have created type arena");
duke@435	405
duke@435	406	if (_shared_type_dict == NULL) {
duke@435	407	Initialize_shared(current);
duke@435	408	}
duke@435	409
duke@435	410	Arena* type_arena = current->type_arena();
duke@435	411
duke@435	412	// Create the hash-cons'ing dictionary with top-level storage allocation
duke@435	413	Dict *tdic = new (type_arena) Dict( (CmpKey)Type::cmp,(Hash)Type::uhash, type_arena, 128 );
duke@435	414	current->set_type_dict(tdic);
duke@435	415
duke@435	416	// Transfer the shared types.
duke@435	417	DictI i(_shared_type_dict);
duke@435	418	for( ; i.test(); ++i ) {
duke@435	419	Type* t = (Type*)i._value;
duke@435	420	tdic->Insert(t,t); // New Type, insert into Type table
duke@435	421	}
coleenp@548	422
coleenp@548	423	#ifdef ASSERT
coleenp@548	424	verify_lastype();
coleenp@548	425	#endif
duke@435	426	}
duke@435	427
duke@435	428	//------------------------------hashcons---------------------------------------
duke@435	429	// Do the hash-cons trick. If the Type already exists in the type table,
duke@435	430	// delete the current Type and return the existing Type. Otherwise stick the
duke@435	431	// current Type in the Type table.
duke@435	432	const Type *Type::hashcons(void) {
duke@435	433	debug_only(base()); // Check the assertion in Type::base().
duke@435	434	// Look up the Type in the Type dictionary
duke@435	435	Dict *tdic = type_dict();
duke@435	436	Type* old = (Type*)(tdic->Insert(this, this, false));
duke@435	437	if( old ) { // Pre-existing Type?
duke@435	438	if( old != this ) // Yes, this guy is not the pre-existing?
duke@435	439	delete this; // Yes, Nuke this guy
duke@435	440	assert( old->_dual, "" );
duke@435	441	return old; // Return pre-existing
duke@435	442	}
duke@435	443
duke@435	444	// Every type has a dual (to make my lattice symmetric).
duke@435	445	// Since we just discovered a new Type, compute its dual right now.
duke@435	446	assert( !_dual, "" ); // No dual yet
duke@435	447	_dual = xdual(); // Compute the dual
duke@435	448	if( cmp(this,_dual)==0 ) { // Handle self-symmetric
duke@435	449	_dual = this;
duke@435	450	return this;
duke@435	451	}
duke@435	452	assert( !_dual->_dual, "" ); // No reverse dual yet
duke@435	453	assert( !(*tdic)[_dual], "" ); // Dual not in type system either
duke@435	454	// New Type, insert into Type table
duke@435	455	tdic->Insert((void*)_dual,(void*)_dual);
duke@435	456	((Type*)_dual)->_dual = this; // Finish up being symmetric
duke@435	457	#ifdef ASSERT
duke@435	458	Type *dual_dual = (Type*)_dual->xdual();
duke@435	459	assert( eq(dual_dual), "xdual(xdual()) should be identity" );
duke@435	460	delete dual_dual;
duke@435	461	#endif
duke@435	462	return this; // Return new Type
duke@435	463	}
duke@435	464
duke@435	465	//------------------------------eq---------------------------------------------
duke@435	466	// Structural equality check for Type representations
duke@435	467	bool Type::eq( const Type * ) const {
duke@435	468	return true; // Nothing else can go wrong
duke@435	469	}
duke@435	470
duke@435	471	//------------------------------hash-------------------------------------------
duke@435	472	// Type-specific hashing function.
duke@435	473	int Type::hash(void) const {
duke@435	474	return _base;
duke@435	475	}
duke@435	476
duke@435	477	//------------------------------is_finite--------------------------------------
duke@435	478	// Has a finite value
duke@435	479	bool Type::is_finite() const {
duke@435	480	return false;
duke@435	481	}
duke@435	482
duke@435	483	//------------------------------is_nan-----------------------------------------
duke@435	484	// Is not a number (NaN)
duke@435	485	bool Type::is_nan() const {
duke@435	486	return false;
duke@435	487	}
duke@435	488
duke@435	489	//------------------------------meet-------------------------------------------
duke@435	490	// Compute the MEET of two types. NOT virtual. It enforces that meet is
duke@435	491	// commutative and the lattice is symmetric.
duke@435	492	const Type *Type::meet( const Type *t ) const {
coleenp@548	493	if (isa_narrowoop() && t->isa_narrowoop()) {
coleenp@548	494	const Type* result = is_narrowoop()->make_oopptr()->meet(t->is_narrowoop()->make_oopptr());
coleenp@548	495	if (result->isa_oopptr()) {
coleenp@548	496	return result->isa_oopptr()->make_narrowoop();
coleenp@548	497	} else if (result == TypePtr::NULL_PTR) {
coleenp@548	498	return TypeNarrowOop::NULL_PTR;
coleenp@548	499	} else {
coleenp@548	500	return result;
coleenp@548	501	}
coleenp@548	502	}
coleenp@548	503
duke@435	504	const Type *mt = xmeet(t);
coleenp@548	505	if (isa_narrowoop() || t->isa_narrowoop()) return mt;
duke@435	506	#ifdef ASSERT
duke@435	507	assert( mt == t->xmeet(this), "meet not commutative" );
duke@435	508	const Type* dual_join = mt->_dual;
duke@435	509	const Type *t2t = dual_join->xmeet(t->_dual);
duke@435	510	const Type *t2this = dual_join->xmeet( _dual);
duke@435	511
duke@435	512	// Interface meet Oop is Not Symmetric:
duke@435	513	// Interface:AnyNull meet Oop:AnyNull == Interface:AnyNull
duke@435	514	// Interface:NotNull meet Oop:NotNull == java/lang/Object:NotNull
duke@435	515	const TypeInstPtr* this_inst = this->isa_instptr();
duke@435	516	const TypeInstPtr* t_inst = t->isa_instptr();
duke@435	517	bool interface_vs_oop = false;
duke@435	518	if( this_inst && this_inst->is_loaded() && t_inst && t_inst->is_loaded() ) {
duke@435	519	bool this_interface = this_inst->klass()->is_interface();
duke@435	520	bool t_interface = t_inst->klass()->is_interface();
duke@435	521	interface_vs_oop = this_interface ^ t_interface;
duke@435	522	}
duke@435	523	const Type *tdual = t->_dual;
duke@435	524	const Type *thisdual = _dual;
duke@435	525	// strip out instances
duke@435	526	if (t2t->isa_oopptr() != NULL) {
duke@435	527	t2t = t2t->isa_oopptr()->cast_to_instance(TypeOopPtr::UNKNOWN_INSTANCE);
duke@435	528	}
duke@435	529	if (t2this->isa_oopptr() != NULL) {
duke@435	530	t2this = t2this->isa_oopptr()->cast_to_instance(TypeOopPtr::UNKNOWN_INSTANCE);
duke@435	531	}
duke@435	532	if (tdual->isa_oopptr() != NULL) {
duke@435	533	tdual = tdual->isa_oopptr()->cast_to_instance(TypeOopPtr::UNKNOWN_INSTANCE);
duke@435	534	}
duke@435	535	if (thisdual->isa_oopptr() != NULL) {
duke@435	536	thisdual = thisdual->isa_oopptr()->cast_to_instance(TypeOopPtr::UNKNOWN_INSTANCE);
duke@435	537	}
duke@435	538
duke@435	539	if( !interface_vs_oop && (t2t != tdual || t2this != thisdual) ) {
duke@435	540	tty->print_cr("=== Meet Not Symmetric ===");
duke@435	541	tty->print("t = "); t->dump(); tty->cr();
duke@435	542	tty->print("this= "); dump(); tty->cr();
duke@435	543	tty->print("mt=(t meet this)= "); mt->dump(); tty->cr();
duke@435	544
duke@435	545	tty->print("t_dual= "); t->_dual->dump(); tty->cr();
duke@435	546	tty->print("this_dual= "); _dual->dump(); tty->cr();
duke@435	547	tty->print("mt_dual= "); mt->_dual->dump(); tty->cr();
duke@435	548
duke@435	549	tty->print("mt_dual meet t_dual= "); t2t ->dump(); tty->cr();
duke@435	550	tty->print("mt_dual meet this_dual= "); t2this ->dump(); tty->cr();
duke@435	551
duke@435	552	fatal("meet not symmetric" );
duke@435	553	}
duke@435	554	#endif
duke@435	555	return mt;
duke@435	556	}
duke@435	557
duke@435	558	//------------------------------xmeet------------------------------------------
duke@435	559	// Compute the MEET of two types. It returns a new Type object.
duke@435	560	const Type *Type::xmeet( const Type *t ) const {
duke@435	561	// Perform a fast test for common case; meeting the same types together.
duke@435	562	if( this == t ) return this; // Meeting same type-rep?
duke@435	563
duke@435	564	// Meeting TOP with anything?
duke@435	565	if( _base == Top ) return t;
duke@435	566
duke@435	567	// Meeting BOTTOM with anything?
duke@435	568	if( _base == Bottom ) return BOTTOM;
duke@435	569
duke@435	570	// Current "this->_base" is one of: Bad, Multi, Control, Top,
duke@435	571	// Abio, Abstore, Floatxxx, Doublexxx, Bottom, lastype.
duke@435	572	switch (t->base()) { // Switch on original type
duke@435	573
duke@435	574	// Cut in half the number of cases I must handle. Only need cases for when
duke@435	575	// the given enum "t->type" is less than or equal to the local enum "type".
duke@435	576	case FloatCon:
duke@435	577	case DoubleCon:
duke@435	578	case Int:
duke@435	579	case Long:
duke@435	580	return t->xmeet(this);
duke@435	581
duke@435	582	case OopPtr:
duke@435	583	return t->xmeet(this);
duke@435	584
duke@435	585	case InstPtr:
duke@435	586	return t->xmeet(this);
duke@435	587
duke@435	588	case KlassPtr:
duke@435	589	return t->xmeet(this);
duke@435	590
duke@435	591	case AryPtr:
duke@435	592	return t->xmeet(this);
duke@435	593
coleenp@548	594	case NarrowOop:
coleenp@548	595	return t->xmeet(this);
coleenp@548	596
duke@435	597	case Bad: // Type check
duke@435	598	default: // Bogus type not in lattice
duke@435	599	typerr(t);
duke@435	600	return Type::BOTTOM;
duke@435	601
duke@435	602	case Bottom: // Ye Olde Default
duke@435	603	return t;
duke@435	604
duke@435	605	case FloatTop:
duke@435	606	if( _base == FloatTop ) return this;
duke@435	607	case FloatBot: // Float
duke@435	608	if( _base == FloatBot || _base == FloatTop ) return FLOAT;
duke@435	609	if( _base == DoubleTop || _base == DoubleBot ) return Type::BOTTOM;
duke@435	610	typerr(t);
duke@435	611	return Type::BOTTOM;
duke@435	612
duke@435	613	case DoubleTop:
duke@435	614	if( _base == DoubleTop ) return this;
duke@435	615	case DoubleBot: // Double
duke@435	616	if( _base == DoubleBot || _base == DoubleTop ) return DOUBLE;
duke@435	617	if( _base == FloatTop || _base == FloatBot ) return Type::BOTTOM;
duke@435	618	typerr(t);
duke@435	619	return Type::BOTTOM;
duke@435	620
duke@435	621	// These next few cases must match exactly or it is a compile-time error.
duke@435	622	case Control: // Control of code
duke@435	623	case Abio: // State of world outside of program
duke@435	624	case Memory:
duke@435	625	if( _base == t->_base ) return this;
duke@435	626	typerr(t);
duke@435	627	return Type::BOTTOM;
duke@435	628
duke@435	629	case Top: // Top of the lattice
duke@435	630	return this;
duke@435	631	}
duke@435	632
duke@435	633	// The type is unchanged
duke@435	634	return this;
duke@435	635	}
duke@435	636
duke@435	637	//-----------------------------filter------------------------------------------
duke@435	638	const Type *Type::filter( const Type *kills ) const {
duke@435	639	const Type* ft = join(kills);
duke@435	640	if (ft->empty())
duke@435	641	return Type::TOP; // Canonical empty value
duke@435	642	return ft;
duke@435	643	}
duke@435	644
duke@435	645	//------------------------------xdual------------------------------------------
duke@435	646	// Compute dual right now.
duke@435	647	const Type::TYPES Type::dual_type[Type::lastype] = {
duke@435	648	Bad, // Bad
duke@435	649	Control, // Control
duke@435	650	Bottom, // Top
duke@435	651	Bad, // Int - handled in v-call
duke@435	652	Bad, // Long - handled in v-call
duke@435	653	Half, // Half
coleenp@548	654	Bad, // NarrowOop - handled in v-call
duke@435	655
duke@435	656	Bad, // Tuple - handled in v-call
duke@435	657	Bad, // Array - handled in v-call
duke@435	658
duke@435	659	Bad, // AnyPtr - handled in v-call
duke@435	660	Bad, // RawPtr - handled in v-call
duke@435	661	Bad, // OopPtr - handled in v-call
duke@435	662	Bad, // InstPtr - handled in v-call
duke@435	663	Bad, // AryPtr - handled in v-call
duke@435	664	Bad, // KlassPtr - handled in v-call
duke@435	665
duke@435	666	Bad, // Function - handled in v-call
duke@435	667	Abio, // Abio
duke@435	668	Return_Address,// Return_Address
duke@435	669	Memory, // Memory
duke@435	670	FloatBot, // FloatTop
duke@435	671	FloatCon, // FloatCon
duke@435	672	FloatTop, // FloatBot
duke@435	673	DoubleBot, // DoubleTop
duke@435	674	DoubleCon, // DoubleCon
duke@435	675	DoubleTop, // DoubleBot
duke@435	676	Top // Bottom
duke@435	677	};
duke@435	678
duke@435	679	const Type *Type::xdual() const {
duke@435	680	// Note: the base() accessor asserts the sanity of _base.
duke@435	681	assert(dual_type[base()] != Bad, "implement with v-call");
duke@435	682	return new Type(dual_type[_base]);
duke@435	683	}
duke@435	684
duke@435	685	//------------------------------has_memory-------------------------------------
duke@435	686	bool Type::has_memory() const {
duke@435	687	Type::TYPES tx = base();
duke@435	688	if (tx == Memory) return true;
duke@435	689	if (tx == Tuple) {
duke@435	690	const TypeTuple *t = is_tuple();
duke@435	691	for (uint i=0; i < t->cnt(); i++) {
duke@435	692	tx = t->field_at(i)->base();
duke@435	693	if (tx == Memory) return true;
duke@435	694	}
duke@435	695	}
duke@435	696	return false;
duke@435	697	}
duke@435	698
duke@435	699	#ifndef PRODUCT
duke@435	700	//------------------------------dump2------------------------------------------
duke@435	701	void Type::dump2( Dict &d, uint depth, outputStream *st ) const {
duke@435	702	st->print(msg[_base]);
duke@435	703	}
duke@435	704
duke@435	705	//------------------------------dump-------------------------------------------
duke@435	706	void Type::dump_on(outputStream *st) const {
duke@435	707	ResourceMark rm;
duke@435	708	Dict d(cmpkey,hashkey); // Stop recursive type dumping
duke@435	709	dump2(d,1, st);
kvn@598	710	if (is_ptr_to_narrowoop()) {
coleenp@548	711	st->print(" [narrow]");
coleenp@548	712	}
duke@435	713	}
duke@435	714
duke@435	715	//------------------------------data-------------------------------------------
duke@435	716	const char * const Type::msg[Type::lastype] = {
coleenp@548	717	"bad","control","top","int:","long:","half", "narrowoop:",
duke@435	718	"tuple:", "aryptr",
duke@435	719	"anyptr:", "rawptr:", "java:", "inst:", "ary:", "klass:",
duke@435	720	"func", "abIO", "return_address", "memory",
duke@435	721	"float_top", "ftcon:", "float",
duke@435	722	"double_top", "dblcon:", "double",
duke@435	723	"bottom"
duke@435	724	};
duke@435	725	#endif
duke@435	726
duke@435	727	//------------------------------singleton--------------------------------------
duke@435	728	// TRUE if Type is a singleton type, FALSE otherwise. Singletons are simple
duke@435	729	// constants (Ldi nodes). Singletons are integer, float or double constants.
duke@435	730	bool Type::singleton(void) const {
duke@435	731	return _base == Top || _base == Half;
duke@435	732	}
duke@435	733
duke@435	734	//------------------------------empty------------------------------------------
duke@435	735	// TRUE if Type is a type with no values, FALSE otherwise.
duke@435	736	bool Type::empty(void) const {
duke@435	737	switch (_base) {
duke@435	738	case DoubleTop:
duke@435	739	case FloatTop:
duke@435	740	case Top:
duke@435	741	return true;
duke@435	742
duke@435	743	case Half:
duke@435	744	case Abio:
duke@435	745	case Return_Address:
duke@435	746	case Memory:
duke@435	747	case Bottom:
duke@435	748	case FloatBot:
duke@435	749	case DoubleBot:
duke@435	750	return false; // never a singleton, therefore never empty
duke@435	751	}
duke@435	752
duke@435	753	ShouldNotReachHere();
duke@435	754	return false;
duke@435	755	}
duke@435	756
duke@435	757	//------------------------------dump_stats-------------------------------------
duke@435	758	// Dump collected statistics to stderr
duke@435	759	#ifndef PRODUCT
duke@435	760	void Type::dump_stats() {
duke@435	761	tty->print("Types made: %d\n", type_dict()->Size());
duke@435	762	}
duke@435	763	#endif
duke@435	764
duke@435	765	//------------------------------typerr-----------------------------------------
duke@435	766	void Type::typerr( const Type *t ) const {
duke@435	767	#ifndef PRODUCT
duke@435	768	tty->print("\nError mixing types: ");
duke@435	769	dump();
duke@435	770	tty->print(" and ");
duke@435	771	t->dump();
duke@435	772	tty->print("\n");
duke@435	773	#endif
duke@435	774	ShouldNotReachHere();
duke@435	775	}
duke@435	776
duke@435	777	//------------------------------isa_oop_ptr------------------------------------
duke@435	778	// Return true if type is an oop pointer type. False for raw pointers.
duke@435	779	static char isa_oop_ptr_tbl[Type::lastype] = {
coleenp@548	780	0,0,0,0,0,0,0/*narrowoop*/,0/*tuple*/, 0/*ary*/,
duke@435	781	0/*anyptr*/,0/*rawptr*/,1/*OopPtr*/,1/*InstPtr*/,1/*AryPtr*/,1/*KlassPtr*/,
duke@435	782	0/*func*/,0,0/*return_address*/,0,
duke@435	783	/*floats*/0,0,0, /*doubles*/0,0,0,
duke@435	784	0
duke@435	785	};
duke@435	786	bool Type::isa_oop_ptr() const {
duke@435	787	return isa_oop_ptr_tbl[_base] != 0;
duke@435	788	}
duke@435	789
duke@435	790	//------------------------------dump_stats-------------------------------------
duke@435	791	// // Check that arrays match type enum
duke@435	792	#ifndef PRODUCT
duke@435	793	void Type::verify_lastype() {
duke@435	794	// Check that arrays match enumeration
duke@435	795	assert( Type::dual_type [Type::lastype - 1] == Type::Top, "did not update array");
duke@435	796	assert( strcmp(Type::msg [Type::lastype - 1],"bottom") == 0, "did not update array");
duke@435	797	// assert( PhiNode::tbl [Type::lastype - 1] == NULL, "did not update array");
duke@435	798	assert( Matcher::base2reg[Type::lastype - 1] == 0, "did not update array");
duke@435	799	assert( isa_oop_ptr_tbl [Type::lastype - 1] == (char)0, "did not update array");
duke@435	800	}
duke@435	801	#endif
duke@435	802
duke@435	803	//=============================================================================
duke@435	804	// Convenience common pre-built types.
duke@435	805	const TypeF *TypeF::ZERO; // Floating point zero
duke@435	806	const TypeF *TypeF::ONE; // Floating point one
duke@435	807
duke@435	808	//------------------------------make-------------------------------------------
duke@435	809	// Create a float constant
duke@435	810	const TypeF *TypeF::make(float f) {
duke@435	811	return (TypeF*)(new TypeF(f))->hashcons();
duke@435	812	}
duke@435	813
duke@435	814	//------------------------------meet-------------------------------------------
duke@435	815	// Compute the MEET of two types. It returns a new Type object.
duke@435	816	const Type *TypeF::xmeet( const Type *t ) const {
duke@435	817	// Perform a fast test for common case; meeting the same types together.
duke@435	818	if( this == t ) return this; // Meeting same type-rep?
duke@435	819
duke@435	820	// Current "this->_base" is FloatCon
duke@435	821	switch (t->base()) { // Switch on original type
duke@435	822	case AnyPtr: // Mixing with oops happens when javac
duke@435	823	case RawPtr: // reuses local variables
duke@435	824	case OopPtr:
duke@435	825	case InstPtr:
duke@435	826	case KlassPtr:
duke@435	827	case AryPtr:
duke@435	828	case Int:
duke@435	829	case Long:
duke@435	830	case DoubleTop:
duke@435	831	case DoubleCon:
duke@435	832	case DoubleBot:
duke@435	833	case Bottom: // Ye Olde Default
duke@435	834	return Type::BOTTOM;
duke@435	835
duke@435	836	case FloatBot:
duke@435	837	return t;
duke@435	838
duke@435	839	default: // All else is a mistake
duke@435	840	typerr(t);
duke@435	841
duke@435	842	case FloatCon: // Float-constant vs Float-constant?
duke@435	843	if( jint_cast(_f) != jint_cast(t->getf()) ) // unequal constants?
duke@435	844	// must compare bitwise as positive zero, negative zero and NaN have
duke@435	845	// all the same representation in C++
duke@435	846	return FLOAT; // Return generic float
duke@435	847	// Equal constants
duke@435	848	case Top:
duke@435	849	case FloatTop:
duke@435	850	break; // Return the float constant
duke@435	851	}
duke@435	852	return this; // Return the float constant
duke@435	853	}
duke@435	854
duke@435	855	//------------------------------xdual------------------------------------------
duke@435	856	// Dual: symmetric
duke@435	857	const Type *TypeF::xdual() const {
duke@435	858	return this;
duke@435	859	}
duke@435	860
duke@435	861	//------------------------------eq---------------------------------------------
duke@435	862	// Structural equality check for Type representations
duke@435	863	bool TypeF::eq( const Type *t ) const {
duke@435	864	if( g_isnan(_f) ||
duke@435	865	g_isnan(t->getf()) ) {
duke@435	866	// One or both are NANs. If both are NANs return true, else false.
duke@435	867	return (g_isnan(_f) && g_isnan(t->getf()));
duke@435	868	}
duke@435	869	if (_f == t->getf()) {
duke@435	870	// (NaN is impossible at this point, since it is not equal even to itself)
duke@435	871	if (_f == 0.0) {
duke@435	872	// difference between positive and negative zero
duke@435	873	if (jint_cast(_f) != jint_cast(t->getf())) return false;
duke@435	874	}
duke@435	875	return true;
duke@435	876	}
duke@435	877	return false;
duke@435	878	}
duke@435	879
duke@435	880	//------------------------------hash-------------------------------------------
duke@435	881	// Type-specific hashing function.
duke@435	882	int TypeF::hash(void) const {
duke@435	883	return *(int*)(&_f);
duke@435	884	}
duke@435	885
duke@435	886	//------------------------------is_finite--------------------------------------
duke@435	887	// Has a finite value
duke@435	888	bool TypeF::is_finite() const {
duke@435	889	return g_isfinite(getf()) != 0;
duke@435	890	}
duke@435	891
duke@435	892	//------------------------------is_nan-----------------------------------------
duke@435	893	// Is not a number (NaN)
duke@435	894	bool TypeF::is_nan() const {
duke@435	895	return g_isnan(getf()) != 0;
duke@435	896	}
duke@435	897
duke@435	898	//------------------------------dump2------------------------------------------
duke@435	899	// Dump float constant Type
duke@435	900	#ifndef PRODUCT
duke@435	901	void TypeF::dump2( Dict &d, uint depth, outputStream *st ) const {
duke@435	902	Type::dump2(d,depth, st);
duke@435	903	st->print("%f", _f);
duke@435	904	}
duke@435	905	#endif
duke@435	906
duke@435	907	//------------------------------singleton--------------------------------------
duke@435	908	// TRUE if Type is a singleton type, FALSE otherwise. Singletons are simple
duke@435	909	// constants (Ldi nodes). Singletons are integer, float or double constants
duke@435	910	// or a single symbol.
duke@435	911	bool TypeF::singleton(void) const {
duke@435	912	return true; // Always a singleton
duke@435	913	}
duke@435	914
duke@435	915	bool TypeF::empty(void) const {
duke@435	916	return false; // always exactly a singleton
duke@435	917	}
duke@435	918
duke@435	919	//=============================================================================
duke@435	920	// Convenience common pre-built types.
duke@435	921	const TypeD *TypeD::ZERO; // Floating point zero
duke@435	922	const TypeD *TypeD::ONE; // Floating point one
duke@435	923
duke@435	924	//------------------------------make-------------------------------------------
duke@435	925	const TypeD *TypeD::make(double d) {
duke@435	926	return (TypeD*)(new TypeD(d))->hashcons();
duke@435	927	}
duke@435	928
duke@435	929	//------------------------------meet-------------------------------------------
duke@435	930	// Compute the MEET of two types. It returns a new Type object.
duke@435	931	const Type *TypeD::xmeet( const Type *t ) const {
duke@435	932	// Perform a fast test for common case; meeting the same types together.
duke@435	933	if( this == t ) return this; // Meeting same type-rep?
duke@435	934
duke@435	935	// Current "this->_base" is DoubleCon
duke@435	936	switch (t->base()) { // Switch on original type
duke@435	937	case AnyPtr: // Mixing with oops happens when javac
duke@435	938	case RawPtr: // reuses local variables
duke@435	939	case OopPtr:
duke@435	940	case InstPtr:
duke@435	941	case KlassPtr:
duke@435	942	case AryPtr:
never@618	943	case NarrowOop:
duke@435	944	case Int:
duke@435	945	case Long:
duke@435	946	case FloatTop:
duke@435	947	case FloatCon:
duke@435	948	case FloatBot:
duke@435	949	case Bottom: // Ye Olde Default
duke@435	950	return Type::BOTTOM;
duke@435	951
duke@435	952	case DoubleBot:
duke@435	953	return t;
duke@435	954
duke@435	955	default: // All else is a mistake
duke@435	956	typerr(t);
duke@435	957
duke@435	958	case DoubleCon: // Double-constant vs Double-constant?
duke@435	959	if( jlong_cast(_d) != jlong_cast(t->getd()) ) // unequal constants? (see comment in TypeF::xmeet)
duke@435	960	return DOUBLE; // Return generic double
duke@435	961	case Top:
duke@435	962	case DoubleTop:
duke@435	963	break;
duke@435	964	}
duke@435	965	return this; // Return the double constant
duke@435	966	}
duke@435	967
duke@435	968	//------------------------------xdual------------------------------------------
duke@435	969	// Dual: symmetric
duke@435	970	const Type *TypeD::xdual() const {
duke@435	971	return this;
duke@435	972	}
duke@435	973
duke@435	974	//------------------------------eq---------------------------------------------
duke@435	975	// Structural equality check for Type representations
duke@435	976	bool TypeD::eq( const Type *t ) const {
duke@435	977	if( g_isnan(_d) ||
duke@435	978	g_isnan(t->getd()) ) {
duke@435	979	// One or both are NANs. If both are NANs return true, else false.
duke@435	980	return (g_isnan(_d) && g_isnan(t->getd()));
duke@435	981	}
duke@435	982	if (_d == t->getd()) {
duke@435	983	// (NaN is impossible at this point, since it is not equal even to itself)
duke@435	984	if (_d == 0.0) {
duke@435	985	// difference between positive and negative zero
duke@435	986	if (jlong_cast(_d) != jlong_cast(t->getd())) return false;
duke@435	987	}
duke@435	988	return true;
duke@435	989	}
duke@435	990	return false;
duke@435	991	}
duke@435	992
duke@435	993	//------------------------------hash-------------------------------------------
duke@435	994	// Type-specific hashing function.
duke@435	995	int TypeD::hash(void) const {
duke@435	996	return *(int*)(&_d);
duke@435	997	}
duke@435	998
duke@435	999	//------------------------------is_finite--------------------------------------
duke@435	1000	// Has a finite value
duke@435	1001	bool TypeD::is_finite() const {
duke@435	1002	return g_isfinite(getd()) != 0;
duke@435	1003	}
duke@435	1004
duke@435	1005	//------------------------------is_nan-----------------------------------------
duke@435	1006	// Is not a number (NaN)
duke@435	1007	bool TypeD::is_nan() const {
duke@435	1008	return g_isnan(getd()) != 0;
duke@435	1009	}
duke@435	1010
duke@435	1011	//------------------------------dump2------------------------------------------
duke@435	1012	// Dump double constant Type
duke@435	1013	#ifndef PRODUCT
duke@435	1014	void TypeD::dump2( Dict &d, uint depth, outputStream *st ) const {
duke@435	1015	Type::dump2(d,depth,st);
duke@435	1016	st->print("%f", _d);
duke@435	1017	}
duke@435	1018	#endif
duke@435	1019
duke@435	1020	//------------------------------singleton--------------------------------------
duke@435	1021	// TRUE if Type is a singleton type, FALSE otherwise. Singletons are simple
duke@435	1022	// constants (Ldi nodes). Singletons are integer, float or double constants
duke@435	1023	// or a single symbol.
duke@435	1024	bool TypeD::singleton(void) const {
duke@435	1025	return true; // Always a singleton
duke@435	1026	}
duke@435	1027
duke@435	1028	bool TypeD::empty(void) const {
duke@435	1029	return false; // always exactly a singleton
duke@435	1030	}
duke@435	1031
duke@435	1032	//=============================================================================
duke@435	1033	// Convience common pre-built types.
duke@435	1034	const TypeInt *TypeInt::MINUS_1;// -1
duke@435	1035	const TypeInt *TypeInt::ZERO; // 0
duke@435	1036	const TypeInt *TypeInt::ONE; // 1
duke@435	1037	const TypeInt *TypeInt::BOOL; // 0 or 1, FALSE or TRUE.
duke@435	1038	const TypeInt *TypeInt::CC; // -1,0 or 1, condition codes
duke@435	1039	const TypeInt *TypeInt::CC_LT; // [-1] == MINUS_1
duke@435	1040	const TypeInt *TypeInt::CC_GT; // [1] == ONE
duke@435	1041	const TypeInt *TypeInt::CC_EQ; // [0] == ZERO
duke@435	1042	const TypeInt *TypeInt::CC_LE; // [-1,0]
duke@435	1043	const TypeInt *TypeInt::CC_GE; // [0,1] == BOOL (!)
duke@435	1044	const TypeInt *TypeInt::BYTE; // Bytes, -128 to 127
duke@435	1045	const TypeInt *TypeInt::CHAR; // Java chars, 0-65535
duke@435	1046	const TypeInt *TypeInt::SHORT; // Java shorts, -32768-32767
duke@435	1047	const TypeInt *TypeInt::POS; // Positive 32-bit integers or zero
duke@435	1048	const TypeInt *TypeInt::POS1; // Positive 32-bit integers
duke@435	1049	const TypeInt *TypeInt::INT; // 32-bit integers
duke@435	1050	const TypeInt *TypeInt::SYMINT; // symmetric range [-max_jint..max_jint]
duke@435	1051
duke@435	1052	//------------------------------TypeInt----------------------------------------
duke@435	1053	TypeInt::TypeInt( jint lo, jint hi, int w ) : Type(Int), _lo(lo), _hi(hi), _widen(w) {
duke@435	1054	}
duke@435	1055
duke@435	1056	//------------------------------make-------------------------------------------
duke@435	1057	const TypeInt *TypeInt::make( jint lo ) {
duke@435	1058	return (TypeInt*)(new TypeInt(lo,lo,WidenMin))->hashcons();
duke@435	1059	}
duke@435	1060
duke@435	1061	#define SMALLINT ((juint)3) // a value too insignificant to consider widening
duke@435	1062
duke@435	1063	const TypeInt *TypeInt::make( jint lo, jint hi, int w ) {
duke@435	1064	// Certain normalizations keep us sane when comparing types.
duke@435	1065	// The 'SMALLINT' covers constants and also CC and its relatives.
duke@435	1066	assert(CC == NULL || (juint)(CC->_hi - CC->_lo) <= SMALLINT, "CC is truly small");
duke@435	1067	if (lo <= hi) {
duke@435	1068	if ((juint)(hi - lo) <= SMALLINT) w = Type::WidenMin;
duke@435	1069	if ((juint)(hi - lo) >= max_juint) w = Type::WidenMax; // plain int
duke@435	1070	}
duke@435	1071	return (TypeInt*)(new TypeInt(lo,hi,w))->hashcons();
duke@435	1072	}
duke@435	1073
duke@435	1074	//------------------------------meet-------------------------------------------
duke@435	1075	// Compute the MEET of two types. It returns a new Type representation object
duke@435	1076	// with reference count equal to the number of Types pointing at it.
duke@435	1077	// Caller should wrap a Types around it.
duke@435	1078	const Type *TypeInt::xmeet( const Type *t ) const {
duke@435	1079	// Perform a fast test for common case; meeting the same types together.
duke@435	1080	if( this == t ) return this; // Meeting same type?
duke@435	1081
duke@435	1082	// Currently "this->_base" is a TypeInt
duke@435	1083	switch (t->base()) { // Switch on original type
duke@435	1084	case AnyPtr: // Mixing with oops happens when javac
duke@435	1085	case RawPtr: // reuses local variables
duke@435	1086	case OopPtr:
duke@435	1087	case InstPtr:
duke@435	1088	case KlassPtr:
duke@435	1089	case AryPtr:
never@618	1090	case NarrowOop:
duke@435	1091	case Long:
duke@435	1092	case FloatTop:
duke@435	1093	case FloatCon:
duke@435	1094	case FloatBot:
duke@435	1095	case DoubleTop:
duke@435	1096	case DoubleCon:
duke@435	1097	case DoubleBot:
duke@435	1098	case Bottom: // Ye Olde Default
duke@435	1099	return Type::BOTTOM;
duke@435	1100	default: // All else is a mistake
duke@435	1101	typerr(t);
duke@435	1102	case Top: // No change
duke@435	1103	return this;
duke@435	1104	case Int: // Int vs Int?
duke@435	1105	break;
duke@435	1106	}
duke@435	1107
duke@435	1108	// Expand covered set
duke@435	1109	const TypeInt *r = t->is_int();
duke@435	1110	// (Avoid TypeInt::make, to avoid the argument normalizations it enforces.)
duke@435	1111	return (new TypeInt( MIN2(_lo,r->_lo), MAX2(_hi,r->_hi), MAX2(_widen,r->_widen) ))->hashcons();
duke@435	1112	}
duke@435	1113
duke@435	1114	//------------------------------xdual------------------------------------------
duke@435	1115	// Dual: reverse hi & lo; flip widen
duke@435	1116	const Type *TypeInt::xdual() const {
duke@435	1117	return new TypeInt(_hi,_lo,WidenMax-_widen);
duke@435	1118	}
duke@435	1119
duke@435	1120	//------------------------------widen------------------------------------------
duke@435	1121	// Only happens for optimistic top-down optimizations.
duke@435	1122	const Type *TypeInt::widen( const Type *old ) const {
duke@435	1123	// Coming from TOP or such; no widening
duke@435	1124	if( old->base() != Int ) return this;
duke@435	1125	const TypeInt *ot = old->is_int();
duke@435	1126
duke@435	1127	// If new guy is equal to old guy, no widening
duke@435	1128	if( _lo == ot->_lo && _hi == ot->_hi )
duke@435	1129	return old;
duke@435	1130
duke@435	1131	// If new guy contains old, then we widened
duke@435	1132	if( _lo <= ot->_lo && _hi >= ot->_hi ) {
duke@435	1133	// New contains old
duke@435	1134	// If new guy is already wider than old, no widening
duke@435	1135	if( _widen > ot->_widen ) return this;
duke@435	1136	// If old guy was a constant, do not bother
duke@435	1137	if (ot->_lo == ot->_hi) return this;
duke@435	1138	// Now widen new guy.
duke@435	1139	// Check for widening too far
duke@435	1140	if (_widen == WidenMax) {
duke@435	1141	if (min_jint < _lo && _hi < max_jint) {
duke@435	1142	// If neither endpoint is extremal yet, push out the endpoint
duke@435	1143	// which is closer to its respective limit.
duke@435	1144	if (_lo >= 0 || // easy common case
duke@435	1145	(juint)(_lo - min_jint) >= (juint)(max_jint - _hi)) {
duke@435	1146	// Try to widen to an unsigned range type of 31 bits:
duke@435	1147	return make(_lo, max_jint, WidenMax);
duke@435	1148	} else {
duke@435	1149	return make(min_jint, _hi, WidenMax);
duke@435	1150	}
duke@435	1151	}
duke@435	1152	return TypeInt::INT;
duke@435	1153	}
duke@435	1154	// Returned widened new guy
duke@435	1155	return make(_lo,_hi,_widen+1);
duke@435	1156	}
duke@435	1157
duke@435	1158	// If old guy contains new, then we probably widened too far & dropped to
duke@435	1159	// bottom. Return the wider fellow.
duke@435	1160	if ( ot->_lo <= _lo && ot->_hi >= _hi )
duke@435	1161	return old;
duke@435	1162
duke@435	1163	//fatal("Integer value range is not subset");
duke@435	1164	//return this;
duke@435	1165	return TypeInt::INT;
duke@435	1166	}
duke@435	1167
duke@435	1168	//------------------------------narrow---------------------------------------
duke@435	1169	// Only happens for pessimistic optimizations.
duke@435	1170	const Type *TypeInt::narrow( const Type *old ) const {
duke@435	1171	if (_lo >= _hi) return this; // already narrow enough
duke@435	1172	if (old == NULL) return this;
duke@435	1173	const TypeInt* ot = old->isa_int();
duke@435	1174	if (ot == NULL) return this;
duke@435	1175	jint olo = ot->_lo;
duke@435	1176	jint ohi = ot->_hi;
duke@435	1177
duke@435	1178	// If new guy is equal to old guy, no narrowing
duke@435	1179	if (_lo == olo && _hi == ohi) return old;
duke@435	1180
duke@435	1181	// If old guy was maximum range, allow the narrowing
duke@435	1182	if (olo == min_jint && ohi == max_jint) return this;
duke@435	1183
duke@435	1184	if (_lo < olo || _hi > ohi)
duke@435	1185	return this; // doesn't narrow; pretty wierd
duke@435	1186
duke@435	1187	// The new type narrows the old type, so look for a "death march".
duke@435	1188	// See comments on PhaseTransform::saturate.
duke@435	1189	juint nrange = _hi - _lo;
duke@435	1190	juint orange = ohi - olo;
duke@435	1191	if (nrange < max_juint - 1 && nrange > (orange >> 1) + (SMALLINT*2)) {
duke@435	1192	// Use the new type only if the range shrinks a lot.
duke@435	1193	// We do not want the optimizer computing 2^31 point by point.
duke@435	1194	return old;
duke@435	1195	}
duke@435	1196
duke@435	1197	return this;
duke@435	1198	}
duke@435	1199
duke@435	1200	//-----------------------------filter------------------------------------------
duke@435	1201	const Type *TypeInt::filter( const Type *kills ) const {
duke@435	1202	const TypeInt* ft = join(kills)->isa_int();
duke@435	1203	if (ft == NULL || ft->_lo > ft->_hi)
duke@435	1204	return Type::TOP; // Canonical empty value
duke@435	1205	if (ft->_widen < this->_widen) {
duke@435	1206	// Do not allow the value of kill->_widen to affect the outcome.
duke@435	1207	// The widen bits must be allowed to run freely through the graph.
duke@435	1208	ft = TypeInt::make(ft->_lo, ft->_hi, this->_widen);
duke@435	1209	}
duke@435	1210	return ft;
duke@435	1211	}
duke@435	1212
duke@435	1213	//------------------------------eq---------------------------------------------
duke@435	1214	// Structural equality check for Type representations
duke@435	1215	bool TypeInt::eq( const Type *t ) const {
duke@435	1216	const TypeInt *r = t->is_int(); // Handy access
duke@435	1217	return r->_lo == _lo && r->_hi == _hi && r->_widen == _widen;
duke@435	1218	}
duke@435	1219
duke@435	1220	//------------------------------hash-------------------------------------------
duke@435	1221	// Type-specific hashing function.
duke@435	1222	int TypeInt::hash(void) const {
duke@435	1223	return _lo+_hi+_widen+(int)Type::Int;
duke@435	1224	}
duke@435	1225
duke@435	1226	//------------------------------is_finite--------------------------------------
duke@435	1227	// Has a finite value
duke@435	1228	bool TypeInt::is_finite() const {
duke@435	1229	return true;
duke@435	1230	}
duke@435	1231
duke@435	1232	//------------------------------dump2------------------------------------------
duke@435	1233	// Dump TypeInt
duke@435	1234	#ifndef PRODUCT
duke@435	1235	static const char* intname(char* buf, jint n) {
duke@435	1236	if (n == min_jint)
duke@435	1237	return "min";
duke@435	1238	else if (n < min_jint + 10000)
duke@435	1239	sprintf(buf, "min+" INT32_FORMAT, n - min_jint);
duke@435	1240	else if (n == max_jint)
duke@435	1241	return "max";
duke@435	1242	else if (n > max_jint - 10000)
duke@435	1243	sprintf(buf, "max-" INT32_FORMAT, max_jint - n);
duke@435	1244	else
duke@435	1245	sprintf(buf, INT32_FORMAT, n);
duke@435	1246	return buf;
duke@435	1247	}
duke@435	1248
duke@435	1249	void TypeInt::dump2( Dict &d, uint depth, outputStream *st ) const {
duke@435	1250	char buf[40], buf2[40];
duke@435	1251	if (_lo == min_jint && _hi == max_jint)
duke@435	1252	st->print("int");
duke@435	1253	else if (is_con())
duke@435	1254	st->print("int:%s", intname(buf, get_con()));
duke@435	1255	else if (_lo == BOOL->_lo && _hi == BOOL->_hi)
duke@435	1256	st->print("bool");
duke@435	1257	else if (_lo == BYTE->_lo && _hi == BYTE->_hi)
duke@435	1258	st->print("byte");
duke@435	1259	else if (_lo == CHAR->_lo && _hi == CHAR->_hi)
duke@435	1260	st->print("char");
duke@435	1261	else if (_lo == SHORT->_lo && _hi == SHORT->_hi)
duke@435	1262	st->print("short");
duke@435	1263	else if (_hi == max_jint)
duke@435	1264	st->print("int:>=%s", intname(buf, _lo));
duke@435	1265	else if (_lo == min_jint)
duke@435	1266	st->print("int:<=%s", intname(buf, _hi));
duke@435	1267	else
duke@435	1268	st->print("int:%s..%s", intname(buf, _lo), intname(buf2, _hi));
duke@435	1269
duke@435	1270	if (_widen != 0 && this != TypeInt::INT)
duke@435	1271	st->print(":%.*s", _widen, "wwww");
duke@435	1272	}
duke@435	1273	#endif
duke@435	1274
duke@435	1275	//------------------------------singleton--------------------------------------
duke@435	1276	// TRUE if Type is a singleton type, FALSE otherwise. Singletons are simple
duke@435	1277	// constants.
duke@435	1278	bool TypeInt::singleton(void) const {
duke@435	1279	return _lo >= _hi;
duke@435	1280	}
duke@435	1281
duke@435	1282	bool TypeInt::empty(void) const {
duke@435	1283	return _lo > _hi;
duke@435	1284	}
duke@435	1285
duke@435	1286	//=============================================================================
duke@435	1287	// Convenience common pre-built types.
duke@435	1288	const TypeLong *TypeLong::MINUS_1;// -1
duke@435	1289	const TypeLong *TypeLong::ZERO; // 0
duke@435	1290	const TypeLong *TypeLong::ONE; // 1
duke@435	1291	const TypeLong *TypeLong::POS; // >=0
duke@435	1292	const TypeLong *TypeLong::LONG; // 64-bit integers
duke@435	1293	const TypeLong *TypeLong::INT; // 32-bit subrange
duke@435	1294	const TypeLong *TypeLong::UINT; // 32-bit unsigned subrange
duke@435	1295
duke@435	1296	//------------------------------TypeLong---------------------------------------
duke@435	1297	TypeLong::TypeLong( jlong lo, jlong hi, int w ) : Type(Long), _lo(lo), _hi(hi), _widen(w) {
duke@435	1298	}
duke@435	1299
duke@435	1300	//------------------------------make-------------------------------------------
duke@435	1301	const TypeLong *TypeLong::make( jlong lo ) {
duke@435	1302	return (TypeLong*)(new TypeLong(lo,lo,WidenMin))->hashcons();
duke@435	1303	}
duke@435	1304
duke@435	1305	const TypeLong *TypeLong::make( jlong lo, jlong hi, int w ) {
duke@435	1306	// Certain normalizations keep us sane when comparing types.
duke@435	1307	// The '1' covers constants.
duke@435	1308	if (lo <= hi) {
duke@435	1309	if ((julong)(hi - lo) <= SMALLINT) w = Type::WidenMin;
duke@435	1310	if ((julong)(hi - lo) >= max_julong) w = Type::WidenMax; // plain long
duke@435	1311	}
duke@435	1312	return (TypeLong*)(new TypeLong(lo,hi,w))->hashcons();
duke@435	1313	}
duke@435	1314
duke@435	1315
duke@435	1316	//------------------------------meet-------------------------------------------
duke@435	1317	// Compute the MEET of two types. It returns a new Type representation object
duke@435	1318	// with reference count equal to the number of Types pointing at it.
duke@435	1319	// Caller should wrap a Types around it.
duke@435	1320	const Type *TypeLong::xmeet( const Type *t ) const {
duke@435	1321	// Perform a fast test for common case; meeting the same types together.
duke@435	1322	if( this == t ) return this; // Meeting same type?
duke@435	1323
duke@435	1324	// Currently "this->_base" is a TypeLong
duke@435	1325	switch (t->base()) { // Switch on original type
duke@435	1326	case AnyPtr: // Mixing with oops happens when javac
duke@435	1327	case RawPtr: // reuses local variables
duke@435	1328	case OopPtr:
duke@435	1329	case InstPtr:
duke@435	1330	case KlassPtr:
duke@435	1331	case AryPtr:
never@618	1332	case NarrowOop:
duke@435	1333	case Int:
duke@435	1334	case FloatTop:
duke@435	1335	case FloatCon:
duke@435	1336	case FloatBot:
duke@435	1337	case DoubleTop:
duke@435	1338	case DoubleCon:
duke@435	1339	case DoubleBot:
duke@435	1340	case Bottom: // Ye Olde Default
duke@435	1341	return Type::BOTTOM;
duke@435	1342	default: // All else is a mistake
duke@435	1343	typerr(t);
duke@435	1344	case Top: // No change
duke@435	1345	return this;
duke@435	1346	case Long: // Long vs Long?
duke@435	1347	break;
duke@435	1348	}
duke@435	1349
duke@435	1350	// Expand covered set
duke@435	1351	const TypeLong *r = t->is_long(); // Turn into a TypeLong
duke@435	1352	// (Avoid TypeLong::make, to avoid the argument normalizations it enforces.)
duke@435	1353	return (new TypeLong( MIN2(_lo,r->_lo), MAX2(_hi,r->_hi), MAX2(_widen,r->_widen) ))->hashcons();
duke@435	1354	}
duke@435	1355
duke@435	1356	//------------------------------xdual------------------------------------------
duke@435	1357	// Dual: reverse hi & lo; flip widen
duke@435	1358	const Type *TypeLong::xdual() const {
duke@435	1359	return new TypeLong(_hi,_lo,WidenMax-_widen);
duke@435	1360	}
duke@435	1361
duke@435	1362	//------------------------------widen------------------------------------------
duke@435	1363	// Only happens for optimistic top-down optimizations.
duke@435	1364	const Type *TypeLong::widen( const Type *old ) const {
duke@435	1365	// Coming from TOP or such; no widening
duke@435	1366	if( old->base() != Long ) return this;
duke@435	1367	const TypeLong *ot = old->is_long();
duke@435	1368
duke@435	1369	// If new guy is equal to old guy, no widening
duke@435	1370	if( _lo == ot->_lo && _hi == ot->_hi )
duke@435	1371	return old;
duke@435	1372
duke@435	1373	// If new guy contains old, then we widened
duke@435	1374	if( _lo <= ot->_lo && _hi >= ot->_hi ) {
duke@435	1375	// New contains old
duke@435	1376	// If new guy is already wider than old, no widening
duke@435	1377	if( _widen > ot->_widen ) return this;
duke@435	1378	// If old guy was a constant, do not bother
duke@435	1379	if (ot->_lo == ot->_hi) return this;
duke@435	1380	// Now widen new guy.
duke@435	1381	// Check for widening too far
duke@435	1382	if (_widen == WidenMax) {
duke@435	1383	if (min_jlong < _lo && _hi < max_jlong) {
duke@435	1384	// If neither endpoint is extremal yet, push out the endpoint
duke@435	1385	// which is closer to its respective limit.
duke@435	1386	if (_lo >= 0 || // easy common case
duke@435	1387	(julong)(_lo - min_jlong) >= (julong)(max_jlong - _hi)) {
duke@435	1388	// Try to widen to an unsigned range type of 32/63 bits:
duke@435	1389	if (_hi < max_juint)
duke@435	1390	return make(_lo, max_juint, WidenMax);
duke@435	1391	else
duke@435	1392	return make(_lo, max_jlong, WidenMax);
duke@435	1393	} else {
duke@435	1394	return make(min_jlong, _hi, WidenMax);
duke@435	1395	}
duke@435	1396	}
duke@435	1397	return TypeLong::LONG;
duke@435	1398	}
duke@435	1399	// Returned widened new guy
duke@435	1400	return make(_lo,_hi,_widen+1);
duke@435	1401	}
duke@435	1402
duke@435	1403	// If old guy contains new, then we probably widened too far & dropped to
duke@435	1404	// bottom. Return the wider fellow.
duke@435	1405	if ( ot->_lo <= _lo && ot->_hi >= _hi )
duke@435	1406	return old;
duke@435	1407
duke@435	1408	// fatal("Long value range is not subset");
duke@435	1409	// return this;
duke@435	1410	return TypeLong::LONG;
duke@435	1411	}
duke@435	1412
duke@435	1413	//------------------------------narrow----------------------------------------
duke@435	1414	// Only happens for pessimistic optimizations.
duke@435	1415	const Type *TypeLong::narrow( const Type *old ) const {
duke@435	1416	if (_lo >= _hi) return this; // already narrow enough
duke@435	1417	if (old == NULL) return this;
duke@435	1418	const TypeLong* ot = old->isa_long();
duke@435	1419	if (ot == NULL) return this;
duke@435	1420	jlong olo = ot->_lo;
duke@435	1421	jlong ohi = ot->_hi;
duke@435	1422
duke@435	1423	// If new guy is equal to old guy, no narrowing
duke@435	1424	if (_lo == olo && _hi == ohi) return old;
duke@435	1425
duke@435	1426	// If old guy was maximum range, allow the narrowing
duke@435	1427	if (olo == min_jlong && ohi == max_jlong) return this;
duke@435	1428
duke@435	1429	if (_lo < olo || _hi > ohi)
duke@435	1430	return this; // doesn't narrow; pretty wierd
duke@435	1431
duke@435	1432	// The new type narrows the old type, so look for a "death march".
duke@435	1433	// See comments on PhaseTransform::saturate.
duke@435	1434	julong nrange = _hi - _lo;
duke@435	1435	julong orange = ohi - olo;
duke@435	1436	if (nrange < max_julong - 1 && nrange > (orange >> 1) + (SMALLINT*2)) {
duke@435	1437	// Use the new type only if the range shrinks a lot.
duke@435	1438	// We do not want the optimizer computing 2^31 point by point.
duke@435	1439	return old;
duke@435	1440	}
duke@435	1441
duke@435	1442	return this;
duke@435	1443	}
duke@435	1444
duke@435	1445	//-----------------------------filter------------------------------------------
duke@435	1446	const Type *TypeLong::filter( const Type *kills ) const {
duke@435	1447	const TypeLong* ft = join(kills)->isa_long();
duke@435	1448	if (ft == NULL || ft->_lo > ft->_hi)
duke@435	1449	return Type::TOP; // Canonical empty value
duke@435	1450	if (ft->_widen < this->_widen) {
duke@435	1451	// Do not allow the value of kill->_widen to affect the outcome.
duke@435	1452	// The widen bits must be allowed to run freely through the graph.
duke@435	1453	ft = TypeLong::make(ft->_lo, ft->_hi, this->_widen);
duke@435	1454	}
duke@435	1455	return ft;
duke@435	1456	}
duke@435	1457
duke@435	1458	//------------------------------eq---------------------------------------------
duke@435	1459	// Structural equality check for Type representations
duke@435	1460	bool TypeLong::eq( const Type *t ) const {
duke@435	1461	const TypeLong *r = t->is_long(); // Handy access
duke@435	1462	return r->_lo == _lo && r->_hi == _hi && r->_widen == _widen;
duke@435	1463	}
duke@435	1464
duke@435	1465	//------------------------------hash-------------------------------------------
duke@435	1466	// Type-specific hashing function.
duke@435	1467	int TypeLong::hash(void) const {
duke@435	1468	return (int)(_lo+_hi+_widen+(int)Type::Long);
duke@435	1469	}
duke@435	1470
duke@435	1471	//------------------------------is_finite--------------------------------------
duke@435	1472	// Has a finite value
duke@435	1473	bool TypeLong::is_finite() const {
duke@435	1474	return true;
duke@435	1475	}
duke@435	1476
duke@435	1477	//------------------------------dump2------------------------------------------
duke@435	1478	// Dump TypeLong
duke@435	1479	#ifndef PRODUCT
duke@435	1480	static const char* longnamenear(jlong x, const char* xname, char* buf, jlong n) {
duke@435	1481	if (n > x) {
duke@435	1482	if (n >= x + 10000) return NULL;
duke@435	1483	sprintf(buf, "%s+" INT64_FORMAT, xname, n - x);
duke@435	1484	} else if (n < x) {
duke@435	1485	if (n <= x - 10000) return NULL;
duke@435	1486	sprintf(buf, "%s-" INT64_FORMAT, xname, x - n);
duke@435	1487	} else {
duke@435	1488	return xname;
duke@435	1489	}
duke@435	1490	return buf;
duke@435	1491	}
duke@435	1492
duke@435	1493	static const char* longname(char* buf, jlong n) {
duke@435	1494	const char* str;
duke@435	1495	if (n == min_jlong)
duke@435	1496	return "min";
duke@435	1497	else if (n < min_jlong + 10000)
duke@435	1498	sprintf(buf, "min+" INT64_FORMAT, n - min_jlong);
duke@435	1499	else if (n == max_jlong)
duke@435	1500	return "max";
duke@435	1501	else if (n > max_jlong - 10000)
duke@435	1502	sprintf(buf, "max-" INT64_FORMAT, max_jlong - n);
duke@435	1503	else if ((str = longnamenear(max_juint, "maxuint", buf, n)) != NULL)
duke@435	1504	return str;
duke@435	1505	else if ((str = longnamenear(max_jint, "maxint", buf, n)) != NULL)
duke@435	1506	return str;
duke@435	1507	else if ((str = longnamenear(min_jint, "minint", buf, n)) != NULL)
duke@435	1508	return str;
duke@435	1509	else
duke@435	1510	sprintf(buf, INT64_FORMAT, n);
duke@435	1511	return buf;
duke@435	1512	}
duke@435	1513
duke@435	1514	void TypeLong::dump2( Dict &d, uint depth, outputStream *st ) const {
duke@435	1515	char buf[80], buf2[80];
duke@435	1516	if (_lo == min_jlong && _hi == max_jlong)
duke@435	1517	st->print("long");
duke@435	1518	else if (is_con())
duke@435	1519	st->print("long:%s", longname(buf, get_con()));
duke@435	1520	else if (_hi == max_jlong)
duke@435	1521	st->print("long:>=%s", longname(buf, _lo));
duke@435	1522	else if (_lo == min_jlong)
duke@435	1523	st->print("long:<=%s", longname(buf, _hi));
duke@435	1524	else
duke@435	1525	st->print("long:%s..%s", longname(buf, _lo), longname(buf2, _hi));
duke@435	1526
duke@435	1527	if (_widen != 0 && this != TypeLong::LONG)
duke@435	1528	st->print(":%.*s", _widen, "wwww");
duke@435	1529	}
duke@435	1530	#endif
duke@435	1531
duke@435	1532	//------------------------------singleton--------------------------------------
duke@435	1533	// TRUE if Type is a singleton type, FALSE otherwise. Singletons are simple
duke@435	1534	// constants
duke@435	1535	bool TypeLong::singleton(void) const {
duke@435	1536	return _lo >= _hi;
duke@435	1537	}
duke@435	1538
duke@435	1539	bool TypeLong::empty(void) const {
duke@435	1540	return _lo > _hi;
duke@435	1541	}
duke@435	1542
duke@435	1543	//=============================================================================
duke@435	1544	// Convenience common pre-built types.
duke@435	1545	const TypeTuple *TypeTuple::IFBOTH; // Return both arms of IF as reachable
duke@435	1546	const TypeTuple *TypeTuple::IFFALSE;
duke@435	1547	const TypeTuple *TypeTuple::IFTRUE;
duke@435	1548	const TypeTuple *TypeTuple::IFNEITHER;
duke@435	1549	const TypeTuple *TypeTuple::LOOPBODY;
duke@435	1550	const TypeTuple *TypeTuple::MEMBAR;
duke@435	1551	const TypeTuple *TypeTuple::STORECONDITIONAL;
duke@435	1552	const TypeTuple *TypeTuple::START_I2C;
duke@435	1553	const TypeTuple *TypeTuple::INT_PAIR;
duke@435	1554	const TypeTuple *TypeTuple::LONG_PAIR;
duke@435	1555
duke@435	1556
duke@435	1557	//------------------------------make-------------------------------------------
duke@435	1558	// Make a TypeTuple from the range of a method signature
duke@435	1559	const TypeTuple *TypeTuple::make_range(ciSignature* sig) {
duke@435	1560	ciType* return_type = sig->return_type();
duke@435	1561	uint total_fields = TypeFunc::Parms + return_type->size();
duke@435	1562	const Type **field_array = fields(total_fields);
duke@435	1563	switch (return_type->basic_type()) {
duke@435	1564	case T_LONG:
duke@435	1565	field_array[TypeFunc::Parms] = TypeLong::LONG;
duke@435	1566	field_array[TypeFunc::Parms+1] = Type::HALF;
duke@435	1567	break;
duke@435	1568	case T_DOUBLE:
duke@435	1569	field_array[TypeFunc::Parms] = Type::DOUBLE;
duke@435	1570	field_array[TypeFunc::Parms+1] = Type::HALF;
duke@435	1571	break;
duke@435	1572	case T_OBJECT:
duke@435	1573	case T_ARRAY:
duke@435	1574	case T_BOOLEAN:
duke@435	1575	case T_CHAR:
duke@435	1576	case T_FLOAT:
duke@435	1577	case T_BYTE:
duke@435	1578	case T_SHORT:
duke@435	1579	case T_INT:
duke@435	1580	field_array[TypeFunc::Parms] = get_const_type(return_type);
duke@435	1581	break;
duke@435	1582	case T_VOID:
duke@435	1583	break;
duke@435	1584	default:
duke@435	1585	ShouldNotReachHere();
duke@435	1586	}
duke@435	1587	return (TypeTuple*)(new TypeTuple(total_fields,field_array))->hashcons();
duke@435	1588	}
duke@435	1589
duke@435	1590	// Make a TypeTuple from the domain of a method signature
duke@435	1591	const TypeTuple *TypeTuple::make_domain(ciInstanceKlass* recv, ciSignature* sig) {
duke@435	1592	uint total_fields = TypeFunc::Parms + sig->size();
duke@435	1593
duke@435	1594	uint pos = TypeFunc::Parms;
duke@435	1595	const Type **field_array;
duke@435	1596	if (recv != NULL) {
duke@435	1597	total_fields++;
duke@435	1598	field_array = fields(total_fields);
duke@435	1599	// Use get_const_type here because it respects UseUniqueSubclasses:
duke@435	1600	field_array[pos++] = get_const_type(recv)->join(TypePtr::NOTNULL);
duke@435	1601	} else {
duke@435	1602	field_array = fields(total_fields);
duke@435	1603	}
duke@435	1604
duke@435	1605	int i = 0;
duke@435	1606	while (pos < total_fields) {
duke@435	1607	ciType* type = sig->type_at(i);
duke@435	1608
duke@435	1609	switch (type->basic_type()) {
duke@435	1610	case T_LONG:
duke@435	1611	field_array[pos++] = TypeLong::LONG;
duke@435	1612	field_array[pos++] = Type::HALF;
duke@435	1613	break;
duke@435	1614	case T_DOUBLE:
duke@435	1615	field_array[pos++] = Type::DOUBLE;
duke@435	1616	field_array[pos++] = Type::HALF;
duke@435	1617	break;
duke@435	1618	case T_OBJECT:
duke@435	1619	case T_ARRAY:
duke@435	1620	case T_BOOLEAN:
duke@435	1621	case T_CHAR:
duke@435	1622	case T_FLOAT:
duke@435	1623	case T_BYTE:
duke@435	1624	case T_SHORT:
duke@435	1625	case T_INT:
duke@435	1626	field_array[pos++] = get_const_type(type);
duke@435	1627	break;
duke@435	1628	default:
duke@435	1629	ShouldNotReachHere();
duke@435	1630	}
duke@435	1631	i++;
duke@435	1632	}
duke@435	1633	return (TypeTuple*)(new TypeTuple(total_fields,field_array))->hashcons();
duke@435	1634	}
duke@435	1635
duke@435	1636	const TypeTuple *TypeTuple::make( uint cnt, const Type **fields ) {
duke@435	1637	return (TypeTuple*)(new TypeTuple(cnt,fields))->hashcons();
duke@435	1638	}
duke@435	1639
duke@435	1640	//------------------------------fields-----------------------------------------
duke@435	1641	// Subroutine call type with space allocated for argument types
duke@435	1642	const Type **TypeTuple::fields( uint arg_cnt ) {
duke@435	1643	const Type **flds = (const Type **)(Compile::current()->type_arena()->Amalloc_4((TypeFunc::Parms+arg_cnt)*sizeof(Type*) ));
duke@435	1644	flds[TypeFunc::Control ] = Type::CONTROL;
duke@435	1645	flds[TypeFunc::I_O ] = Type::ABIO;
duke@435	1646	flds[TypeFunc::Memory ] = Type::MEMORY;
duke@435	1647	flds[TypeFunc::FramePtr ] = TypeRawPtr::BOTTOM;
duke@435	1648	flds[TypeFunc::ReturnAdr] = Type::RETURN_ADDRESS;
duke@435	1649
duke@435	1650	return flds;
duke@435	1651	}
duke@435	1652
duke@435	1653	//------------------------------meet-------------------------------------------
duke@435	1654	// Compute the MEET of two types. It returns a new Type object.
duke@435	1655	const Type *TypeTuple::xmeet( const Type *t ) const {
duke@435	1656	// Perform a fast test for common case; meeting the same types together.
duke@435	1657	if( this == t ) return this; // Meeting same type-rep?
duke@435	1658
duke@435	1659	// Current "this->_base" is Tuple
duke@435	1660	switch (t->base()) { // switch on original type
duke@435	1661
duke@435	1662	case Bottom: // Ye Olde Default
duke@435	1663	return t;
duke@435	1664
duke@435	1665	default: // All else is a mistake
duke@435	1666	typerr(t);
duke@435	1667
duke@435	1668	case Tuple: { // Meeting 2 signatures?
duke@435	1669	const TypeTuple *x = t->is_tuple();
duke@435	1670	assert( _cnt == x->_cnt, "" );
duke@435	1671	const Type **fields = (const Type **)(Compile::current()->type_arena()->Amalloc_4( _cnt*sizeof(Type*) ));
duke@435	1672	for( uint i=0; i<_cnt; i++ )
duke@435	1673	fields[i] = field_at(i)->xmeet( x->field_at(i) );
duke@435	1674	return TypeTuple::make(_cnt,fields);
duke@435	1675	}
duke@435	1676	case Top:
duke@435	1677	break;
duke@435	1678	}
duke@435	1679	return this; // Return the double constant
duke@435	1680	}
duke@435	1681
duke@435	1682	//------------------------------xdual------------------------------------------
duke@435	1683	// Dual: compute field-by-field dual
duke@435	1684	const Type *TypeTuple::xdual() const {
duke@435	1685	const Type **fields = (const Type **)(Compile::current()->type_arena()->Amalloc_4( _cnt*sizeof(Type*) ));
duke@435	1686	for( uint i=0; i<_cnt; i++ )
duke@435	1687	fields[i] = _fields[i]->dual();
duke@435	1688	return new TypeTuple(_cnt,fields);
duke@435	1689	}
duke@435	1690
duke@435	1691	//------------------------------eq---------------------------------------------
duke@435	1692	// Structural equality check for Type representations
duke@435	1693	bool TypeTuple::eq( const Type *t ) const {
duke@435	1694	const TypeTuple *s = (const TypeTuple *)t;
duke@435	1695	if (_cnt != s->_cnt) return false; // Unequal field counts
duke@435	1696	for (uint i = 0; i < _cnt; i++)
duke@435	1697	if (field_at(i) != s->field_at(i)) // POINTER COMPARE! NO RECURSION!
duke@435	1698	return false; // Missed
duke@435	1699	return true;
duke@435	1700	}
duke@435	1701
duke@435	1702	//------------------------------hash-------------------------------------------
duke@435	1703	// Type-specific hashing function.
duke@435	1704	int TypeTuple::hash(void) const {
duke@435	1705	intptr_t sum = _cnt;
duke@435	1706	for( uint i=0; i<_cnt; i++ )
duke@435	1707	sum += (intptr_t)_fields[i]; // Hash on pointers directly
duke@435	1708	return sum;
duke@435	1709	}
duke@435	1710
duke@435	1711	//------------------------------dump2------------------------------------------
duke@435	1712	// Dump signature Type
duke@435	1713	#ifndef PRODUCT
duke@435	1714	void TypeTuple::dump2( Dict &d, uint depth, outputStream *st ) const {
duke@435	1715	st->print("{");
duke@435	1716	if( !depth || d[this] ) { // Check for recursive print
duke@435	1717	st->print("...}");
duke@435	1718	return;
duke@435	1719	}
duke@435	1720	d.Insert((void*)this, (void*)this); // Stop recursion
duke@435	1721	if( _cnt ) {
duke@435	1722	uint i;
duke@435	1723	for( i=0; i<_cnt-1; i++ ) {
duke@435	1724	st->print("%d:", i);
duke@435	1725	_fields[i]->dump2(d, depth-1, st);
duke@435	1726	st->print(", ");
duke@435	1727	}
duke@435	1728	st->print("%d:", i);
duke@435	1729	_fields[i]->dump2(d, depth-1, st);
duke@435	1730	}
duke@435	1731	st->print("}");
duke@435	1732	}
duke@435	1733	#endif
duke@435	1734
duke@435	1735	//------------------------------singleton--------------------------------------
duke@435	1736	// TRUE if Type is a singleton type, FALSE otherwise. Singletons are simple
duke@435	1737	// constants (Ldi nodes). Singletons are integer, float or double constants
duke@435	1738	// or a single symbol.
duke@435	1739	bool TypeTuple::singleton(void) const {
duke@435	1740	return false; // Never a singleton
duke@435	1741	}
duke@435	1742
duke@435	1743	bool TypeTuple::empty(void) const {
duke@435	1744	for( uint i=0; i<_cnt; i++ ) {
duke@435	1745	if (_fields[i]->empty()) return true;
duke@435	1746	}
duke@435	1747	return false;
duke@435	1748	}
duke@435	1749
duke@435	1750	//=============================================================================
duke@435	1751	// Convenience common pre-built types.
duke@435	1752
duke@435	1753	inline const TypeInt* normalize_array_size(const TypeInt* size) {
duke@435	1754	// Certain normalizations keep us sane when comparing types.
duke@435	1755	// We do not want arrayOop variables to differ only by the wideness
duke@435	1756	// of their index types. Pick minimum wideness, since that is the
duke@435	1757	// forced wideness of small ranges anyway.
duke@435	1758	if (size->_widen != Type::WidenMin)
duke@435	1759	return TypeInt::make(size->_lo, size->_hi, Type::WidenMin);
duke@435	1760	else
duke@435	1761	return size;
duke@435	1762	}
duke@435	1763
duke@435	1764	//------------------------------make-------------------------------------------
duke@435	1765	const TypeAry *TypeAry::make( const Type *elem, const TypeInt *size) {
coleenp@548	1766	if (UseCompressedOops && elem->isa_oopptr()) {
coleenp@548	1767	elem = elem->is_oopptr()->make_narrowoop();
coleenp@548	1768	}
duke@435	1769	size = normalize_array_size(size);
duke@435	1770	return (TypeAry*)(new TypeAry(elem,size))->hashcons();
duke@435	1771	}
duke@435	1772
duke@435	1773	//------------------------------meet-------------------------------------------
duke@435	1774	// Compute the MEET of two types. It returns a new Type object.
duke@435	1775	const Type *TypeAry::xmeet( const Type *t ) const {
duke@435	1776	// Perform a fast test for common case; meeting the same types together.
duke@435	1777	if( this == t ) return this; // Meeting same type-rep?
duke@435	1778
duke@435	1779	// Current "this->_base" is Ary
duke@435	1780	switch (t->base()) { // switch on original type
duke@435	1781
duke@435	1782	case Bottom: // Ye Olde Default
duke@435	1783	return t;
duke@435	1784
duke@435	1785	default: // All else is a mistake
duke@435	1786	typerr(t);
duke@435	1787
duke@435	1788	case Array: { // Meeting 2 arrays?
duke@435	1789	const TypeAry *a = t->is_ary();
duke@435	1790	return TypeAry::make(_elem->meet(a->_elem),
duke@435	1791	_size->xmeet(a->_size)->is_int());
duke@435	1792	}
duke@435	1793	case Top:
duke@435	1794	break;
duke@435	1795	}
duke@435	1796	return this; // Return the double constant
duke@435	1797	}
duke@435	1798
duke@435	1799	//------------------------------xdual------------------------------------------
duke@435	1800	// Dual: compute field-by-field dual
duke@435	1801	const Type *TypeAry::xdual() const {
duke@435	1802	const TypeInt* size_dual = _size->dual()->is_int();
duke@435	1803	size_dual = normalize_array_size(size_dual);
duke@435	1804	return new TypeAry( _elem->dual(), size_dual);
duke@435	1805	}
duke@435	1806
duke@435	1807	//------------------------------eq---------------------------------------------
duke@435	1808	// Structural equality check for Type representations
duke@435	1809	bool TypeAry::eq( const Type *t ) const {
duke@435	1810	const TypeAry *a = (const TypeAry*)t;
duke@435	1811	return _elem == a->_elem &&
duke@435	1812	_size == a->_size;
duke@435	1813	}
duke@435	1814
duke@435	1815	//------------------------------hash-------------------------------------------
duke@435	1816	// Type-specific hashing function.
duke@435	1817	int TypeAry::hash(void) const {
duke@435	1818	return (intptr_t)_elem + (intptr_t)_size;
duke@435	1819	}
duke@435	1820
duke@435	1821	//------------------------------dump2------------------------------------------
duke@435	1822	#ifndef PRODUCT
duke@435	1823	void TypeAry::dump2( Dict &d, uint depth, outputStream *st ) const {
duke@435	1824	_elem->dump2(d, depth, st);
duke@435	1825	st->print("[");
duke@435	1826	_size->dump2(d, depth, st);
duke@435	1827	st->print("]");
duke@435	1828	}
duke@435	1829	#endif
duke@435	1830
duke@435	1831	//------------------------------singleton--------------------------------------
duke@435	1832	// TRUE if Type is a singleton type, FALSE otherwise. Singletons are simple
duke@435	1833	// constants (Ldi nodes). Singletons are integer, float or double constants
duke@435	1834	// or a single symbol.
duke@435	1835	bool TypeAry::singleton(void) const {
duke@435	1836	return false; // Never a singleton
duke@435	1837	}
duke@435	1838
duke@435	1839	bool TypeAry::empty(void) const {
duke@435	1840	return _elem->empty() || _size->empty();
duke@435	1841	}
duke@435	1842
duke@435	1843	//--------------------------ary_must_be_exact----------------------------------
duke@435	1844	bool TypeAry::ary_must_be_exact() const {
duke@435	1845	if (!UseExactTypes) return false;
duke@435	1846	// This logic looks at the element type of an array, and returns true
duke@435	1847	// if the element type is either a primitive or a final instance class.
duke@435	1848	// In such cases, an array built on this ary must have no subclasses.
duke@435	1849	if (_elem == BOTTOM) return false; // general array not exact
duke@435	1850	if (_elem == TOP ) return false; // inverted general array not exact
coleenp@548	1851	const TypeOopPtr* toop = NULL;
coleenp@548	1852	if (UseCompressedOops) {
coleenp@548	1853	const TypeNarrowOop* noop = _elem->isa_narrowoop();
coleenp@548	1854	if (noop) toop = noop->make_oopptr()->isa_oopptr();
coleenp@548	1855	} else {
coleenp@548	1856	toop = _elem->isa_oopptr();
coleenp@548	1857	}
duke@435	1858	if (!toop) return true; // a primitive type, like int
duke@435	1859	ciKlass* tklass = toop->klass();
duke@435	1860	if (tklass == NULL) return false; // unloaded class
duke@435	1861	if (!tklass->is_loaded()) return false; // unloaded class
coleenp@548	1862	const TypeInstPtr* tinst;
coleenp@548	1863	if (_elem->isa_narrowoop())
coleenp@548	1864	tinst = _elem->is_narrowoop()->make_oopptr()->isa_instptr();
coleenp@548	1865	else
coleenp@548	1866	tinst = _elem->isa_instptr();
duke@435	1867	if (tinst) return tklass->as_instance_klass()->is_final();
coleenp@548	1868	const TypeAryPtr* tap;
coleenp@548	1869	if (_elem->isa_narrowoop())
coleenp@548	1870	tap = _elem->is_narrowoop()->make_oopptr()->isa_aryptr();
coleenp@548	1871	else
coleenp@548	1872	tap = _elem->isa_aryptr();
duke@435	1873	if (tap) return tap->ary()->ary_must_be_exact();
duke@435	1874	return false;
duke@435	1875	}
duke@435	1876
duke@435	1877	//=============================================================================
duke@435	1878	// Convenience common pre-built types.
duke@435	1879	const TypePtr *TypePtr::NULL_PTR;
duke@435	1880	const TypePtr *TypePtr::NOTNULL;
duke@435	1881	const TypePtr *TypePtr::BOTTOM;
duke@435	1882
duke@435	1883	//------------------------------meet-------------------------------------------
duke@435	1884	// Meet over the PTR enum
duke@435	1885	const TypePtr::PTR TypePtr::ptr_meet[TypePtr::lastPTR][TypePtr::lastPTR] = {
duke@435	1886	// TopPTR, AnyNull, Constant, Null, NotNull, BotPTR,
duke@435	1887	{ /* Top */ TopPTR, AnyNull, Constant, Null, NotNull, BotPTR,},
duke@435	1888	{ /* AnyNull */ AnyNull, AnyNull, Constant, BotPTR, NotNull, BotPTR,},
duke@435	1889	{ /* Constant*/ Constant, Constant, Constant, BotPTR, NotNull, BotPTR,},
duke@435	1890	{ /* Null */ Null, BotPTR, BotPTR, Null, BotPTR, BotPTR,},
duke@435	1891	{ /* NotNull */ NotNull, NotNull, NotNull, BotPTR, NotNull, BotPTR,},
duke@435	1892	{ /* BotPTR */ BotPTR, BotPTR, BotPTR, BotPTR, BotPTR, BotPTR,}
duke@435	1893	};
duke@435	1894
duke@435	1895	//------------------------------make-------------------------------------------
duke@435	1896	const TypePtr *TypePtr::make( TYPES t, enum PTR ptr, int offset ) {
duke@435	1897	return (TypePtr*)(new TypePtr(t,ptr,offset))->hashcons();
duke@435	1898	}
duke@435	1899
duke@435	1900	//------------------------------cast_to_ptr_type-------------------------------
duke@435	1901	const Type *TypePtr::cast_to_ptr_type(PTR ptr) const {
duke@435	1902	assert(_base == AnyPtr, "subclass must override cast_to_ptr_type");
duke@435	1903	if( ptr == _ptr ) return this;
duke@435	1904	return make(_base, ptr, _offset);
duke@435	1905	}
duke@435	1906
duke@435	1907	//------------------------------get_con----------------------------------------
duke@435	1908	intptr_t TypePtr::get_con() const {
duke@435	1909	assert( _ptr == Null, "" );
duke@435	1910	return _offset;
duke@435	1911	}
duke@435	1912
duke@435	1913	//------------------------------meet-------------------------------------------
duke@435	1914	// Compute the MEET of two types. It returns a new Type object.
duke@435	1915	const Type *TypePtr::xmeet( const Type *t ) const {
duke@435	1916	// Perform a fast test for common case; meeting the same types together.
duke@435	1917	if( this == t ) return this; // Meeting same type-rep?
duke@435	1918
duke@435	1919	// Current "this->_base" is AnyPtr
duke@435	1920	switch (t->base()) { // switch on original type
duke@435	1921	case Int: // Mixing ints & oops happens when javac
duke@435	1922	case Long: // reuses local variables
duke@435	1923	case FloatTop:
duke@435	1924	case FloatCon:
duke@435	1925	case FloatBot:
duke@435	1926	case DoubleTop:
duke@435	1927	case DoubleCon:
duke@435	1928	case DoubleBot:
coleenp@548	1929	case NarrowOop:
duke@435	1930	case Bottom: // Ye Olde Default
duke@435	1931	return Type::BOTTOM;
duke@435	1932	case Top:
duke@435	1933	return this;
duke@435	1934
duke@435	1935	case AnyPtr: { // Meeting to AnyPtrs
duke@435	1936	const TypePtr *tp = t->is_ptr();
duke@435	1937	return make( AnyPtr, meet_ptr(tp->ptr()), meet_offset(tp->offset()) );
duke@435	1938	}
duke@435	1939	case RawPtr: // For these, flip the call around to cut down
duke@435	1940	case OopPtr:
duke@435	1941	case InstPtr: // on the cases I have to handle.
duke@435	1942	case KlassPtr:
duke@435	1943	case AryPtr:
duke@435	1944	return t->xmeet(this); // Call in reverse direction
duke@435	1945	default: // All else is a mistake
duke@435	1946	typerr(t);
duke@435	1947
duke@435	1948	}
duke@435	1949	return this;
duke@435	1950	}
duke@435	1951
duke@435	1952	//------------------------------meet_offset------------------------------------
duke@435	1953	int TypePtr::meet_offset( int offset ) const {
duke@435	1954	// Either is 'TOP' offset? Return the other offset!
duke@435	1955	if( _offset == OffsetTop ) return offset;
duke@435	1956	if( offset == OffsetTop ) return _offset;
duke@435	1957	// If either is different, return 'BOTTOM' offset
duke@435	1958	if( _offset != offset ) return OffsetBot;
duke@435	1959	return _offset;
duke@435	1960	}
duke@435	1961
duke@435	1962	//------------------------------dual_offset------------------------------------
duke@435	1963	int TypePtr::dual_offset( ) const {
duke@435	1964	if( _offset == OffsetTop ) return OffsetBot;// Map 'TOP' into 'BOTTOM'
duke@435	1965	if( _offset == OffsetBot ) return OffsetTop;// Map 'BOTTOM' into 'TOP'
duke@435	1966	return _offset; // Map everything else into self
duke@435	1967	}
duke@435	1968
duke@435	1969	//------------------------------xdual------------------------------------------
duke@435	1970	// Dual: compute field-by-field dual
duke@435	1971	const TypePtr::PTR TypePtr::ptr_dual[TypePtr::lastPTR] = {
duke@435	1972	BotPTR, NotNull, Constant, Null, AnyNull, TopPTR
duke@435	1973	};
duke@435	1974	const Type *TypePtr::xdual() const {
duke@435	1975	return new TypePtr( AnyPtr, dual_ptr(), dual_offset() );
duke@435	1976	}
duke@435	1977
duke@435	1978	//------------------------------add_offset-------------------------------------
duke@435	1979	const TypePtr *TypePtr::add_offset( int offset ) const {
duke@435	1980	if( offset == 0 ) return this; // No change
duke@435	1981	if( _offset == OffsetBot ) return this;
duke@435	1982	if( offset == OffsetBot ) offset = OffsetBot;
duke@435	1983	else if( _offset == OffsetTop || offset == OffsetTop ) offset = OffsetTop;
duke@435	1984	else offset += _offset;
duke@435	1985	return make( AnyPtr, _ptr, offset );
duke@435	1986	}
duke@435	1987
duke@435	1988	//------------------------------eq---------------------------------------------
duke@435	1989	// Structural equality check for Type representations
duke@435	1990	bool TypePtr::eq( const Type *t ) const {
duke@435	1991	const TypePtr *a = (const TypePtr*)t;
duke@435	1992	return _ptr == a->ptr() && _offset == a->offset();
duke@435	1993	}
duke@435	1994
duke@435	1995	//------------------------------hash-------------------------------------------
duke@435	1996	// Type-specific hashing function.
duke@435	1997	int TypePtr::hash(void) const {
duke@435	1998	return _ptr + _offset;
duke@435	1999	}
duke@435	2000
duke@435	2001	//------------------------------dump2------------------------------------------
duke@435	2002	const char *const TypePtr::ptr_msg[TypePtr::lastPTR] = {
duke@435	2003	"TopPTR","AnyNull","Constant","NULL","NotNull","BotPTR"
duke@435	2004	};
duke@435	2005
duke@435	2006	#ifndef PRODUCT
duke@435	2007	void TypePtr::dump2( Dict &d, uint depth, outputStream *st ) const {
duke@435	2008	if( _ptr == Null ) st->print("NULL");
duke@435	2009	else st->print("%s *", ptr_msg[_ptr]);
duke@435	2010	if( _offset == OffsetTop ) st->print("+top");
duke@435	2011	else if( _offset == OffsetBot ) st->print("+bot");
duke@435	2012	else if( _offset ) st->print("+%d", _offset);
duke@435	2013	}
duke@435	2014	#endif
duke@435	2015
duke@435	2016	//------------------------------singleton--------------------------------------
duke@435	2017	// TRUE if Type is a singleton type, FALSE otherwise. Singletons are simple
duke@435	2018	// constants
duke@435	2019	bool TypePtr::singleton(void) const {
duke@435	2020	// TopPTR, Null, AnyNull, Constant are all singletons
duke@435	2021	return (_offset != OffsetBot) && !below_centerline(_ptr);
duke@435	2022	}
duke@435	2023
duke@435	2024	bool TypePtr::empty(void) const {
duke@435	2025	return (_offset == OffsetTop) || above_centerline(_ptr);
duke@435	2026	}
duke@435	2027
duke@435	2028	//=============================================================================
duke@435	2029	// Convenience common pre-built types.
duke@435	2030	const TypeRawPtr *TypeRawPtr::BOTTOM;
duke@435	2031	const TypeRawPtr *TypeRawPtr::NOTNULL;
duke@435	2032
duke@435	2033	//------------------------------make-------------------------------------------
duke@435	2034	const TypeRawPtr *TypeRawPtr::make( enum PTR ptr ) {
duke@435	2035	assert( ptr != Constant, "what is the constant?" );
duke@435	2036	assert( ptr != Null, "Use TypePtr for NULL" );
duke@435	2037	return (TypeRawPtr*)(new TypeRawPtr(ptr,0))->hashcons();
duke@435	2038	}
duke@435	2039
duke@435	2040	const TypeRawPtr *TypeRawPtr::make( address bits ) {
duke@435	2041	assert( bits, "Use TypePtr for NULL" );
duke@435	2042	return (TypeRawPtr*)(new TypeRawPtr(Constant,bits))->hashcons();
duke@435	2043	}
duke@435	2044
duke@435	2045	//------------------------------cast_to_ptr_type-------------------------------
duke@435	2046	const Type *TypeRawPtr::cast_to_ptr_type(PTR ptr) const {
duke@435	2047	assert( ptr != Constant, "what is the constant?" );
duke@435	2048	assert( ptr != Null, "Use TypePtr for NULL" );
duke@435	2049	assert( _bits==0, "Why cast a constant address?");
duke@435	2050	if( ptr == _ptr ) return this;
duke@435	2051	return make(ptr);
duke@435	2052	}
duke@435	2053
duke@435	2054	//------------------------------get_con----------------------------------------
duke@435	2055	intptr_t TypeRawPtr::get_con() const {
duke@435	2056	assert( _ptr == Null || _ptr == Constant, "" );
duke@435	2057	return (intptr_t)_bits;
duke@435	2058	}
duke@435	2059
duke@435	2060	//------------------------------meet-------------------------------------------
duke@435	2061	// Compute the MEET of two types. It returns a new Type object.
duke@435	2062	const Type *TypeRawPtr::xmeet( const Type *t ) const {
duke@435	2063	// Perform a fast test for common case; meeting the same types together.
duke@435	2064	if( this == t ) return this; // Meeting same type-rep?
duke@435	2065
duke@435	2066	// Current "this->_base" is RawPtr
duke@435	2067	switch( t->base() ) { // switch on original type
duke@435	2068	case Bottom: // Ye Olde Default
duke@435	2069	return t;
duke@435	2070	case Top:
duke@435	2071	return this;
duke@435	2072	case AnyPtr: // Meeting to AnyPtrs
duke@435	2073	break;
duke@435	2074	case RawPtr: { // might be top, bot, any/not or constant
duke@435	2075	enum PTR tptr = t->is_ptr()->ptr();
duke@435	2076	enum PTR ptr = meet_ptr( tptr );
duke@435	2077	if( ptr == Constant ) { // Cannot be equal constants, so...
duke@435	2078	if( tptr == Constant && _ptr != Constant) return t;
duke@435	2079	if( _ptr == Constant && tptr != Constant) return this;
duke@435	2080	ptr = NotNull; // Fall down in lattice
duke@435	2081	}
duke@435	2082	return make( ptr );
duke@435	2083	}
duke@435	2084
duke@435	2085	case OopPtr:
duke@435	2086	case InstPtr:
duke@435	2087	case KlassPtr:
duke@435	2088	case AryPtr:
duke@435	2089	return TypePtr::BOTTOM; // Oop meet raw is not well defined
duke@435	2090	default: // All else is a mistake
duke@435	2091	typerr(t);
duke@435	2092	}
duke@435	2093
duke@435	2094	// Found an AnyPtr type vs self-RawPtr type
duke@435	2095	const TypePtr *tp = t->is_ptr();
duke@435	2096	switch (tp->ptr()) {
duke@435	2097	case TypePtr::TopPTR: return this;
duke@435	2098	case TypePtr::BotPTR: return t;
duke@435	2099	case TypePtr::Null:
duke@435	2100	if( _ptr == TypePtr::TopPTR ) return t;
duke@435	2101	return TypeRawPtr::BOTTOM;
duke@435	2102	case TypePtr::NotNull: return TypePtr::make( AnyPtr, meet_ptr(TypePtr::NotNull), tp->meet_offset(0) );
duke@435	2103	case TypePtr::AnyNull:
duke@435	2104	if( _ptr == TypePtr::Constant) return this;
duke@435	2105	return make( meet_ptr(TypePtr::AnyNull) );
duke@435	2106	default: ShouldNotReachHere();
duke@435	2107	}
duke@435	2108	return this;
duke@435	2109	}
duke@435	2110
duke@435	2111	//------------------------------xdual------------------------------------------
duke@435	2112	// Dual: compute field-by-field dual
duke@435	2113	const Type *TypeRawPtr::xdual() const {
duke@435	2114	return new TypeRawPtr( dual_ptr(), _bits );
duke@435	2115	}
duke@435	2116
duke@435	2117	//------------------------------add_offset-------------------------------------
duke@435	2118	const TypePtr *TypeRawPtr::add_offset( int offset ) const {
duke@435	2119	if( offset == OffsetTop ) return BOTTOM; // Undefined offset-> undefined pointer
duke@435	2120	if( offset == OffsetBot ) return BOTTOM; // Unknown offset-> unknown pointer
duke@435	2121	if( offset == 0 ) return this; // No change
duke@435	2122	switch (_ptr) {
duke@435	2123	case TypePtr::TopPTR:
duke@435	2124	case TypePtr::BotPTR:
duke@435	2125	case TypePtr::NotNull:
duke@435	2126	return this;
duke@435	2127	case TypePtr::Null:
duke@435	2128	case TypePtr::Constant:
duke@435	2129	return make( _bits+offset );
duke@435	2130	default: ShouldNotReachHere();
duke@435	2131	}
duke@435	2132	return NULL; // Lint noise
duke@435	2133	}
duke@435	2134
duke@435	2135	//------------------------------eq---------------------------------------------
duke@435	2136	// Structural equality check for Type representations
duke@435	2137	bool TypeRawPtr::eq( const Type *t ) const {
duke@435	2138	const TypeRawPtr *a = (const TypeRawPtr*)t;
duke@435	2139	return _bits == a->_bits && TypePtr::eq(t);
duke@435	2140	}
duke@435	2141
duke@435	2142	//------------------------------hash-------------------------------------------
duke@435	2143	// Type-specific hashing function.
duke@435	2144	int TypeRawPtr::hash(void) const {
duke@435	2145	return (intptr_t)_bits + TypePtr::hash();
duke@435	2146	}
duke@435	2147
duke@435	2148	//------------------------------dump2------------------------------------------
duke@435	2149	#ifndef PRODUCT
duke@435	2150	void TypeRawPtr::dump2( Dict &d, uint depth, outputStream *st ) const {
duke@435	2151	if( _ptr == Constant )
duke@435	2152	st->print(INTPTR_FORMAT, _bits);
duke@435	2153	else
duke@435	2154	st->print("rawptr:%s", ptr_msg[_ptr]);
duke@435	2155	}
duke@435	2156	#endif
duke@435	2157
duke@435	2158	//=============================================================================
duke@435	2159	// Convenience common pre-built type.
duke@435	2160	const TypeOopPtr *TypeOopPtr::BOTTOM;
duke@435	2161
kvn@598	2162	//------------------------------TypeOopPtr-------------------------------------
kvn@598	2163	TypeOopPtr::TypeOopPtr( TYPES t, PTR ptr, ciKlass* k, bool xk, ciObject* o, int offset, int instance_id )
kvn@598	2164	: TypePtr(t, ptr, offset),
kvn@598	2165	_const_oop(o), _klass(k),
kvn@598	2166	_klass_is_exact(xk),
kvn@598	2167	_is_ptr_to_narrowoop(false),
kvn@598	2168	_instance_id(instance_id) {
kvn@598	2169	#ifdef _LP64
kvn@598	2170	if (UseCompressedOops && _offset != 0) {
kvn@598	2171	if (klass() == NULL) {
kvn@598	2172	assert(this->isa_aryptr(), "only arrays without klass");
kvn@598	2173	_is_ptr_to_narrowoop = true;
kvn@598	2174	} else if (_offset == oopDesc::klass_offset_in_bytes()) {
kvn@598	2175	_is_ptr_to_narrowoop = true;
kvn@598	2176	} else if (this->isa_aryptr()) {
kvn@598	2177	_is_ptr_to_narrowoop = (klass()->is_obj_array_klass() &&
kvn@598	2178	_offset != arrayOopDesc::length_offset_in_bytes());
kvn@598	2179	} else if (klass() == ciEnv::current()->Class_klass() &&
kvn@598	2180	(_offset == java_lang_Class::klass_offset_in_bytes() ||
kvn@598	2181	_offset == java_lang_Class::array_klass_offset_in_bytes())) {
kvn@598	2182	// Special hidden fields from the Class.
kvn@598	2183	assert(this->isa_instptr(), "must be an instance ptr.");
kvn@598	2184	_is_ptr_to_narrowoop = true;
kvn@598	2185	} else if (klass()->is_instance_klass()) {
kvn@598	2186	ciInstanceKlass* ik = klass()->as_instance_klass();
kvn@598	2187	ciField* field = NULL;
kvn@598	2188	if (this->isa_klassptr()) {
kvn@598	2189	// Perm objects don't use compressed references, except for
kvn@598	2190	// static fields which are currently compressed.
kvn@598	2191	field = ik->get_field_by_offset(_offset, true);
kvn@598	2192	if (field != NULL) {
kvn@598	2193	BasicType basic_elem_type = field->layout_type();
kvn@598	2194	_is_ptr_to_narrowoop = (basic_elem_type == T_OBJECT ||
kvn@598	2195	basic_elem_type == T_ARRAY);
kvn@598	2196	}
kvn@598	2197	} else if (_offset == OffsetBot || _offset == OffsetTop) {
kvn@598	2198	// unsafe access
kvn@598	2199	_is_ptr_to_narrowoop = true;
kvn@598	2200	} else { // exclude unsafe ops
kvn@598	2201	assert(this->isa_instptr(), "must be an instance ptr.");
kvn@598	2202	// Field which contains a compressed oop references.
kvn@598	2203	field = ik->get_field_by_offset(_offset, false);
kvn@598	2204	if (field != NULL) {
kvn@598	2205	BasicType basic_elem_type = field->layout_type();
kvn@598	2206	_is_ptr_to_narrowoop = (basic_elem_type == T_OBJECT ||
kvn@598	2207	basic_elem_type == T_ARRAY);
kvn@598	2208	} else if (klass()->equals(ciEnv::current()->Object_klass())) {
kvn@598	2209	// Compile::find_alias_type() cast exactness on all types to verify
kvn@598	2210	// that it does not affect alias type.
kvn@598	2211	_is_ptr_to_narrowoop = true;
kvn@598	2212	} else {
kvn@598	2213	// Type for the copy start in LibraryCallKit::inline_native_clone().
kvn@598	2214	assert(!klass_is_exact(), "only non-exact klass");
kvn@598	2215	_is_ptr_to_narrowoop = true;
kvn@598	2216	}
kvn@598	2217	}
kvn@598	2218	}
kvn@598	2219	}
kvn@598	2220	#endif
kvn@598	2221	}
kvn@598	2222
duke@435	2223	//------------------------------make-------------------------------------------
duke@435	2224	const TypeOopPtr *TypeOopPtr::make(PTR ptr,
duke@435	2225	int offset) {
duke@435	2226	assert(ptr != Constant, "no constant generic pointers");
duke@435	2227	ciKlass* k = ciKlassKlass::make();
duke@435	2228	bool xk = false;
duke@435	2229	ciObject* o = NULL;
duke@435	2230	return (TypeOopPtr*)(new TypeOopPtr(OopPtr, ptr, k, xk, o, offset, UNKNOWN_INSTANCE))->hashcons();
duke@435	2231	}
duke@435	2232
duke@435	2233
duke@435	2234	//------------------------------cast_to_ptr_type-------------------------------
duke@435	2235	const Type *TypeOopPtr::cast_to_ptr_type(PTR ptr) const {
duke@435	2236	assert(_base == OopPtr, "subclass must override cast_to_ptr_type");
duke@435	2237	if( ptr == _ptr ) return this;
duke@435	2238	return make(ptr, _offset);
duke@435	2239	}
duke@435	2240
duke@435	2241	//-----------------------------cast_to_instance-------------------------------
duke@435	2242	const TypeOopPtr *TypeOopPtr::cast_to_instance(int instance_id) const {
duke@435	2243	// There are no instances of a general oop.
duke@435	2244	// Return self unchanged.
duke@435	2245	return this;
duke@435	2246	}
duke@435	2247
duke@435	2248	//-----------------------------cast_to_exactness-------------------------------
duke@435	2249	const Type *TypeOopPtr::cast_to_exactness(bool klass_is_exact) const {
duke@435	2250	// There is no such thing as an exact general oop.
duke@435	2251	// Return self unchanged.
duke@435	2252	return this;
duke@435	2253	}
duke@435	2254
duke@435	2255
duke@435	2256	//------------------------------as_klass_type----------------------------------
duke@435	2257	// Return the klass type corresponding to this instance or array type.
duke@435	2258	// It is the type that is loaded from an object of this type.
duke@435	2259	const TypeKlassPtr* TypeOopPtr::as_klass_type() const {
duke@435	2260	ciKlass* k = klass();
duke@435	2261	bool xk = klass_is_exact();
duke@435	2262	if (k == NULL || !k->is_java_klass())
duke@435	2263	return TypeKlassPtr::OBJECT;
duke@435	2264	else
duke@435	2265	return TypeKlassPtr::make(xk? Constant: NotNull, k, 0);
duke@435	2266	}
duke@435	2267
duke@435	2268
duke@435	2269	//------------------------------meet-------------------------------------------
duke@435	2270	// Compute the MEET of two types. It returns a new Type object.
duke@435	2271	const Type *TypeOopPtr::xmeet( const Type *t ) const {
duke@435	2272	// Perform a fast test for common case; meeting the same types together.
duke@435	2273	if( this == t ) return this; // Meeting same type-rep?
duke@435	2274
duke@435	2275	// Current "this->_base" is OopPtr
duke@435	2276	switch (t->base()) { // switch on original type
duke@435	2277
duke@435	2278	case Int: // Mixing ints & oops happens when javac
duke@435	2279	case Long: // reuses local variables
duke@435	2280	case FloatTop:
duke@435	2281	case FloatCon:
duke@435	2282	case FloatBot:
duke@435	2283	case DoubleTop:
duke@435	2284	case DoubleCon:
duke@435	2285	case DoubleBot:
duke@435	2286	case Bottom: // Ye Olde Default
duke@435	2287	return Type::BOTTOM;
duke@435	2288	case Top:
duke@435	2289	return this;
duke@435	2290
duke@435	2291	default: // All else is a mistake
duke@435	2292	typerr(t);
duke@435	2293
duke@435	2294	case RawPtr:
duke@435	2295	return TypePtr::BOTTOM; // Oop meet raw is not well defined
duke@435	2296
duke@435	2297	case AnyPtr: {
duke@435	2298	// Found an AnyPtr type vs self-OopPtr type
duke@435	2299	const TypePtr *tp = t->is_ptr();
duke@435	2300	int offset = meet_offset(tp->offset());
duke@435	2301	PTR ptr = meet_ptr(tp->ptr());
duke@435	2302	switch (tp->ptr()) {
duke@435	2303	case Null:
duke@435	2304	if (ptr == Null) return TypePtr::make(AnyPtr, ptr, offset);
duke@435	2305	// else fall through:
duke@435	2306	case TopPTR:
duke@435	2307	case AnyNull:
duke@435	2308	return make(ptr, offset);
duke@435	2309	case BotPTR:
duke@435	2310	case NotNull:
duke@435	2311	return TypePtr::make(AnyPtr, ptr, offset);
duke@435	2312	default: typerr(t);
duke@435	2313	}
duke@435	2314	}
duke@435	2315
duke@435	2316	case OopPtr: { // Meeting to other OopPtrs
duke@435	2317	const TypeOopPtr *tp = t->is_oopptr();
duke@435	2318	return make( meet_ptr(tp->ptr()), meet_offset(tp->offset()) );
duke@435	2319	}
duke@435	2320
duke@435	2321	case InstPtr: // For these, flip the call around to cut down
duke@435	2322	case KlassPtr: // on the cases I have to handle.
duke@435	2323	case AryPtr:
duke@435	2324	return t->xmeet(this); // Call in reverse direction
duke@435	2325
duke@435	2326	} // End of switch
duke@435	2327	return this; // Return the double constant
duke@435	2328	}
duke@435	2329
duke@435	2330
duke@435	2331	//------------------------------xdual------------------------------------------
duke@435	2332	// Dual of a pure heap pointer. No relevant klass or oop information.
duke@435	2333	const Type *TypeOopPtr::xdual() const {
duke@435	2334	assert(klass() == ciKlassKlass::make(), "no klasses here");
duke@435	2335	assert(const_oop() == NULL, "no constants here");
duke@435	2336	return new TypeOopPtr(_base, dual_ptr(), klass(), klass_is_exact(), const_oop(), dual_offset(), dual_instance() );
duke@435	2337	}
duke@435	2338
duke@435	2339	//--------------------------make_from_klass_common-----------------------------
duke@435	2340	// Computes the element-type given a klass.
duke@435	2341	const TypeOopPtr* TypeOopPtr::make_from_klass_common(ciKlass *klass, bool klass_change, bool try_for_exact) {
duke@435	2342	assert(klass->is_java_klass(), "must be java language klass");
duke@435	2343	if (klass->is_instance_klass()) {
duke@435	2344	Compile* C = Compile::current();
duke@435	2345	Dependencies* deps = C->dependencies();
duke@435	2346	assert((deps != NULL) == (C->method() != NULL && C->method()->code_size() > 0), "sanity");
duke@435	2347	// Element is an instance
duke@435	2348	bool klass_is_exact = false;
duke@435	2349	if (klass->is_loaded()) {
duke@435	2350	// Try to set klass_is_exact.
duke@435	2351	ciInstanceKlass* ik = klass->as_instance_klass();
duke@435	2352	klass_is_exact = ik->is_final();
duke@435	2353	if (!klass_is_exact && klass_change
duke@435	2354	&& deps != NULL && UseUniqueSubclasses) {
duke@435	2355	ciInstanceKlass* sub = ik->unique_concrete_subklass();
duke@435	2356	if (sub != NULL) {
duke@435	2357	deps->assert_abstract_with_unique_concrete_subtype(ik, sub);
duke@435	2358	klass = ik = sub;
duke@435	2359	klass_is_exact = sub->is_final();
duke@435	2360	}
duke@435	2361	}
duke@435	2362	if (!klass_is_exact && try_for_exact
duke@435	2363	&& deps != NULL && UseExactTypes) {
duke@435	2364	if (!ik->is_interface() && !ik->has_subklass()) {
duke@435	2365	// Add a dependence; if concrete subclass added we need to recompile
duke@435	2366	deps->assert_leaf_type(ik);
duke@435	2367	klass_is_exact = true;
duke@435	2368	}
duke@435	2369	}
duke@435	2370	}
duke@435	2371	return TypeInstPtr::make(TypePtr::BotPTR, klass, klass_is_exact, NULL, 0);
duke@435	2372	} else if (klass->is_obj_array_klass()) {
duke@435	2373	// Element is an object array. Recursively call ourself.
duke@435	2374	const TypeOopPtr *etype = TypeOopPtr::make_from_klass_common(klass->as_obj_array_klass()->element_klass(), false, try_for_exact);
duke@435	2375	bool xk = etype->klass_is_exact();
duke@435	2376	const TypeAry* arr0 = TypeAry::make(etype, TypeInt::POS);
duke@435	2377	// We used to pass NotNull in here, asserting that the sub-arrays
duke@435	2378	// are all not-null. This is not true in generally, as code can
duke@435	2379	// slam NULLs down in the subarrays.
duke@435	2380	const TypeAryPtr* arr = TypeAryPtr::make(TypePtr::BotPTR, arr0, klass, xk, 0);
duke@435	2381	return arr;
duke@435	2382	} else if (klass->is_type_array_klass()) {
duke@435	2383	// Element is an typeArray
duke@435	2384	const Type* etype = get_const_basic_type(klass->as_type_array_klass()->element_type());
duke@435	2385	const TypeAry* arr0 = TypeAry::make(etype, TypeInt::POS);
duke@435	2386	// We used to pass NotNull in here, asserting that the array pointer
duke@435	2387	// is not-null. That was not true in general.
duke@435	2388	const TypeAryPtr* arr = TypeAryPtr::make(TypePtr::BotPTR, arr0, klass, true, 0);
duke@435	2389	return arr;
duke@435	2390	} else {
duke@435	2391	ShouldNotReachHere();
duke@435	2392	return NULL;
duke@435	2393	}
duke@435	2394	}
duke@435	2395
duke@435	2396	//------------------------------make_from_constant-----------------------------
duke@435	2397	// Make a java pointer from an oop constant
duke@435	2398	const TypeOopPtr* TypeOopPtr::make_from_constant(ciObject* o) {
duke@435	2399	if (o->is_method_data() || o->is_method()) {
duke@435	2400	// Treat much like a typeArray of bytes, like below, but fake the type...
duke@435	2401	assert(o->has_encoding(), "must be a perm space object");
duke@435	2402	const Type* etype = (Type*)get_const_basic_type(T_BYTE);
duke@435	2403	const TypeAry* arr0 = TypeAry::make(etype, TypeInt::POS);
duke@435	2404	ciKlass *klass = ciTypeArrayKlass::make((BasicType) T_BYTE);
duke@435	2405	assert(o->has_encoding(), "method data oops should be tenured");
duke@435	2406	const TypeAryPtr* arr = TypeAryPtr::make(TypePtr::Constant, o, arr0, klass, true, 0);
duke@435	2407	return arr;
duke@435	2408	} else {
duke@435	2409	assert(o->is_java_object(), "must be java language object");
duke@435	2410	assert(!o->is_null_object(), "null object not yet handled here.");
duke@435	2411	ciKlass *klass = o->klass();
duke@435	2412	if (klass->is_instance_klass()) {
duke@435	2413	// Element is an instance
duke@435	2414	if (!o->has_encoding()) { // not a perm-space constant
duke@435	2415	// %%% remove this restriction by rewriting non-perm ConPNodes in a later phase
duke@435	2416	return TypeInstPtr::make(TypePtr::NotNull, klass, true, NULL, 0);
duke@435	2417	}
duke@435	2418	return TypeInstPtr::make(o);
duke@435	2419	} else if (klass->is_obj_array_klass()) {
duke@435	2420	// Element is an object array. Recursively call ourself.
duke@435	2421	const Type *etype =
duke@435	2422	TypeOopPtr::make_from_klass_raw(klass->as_obj_array_klass()->element_klass());
duke@435	2423	const TypeAry* arr0 = TypeAry::make(etype, TypeInt::make(o->as_array()->length()));
duke@435	2424	// We used to pass NotNull in here, asserting that the sub-arrays
duke@435	2425	// are all not-null. This is not true in generally, as code can
duke@435	2426	// slam NULLs down in the subarrays.
duke@435	2427	if (!o->has_encoding()) { // not a perm-space constant
duke@435	2428	// %%% remove this restriction by rewriting non-perm ConPNodes in a later phase
duke@435	2429	return TypeAryPtr::make(TypePtr::NotNull, arr0, klass, true, 0);
duke@435	2430	}
duke@435	2431	const TypeAryPtr* arr = TypeAryPtr::make(TypePtr::Constant, o, arr0, klass, true, 0);
duke@435	2432	return arr;
duke@435	2433	} else if (klass->is_type_array_klass()) {
duke@435	2434	// Element is an typeArray
duke@435	2435	const Type* etype =
duke@435	2436	(Type*)get_const_basic_type(klass->as_type_array_klass()->element_type());
duke@435	2437	const TypeAry* arr0 = TypeAry::make(etype, TypeInt::make(o->as_array()->length()));
duke@435	2438	// We used to pass NotNull in here, asserting that the array pointer
duke@435	2439	// is not-null. That was not true in general.
duke@435	2440	if (!o->has_encoding()) { // not a perm-space constant
duke@435	2441	// %%% remove this restriction by rewriting non-perm ConPNodes in a later phase
duke@435	2442	return TypeAryPtr::make(TypePtr::NotNull, arr0, klass, true, 0);
duke@435	2443	}
duke@435	2444	const TypeAryPtr* arr = TypeAryPtr::make(TypePtr::Constant, o, arr0, klass, true, 0);
duke@435	2445	return arr;
duke@435	2446	}
duke@435	2447	}
duke@435	2448
duke@435	2449	ShouldNotReachHere();
duke@435	2450	return NULL;
duke@435	2451	}
duke@435	2452
duke@435	2453	//------------------------------get_con----------------------------------------
duke@435	2454	intptr_t TypeOopPtr::get_con() const {
duke@435	2455	assert( _ptr == Null || _ptr == Constant, "" );
duke@435	2456	assert( _offset >= 0, "" );
duke@435	2457
duke@435	2458	if (_offset != 0) {
duke@435	2459	// After being ported to the compiler interface, the compiler no longer
duke@435	2460	// directly manipulates the addresses of oops. Rather, it only has a pointer
duke@435	2461	// to a handle at compile time. This handle is embedded in the generated
duke@435	2462	// code and dereferenced at the time the nmethod is made. Until that time,
duke@435	2463	// it is not reasonable to do arithmetic with the addresses of oops (we don't
duke@435	2464	// have access to the addresses!). This does not seem to currently happen,
duke@435	2465	// but this assertion here is to help prevent its occurrance.
duke@435	2466	tty->print_cr("Found oop constant with non-zero offset");
duke@435	2467	ShouldNotReachHere();
duke@435	2468	}
duke@435	2469
duke@435	2470	return (intptr_t)const_oop()->encoding();
duke@435	2471	}
duke@435	2472
duke@435	2473
duke@435	2474	//-----------------------------filter------------------------------------------
duke@435	2475	// Do not allow interface-vs.-noninterface joins to collapse to top.
duke@435	2476	const Type *TypeOopPtr::filter( const Type *kills ) const {
duke@435	2477
duke@435	2478	const Type* ft = join(kills);
duke@435	2479	const TypeInstPtr* ftip = ft->isa_instptr();
duke@435	2480	const TypeInstPtr* ktip = kills->isa_instptr();
duke@435	2481
duke@435	2482	if (ft->empty()) {
duke@435	2483	// Check for evil case of 'this' being a class and 'kills' expecting an
duke@435	2484	// interface. This can happen because the bytecodes do not contain
duke@435	2485	// enough type info to distinguish a Java-level interface variable
duke@435	2486	// from a Java-level object variable. If we meet 2 classes which
duke@435	2487	// both implement interface I, but their meet is at 'j/l/O' which
duke@435	2488	// doesn't implement I, we have no way to tell if the result should
duke@435	2489	// be 'I' or 'j/l/O'. Thus we'll pick 'j/l/O'. If this then flows
duke@435	2490	// into a Phi which "knows" it's an Interface type we'll have to
duke@435	2491	// uplift the type.
duke@435	2492	if (!empty() && ktip != NULL && ktip->is_loaded() && ktip->klass()->is_interface())
duke@435	2493	return kills; // Uplift to interface
duke@435	2494
duke@435	2495	return Type::TOP; // Canonical empty value
duke@435	2496	}
duke@435	2497
duke@435	2498	// If we have an interface-typed Phi or cast and we narrow to a class type,
duke@435	2499	// the join should report back the class. However, if we have a J/L/Object
duke@435	2500	// class-typed Phi and an interface flows in, it's possible that the meet &
duke@435	2501	// join report an interface back out. This isn't possible but happens
duke@435	2502	// because the type system doesn't interact well with interfaces.
duke@435	2503	if (ftip != NULL && ktip != NULL &&
duke@435	2504	ftip->is_loaded() && ftip->klass()->is_interface() &&
duke@435	2505	ktip->is_loaded() && !ktip->klass()->is_interface()) {
duke@435	2506	// Happens in a CTW of rt.jar, 320-341, no extra flags
duke@435	2507	return ktip->cast_to_ptr_type(ftip->ptr());
duke@435	2508	}
duke@435	2509
duke@435	2510	return ft;
duke@435	2511	}
duke@435	2512
duke@435	2513	//------------------------------eq---------------------------------------------
duke@435	2514	// Structural equality check for Type representations
duke@435	2515	bool TypeOopPtr::eq( const Type *t ) const {
duke@435	2516	const TypeOopPtr *a = (const TypeOopPtr*)t;
duke@435	2517	if (_klass_is_exact != a->_klass_is_exact ||
duke@435	2518	_instance_id != a->_instance_id) return false;
duke@435	2519	ciObject* one = const_oop();
duke@435	2520	ciObject* two = a->const_oop();
duke@435	2521	if (one == NULL || two == NULL) {
duke@435	2522	return (one == two) && TypePtr::eq(t);
duke@435	2523	} else {
duke@435	2524	return one->equals(two) && TypePtr::eq(t);
duke@435	2525	}
duke@435	2526	}
duke@435	2527
duke@435	2528	//------------------------------hash-------------------------------------------
duke@435	2529	// Type-specific hashing function.
duke@435	2530	int TypeOopPtr::hash(void) const {
duke@435	2531	return
duke@435	2532	(const_oop() ? const_oop()->hash() : 0) +
duke@435	2533	_klass_is_exact +
duke@435	2534	_instance_id +
duke@435	2535	TypePtr::hash();
duke@435	2536	}
duke@435	2537
duke@435	2538	//------------------------------dump2------------------------------------------
duke@435	2539	#ifndef PRODUCT
duke@435	2540	void TypeOopPtr::dump2( Dict &d, uint depth, outputStream *st ) const {
duke@435	2541	st->print("oopptr:%s", ptr_msg[_ptr]);
duke@435	2542	if( _klass_is_exact ) st->print(":exact");
duke@435	2543	if( const_oop() ) st->print(INTPTR_FORMAT, const_oop());
duke@435	2544	switch( _offset ) {
duke@435	2545	case OffsetTop: st->print("+top"); break;
duke@435	2546	case OffsetBot: st->print("+any"); break;
duke@435	2547	case 0: break;
duke@435	2548	default: st->print("+%d",_offset); break;
duke@435	2549	}
duke@435	2550	if (_instance_id != UNKNOWN_INSTANCE)
duke@435	2551	st->print(",iid=%d",_instance_id);
duke@435	2552	}
duke@435	2553	#endif
duke@435	2554
duke@435	2555	//------------------------------singleton--------------------------------------
duke@435	2556	// TRUE if Type is a singleton type, FALSE otherwise. Singletons are simple
duke@435	2557	// constants
duke@435	2558	bool TypeOopPtr::singleton(void) const {
duke@435	2559	// detune optimizer to not generate constant oop + constant offset as a constant!
duke@435	2560	// TopPTR, Null, AnyNull, Constant are all singletons
duke@435	2561	return (_offset == 0) && !below_centerline(_ptr);
duke@435	2562	}
duke@435	2563
duke@435	2564	//------------------------------xadd_offset------------------------------------
duke@435	2565	int TypeOopPtr::xadd_offset( int offset ) const {
duke@435	2566	// Adding to 'TOP' offset? Return 'TOP'!
duke@435	2567	if( _offset == OffsetTop || offset == OffsetTop ) return OffsetTop;
duke@435	2568	// Adding to 'BOTTOM' offset? Return 'BOTTOM'!
duke@435	2569	if( _offset == OffsetBot || offset == OffsetBot ) return OffsetBot;
duke@435	2570
duke@435	2571	// assert( _offset >= 0 && _offset+offset >= 0, "" );
duke@435	2572	// It is possible to construct a negative offset during PhaseCCP
duke@435	2573
duke@435	2574	return _offset+offset; // Sum valid offsets
duke@435	2575	}
duke@435	2576
duke@435	2577	//------------------------------add_offset-------------------------------------
duke@435	2578	const TypePtr *TypeOopPtr::add_offset( int offset ) const {
duke@435	2579	return make( _ptr, xadd_offset(offset) );
duke@435	2580	}
duke@435	2581
coleenp@548	2582	const TypeNarrowOop* TypeOopPtr::make_narrowoop() const {
coleenp@548	2583	return TypeNarrowOop::make(this);
coleenp@548	2584	}
coleenp@548	2585
duke@435	2586	int TypeOopPtr::meet_instance(int iid) const {
duke@435	2587	if (iid == 0) {
duke@435	2588	return (_instance_id < 0) ? _instance_id : UNKNOWN_INSTANCE;
duke@435	2589	} else if (_instance_id == UNKNOWN_INSTANCE) {
duke@435	2590	return (iid < 0) ? iid : UNKNOWN_INSTANCE;
duke@435	2591	} else {
duke@435	2592	return (_instance_id == iid) ? iid : UNKNOWN_INSTANCE;
duke@435	2593	}
duke@435	2594	}
duke@435	2595
duke@435	2596	//=============================================================================
duke@435	2597	// Convenience common pre-built types.
duke@435	2598	const TypeInstPtr *TypeInstPtr::NOTNULL;
duke@435	2599	const TypeInstPtr *TypeInstPtr::BOTTOM;
duke@435	2600	const TypeInstPtr *TypeInstPtr::MIRROR;
duke@435	2601	const TypeInstPtr *TypeInstPtr::MARK;
duke@435	2602	const TypeInstPtr *TypeInstPtr::KLASS;
duke@435	2603
duke@435	2604	//------------------------------TypeInstPtr-------------------------------------
duke@435	2605	TypeInstPtr::TypeInstPtr(PTR ptr, ciKlass* k, bool xk, ciObject* o, int off, int instance_id)
duke@435	2606	: TypeOopPtr(InstPtr, ptr, k, xk, o, off, instance_id), _name(k->name()) {
duke@435	2607	assert(k != NULL &&
duke@435	2608	(k->is_loaded() || o == NULL),
duke@435	2609	"cannot have constants with non-loaded klass");
duke@435	2610	};
duke@435	2611
duke@435	2612	//------------------------------make-------------------------------------------
duke@435	2613	const TypeInstPtr *TypeInstPtr::make(PTR ptr,
duke@435	2614	ciKlass* k,
duke@435	2615	bool xk,
duke@435	2616	ciObject* o,
duke@435	2617	int offset,
duke@435	2618	int instance_id) {
duke@435	2619	assert( !k->is_loaded() || k->is_instance_klass() ||
duke@435	2620	k->is_method_klass(), "Must be for instance or method");
duke@435	2621	// Either const_oop() is NULL or else ptr is Constant
duke@435	2622	assert( (!o && ptr != Constant) || (o && ptr == Constant),
duke@435	2623	"constant pointers must have a value supplied" );
duke@435	2624	// Ptr is never Null
duke@435	2625	assert( ptr != Null, "NULL pointers are not typed" );
duke@435	2626
duke@435	2627	if (instance_id != UNKNOWN_INSTANCE)
duke@435	2628	xk = true; // instances are always exactly typed
duke@435	2629	if (!UseExactTypes) xk = false;
duke@435	2630	if (ptr == Constant) {
duke@435	2631	// Note: This case includes meta-object constants, such as methods.
duke@435	2632	xk = true;
duke@435	2633	} else if (k->is_loaded()) {
duke@435	2634	ciInstanceKlass* ik = k->as_instance_klass();
duke@435	2635	if (!xk && ik->is_final()) xk = true; // no inexact final klass
duke@435	2636	if (xk && ik->is_interface()) xk = false; // no exact interface
duke@435	2637	}
duke@435	2638
duke@435	2639	// Now hash this baby
duke@435	2640	TypeInstPtr *result =
duke@435	2641	(TypeInstPtr*)(new TypeInstPtr(ptr, k, xk, o ,offset, instance_id))->hashcons();
duke@435	2642
duke@435	2643	return result;
duke@435	2644	}
duke@435	2645
duke@435	2646
duke@435	2647	//------------------------------cast_to_ptr_type-------------------------------
duke@435	2648	const Type *TypeInstPtr::cast_to_ptr_type(PTR ptr) const {
duke@435	2649	if( ptr == _ptr ) return this;
duke@435	2650	// Reconstruct _sig info here since not a problem with later lazy
duke@435	2651	// construction, _sig will show up on demand.
duke@435	2652	return make(ptr, klass(), klass_is_exact(), const_oop(), _offset);
duke@435	2653	}
duke@435	2654
duke@435	2655
duke@435	2656	//-----------------------------cast_to_exactness-------------------------------
duke@435	2657	const Type *TypeInstPtr::cast_to_exactness(bool klass_is_exact) const {
duke@435	2658	if( klass_is_exact == _klass_is_exact ) return this;
duke@435	2659	if (!UseExactTypes) return this;
duke@435	2660	if (!_klass->is_loaded()) return this;
duke@435	2661	ciInstanceKlass* ik = _klass->as_instance_klass();
duke@435	2662	if( (ik->is_final() || _const_oop) ) return this; // cannot clear xk
duke@435	2663	if( ik->is_interface() ) return this; // cannot set xk
duke@435	2664	return make(ptr(), klass(), klass_is_exact, const_oop(), _offset, _instance_id);
duke@435	2665	}
duke@435	2666
duke@435	2667	//-----------------------------cast_to_instance-------------------------------
duke@435	2668	const TypeOopPtr *TypeInstPtr::cast_to_instance(int instance_id) const {
duke@435	2669	if( instance_id == _instance_id) return this;
kvn@598	2670	bool exact = true;
kvn@598	2671	PTR ptr_t = NotNull;
kvn@598	2672	if (instance_id == UNKNOWN_INSTANCE) {
kvn@598	2673	exact = _klass_is_exact;
kvn@598	2674	ptr_t = _ptr;
kvn@598	2675	}
kvn@598	2676	return make(ptr_t, klass(), exact, const_oop(), _offset, instance_id);
duke@435	2677	}
duke@435	2678
duke@435	2679	//------------------------------xmeet_unloaded---------------------------------
duke@435	2680	// Compute the MEET of two InstPtrs when at least one is unloaded.
duke@435	2681	// Assume classes are different since called after check for same name/class-loader
duke@435	2682	const TypeInstPtr *TypeInstPtr::xmeet_unloaded(const TypeInstPtr *tinst) const {
duke@435	2683	int off = meet_offset(tinst->offset());
duke@435	2684	PTR ptr = meet_ptr(tinst->ptr());
duke@435	2685
duke@435	2686	const TypeInstPtr *loaded = is_loaded() ? this : tinst;
duke@435	2687	const TypeInstPtr *unloaded = is_loaded() ? tinst : this;
duke@435	2688	if( loaded->klass()->equals(ciEnv::current()->Object_klass()) ) {
duke@435	2689	//
duke@435	2690	// Meet unloaded class with java/lang/Object
duke@435	2691	//
duke@435	2692	// Meet
duke@435	2693	// | Unloaded Class
duke@435	2694	// Object | TOP | AnyNull | Constant | NotNull | BOTTOM |
duke@435	2695	// ===================================================================
duke@435	2696	// TOP | ..........................Unloaded......................|
duke@435	2697	// AnyNull | U-AN |................Unloaded......................|
duke@435	2698	// Constant | ... O-NN .................................. | O-BOT |
duke@435	2699	// NotNull | ... O-NN .................................. | O-BOT |
duke@435	2700	// BOTTOM | ........................Object-BOTTOM ..................|
duke@435	2701	//
duke@435	2702	assert(loaded->ptr() != TypePtr::Null, "insanity check");
duke@435	2703	//
duke@435	2704	if( loaded->ptr() == TypePtr::TopPTR ) { return unloaded; }
duke@435	2705	else if (loaded->ptr() == TypePtr::AnyNull) { return TypeInstPtr::make( ptr, unloaded->klass() ); }
duke@435	2706	else if (loaded->ptr() == TypePtr::BotPTR ) { return TypeInstPtr::BOTTOM; }
duke@435	2707	else if (loaded->ptr() == TypePtr::Constant || loaded->ptr() == TypePtr::NotNull) {
duke@435	2708	if (unloaded->ptr() == TypePtr::BotPTR ) { return TypeInstPtr::BOTTOM; }
duke@435	2709	else { return TypeInstPtr::NOTNULL; }
duke@435	2710	}
duke@435	2711	else if( unloaded->ptr() == TypePtr::TopPTR ) { return unloaded; }
duke@435	2712
duke@435	2713	return unloaded->cast_to_ptr_type(TypePtr::AnyNull)->is_instptr();
duke@435	2714	}
duke@435	2715
duke@435	2716	// Both are unloaded, not the same class, not Object
duke@435	2717	// Or meet unloaded with a different loaded class, not java/lang/Object
duke@435	2718	if( ptr != TypePtr::BotPTR ) {
duke@435	2719	return TypeInstPtr::NOTNULL;
duke@435	2720	}
duke@435	2721	return TypeInstPtr::BOTTOM;
duke@435	2722	}
duke@435	2723
duke@435	2724
duke@435	2725	//------------------------------meet-------------------------------------------
duke@435	2726	// Compute the MEET of two types. It returns a new Type object.
duke@435	2727	const Type *TypeInstPtr::xmeet( const Type *t ) const {
duke@435	2728	// Perform a fast test for common case; meeting the same types together.
duke@435	2729	if( this == t ) return this; // Meeting same type-rep?
duke@435	2730
duke@435	2731	// Current "this->_base" is Pointer
duke@435	2732	switch (t->base()) { // switch on original type
duke@435	2733
duke@435	2734	case Int: // Mixing ints & oops happens when javac
duke@435	2735	case Long: // reuses local variables
duke@435	2736	case FloatTop:
duke@435	2737	case FloatCon:
duke@435	2738	case FloatBot:
duke@435	2739	case DoubleTop:
duke@435	2740	case DoubleCon:
duke@435	2741	case DoubleBot:
coleenp@548	2742	case NarrowOop:
duke@435	2743	case Bottom: // Ye Olde Default
duke@435	2744	return Type::BOTTOM;
duke@435	2745	case Top:
duke@435	2746	return this;
duke@435	2747
duke@435	2748	default: // All else is a mistake
duke@435	2749	typerr(t);
duke@435	2750
duke@435	2751	case RawPtr: return TypePtr::BOTTOM;
duke@435	2752
duke@435	2753	case AryPtr: { // All arrays inherit from Object class
duke@435	2754	const TypeAryPtr *tp = t->is_aryptr();
duke@435	2755	int offset = meet_offset(tp->offset());
duke@435	2756	PTR ptr = meet_ptr(tp->ptr());
duke@435	2757	int iid = meet_instance(tp->instance_id());
duke@435	2758	switch (ptr) {
duke@435	2759	case TopPTR:
duke@435	2760	case AnyNull: // Fall 'down' to dual of object klass
duke@435	2761	if (klass()->equals(ciEnv::current()->Object_klass())) {
duke@435	2762	return TypeAryPtr::make(ptr, tp->ary(), tp->klass(), tp->klass_is_exact(), offset, iid);
duke@435	2763	} else {
duke@435	2764	// cannot subclass, so the meet has to fall badly below the centerline
duke@435	2765	ptr = NotNull;
duke@435	2766	return TypeInstPtr::make( ptr, ciEnv::current()->Object_klass(), false, NULL, offset, iid);
duke@435	2767	}
duke@435	2768	case Constant:
duke@435	2769	case NotNull:
duke@435	2770	case BotPTR: // Fall down to object klass
duke@435	2771	// LCA is object_klass, but if we subclass from the top we can do better
duke@435	2772	if( above_centerline(_ptr) ) { // if( _ptr == TopPTR || _ptr == AnyNull )
duke@435	2773	// If 'this' (InstPtr) is above the centerline and it is Object class
duke@435	2774	// then we can subclass in the Java class heirarchy.
duke@435	2775	if (klass()->equals(ciEnv::current()->Object_klass())) {
duke@435	2776	// that is, tp's array type is a subtype of my klass
duke@435	2777	return TypeAryPtr::make(ptr, tp->ary(), tp->klass(), tp->klass_is_exact(), offset, iid);
duke@435	2778	}
duke@435	2779	}
duke@435	2780	// The other case cannot happen, since I cannot be a subtype of an array.
duke@435	2781	// The meet falls down to Object class below centerline.
duke@435	2782	if( ptr == Constant )
duke@435	2783	ptr = NotNull;
duke@435	2784	return make( ptr, ciEnv::current()->Object_klass(), false, NULL, offset, iid );
duke@435	2785	default: typerr(t);
duke@435	2786	}
duke@435	2787	}
duke@435	2788
duke@435	2789	case OopPtr: { // Meeting to OopPtrs
duke@435	2790	// Found a OopPtr type vs self-InstPtr type
duke@435	2791	const TypePtr *tp = t->is_oopptr();
duke@435	2792	int offset = meet_offset(tp->offset());
duke@435	2793	PTR ptr = meet_ptr(tp->ptr());
duke@435	2794	switch (tp->ptr()) {
duke@435	2795	case TopPTR:
duke@435	2796	case AnyNull:
duke@435	2797	return make(ptr, klass(), klass_is_exact(),
duke@435	2798	(ptr == Constant ? const_oop() : NULL), offset);
duke@435	2799	case NotNull:
duke@435	2800	case BotPTR:
duke@435	2801	return TypeOopPtr::make(ptr, offset);
duke@435	2802	default: typerr(t);
duke@435	2803	}
duke@435	2804	}
duke@435	2805
duke@435	2806	case AnyPtr: { // Meeting to AnyPtrs
duke@435	2807	// Found an AnyPtr type vs self-InstPtr type
duke@435	2808	const TypePtr *tp = t->is_ptr();
duke@435	2809	int offset = meet_offset(tp->offset());
duke@435	2810	PTR ptr = meet_ptr(tp->ptr());
duke@435	2811	switch (tp->ptr()) {
duke@435	2812	case Null:
duke@435	2813	if( ptr == Null ) return TypePtr::make( AnyPtr, ptr, offset );
duke@435	2814	case TopPTR:
duke@435	2815	case AnyNull:
duke@435	2816	return make( ptr, klass(), klass_is_exact(),
duke@435	2817	(ptr == Constant ? const_oop() : NULL), offset );
duke@435	2818	case NotNull:
duke@435	2819	case BotPTR:
duke@435	2820	return TypePtr::make( AnyPtr, ptr, offset );
duke@435	2821	default: typerr(t);
duke@435	2822	}
duke@435	2823	}
duke@435	2824
duke@435	2825	/*
duke@435	2826	A-top }
duke@435	2827	/ | \ } Tops
duke@435	2828	B-top A-any C-top }
duke@435	2829	| / | \ | } Any-nulls
duke@435	2830	B-any | C-any }
duke@435	2831	| | |
duke@435	2832	B-con A-con C-con } constants; not comparable across classes
duke@435	2833	| | |
duke@435	2834	B-not | C-not }
duke@435	2835	| \ | / | } not-nulls
duke@435	2836	B-bot A-not C-bot }
duke@435	2837	\ | / } Bottoms
duke@435	2838	A-bot }
duke@435	2839	*/
duke@435	2840
duke@435	2841	case InstPtr: { // Meeting 2 Oops?
duke@435	2842	// Found an InstPtr sub-type vs self-InstPtr type
duke@435	2843	const TypeInstPtr *tinst = t->is_instptr();
duke@435	2844	int off = meet_offset( tinst->offset() );
duke@435	2845	PTR ptr = meet_ptr( tinst->ptr() );
duke@435	2846	int instance_id = meet_instance(tinst->instance_id());
duke@435	2847
duke@435	2848	// Check for easy case; klasses are equal (and perhaps not loaded!)
duke@435	2849	// If we have constants, then we created oops so classes are loaded
duke@435	2850	// and we can handle the constants further down. This case handles
duke@435	2851	// both-not-loaded or both-loaded classes
duke@435	2852	if (ptr != Constant && klass()->equals(tinst->klass()) && klass_is_exact() == tinst->klass_is_exact()) {
duke@435	2853	return make( ptr, klass(), klass_is_exact(), NULL, off, instance_id );
duke@435	2854	}
duke@435	2855
duke@435	2856	// Classes require inspection in the Java klass hierarchy. Must be loaded.
duke@435	2857	ciKlass* tinst_klass = tinst->klass();
duke@435	2858	ciKlass* this_klass = this->klass();
duke@435	2859	bool tinst_xk = tinst->klass_is_exact();
duke@435	2860	bool this_xk = this->klass_is_exact();
duke@435	2861	if (!tinst_klass->is_loaded() || !this_klass->is_loaded() ) {
duke@435	2862	// One of these classes has not been loaded
duke@435	2863	const TypeInstPtr *unloaded_meet = xmeet_unloaded(tinst);
duke@435	2864	#ifndef PRODUCT
duke@435	2865	if( PrintOpto && Verbose ) {
duke@435	2866	tty->print("meet of unloaded classes resulted in: "); unloaded_meet->dump(); tty->cr();
duke@435	2867	tty->print(" this == "); this->dump(); tty->cr();
duke@435	2868	tty->print(" tinst == "); tinst->dump(); tty->cr();
duke@435	2869	}
duke@435	2870	#endif
duke@435	2871	return unloaded_meet;
duke@435	2872	}
duke@435	2873
duke@435	2874	// Handle mixing oops and interfaces first.
duke@435	2875	if( this_klass->is_interface() && !tinst_klass->is_interface() ) {
duke@435	2876	ciKlass *tmp = tinst_klass; // Swap interface around
duke@435	2877	tinst_klass = this_klass;
duke@435	2878	this_klass = tmp;
duke@435	2879	bool tmp2 = tinst_xk;
duke@435	2880	tinst_xk = this_xk;
duke@435	2881	this_xk = tmp2;
duke@435	2882	}
duke@435	2883	if (tinst_klass->is_interface() &&
duke@435	2884	!(this_klass->is_interface() ||
duke@435	2885	// Treat java/lang/Object as an honorary interface,
duke@435	2886	// because we need a bottom for the interface hierarchy.
duke@435	2887	this_klass == ciEnv::current()->Object_klass())) {
duke@435	2888	// Oop meets interface!
duke@435	2889
duke@435	2890	// See if the oop subtypes (implements) interface.
duke@435	2891	ciKlass *k;
duke@435	2892	bool xk;
duke@435	2893	if( this_klass->is_subtype_of( tinst_klass ) ) {
duke@435	2894	// Oop indeed subtypes. Now keep oop or interface depending
duke@435	2895	// on whether we are both above the centerline or either is
duke@435	2896	// below the centerline. If we are on the centerline
duke@435	2897	// (e.g., Constant vs. AnyNull interface), use the constant.
duke@435	2898	k = below_centerline(ptr) ? tinst_klass : this_klass;
duke@435	2899	// If we are keeping this_klass, keep its exactness too.
duke@435	2900	xk = below_centerline(ptr) ? tinst_xk : this_xk;
duke@435	2901	} else { // Does not implement, fall to Object
duke@435	2902	// Oop does not implement interface, so mixing falls to Object
duke@435	2903	// just like the verifier does (if both are above the
duke@435	2904	// centerline fall to interface)
duke@435	2905	k = above_centerline(ptr) ? tinst_klass : ciEnv::current()->Object_klass();
duke@435	2906	xk = above_centerline(ptr) ? tinst_xk : false;
duke@435	2907	// Watch out for Constant vs. AnyNull interface.
duke@435	2908	if (ptr == Constant) ptr = NotNull; // forget it was a constant
duke@435	2909	}
duke@435	2910	ciObject* o = NULL; // the Constant value, if any
duke@435	2911	if (ptr == Constant) {
duke@435	2912	// Find out which constant.
duke@435	2913	o = (this_klass == klass()) ? const_oop() : tinst->const_oop();
duke@435	2914	}
duke@435	2915	return make( ptr, k, xk, o, off );
duke@435	2916	}
duke@435	2917
duke@435	2918	// Either oop vs oop or interface vs interface or interface vs Object
duke@435	2919
duke@435	2920	// !!! Here's how the symmetry requirement breaks down into invariants:
duke@435	2921	// If we split one up & one down AND they subtype, take the down man.
duke@435	2922	// If we split one up & one down AND they do NOT subtype, "fall hard".
duke@435	2923	// If both are up and they subtype, take the subtype class.
duke@435	2924	// If both are up and they do NOT subtype, "fall hard".
duke@435	2925	// If both are down and they subtype, take the supertype class.
duke@435	2926	// If both are down and they do NOT subtype, "fall hard".
duke@435	2927	// Constants treated as down.
duke@435	2928
duke@435	2929	// Now, reorder the above list; observe that both-down+subtype is also
duke@435	2930	// "fall hard"; "fall hard" becomes the default case:
duke@435	2931	// If we split one up & one down AND they subtype, take the down man.
duke@435	2932	// If both are up and they subtype, take the subtype class.
duke@435	2933
duke@435	2934	// If both are down and they subtype, "fall hard".
duke@435	2935	// If both are down and they do NOT subtype, "fall hard".
duke@435	2936	// If both are up and they do NOT subtype, "fall hard".
duke@435	2937	// If we split one up & one down AND they do NOT subtype, "fall hard".
duke@435	2938
duke@435	2939	// If a proper subtype is exact, and we return it, we return it exactly.
duke@435	2940	// If a proper supertype is exact, there can be no subtyping relationship!
duke@435	2941	// If both types are equal to the subtype, exactness is and-ed below the
duke@435	2942	// centerline and or-ed above it. (N.B. Constants are always exact.)
duke@435	2943
duke@435	2944	// Check for subtyping:
duke@435	2945	ciKlass *subtype = NULL;
duke@435	2946	bool subtype_exact = false;
duke@435	2947	if( tinst_klass->equals(this_klass) ) {
duke@435	2948	subtype = this_klass;
duke@435	2949	subtype_exact = below_centerline(ptr) ? (this_xk & tinst_xk) : (this_xk | tinst_xk);
duke@435	2950	} else if( !tinst_xk && this_klass->is_subtype_of( tinst_klass ) ) {
duke@435	2951	subtype = this_klass; // Pick subtyping class
duke@435	2952	subtype_exact = this_xk;
duke@435	2953	} else if( !this_xk && tinst_klass->is_subtype_of( this_klass ) ) {
duke@435	2954	subtype = tinst_klass; // Pick subtyping class
duke@435	2955	subtype_exact = tinst_xk;
duke@435	2956	}
duke@435	2957
duke@435	2958	if( subtype ) {
duke@435	2959	if( above_centerline(ptr) ) { // both are up?
duke@435	2960	this_klass = tinst_klass = subtype;
duke@435	2961	this_xk = tinst_xk = subtype_exact;
duke@435	2962	} else if( above_centerline(this ->_ptr) && !above_centerline(tinst->_ptr) ) {
duke@435	2963	this_klass = tinst_klass; // tinst is down; keep down man
duke@435	2964	this_xk = tinst_xk;
duke@435	2965	} else if( above_centerline(tinst->_ptr) && !above_centerline(this ->_ptr) ) {
duke@435	2966	tinst_klass = this_klass; // this is down; keep down man
duke@435	2967	tinst_xk = this_xk;
duke@435	2968	} else {
duke@435	2969	this_xk = subtype_exact; // either they are equal, or we'll do an LCA
duke@435	2970	}
duke@435	2971	}
duke@435	2972
duke@435	2973	// Check for classes now being equal
duke@435	2974	if (tinst_klass->equals(this_klass)) {
duke@435	2975	// If the klasses are equal, the constants may still differ. Fall to
duke@435	2976	// NotNull if they do (neither constant is NULL; that is a special case
duke@435	2977	// handled elsewhere).
duke@435	2978	ciObject* o = NULL; // Assume not constant when done
duke@435	2979	ciObject* this_oop = const_oop();
duke@435	2980	ciObject* tinst_oop = tinst->const_oop();
duke@435	2981	if( ptr == Constant ) {
duke@435	2982	if (this_oop != NULL && tinst_oop != NULL &&
duke@435	2983	this_oop->equals(tinst_oop) )
duke@435	2984	o = this_oop;
duke@435	2985	else if (above_centerline(this ->_ptr))
duke@435	2986	o = tinst_oop;
duke@435	2987	else if (above_centerline(tinst ->_ptr))
duke@435	2988	o = this_oop;
duke@435	2989	else
duke@435	2990	ptr = NotNull;
duke@435	2991	}
duke@435	2992	return make( ptr, this_klass, this_xk, o, off, instance_id );
duke@435	2993	} // Else classes are not equal
duke@435	2994
duke@435	2995	// Since klasses are different, we require a LCA in the Java
duke@435	2996	// class hierarchy - which means we have to fall to at least NotNull.
duke@435	2997	if( ptr == TopPTR || ptr == AnyNull || ptr == Constant )
duke@435	2998	ptr = NotNull;
duke@435	2999
duke@435	3000	// Now we find the LCA of Java classes
duke@435	3001	ciKlass* k = this_klass->least_common_ancestor(tinst_klass);
duke@435	3002	return make( ptr, k, false, NULL, off );
duke@435	3003	} // End of case InstPtr
duke@435	3004
duke@435	3005	case KlassPtr:
duke@435	3006	return TypeInstPtr::BOTTOM;
duke@435	3007
duke@435	3008	} // End of switch
duke@435	3009	return this; // Return the double constant
duke@435	3010	}
duke@435	3011
duke@435	3012
duke@435	3013	//------------------------java_mirror_type--------------------------------------
duke@435	3014	ciType* TypeInstPtr::java_mirror_type() const {
duke@435	3015	// must be a singleton type
duke@435	3016	if( const_oop() == NULL ) return NULL;
duke@435	3017
duke@435	3018	// must be of type java.lang.Class
duke@435	3019	if( klass() != ciEnv::current()->Class_klass() ) return NULL;
duke@435	3020
duke@435	3021	return const_oop()->as_instance()->java_mirror_type();
duke@435	3022	}
duke@435	3023
duke@435	3024
duke@435	3025	//------------------------------xdual------------------------------------------
duke@435	3026	// Dual: do NOT dual on klasses. This means I do NOT understand the Java
duke@435	3027	// inheritence mechanism.
duke@435	3028	const Type *TypeInstPtr::xdual() const {
duke@435	3029	return new TypeInstPtr( dual_ptr(), klass(), klass_is_exact(), const_oop(), dual_offset(), dual_instance() );
duke@435	3030	}
duke@435	3031
duke@435	3032	//------------------------------eq---------------------------------------------
duke@435	3033	// Structural equality check for Type representations
duke@435	3034	bool TypeInstPtr::eq( const Type *t ) const {
duke@435	3035	const TypeInstPtr *p = t->is_instptr();
duke@435	3036	return
duke@435	3037	klass()->equals(p->klass()) &&
duke@435	3038	TypeOopPtr::eq(p); // Check sub-type stuff
duke@435	3039	}
duke@435	3040
duke@435	3041	//------------------------------hash-------------------------------------------
duke@435	3042	// Type-specific hashing function.
duke@435	3043	int TypeInstPtr::hash(void) const {
duke@435	3044	int hash = klass()->hash() + TypeOopPtr::hash();
duke@435	3045	return hash;
duke@435	3046	}
duke@435	3047
duke@435	3048	//------------------------------dump2------------------------------------------
duke@435	3049	// Dump oop Type
duke@435	3050	#ifndef PRODUCT
duke@435	3051	void TypeInstPtr::dump2( Dict &d, uint depth, outputStream *st ) const {
duke@435	3052	// Print the name of the klass.
duke@435	3053	klass()->print_name_on(st);
duke@435	3054
duke@435	3055	switch( _ptr ) {
duke@435	3056	case Constant:
duke@435	3057	// TO DO: Make CI print the hex address of the underlying oop.
duke@435	3058	if (WizardMode || Verbose) {
duke@435	3059	const_oop()->print_oop(st);
duke@435	3060	}
duke@435	3061	case BotPTR:
duke@435	3062	if (!WizardMode && !Verbose) {
duke@435	3063	if( _klass_is_exact ) st->print(":exact");
duke@435	3064	break;
duke@435	3065	}
duke@435	3066	case TopPTR:
duke@435	3067	case AnyNull:
duke@435	3068	case NotNull:
duke@435	3069	st->print(":%s", ptr_msg[_ptr]);
duke@435	3070	if( _klass_is_exact ) st->print(":exact");
duke@435	3071	break;
duke@435	3072	}
duke@435	3073
duke@435	3074	if( _offset ) { // Dump offset, if any
duke@435	3075	if( _offset == OffsetBot ) st->print("+any");
duke@435	3076	else if( _offset == OffsetTop ) st->print("+unknown");
duke@435	3077	else st->print("+%d", _offset);
duke@435	3078	}
duke@435	3079
duke@435	3080	st->print(" *");
duke@435	3081	if (_instance_id != UNKNOWN_INSTANCE)
duke@435	3082	st->print(",iid=%d",_instance_id);
duke@435	3083	}
duke@435	3084	#endif
duke@435	3085
duke@435	3086	//------------------------------add_offset-------------------------------------
duke@435	3087	const TypePtr *TypeInstPtr::add_offset( int offset ) const {
duke@435	3088	return make( _ptr, klass(), klass_is_exact(), const_oop(), xadd_offset(offset), _instance_id );
duke@435	3089	}
duke@435	3090
duke@435	3091	//=============================================================================
duke@435	3092	// Convenience common pre-built types.
duke@435	3093	const TypeAryPtr *TypeAryPtr::RANGE;
duke@435	3094	const TypeAryPtr *TypeAryPtr::OOPS;
kvn@598	3095	const TypeAryPtr *TypeAryPtr::NARROWOOPS;
duke@435	3096	const TypeAryPtr *TypeAryPtr::BYTES;
duke@435	3097	const TypeAryPtr *TypeAryPtr::SHORTS;
duke@435	3098	const TypeAryPtr *TypeAryPtr::CHARS;
duke@435	3099	const TypeAryPtr *TypeAryPtr::INTS;
duke@435	3100	const TypeAryPtr *TypeAryPtr::LONGS;
duke@435	3101	const TypeAryPtr *TypeAryPtr::FLOATS;
duke@435	3102	const TypeAryPtr *TypeAryPtr::DOUBLES;
duke@435	3103
duke@435	3104	//------------------------------make-------------------------------------------
duke@435	3105	const TypeAryPtr *TypeAryPtr::make( PTR ptr, const TypeAry *ary, ciKlass* k, bool xk, int offset, int instance_id ) {
duke@435	3106	assert(!(k == NULL && ary->_elem->isa_int()),
duke@435	3107	"integral arrays must be pre-equipped with a class");
duke@435	3108	if (!xk) xk = ary->ary_must_be_exact();
duke@435	3109	if (instance_id != UNKNOWN_INSTANCE)
duke@435	3110	xk = true; // instances are always exactly typed
duke@435	3111	if (!UseExactTypes) xk = (ptr == Constant);
duke@435	3112	return (TypeAryPtr*)(new TypeAryPtr(ptr, NULL, ary, k, xk, offset, instance_id))->hashcons();
duke@435	3113	}
duke@435	3114
duke@435	3115	//------------------------------make-------------------------------------------
duke@435	3116	const TypeAryPtr *TypeAryPtr::make( PTR ptr, ciObject* o, const TypeAry *ary, ciKlass* k, bool xk, int offset, int instance_id ) {
duke@435	3117	assert(!(k == NULL && ary->_elem->isa_int()),
duke@435	3118	"integral arrays must be pre-equipped with a class");
duke@435	3119	assert( (ptr==Constant && o) || (ptr!=Constant && !o), "" );
duke@435	3120	if (!xk) xk = (o != NULL) || ary->ary_must_be_exact();
duke@435	3121	if (instance_id != UNKNOWN_INSTANCE)
duke@435	3122	xk = true; // instances are always exactly typed
duke@435	3123	if (!UseExactTypes) xk = (ptr == Constant);
duke@435	3124	return (TypeAryPtr*)(new TypeAryPtr(ptr, o, ary, k, xk, offset, instance_id))->hashcons();
duke@435	3125	}
duke@435	3126
duke@435	3127	//------------------------------cast_to_ptr_type-------------------------------
duke@435	3128	const Type *TypeAryPtr::cast_to_ptr_type(PTR ptr) const {
duke@435	3129	if( ptr == _ptr ) return this;
duke@435	3130	return make(ptr, const_oop(), _ary, klass(), klass_is_exact(), _offset);
duke@435	3131	}
duke@435	3132
duke@435	3133
duke@435	3134	//-----------------------------cast_to_exactness-------------------------------
duke@435	3135	const Type *TypeAryPtr::cast_to_exactness(bool klass_is_exact) const {
duke@435	3136	if( klass_is_exact == _klass_is_exact ) return this;
duke@435	3137	if (!UseExactTypes) return this;
duke@435	3138	if (_ary->ary_must_be_exact()) return this; // cannot clear xk
duke@435	3139	return make(ptr(), const_oop(), _ary, klass(), klass_is_exact, _offset, _instance_id);
duke@435	3140	}
duke@435	3141
duke@435	3142	//-----------------------------cast_to_instance-------------------------------
duke@435	3143	const TypeOopPtr *TypeAryPtr::cast_to_instance(int instance_id) const {
duke@435	3144	if( instance_id == _instance_id) return this;
kvn@598	3145	bool exact = true;
kvn@598	3146	PTR ptr_t = NotNull;
kvn@598	3147	if (instance_id == UNKNOWN_INSTANCE) {
kvn@598	3148	exact = _klass_is_exact;
kvn@598	3149	ptr_t = _ptr;
kvn@598	3150	}
kvn@598	3151	return make(ptr_t, const_oop(), _ary, klass(), exact, _offset, instance_id);
duke@435	3152	}
duke@435	3153
duke@435	3154	//-----------------------------narrow_size_type-------------------------------
duke@435	3155	// Local cache for arrayOopDesc::max_array_length(etype),
duke@435	3156	// which is kind of slow (and cached elsewhere by other users).
duke@435	3157	static jint max_array_length_cache[T_CONFLICT+1];
duke@435	3158	static jint max_array_length(BasicType etype) {
duke@435	3159	jint& cache = max_array_length_cache[etype];
duke@435	3160	jint res = cache;
duke@435	3161	if (res == 0) {
duke@435	3162	switch (etype) {
coleenp@548	3163	case T_NARROWOOP:
coleenp@548	3164	etype = T_OBJECT;
coleenp@548	3165	break;
duke@435	3166	case T_CONFLICT:
duke@435	3167	case T_ILLEGAL:
duke@435	3168	case T_VOID:
duke@435	3169	etype = T_BYTE; // will produce conservatively high value
duke@435	3170	}
duke@435	3171	cache = res = arrayOopDesc::max_array_length(etype);
duke@435	3172	}
duke@435	3173	return res;
duke@435	3174	}
duke@435	3175
duke@435	3176	// Narrow the given size type to the index range for the given array base type.
duke@435	3177	// Return NULL if the resulting int type becomes empty.
duke@435	3178	const TypeInt* TypeAryPtr::narrow_size_type(const TypeInt* size, BasicType elem) {
duke@435	3179	jint hi = size->_hi;
duke@435	3180	jint lo = size->_lo;
duke@435	3181	jint min_lo = 0;
duke@435	3182	jint max_hi = max_array_length(elem);
duke@435	3183	//if (index_not_size) --max_hi; // type of a valid array index, FTR
duke@435	3184	bool chg = false;
duke@435	3185	if (lo < min_lo) { lo = min_lo; chg = true; }
duke@435	3186	if (hi > max_hi) { hi = max_hi; chg = true; }
duke@435	3187	if (lo > hi)
duke@435	3188	return NULL;
duke@435	3189	if (!chg)
duke@435	3190	return size;
duke@435	3191	return TypeInt::make(lo, hi, Type::WidenMin);
duke@435	3192	}
duke@435	3193
duke@435	3194	//-------------------------------cast_to_size----------------------------------
duke@435	3195	const TypeAryPtr* TypeAryPtr::cast_to_size(const TypeInt* new_size) const {
duke@435	3196	assert(new_size != NULL, "");
duke@435	3197	new_size = narrow_size_type(new_size, elem()->basic_type());
duke@435	3198	if (new_size == NULL) // Negative length arrays will produce weird
duke@435	3199	new_size = TypeInt::ZERO; // intermediate dead fast-path goo
duke@435	3200	if (new_size == size()) return this;
duke@435	3201	const TypeAry* new_ary = TypeAry::make(elem(), new_size);
duke@435	3202	return make(ptr(), const_oop(), new_ary, klass(), klass_is_exact(), _offset);
duke@435	3203	}
duke@435	3204
duke@435	3205
duke@435	3206	//------------------------------eq---------------------------------------------
duke@435	3207	// Structural equality check for Type representations
duke@435	3208	bool TypeAryPtr::eq( const Type *t ) const {
duke@435	3209	const TypeAryPtr *p = t->is_aryptr();
duke@435	3210	return
duke@435	3211	_ary == p->_ary && // Check array
duke@435	3212	TypeOopPtr::eq(p); // Check sub-parts
duke@435	3213	}
duke@435	3214
duke@435	3215	//------------------------------hash-------------------------------------------
duke@435	3216	// Type-specific hashing function.
duke@435	3217	int TypeAryPtr::hash(void) const {
duke@435	3218	return (intptr_t)_ary + TypeOopPtr::hash();
duke@435	3219	}
duke@435	3220
duke@435	3221	//------------------------------meet-------------------------------------------
duke@435	3222	// Compute the MEET of two types. It returns a new Type object.
duke@435	3223	const Type *TypeAryPtr::xmeet( const Type *t ) const {
duke@435	3224	// Perform a fast test for common case; meeting the same types together.
duke@435	3225	if( this == t ) return this; // Meeting same type-rep?
duke@435	3226	// Current "this->_base" is Pointer
duke@435	3227	switch (t->base()) { // switch on original type
duke@435	3228
duke@435	3229	// Mixing ints & oops happens when javac reuses local variables
duke@435	3230	case Int:
duke@435	3231	case Long:
duke@435	3232	case FloatTop:
duke@435	3233	case FloatCon:
duke@435	3234	case FloatBot:
duke@435	3235	case DoubleTop:
duke@435	3236	case DoubleCon:
duke@435	3237	case DoubleBot:
coleenp@548	3238	case NarrowOop:
duke@435	3239	case Bottom: // Ye Olde Default
duke@435	3240	return Type::BOTTOM;
duke@435	3241	case Top:
duke@435	3242	return this;
duke@435	3243
duke@435	3244	default: // All else is a mistake
duke@435	3245	typerr(t);
duke@435	3246
duke@435	3247	case OopPtr: { // Meeting to OopPtrs
duke@435	3248	// Found a OopPtr type vs self-AryPtr type
duke@435	3249	const TypePtr *tp = t->is_oopptr();
duke@435	3250	int offset = meet_offset(tp->offset());
duke@435	3251	PTR ptr = meet_ptr(tp->ptr());
duke@435	3252	switch (tp->ptr()) {
duke@435	3253	case TopPTR:
duke@435	3254	case AnyNull:
duke@435	3255	return make(ptr, (ptr == Constant ? const_oop() : NULL), _ary, _klass, _klass_is_exact, offset);
duke@435	3256	case BotPTR:
duke@435	3257	case NotNull:
duke@435	3258	return TypeOopPtr::make(ptr, offset);
duke@435	3259	default: ShouldNotReachHere();
duke@435	3260	}
duke@435	3261	}
duke@435	3262
duke@435	3263	case AnyPtr: { // Meeting two AnyPtrs
duke@435	3264	// Found an AnyPtr type vs self-AryPtr type
duke@435	3265	const TypePtr *tp = t->is_ptr();
duke@435	3266	int offset = meet_offset(tp->offset());
duke@435	3267	PTR ptr = meet_ptr(tp->ptr());
duke@435	3268	switch (tp->ptr()) {
duke@435	3269	case TopPTR:
duke@435	3270	return this;
duke@435	3271	case BotPTR:
duke@435	3272	case NotNull:
duke@435	3273	return TypePtr::make(AnyPtr, ptr, offset);
duke@435	3274	case Null:
duke@435	3275	if( ptr == Null ) return TypePtr::make(AnyPtr, ptr, offset);
duke@435	3276	case AnyNull:
duke@435	3277	return make( ptr, (ptr == Constant ? const_oop() : NULL), _ary, _klass, _klass_is_exact, offset );
duke@435	3278	default: ShouldNotReachHere();
duke@435	3279	}
duke@435	3280	}
duke@435	3281
duke@435	3282	case RawPtr: return TypePtr::BOTTOM;
duke@435	3283
duke@435	3284	case AryPtr: { // Meeting 2 references?
duke@435	3285	const TypeAryPtr *tap = t->is_aryptr();
duke@435	3286	int off = meet_offset(tap->offset());
duke@435	3287	const TypeAry *tary = _ary->meet(tap->_ary)->is_ary();
duke@435	3288	PTR ptr = meet_ptr(tap->ptr());
duke@435	3289	int iid = meet_instance(tap->instance_id());
duke@435	3290	ciKlass* lazy_klass = NULL;
duke@435	3291	if (tary->_elem->isa_int()) {
duke@435	3292	// Integral array element types have irrelevant lattice relations.
duke@435	3293	// It is the klass that determines array layout, not the element type.
duke@435	3294	if (_klass == NULL)
duke@435	3295	lazy_klass = tap->_klass;
duke@435	3296	else if (tap->_klass == NULL || tap->_klass == _klass) {
duke@435	3297	lazy_klass = _klass;
duke@435	3298	} else {
duke@435	3299	// Something like byte[int+] meets char[int+].
duke@435	3300	// This must fall to bottom, not (int[-128..65535])[int+].
duke@435	3301	tary = TypeAry::make(Type::BOTTOM, tary->_size);
duke@435	3302	}
duke@435	3303	}
duke@435	3304	bool xk;
duke@435	3305	switch (tap->ptr()) {
duke@435	3306	case AnyNull:
duke@435	3307	case TopPTR:
duke@435	3308	// Compute new klass on demand, do not use tap->_klass
duke@435	3309	xk = (tap->_klass_is_exact | this->_klass_is_exact);
kvn@499	3310	return make( ptr, const_oop(), tary, lazy_klass, xk, off, iid );
duke@435	3311	case Constant: {
duke@435	3312	ciObject* o = const_oop();
duke@435	3313	if( _ptr == Constant ) {
duke@435	3314	if( tap->const_oop() != NULL && !o->equals(tap->const_oop()) ) {
duke@435	3315	ptr = NotNull;
duke@435	3316	o = NULL;
duke@435	3317	}
duke@435	3318	} else if( above_centerline(_ptr) ) {
duke@435	3319	o = tap->const_oop();
duke@435	3320	}
duke@435	3321	xk = true;
kvn@499	3322	return TypeAryPtr::make( ptr, o, tary, tap->_klass, xk, off, iid );
duke@435	3323	}
duke@435	3324	case NotNull:
duke@435	3325	case BotPTR:
duke@435	3326	// Compute new klass on demand, do not use tap->_klass
duke@435	3327	if (above_centerline(this->_ptr))
duke@435	3328	xk = tap->_klass_is_exact;
duke@435	3329	else if (above_centerline(tap->_ptr))
duke@435	3330	xk = this->_klass_is_exact;
duke@435	3331	else xk = (tap->_klass_is_exact & this->_klass_is_exact) &&
duke@435	3332	(klass() == tap->klass()); // Only precise for identical arrays
duke@435	3333	return TypeAryPtr::make( ptr, NULL, tary, lazy_klass, xk, off, iid );
duke@435	3334	default: ShouldNotReachHere();
duke@435	3335	}
duke@435	3336	}
duke@435	3337
duke@435	3338	// All arrays inherit from Object class
duke@435	3339	case InstPtr: {
duke@435	3340	const TypeInstPtr *tp = t->is_instptr();
duke@435	3341	int offset = meet_offset(tp->offset());
duke@435	3342	PTR ptr = meet_ptr(tp->ptr());
duke@435	3343	int iid = meet_instance(tp->instance_id());
duke@435	3344	switch (ptr) {
duke@435	3345	case TopPTR:
duke@435	3346	case AnyNull: // Fall 'down' to dual of object klass
duke@435	3347	if( tp->klass()->equals(ciEnv::current()->Object_klass()) ) {
duke@435	3348	return TypeAryPtr::make( ptr, _ary, _klass, _klass_is_exact, offset, iid );
duke@435	3349	} else {
duke@435	3350	// cannot subclass, so the meet has to fall badly below the centerline
duke@435	3351	ptr = NotNull;
duke@435	3352	return TypeInstPtr::make( ptr, ciEnv::current()->Object_klass(), false, NULL,offset, iid);
duke@435	3353	}
duke@435	3354	case Constant:
duke@435	3355	case NotNull:
duke@435	3356	case BotPTR: // Fall down to object klass
duke@435	3357	// LCA is object_klass, but if we subclass from the top we can do better
duke@435	3358	if (above_centerline(tp->ptr())) {
duke@435	3359	// If 'tp' is above the centerline and it is Object class
duke@435	3360	// then we can subclass in the Java class heirarchy.
duke@435	3361	if( tp->klass()->equals(ciEnv::current()->Object_klass()) ) {
duke@435	3362	// that is, my array type is a subtype of 'tp' klass
duke@435	3363	return make( ptr, _ary, _klass, _klass_is_exact, offset, iid );
duke@435	3364	}
duke@435	3365	}
duke@435	3366	// The other case cannot happen, since t cannot be a subtype of an array.
duke@435	3367	// The meet falls down to Object class below centerline.
duke@435	3368	if( ptr == Constant )
duke@435	3369	ptr = NotNull;
duke@435	3370	return TypeInstPtr::make( ptr, ciEnv::current()->Object_klass(), false, NULL,offset, iid);
duke@435	3371	default: typerr(t);
duke@435	3372	}
duke@435	3373	}
duke@435	3374
duke@435	3375	case KlassPtr:
duke@435	3376	return TypeInstPtr::BOTTOM;
duke@435	3377
duke@435	3378	}
duke@435	3379	return this; // Lint noise
duke@435	3380	}
duke@435	3381
duke@435	3382	//------------------------------xdual------------------------------------------
duke@435	3383	// Dual: compute field-by-field dual
duke@435	3384	const Type *TypeAryPtr::xdual() const {
duke@435	3385	return new TypeAryPtr( dual_ptr(), _const_oop, _ary->dual()->is_ary(),_klass, _klass_is_exact, dual_offset(), dual_instance() );
duke@435	3386	}
duke@435	3387
duke@435	3388	//------------------------------dump2------------------------------------------
duke@435	3389	#ifndef PRODUCT
duke@435	3390	void TypeAryPtr::dump2( Dict &d, uint depth, outputStream *st ) const {
duke@435	3391	_ary->dump2(d,depth,st);
duke@435	3392	switch( _ptr ) {
duke@435	3393	case Constant:
duke@435	3394	const_oop()->print(st);
duke@435	3395	break;
duke@435	3396	case BotPTR:
duke@435	3397	if (!WizardMode && !Verbose) {
duke@435	3398	if( _klass_is_exact ) st->print(":exact");
duke@435	3399	break;
duke@435	3400	}
duke@435	3401	case TopPTR:
duke@435	3402	case AnyNull:
duke@435	3403	case NotNull:
duke@435	3404	st->print(":%s", ptr_msg[_ptr]);
duke@435	3405	if( _klass_is_exact ) st->print(":exact");
duke@435	3406	break;
duke@435	3407	}
duke@435	3408
kvn@499	3409	if( _offset != 0 ) {
kvn@499	3410	int header_size = objArrayOopDesc::header_size() * wordSize;
kvn@499	3411	if( _offset == OffsetTop ) st->print("+undefined");
kvn@499	3412	else if( _offset == OffsetBot ) st->print("+any");
kvn@499	3413	else if( _offset < header_size ) st->print("+%d", _offset);
kvn@499	3414	else {
kvn@499	3415	BasicType basic_elem_type = elem()->basic_type();
kvn@499	3416	int array_base = arrayOopDesc::base_offset_in_bytes(basic_elem_type);
kvn@499	3417	int elem_size = type2aelembytes(basic_elem_type);
kvn@499	3418	st->print("[%d]", (_offset - array_base)/elem_size);
kvn@499	3419	}
kvn@499	3420	}
kvn@499	3421	st->print(" *");
duke@435	3422	if (_instance_id != UNKNOWN_INSTANCE)
duke@435	3423	st->print(",iid=%d",_instance_id);
duke@435	3424	}
duke@435	3425	#endif
duke@435	3426
duke@435	3427	bool TypeAryPtr::empty(void) const {
duke@435	3428	if (_ary->empty()) return true;
duke@435	3429	return TypeOopPtr::empty();
duke@435	3430	}
duke@435	3431
duke@435	3432	//------------------------------add_offset-------------------------------------
duke@435	3433	const TypePtr *TypeAryPtr::add_offset( int offset ) const {
duke@435	3434	return make( _ptr, _const_oop, _ary, _klass, _klass_is_exact, xadd_offset(offset), _instance_id );
duke@435	3435	}
duke@435	3436
duke@435	3437
duke@435	3438	//=============================================================================
coleenp@548	3439	const TypeNarrowOop *TypeNarrowOop::BOTTOM;
coleenp@548	3440	const TypeNarrowOop *TypeNarrowOop::NULL_PTR;
coleenp@548	3441
coleenp@548	3442
coleenp@548	3443	const TypeNarrowOop* TypeNarrowOop::make(const TypePtr* type) {
coleenp@548	3444	return (const TypeNarrowOop*)(new TypeNarrowOop(type))->hashcons();
coleenp@548	3445	}
coleenp@548	3446
coleenp@548	3447	//------------------------------hash-------------------------------------------
coleenp@548	3448	// Type-specific hashing function.
coleenp@548	3449	int TypeNarrowOop::hash(void) const {
coleenp@548	3450	return _ooptype->hash() + 7;
coleenp@548	3451	}
coleenp@548	3452
coleenp@548	3453
coleenp@548	3454	bool TypeNarrowOop::eq( const Type *t ) const {
coleenp@548	3455	const TypeNarrowOop* tc = t->isa_narrowoop();
coleenp@548	3456	if (tc != NULL) {
coleenp@548	3457	if (_ooptype->base() != tc->_ooptype->base()) {
coleenp@548	3458	return false;
coleenp@548	3459	}
coleenp@548	3460	return tc->_ooptype->eq(_ooptype);
coleenp@548	3461	}
coleenp@548	3462	return false;
coleenp@548	3463	}
coleenp@548	3464
coleenp@548	3465	bool TypeNarrowOop::singleton(void) const { // TRUE if type is a singleton
coleenp@548	3466	return _ooptype->singleton();
coleenp@548	3467	}
coleenp@548	3468
coleenp@548	3469	bool TypeNarrowOop::empty(void) const {
coleenp@548	3470	return _ooptype->empty();
coleenp@548	3471	}
coleenp@548	3472
coleenp@548	3473	//------------------------------meet-------------------------------------------
coleenp@548	3474	// Compute the MEET of two types. It returns a new Type object.
coleenp@548	3475	const Type *TypeNarrowOop::xmeet( const Type *t ) const {
coleenp@548	3476	// Perform a fast test for common case; meeting the same types together.
coleenp@548	3477	if( this == t ) return this; // Meeting same type-rep?
coleenp@548	3478
coleenp@548	3479
coleenp@548	3480	// Current "this->_base" is OopPtr
coleenp@548	3481	switch (t->base()) { // switch on original type
coleenp@548	3482
coleenp@548	3483	case Int: // Mixing ints & oops happens when javac
coleenp@548	3484	case Long: // reuses local variables
coleenp@548	3485	case FloatTop:
coleenp@548	3486	case FloatCon:
coleenp@548	3487	case FloatBot:
coleenp@548	3488	case DoubleTop:
coleenp@548	3489	case DoubleCon:
coleenp@548	3490	case DoubleBot:
coleenp@548	3491	case Bottom: // Ye Olde Default
coleenp@548	3492	return Type::BOTTOM;
coleenp@548	3493	case Top:
coleenp@548	3494	return this;
coleenp@548	3495
coleenp@548	3496	case NarrowOop: {
coleenp@548	3497	const Type* result = _ooptype->xmeet(t->is_narrowoop()->make_oopptr());
coleenp@548	3498	if (result->isa_ptr()) {
coleenp@548	3499	return TypeNarrowOop::make(result->is_ptr());
coleenp@548	3500	}
coleenp@548	3501	return result;
coleenp@548	3502	}
coleenp@548	3503
coleenp@548	3504	default: // All else is a mistake
coleenp@548	3505	typerr(t);
coleenp@548	3506
coleenp@548	3507	case RawPtr:
coleenp@548	3508	case AnyPtr:
coleenp@548	3509	case OopPtr:
coleenp@548	3510	case InstPtr:
coleenp@548	3511	case KlassPtr:
coleenp@548	3512	case AryPtr:
coleenp@548	3513	typerr(t);
coleenp@548	3514	return Type::BOTTOM;
coleenp@548	3515
coleenp@548	3516	} // End of switch
coleenp@548	3517	}
coleenp@548	3518
coleenp@548	3519	const Type *TypeNarrowOop::xdual() const { // Compute dual right now.
coleenp@548	3520	const TypePtr* odual = _ooptype->dual()->is_ptr();
coleenp@548	3521	return new TypeNarrowOop(odual);
coleenp@548	3522	}
coleenp@548	3523
coleenp@548	3524	const Type *TypeNarrowOop::filter( const Type *kills ) const {
coleenp@548	3525	if (kills->isa_narrowoop()) {
coleenp@548	3526	const Type* ft =_ooptype->filter(kills->is_narrowoop()->_ooptype);
coleenp@548	3527	if (ft->empty())
coleenp@548	3528	return Type::TOP; // Canonical empty value
coleenp@548	3529	if (ft->isa_ptr()) {
coleenp@548	3530	return make(ft->isa_ptr());
coleenp@548	3531	}
coleenp@548	3532	return ft;
coleenp@548	3533	} else if (kills->isa_ptr()) {
coleenp@548	3534	const Type* ft = _ooptype->join(kills);
coleenp@548	3535	if (ft->empty())
coleenp@548	3536	return Type::TOP; // Canonical empty value
coleenp@548	3537	return ft;
coleenp@548	3538	} else {
coleenp@548	3539	return Type::TOP;
coleenp@548	3540	}
coleenp@548	3541	}
coleenp@548	3542
coleenp@548	3543
coleenp@548	3544	intptr_t TypeNarrowOop::get_con() const {
coleenp@548	3545	return _ooptype->get_con();
coleenp@548	3546	}
coleenp@548	3547
coleenp@548	3548	#ifndef PRODUCT
coleenp@548	3549	void TypeNarrowOop::dump2( Dict & d, uint depth, outputStream *st ) const {
coleenp@548	3550	tty->print("narrowoop: ");
coleenp@548	3551	_ooptype->dump2(d, depth, st);
coleenp@548	3552	}
coleenp@548	3553	#endif
coleenp@548	3554
coleenp@548	3555
coleenp@548	3556	//=============================================================================
duke@435	3557	// Convenience common pre-built types.
duke@435	3558
duke@435	3559	// Not-null object klass or below
duke@435	3560	const TypeKlassPtr *TypeKlassPtr::OBJECT;
duke@435	3561	const TypeKlassPtr *TypeKlassPtr::OBJECT_OR_NULL;
duke@435	3562
duke@435	3563	//------------------------------TypeKlasPtr------------------------------------
duke@435	3564	TypeKlassPtr::TypeKlassPtr( PTR ptr, ciKlass* klass, int offset )
duke@435	3565	: TypeOopPtr(KlassPtr, ptr, klass, (ptr==Constant), (ptr==Constant ? klass : NULL), offset, 0) {
duke@435	3566	}
duke@435	3567
duke@435	3568	//------------------------------make-------------------------------------------
duke@435	3569	// ptr to klass 'k', if Constant, or possibly to a sub-klass if not a Constant
duke@435	3570	const TypeKlassPtr *TypeKlassPtr::make( PTR ptr, ciKlass* k, int offset ) {
duke@435	3571	assert( k != NULL, "Expect a non-NULL klass");
duke@435	3572	assert(k->is_instance_klass() || k->is_array_klass() ||
duke@435	3573	k->is_method_klass(), "Incorrect type of klass oop");
duke@435	3574	TypeKlassPtr *r =
duke@435	3575	(TypeKlassPtr*)(new TypeKlassPtr(ptr, k, offset))->hashcons();
duke@435	3576
duke@435	3577	return r;
duke@435	3578	}
duke@435	3579
duke@435	3580	//------------------------------eq---------------------------------------------
duke@435	3581	// Structural equality check for Type representations
duke@435	3582	bool TypeKlassPtr::eq( const Type *t ) const {
duke@435	3583	const TypeKlassPtr *p = t->is_klassptr();
duke@435	3584	return
duke@435	3585	klass()->equals(p->klass()) &&
duke@435	3586	TypeOopPtr::eq(p);
duke@435	3587	}
duke@435	3588
duke@435	3589	//------------------------------hash-------------------------------------------
duke@435	3590	// Type-specific hashing function.
duke@435	3591	int TypeKlassPtr::hash(void) const {
duke@435	3592	return klass()->hash() + TypeOopPtr::hash();
duke@435	3593	}
duke@435	3594
duke@435	3595
duke@435	3596	//------------------------------klass------------------------------------------
duke@435	3597	// Return the defining klass for this class
duke@435	3598	ciKlass* TypeAryPtr::klass() const {
duke@435	3599	if( _klass ) return _klass; // Return cached value, if possible
duke@435	3600
duke@435	3601	// Oops, need to compute _klass and cache it
duke@435	3602	ciKlass* k_ary = NULL;
duke@435	3603	const TypeInstPtr *tinst;
duke@435	3604	const TypeAryPtr *tary;
coleenp@548	3605	const Type* el = elem();
coleenp@548	3606	if (el->isa_narrowoop()) {
coleenp@548	3607	el = el->is_narrowoop()->make_oopptr();
coleenp@548	3608	}
coleenp@548	3609
duke@435	3610	// Get element klass
coleenp@548	3611	if ((tinst = el->isa_instptr()) != NULL) {
duke@435	3612	// Compute array klass from element klass
duke@435	3613	k_ary = ciObjArrayKlass::make(tinst->klass());
coleenp@548	3614	} else if ((tary = el->isa_aryptr()) != NULL) {
duke@435	3615	// Compute array klass from element klass
duke@435	3616	ciKlass* k_elem = tary->klass();
duke@435	3617	// If element type is something like bottom[], k_elem will be null.
duke@435	3618	if (k_elem != NULL)
duke@435	3619	k_ary = ciObjArrayKlass::make(k_elem);
coleenp@548	3620	} else if ((el->base() == Type::Top) ||
coleenp@548	3621	(el->base() == Type::Bottom)) {
duke@435	3622	// element type of Bottom occurs from meet of basic type
duke@435	3623	// and object; Top occurs when doing join on Bottom.
duke@435	3624	// Leave k_ary at NULL.
duke@435	3625	} else {
duke@435	3626	// Cannot compute array klass directly from basic type,
duke@435	3627	// since subtypes of TypeInt all have basic type T_INT.
coleenp@548	3628	assert(!el->isa_int(),
duke@435	3629	"integral arrays must be pre-equipped with a class");
duke@435	3630	// Compute array klass directly from basic type
coleenp@548	3631	k_ary = ciTypeArrayKlass::make(el->basic_type());
duke@435	3632	}
duke@435	3633
kvn@598	3634	if( this != TypeAryPtr::OOPS ) {
duke@435	3635	// The _klass field acts as a cache of the underlying
duke@435	3636	// ciKlass for this array type. In order to set the field,
duke@435	3637	// we need to cast away const-ness.
duke@435	3638	//
duke@435	3639	// IMPORTANT NOTE: we *never* set the _klass field for the
duke@435	3640	// type TypeAryPtr::OOPS. This Type is shared between all
duke@435	3641	// active compilations. However, the ciKlass which represents
duke@435	3642	// this Type is *not* shared between compilations, so caching
duke@435	3643	// this value would result in fetching a dangling pointer.
duke@435	3644	//
duke@435	3645	// Recomputing the underlying ciKlass for each request is
duke@435	3646	// a bit less efficient than caching, but calls to
duke@435	3647	// TypeAryPtr::OOPS->klass() are not common enough to matter.
duke@435	3648	((TypeAryPtr*)this)->_klass = k_ary;
kvn@598	3649	if (UseCompressedOops && k_ary != NULL && k_ary->is_obj_array_klass() &&
kvn@598	3650	_offset != 0 && _offset != arrayOopDesc::length_offset_in_bytes()) {
kvn@598	3651	((TypeAryPtr*)this)->_is_ptr_to_narrowoop = true;
kvn@598	3652	}
kvn@598	3653	}
duke@435	3654	return k_ary;
duke@435	3655	}
duke@435	3656
duke@435	3657
duke@435	3658	//------------------------------add_offset-------------------------------------
duke@435	3659	// Access internals of klass object
duke@435	3660	const TypePtr *TypeKlassPtr::add_offset( int offset ) const {
duke@435	3661	return make( _ptr, klass(), xadd_offset(offset) );
duke@435	3662	}
duke@435	3663
duke@435	3664	//------------------------------cast_to_ptr_type-------------------------------
duke@435	3665	const Type *TypeKlassPtr::cast_to_ptr_type(PTR ptr) const {
duke@435	3666	assert(_base == OopPtr, "subclass must override cast_to_ptr_type");
duke@435	3667	if( ptr == _ptr ) return this;
duke@435	3668	return make(ptr, _klass, _offset);
duke@435	3669	}
duke@435	3670
duke@435	3671
duke@435	3672	//-----------------------------cast_to_exactness-------------------------------
duke@435	3673	const Type *TypeKlassPtr::cast_to_exactness(bool klass_is_exact) const {
duke@435	3674	if( klass_is_exact == _klass_is_exact ) return this;
duke@435	3675	if (!UseExactTypes) return this;
duke@435	3676	return make(klass_is_exact ? Constant : NotNull, _klass, _offset);
duke@435	3677	}
duke@435	3678
duke@435	3679
duke@435	3680	//-----------------------------as_instance_type--------------------------------
duke@435	3681	// Corresponding type for an instance of the given class.
duke@435	3682	// It will be NotNull, and exact if and only if the klass type is exact.
duke@435	3683	const TypeOopPtr* TypeKlassPtr::as_instance_type() const {
duke@435	3684	ciKlass* k = klass();
duke@435	3685	bool xk = klass_is_exact();
duke@435	3686	//return TypeInstPtr::make(TypePtr::NotNull, k, xk, NULL, 0);
duke@435	3687	const TypeOopPtr* toop = TypeOopPtr::make_from_klass_raw(k);
duke@435	3688	toop = toop->cast_to_ptr_type(TypePtr::NotNull)->is_oopptr();
duke@435	3689	return toop->cast_to_exactness(xk)->is_oopptr();
duke@435	3690	}
duke@435	3691
duke@435	3692
duke@435	3693	//------------------------------xmeet------------------------------------------
duke@435	3694	// Compute the MEET of two types, return a new Type object.
duke@435	3695	const Type *TypeKlassPtr::xmeet( const Type *t ) const {
duke@435	3696	// Perform a fast test for common case; meeting the same types together.
duke@435	3697	if( this == t ) return this; // Meeting same type-rep?
duke@435	3698
duke@435	3699	// Current "this->_base" is Pointer
duke@435	3700	switch (t->base()) { // switch on original type
duke@435	3701
duke@435	3702	case Int: // Mixing ints & oops happens when javac
duke@435	3703	case Long: // reuses local variables
duke@435	3704	case FloatTop:
duke@435	3705	case FloatCon:
duke@435	3706	case FloatBot:
duke@435	3707	case DoubleTop:
duke@435	3708	case DoubleCon:
duke@435	3709	case DoubleBot:
duke@435	3710	case Bottom: // Ye Olde Default
duke@435	3711	return Type::BOTTOM;
duke@435	3712	case Top:
duke@435	3713	return this;
duke@435	3714
duke@435	3715	default: // All else is a mistake
duke@435	3716	typerr(t);
duke@435	3717
duke@435	3718	case RawPtr: return TypePtr::BOTTOM;
duke@435	3719
duke@435	3720	case OopPtr: { // Meeting to OopPtrs
duke@435	3721	// Found a OopPtr type vs self-KlassPtr type
duke@435	3722	const TypePtr *tp = t->is_oopptr();
duke@435	3723	int offset = meet_offset(tp->offset());
duke@435	3724	PTR ptr = meet_ptr(tp->ptr());
duke@435	3725	switch (tp->ptr()) {
duke@435	3726	case TopPTR:
duke@435	3727	case AnyNull:
duke@435	3728	return make(ptr, klass(), offset);
duke@435	3729	case BotPTR:
duke@435	3730	case NotNull:
duke@435	3731	return TypePtr::make(AnyPtr, ptr, offset);
duke@435	3732	default: typerr(t);
duke@435	3733	}
duke@435	3734	}
duke@435	3735
duke@435	3736	case AnyPtr: { // Meeting to AnyPtrs
duke@435	3737	// Found an AnyPtr type vs self-KlassPtr type
duke@435	3738	const TypePtr *tp = t->is_ptr();
duke@435	3739	int offset = meet_offset(tp->offset());
duke@435	3740	PTR ptr = meet_ptr(tp->ptr());
duke@435	3741	switch (tp->ptr()) {
duke@435	3742	case TopPTR:
duke@435	3743	return this;
duke@435	3744	case Null:
duke@435	3745	if( ptr == Null ) return TypePtr::make( AnyPtr, ptr, offset );
duke@435	3746	case AnyNull:
duke@435	3747	return make( ptr, klass(), offset );
duke@435	3748	case BotPTR:
duke@435	3749	case NotNull:
duke@435	3750	return TypePtr::make(AnyPtr, ptr, offset);
duke@435	3751	default: typerr(t);
duke@435	3752	}
duke@435	3753	}
duke@435	3754
duke@435	3755	case AryPtr: // Meet with AryPtr
duke@435	3756	case InstPtr: // Meet with InstPtr
duke@435	3757	return TypeInstPtr::BOTTOM;
duke@435	3758
duke@435	3759	//
duke@435	3760	// A-top }
duke@435	3761	// / | \ } Tops
duke@435	3762	// B-top A-any C-top }
duke@435	3763	// | / | \ | } Any-nulls
duke@435	3764	// B-any | C-any }
duke@435	3765	// | | |
duke@435	3766	// B-con A-con C-con } constants; not comparable across classes
duke@435	3767	// | | |
duke@435	3768	// B-not | C-not }
duke@435	3769	// | \ | / | } not-nulls
duke@435	3770	// B-bot A-not C-bot }
duke@435	3771	// \ | / } Bottoms
duke@435	3772	// A-bot }
duke@435	3773	//
duke@435	3774
duke@435	3775	case KlassPtr: { // Meet two KlassPtr types
duke@435	3776	const TypeKlassPtr *tkls = t->is_klassptr();
duke@435	3777	int off = meet_offset(tkls->offset());
duke@435	3778	PTR ptr = meet_ptr(tkls->ptr());
duke@435	3779
duke@435	3780	// Check for easy case; klasses are equal (and perhaps not loaded!)
duke@435	3781	// If we have constants, then we created oops so classes are loaded
duke@435	3782	// and we can handle the constants further down. This case handles
duke@435	3783	// not-loaded classes
duke@435	3784	if( ptr != Constant && tkls->klass()->equals(klass()) ) {
duke@435	3785	return make( ptr, klass(), off );
duke@435	3786	}
duke@435	3787
duke@435	3788	// Classes require inspection in the Java klass hierarchy. Must be loaded.
duke@435	3789	ciKlass* tkls_klass = tkls->klass();
duke@435	3790	ciKlass* this_klass = this->klass();
duke@435	3791	assert( tkls_klass->is_loaded(), "This class should have been loaded.");
duke@435	3792	assert( this_klass->is_loaded(), "This class should have been loaded.");
duke@435	3793
duke@435	3794	// If 'this' type is above the centerline and is a superclass of the
duke@435	3795	// other, we can treat 'this' as having the same type as the other.
duke@435	3796	if ((above_centerline(this->ptr())) &&
duke@435	3797	tkls_klass->is_subtype_of(this_klass)) {
duke@435	3798	this_klass = tkls_klass;
duke@435	3799	}
duke@435	3800	// If 'tinst' type is above the centerline and is a superclass of the
duke@435	3801	// other, we can treat 'tinst' as having the same type as the other.
duke@435	3802	if ((above_centerline(tkls->ptr())) &&
duke@435	3803	this_klass->is_subtype_of(tkls_klass)) {
duke@435	3804	tkls_klass = this_klass;
duke@435	3805	}
duke@435	3806
duke@435	3807	// Check for classes now being equal
duke@435	3808	if (tkls_klass->equals(this_klass)) {
duke@435	3809	// If the klasses are equal, the constants may still differ. Fall to
duke@435	3810	// NotNull if they do (neither constant is NULL; that is a special case
duke@435	3811	// handled elsewhere).
duke@435	3812	ciObject* o = NULL; // Assume not constant when done
duke@435	3813	ciObject* this_oop = const_oop();
duke@435	3814	ciObject* tkls_oop = tkls->const_oop();
duke@435	3815	if( ptr == Constant ) {
duke@435	3816	if (this_oop != NULL && tkls_oop != NULL &&
duke@435	3817	this_oop->equals(tkls_oop) )
duke@435	3818	o = this_oop;
duke@435	3819	else if (above_centerline(this->ptr()))
duke@435	3820	o = tkls_oop;
duke@435	3821	else if (above_centerline(tkls->ptr()))
duke@435	3822	o = this_oop;
duke@435	3823	else
duke@435	3824	ptr = NotNull;
duke@435	3825	}
duke@435	3826	return make( ptr, this_klass, off );
duke@435	3827	} // Else classes are not equal
duke@435	3828
duke@435	3829	// Since klasses are different, we require the LCA in the Java
duke@435	3830	// class hierarchy - which means we have to fall to at least NotNull.
duke@435	3831	if( ptr == TopPTR || ptr == AnyNull || ptr == Constant )
duke@435	3832	ptr = NotNull;
duke@435	3833	// Now we find the LCA of Java classes
duke@435	3834	ciKlass* k = this_klass->least_common_ancestor(tkls_klass);
duke@435	3835	return make( ptr, k, off );
duke@435	3836	} // End of case KlassPtr
duke@435	3837
duke@435	3838	} // End of switch
duke@435	3839	return this; // Return the double constant
duke@435	3840	}
duke@435	3841
duke@435	3842	//------------------------------xdual------------------------------------------
duke@435	3843	// Dual: compute field-by-field dual
duke@435	3844	const Type *TypeKlassPtr::xdual() const {
duke@435	3845	return new TypeKlassPtr( dual_ptr(), klass(), dual_offset() );
duke@435	3846	}
duke@435	3847
duke@435	3848	//------------------------------dump2------------------------------------------
duke@435	3849	// Dump Klass Type
duke@435	3850	#ifndef PRODUCT
duke@435	3851	void TypeKlassPtr::dump2( Dict & d, uint depth, outputStream *st ) const {
duke@435	3852	switch( _ptr ) {
duke@435	3853	case Constant:
duke@435	3854	st->print("precise ");
duke@435	3855	case NotNull:
duke@435	3856	{
duke@435	3857	const char *name = klass()->name()->as_utf8();
duke@435	3858	if( name ) {
duke@435	3859	st->print("klass %s: " INTPTR_FORMAT, name, klass());
duke@435	3860	} else {
duke@435	3861	ShouldNotReachHere();
duke@435	3862	}
duke@435	3863	}
duke@435	3864	case BotPTR:
duke@435	3865	if( !WizardMode && !Verbose && !_klass_is_exact ) break;
duke@435	3866	case TopPTR:
duke@435	3867	case AnyNull:
duke@435	3868	st->print(":%s", ptr_msg[_ptr]);
duke@435	3869	if( _klass_is_exact ) st->print(":exact");
duke@435	3870	break;
duke@435	3871	}
duke@435	3872
duke@435	3873	if( _offset ) { // Dump offset, if any
duke@435	3874	if( _offset == OffsetBot ) { st->print("+any"); }
duke@435	3875	else if( _offset == OffsetTop ) { st->print("+unknown"); }
duke@435	3876	else { st->print("+%d", _offset); }
duke@435	3877	}
duke@435	3878
duke@435	3879	st->print(" *");
duke@435	3880	}
duke@435	3881	#endif
duke@435	3882
duke@435	3883
duke@435	3884
duke@435	3885	//=============================================================================
duke@435	3886	// Convenience common pre-built types.
duke@435	3887
duke@435	3888	//------------------------------make-------------------------------------------
duke@435	3889	const TypeFunc *TypeFunc::make( const TypeTuple *domain, const TypeTuple *range ) {
duke@435	3890	return (TypeFunc*)(new TypeFunc(domain,range))->hashcons();
duke@435	3891	}
duke@435	3892
duke@435	3893	//------------------------------make-------------------------------------------
duke@435	3894	const TypeFunc *TypeFunc::make(ciMethod* method) {
duke@435	3895	Compile* C = Compile::current();
duke@435	3896	const TypeFunc* tf = C->last_tf(method); // check cache
duke@435	3897	if (tf != NULL) return tf; // The hit rate here is almost 50%.
duke@435	3898	const TypeTuple *domain;
duke@435	3899	if (method->flags().is_static()) {
duke@435	3900	domain = TypeTuple::make_domain(NULL, method->signature());
duke@435	3901	} else {
duke@435	3902	domain = TypeTuple::make_domain(method->holder(), method->signature());
duke@435	3903	}
duke@435	3904	const TypeTuple *range = TypeTuple::make_range(method->signature());
duke@435	3905	tf = TypeFunc::make(domain, range);
duke@435	3906	C->set_last_tf(method, tf); // fill cache
duke@435	3907	return tf;
duke@435	3908	}
duke@435	3909
duke@435	3910	//------------------------------meet-------------------------------------------
duke@435	3911	// Compute the MEET of two types. It returns a new Type object.
duke@435	3912	const Type *TypeFunc::xmeet( const Type *t ) const {
duke@435	3913	// Perform a fast test for common case; meeting the same types together.
duke@435	3914	if( this == t ) return this; // Meeting same type-rep?
duke@435	3915
duke@435	3916	// Current "this->_base" is Func
duke@435	3917	switch (t->base()) { // switch on original type
duke@435	3918
duke@435	3919	case Bottom: // Ye Olde Default
duke@435	3920	return t;
duke@435	3921
duke@435	3922	default: // All else is a mistake
duke@435	3923	typerr(t);
duke@435	3924
duke@435	3925	case Top:
duke@435	3926	break;
duke@435	3927	}
duke@435	3928	return this; // Return the double constant
duke@435	3929	}
duke@435	3930
duke@435	3931	//------------------------------xdual------------------------------------------
duke@435	3932	// Dual: compute field-by-field dual
duke@435	3933	const Type *TypeFunc::xdual() const {
duke@435	3934	return this;
duke@435	3935	}
duke@435	3936
duke@435	3937	//------------------------------eq---------------------------------------------
duke@435	3938	// Structural equality check for Type representations
duke@435	3939	bool TypeFunc::eq( const Type *t ) const {
duke@435	3940	const TypeFunc *a = (const TypeFunc*)t;
duke@435	3941	return _domain == a->_domain &&
duke@435	3942	_range == a->_range;
duke@435	3943	}
duke@435	3944
duke@435	3945	//------------------------------hash-------------------------------------------
duke@435	3946	// Type-specific hashing function.
duke@435	3947	int TypeFunc::hash(void) const {
duke@435	3948	return (intptr_t)_domain + (intptr_t)_range;
duke@435	3949	}
duke@435	3950
duke@435	3951	//------------------------------dump2------------------------------------------
duke@435	3952	// Dump Function Type
duke@435	3953	#ifndef PRODUCT
duke@435	3954	void TypeFunc::dump2( Dict &d, uint depth, outputStream *st ) const {
duke@435	3955	if( _range->_cnt <= Parms )
duke@435	3956	st->print("void");
duke@435	3957	else {
duke@435	3958	uint i;
duke@435	3959	for (i = Parms; i < _range->_cnt-1; i++) {
duke@435	3960	_range->field_at(i)->dump2(d,depth,st);
duke@435	3961	st->print("/");
duke@435	3962	}
duke@435	3963	_range->field_at(i)->dump2(d,depth,st);
duke@435	3964	}
duke@435	3965	st->print(" ");
duke@435	3966	st->print("( ");
duke@435	3967	if( !depth || d[this] ) { // Check for recursive dump
duke@435	3968	st->print("...)");
duke@435	3969	return;
duke@435	3970	}
duke@435	3971	d.Insert((void*)this,(void*)this); // Stop recursion
duke@435	3972	if (Parms < _domain->_cnt)
duke@435	3973	_domain->field_at(Parms)->dump2(d,depth-1,st);
duke@435	3974	for (uint i = Parms+1; i < _domain->_cnt; i++) {
duke@435	3975	st->print(", ");
duke@435	3976	_domain->field_at(i)->dump2(d,depth-1,st);
duke@435	3977	}
duke@435	3978	st->print(" )");
duke@435	3979	}
duke@435	3980
duke@435	3981	//------------------------------print_flattened--------------------------------
duke@435	3982	// Print a 'flattened' signature
duke@435	3983	static const char * const flat_type_msg[Type::lastype] = {
coleenp@548	3984	"bad","control","top","int","long","_", "narrowoop",
duke@435	3985	"tuple:", "array:",
duke@435	3986	"ptr", "rawptr", "ptr", "ptr", "ptr", "ptr",
duke@435	3987	"func", "abIO", "return_address", "mem",
duke@435	3988	"float_top", "ftcon:", "flt",
duke@435	3989	"double_top", "dblcon:", "dbl",
duke@435	3990	"bottom"
duke@435	3991	};
duke@435	3992
duke@435	3993	void TypeFunc::print_flattened() const {
duke@435	3994	if( _range->_cnt <= Parms )
duke@435	3995	tty->print("void");
duke@435	3996	else {
duke@435	3997	uint i;
duke@435	3998	for (i = Parms; i < _range->_cnt-1; i++)
duke@435	3999	tty->print("%s/",flat_type_msg[_range->field_at(i)->base()]);
duke@435	4000	tty->print("%s",flat_type_msg[_range->field_at(i)->base()]);
duke@435	4001	}
duke@435	4002	tty->print(" ( ");
duke@435	4003	if (Parms < _domain->_cnt)
duke@435	4004	tty->print("%s",flat_type_msg[_domain->field_at(Parms)->base()]);
duke@435	4005	for (uint i = Parms+1; i < _domain->_cnt; i++)
duke@435	4006	tty->print(", %s",flat_type_msg[_domain->field_at(i)->base()]);
duke@435	4007	tty->print(" )");
duke@435	4008	}
duke@435	4009	#endif
duke@435	4010
duke@435	4011	//------------------------------singleton--------------------------------------
duke@435	4012	// TRUE if Type is a singleton type, FALSE otherwise. Singletons are simple
duke@435	4013	// constants (Ldi nodes). Singletons are integer, float or double constants
duke@435	4014	// or a single symbol.
duke@435	4015	bool TypeFunc::singleton(void) const {
duke@435	4016	return false; // Never a singleton
duke@435	4017	}
duke@435	4018
duke@435	4019	bool TypeFunc::empty(void) const {
duke@435	4020	return false; // Never empty
duke@435	4021	}
duke@435	4022
duke@435	4023
duke@435	4024	BasicType TypeFunc::return_type() const{
duke@435	4025	if (range()->cnt() == TypeFunc::Parms) {
duke@435	4026	return T_VOID;
duke@435	4027	}
duke@435	4028	return range()->field_at(TypeFunc::Parms)->basic_type();
duke@435	4029	}