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

src/share/vm/opto/addnode.cpp@d5fc211aea19 (annotated)

src/share/vm/opto/addnode.cpp

Mon, 25 Feb 2008 15:05:44 -0800

author

kvn

date

Mon, 25 Feb 2008 15:05:44 -0800

changeset 464

d5fc211aea19

parent 452

ff5961f4c095

child 467

4d428c5b4cb3

permissions

-rw-r--r--

6633953: type2aelembytes{T_ADDRESS} should be 8 bytes in 64 bit VM
Summary: T_ADDRESS size is defined as 'int' size (4 bytes) but C2 use it for raw pointers and as memory type for StoreP and LoadP nodes.
Reviewed-by: jrose

duke@435	1	/*
duke@435	2	* Copyright 1997-2006 Sun Microsystems, Inc. All Rights Reserved.
duke@435	3	* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
duke@435	4	*
duke@435	5	* This code is free software; you can redistribute it and/or modify it
duke@435	6	* under the terms of the GNU General Public License version 2 only, as
duke@435	7	* published by the Free Software Foundation.
duke@435	8	*
duke@435	9	* This code is distributed in the hope that it will be useful, but WITHOUT
duke@435	10	* ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
duke@435	11	* FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
duke@435	12	* version 2 for more details (a copy is included in the LICENSE file that
duke@435	13	* accompanied this code).
duke@435	14	*
duke@435	15	* You should have received a copy of the GNU General Public License version
duke@435	16	* 2 along with this work; if not, write to the Free Software Foundation,
duke@435	17	* Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
duke@435	18	*
duke@435	19	* Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara,
duke@435	20	* CA 95054 USA or visit www.sun.com if you need additional information or
duke@435	21	* have any questions.
duke@435	22	*
duke@435	23	*/
duke@435	24
duke@435	25	// Portions of code courtesy of Clifford Click
duke@435	26
duke@435	27	#include "incls/_precompiled.incl"
duke@435	28	#include "incls/_addnode.cpp.incl"
duke@435	29
duke@435	30	#define MAXFLOAT ((float)3.40282346638528860e+38)
duke@435	31
duke@435	32	// Classic Add functionality. This covers all the usual 'add' behaviors for
duke@435	33	// an algebraic ring. Add-integer, add-float, add-double, and binary-or are
duke@435	34	// all inherited from this class. The various identity values are supplied
duke@435	35	// by virtual functions.
duke@435	36
duke@435	37
duke@435	38	//=============================================================================
duke@435	39	//------------------------------hash-------------------------------------------
duke@435	40	// Hash function over AddNodes. Needs to be commutative; i.e., I swap
duke@435	41	// (commute) inputs to AddNodes willy-nilly so the hash function must return
duke@435	42	// the same value in the presence of edge swapping.
duke@435	43	uint AddNode::hash() const {
duke@435	44	return (uintptr_t)in(1) + (uintptr_t)in(2) + Opcode();
duke@435	45	}
duke@435	46
duke@435	47	//------------------------------Identity---------------------------------------
duke@435	48	// If either input is a constant 0, return the other input.
duke@435	49	Node *AddNode::Identity( PhaseTransform *phase ) {
duke@435	50	const Type *zero = add_id(); // The additive identity
duke@435	51	if( phase->type( in(1) )->higher_equal( zero ) ) return in(2);
duke@435	52	if( phase->type( in(2) )->higher_equal( zero ) ) return in(1);
duke@435	53	return this;
duke@435	54	}
duke@435	55
duke@435	56	//------------------------------commute----------------------------------------
duke@435	57	// Commute operands to move loads and constants to the right.
duke@435	58	static bool commute( Node *add, int con_left, int con_right ) {
duke@435	59	Node *in1 = add->in(1);
duke@435	60	Node *in2 = add->in(2);
duke@435	61
duke@435	62	// Convert "1+x" into "x+1".
duke@435	63	// Right is a constant; leave it
duke@435	64	if( con_right ) return false;
duke@435	65	// Left is a constant; move it right.
duke@435	66	if( con_left ) {
duke@435	67	add->swap_edges(1, 2);
duke@435	68	return true;
duke@435	69	}
duke@435	70
duke@435	71	// Convert "Load+x" into "x+Load".
duke@435	72	// Now check for loads
duke@435	73	if( in2->is_Load() ) return false;
duke@435	74	// Left is a Load and Right is not; move it right.
duke@435	75	if( in1->is_Load() ) {
duke@435	76	add->swap_edges(1, 2);
duke@435	77	return true;
duke@435	78	}
duke@435	79
duke@435	80	PhiNode *phi;
duke@435	81	// Check for tight loop increments: Loop-phi of Add of loop-phi
duke@435	82	if( in1->is_Phi() && (phi = in1->as_Phi()) && !phi->is_copy() && phi->region()->is_Loop() && phi->in(2)==add)
duke@435	83	return false;
duke@435	84	if( in2->is_Phi() && (phi = in2->as_Phi()) && !phi->is_copy() && phi->region()->is_Loop() && phi->in(2)==add){
duke@435	85	add->swap_edges(1, 2);
duke@435	86	return true;
duke@435	87	}
duke@435	88
duke@435	89	// Otherwise, sort inputs (commutativity) to help value numbering.
duke@435	90	if( in1->_idx > in2->_idx ) {
duke@435	91	add->swap_edges(1, 2);
duke@435	92	return true;
duke@435	93	}
duke@435	94	return false;
duke@435	95	}
duke@435	96
duke@435	97	//------------------------------Idealize---------------------------------------
duke@435	98	// If we get here, we assume we are associative!
duke@435	99	Node *AddNode::Ideal(PhaseGVN *phase, bool can_reshape) {
duke@435	100	const Type *t1 = phase->type( in(1) );
duke@435	101	const Type *t2 = phase->type( in(2) );
duke@435	102	int con_left = t1->singleton();
duke@435	103	int con_right = t2->singleton();
duke@435	104
duke@435	105	// Check for commutative operation desired
duke@435	106	if( commute(this,con_left,con_right) ) return this;
duke@435	107
duke@435	108	AddNode *progress = NULL; // Progress flag
duke@435	109
duke@435	110	// Convert "(x+1)+2" into "x+(1+2)". If the right input is a
duke@435	111	// constant, and the left input is an add of a constant, flatten the
duke@435	112	// expression tree.
duke@435	113	Node *add1 = in(1);
duke@435	114	Node *add2 = in(2);
duke@435	115	int add1_op = add1->Opcode();
duke@435	116	int this_op = Opcode();
duke@435	117	if( con_right && t2 != Type::TOP && // Right input is a constant?
duke@435	118	add1_op == this_op ) { // Left input is an Add?
duke@435	119
duke@435	120	// Type of left _in right input
duke@435	121	const Type *t12 = phase->type( add1->in(2) );
duke@435	122	if( t12->singleton() && t12 != Type::TOP ) { // Left input is an add of a constant?
duke@435	123	// Check for rare case of closed data cycle which can happen inside
duke@435	124	// unreachable loops. In these cases the computation is undefined.
duke@435	125	#ifdef ASSERT
duke@435	126	Node *add11 = add1->in(1);
duke@435	127	int add11_op = add11->Opcode();
duke@435	128	if( (add1 == add1->in(1))
duke@435	129	|| (add11_op == this_op && add11->in(1) == add1) ) {
duke@435	130	assert(false, "dead loop in AddNode::Ideal");
duke@435	131	}
duke@435	132	#endif
duke@435	133	// The Add of the flattened expression
duke@435	134	Node *x1 = add1->in(1);
duke@435	135	Node *x2 = phase->makecon( add1->as_Add()->add_ring( t2, t12 ));
duke@435	136	PhaseIterGVN *igvn = phase->is_IterGVN();
duke@435	137	if( igvn ) {
duke@435	138	set_req_X(2,x2,igvn);
duke@435	139	set_req_X(1,x1,igvn);
duke@435	140	} else {
duke@435	141	set_req(2,x2);
duke@435	142	set_req(1,x1);
duke@435	143	}
duke@435	144	progress = this; // Made progress
duke@435	145	add1 = in(1);
duke@435	146	add1_op = add1->Opcode();
duke@435	147	}
duke@435	148	}
duke@435	149
duke@435	150	// Convert "(x+1)+y" into "(x+y)+1". Push constants down the expression tree.
duke@435	151	if( add1_op == this_op && !con_right ) {
duke@435	152	Node *a12 = add1->in(2);
duke@435	153	const Type *t12 = phase->type( a12 );
duke@435	154	if( t12->singleton() && t12 != Type::TOP && (add1 != add1->in(1)) ) {
duke@435	155	add2 = add1->clone();
duke@435	156	add2->set_req(2, in(2));
duke@435	157	add2 = phase->transform(add2);
duke@435	158	set_req(1, add2);
duke@435	159	set_req(2, a12);
duke@435	160	progress = this;
duke@435	161	add2 = a12;
duke@435	162	}
duke@435	163	}
duke@435	164
duke@435	165	// Convert "x+(y+1)" into "(x+y)+1". Push constants down the expression tree.
duke@435	166	int add2_op = add2->Opcode();
duke@435	167	if( add2_op == this_op && !con_left ) {
duke@435	168	Node *a22 = add2->in(2);
duke@435	169	const Type *t22 = phase->type( a22 );
duke@435	170	if( t22->singleton() && t22 != Type::TOP && (add2 != add2->in(1)) ) {
duke@435	171	Node *addx = add2->clone();
duke@435	172	addx->set_req(1, in(1));
duke@435	173	addx->set_req(2, add2->in(1));
duke@435	174	addx = phase->transform(addx);
duke@435	175	set_req(1, addx);
duke@435	176	set_req(2, a22);
duke@435	177	progress = this;
duke@435	178	}
duke@435	179	}
duke@435	180
duke@435	181	return progress;
duke@435	182	}
duke@435	183
duke@435	184	//------------------------------Value-----------------------------------------
duke@435	185	// An add node sums it's two _in. If one input is an RSD, we must mixin
duke@435	186	// the other input's symbols.
duke@435	187	const Type *AddNode::Value( PhaseTransform *phase ) const {
duke@435	188	// Either input is TOP ==> the result is TOP
duke@435	189	const Type *t1 = phase->type( in(1) );
duke@435	190	const Type *t2 = phase->type( in(2) );
duke@435	191	if( t1 == Type::TOP ) return Type::TOP;
duke@435	192	if( t2 == Type::TOP ) return Type::TOP;
duke@435	193
duke@435	194	// Either input is BOTTOM ==> the result is the local BOTTOM
duke@435	195	const Type *bot = bottom_type();
duke@435	196	if( (t1 == bot) || (t2 == bot) ||
duke@435	197	(t1 == Type::BOTTOM) || (t2 == Type::BOTTOM) )
duke@435	198	return bot;
duke@435	199
duke@435	200	// Check for an addition involving the additive identity
duke@435	201	const Type *tadd = add_of_identity( t1, t2 );
duke@435	202	if( tadd ) return tadd;
duke@435	203
duke@435	204	return add_ring(t1,t2); // Local flavor of type addition
duke@435	205	}
duke@435	206
duke@435	207	//------------------------------add_identity-----------------------------------
duke@435	208	// Check for addition of the identity
duke@435	209	const Type *AddNode::add_of_identity( const Type *t1, const Type *t2 ) const {
duke@435	210	const Type *zero = add_id(); // The additive identity
duke@435	211	if( t1->higher_equal( zero ) ) return t2;
duke@435	212	if( t2->higher_equal( zero ) ) return t1;
duke@435	213
duke@435	214	return NULL;
duke@435	215	}
duke@435	216
duke@435	217
duke@435	218	//=============================================================================
duke@435	219	//------------------------------Idealize---------------------------------------
duke@435	220	Node *AddINode::Ideal(PhaseGVN *phase, bool can_reshape) {
duke@435	221	int op1 = in(1)->Opcode();
duke@435	222	int op2 = in(2)->Opcode();
duke@435	223	// Fold (con1-x)+con2 into (con1+con2)-x
duke@435	224	if( op1 == Op_SubI ) {
duke@435	225	const Type *t_sub1 = phase->type( in(1)->in(1) );
duke@435	226	const Type *t_2 = phase->type( in(2) );
duke@435	227	if( t_sub1->singleton() && t_2->singleton() && t_sub1 != Type::TOP && t_2 != Type::TOP )
duke@435	228	return new (phase->C, 3) SubINode(phase->makecon( add_ring( t_sub1, t_2 ) ),
duke@435	229	in(1)->in(2) );
duke@435	230	// Convert "(a-b)+(c-d)" into "(a+c)-(b+d)"
duke@435	231	if( op2 == Op_SubI ) {
duke@435	232	// Check for dead cycle: d = (a-b)+(c-d)
duke@435	233	assert( in(1)->in(2) != this && in(2)->in(2) != this,
duke@435	234	"dead loop in AddINode::Ideal" );
duke@435	235	Node *sub = new (phase->C, 3) SubINode(NULL, NULL);
duke@435	236	sub->init_req(1, phase->transform(new (phase->C, 3) AddINode(in(1)->in(1), in(2)->in(1) ) ));
duke@435	237	sub->init_req(2, phase->transform(new (phase->C, 3) AddINode(in(1)->in(2), in(2)->in(2) ) ));
duke@435	238	return sub;
duke@435	239	}
duke@435	240	}
duke@435	241
duke@435	242	// Convert "x+(0-y)" into "(x-y)"
duke@435	243	if( op2 == Op_SubI && phase->type(in(2)->in(1)) == TypeInt::ZERO )
duke@435	244	return new (phase->C, 3) SubINode(in(1), in(2)->in(2) );
duke@435	245
duke@435	246	// Convert "(0-y)+x" into "(x-y)"
duke@435	247	if( op1 == Op_SubI && phase->type(in(1)->in(1)) == TypeInt::ZERO )
duke@435	248	return new (phase->C, 3) SubINode( in(2), in(1)->in(2) );
duke@435	249
duke@435	250	// Convert (x>>>z)+y into (x+(y<<z))>>>z for small constant z and y.
duke@435	251	// Helps with array allocation math constant folding
duke@435	252	// See 4790063:
duke@435	253	// Unrestricted transformation is unsafe for some runtime values of 'x'
duke@435	254	// ( x == 0, z == 1, y == -1 ) fails
duke@435	255	// ( x == -5, z == 1, y == 1 ) fails
duke@435	256	// Transform works for small z and small negative y when the addition
duke@435	257	// (x + (y << z)) does not cross zero.
duke@435	258	// Implement support for negative y and (x >= -(y << z))
duke@435	259	// Have not observed cases where type information exists to support
duke@435	260	// positive y and (x <= -(y << z))
duke@435	261	if( op1 == Op_URShiftI && op2 == Op_ConI &&
duke@435	262	in(1)->in(2)->Opcode() == Op_ConI ) {
duke@435	263	jint z = phase->type( in(1)->in(2) )->is_int()->get_con() & 0x1f; // only least significant 5 bits matter
duke@435	264	jint y = phase->type( in(2) )->is_int()->get_con();
duke@435	265
duke@435	266	if( z < 5 && -5 < y && y < 0 ) {
duke@435	267	const Type *t_in11 = phase->type(in(1)->in(1));
duke@435	268	if( t_in11 != Type::TOP && (t_in11->is_int()->_lo >= -(y << z)) ) {
duke@435	269	Node *a = phase->transform( new (phase->C, 3) AddINode( in(1)->in(1), phase->intcon(y<<z) ) );
duke@435	270	return new (phase->C, 3) URShiftINode( a, in(1)->in(2) );
duke@435	271	}
duke@435	272	}
duke@435	273	}
duke@435	274
duke@435	275	return AddNode::Ideal(phase, can_reshape);
duke@435	276	}
duke@435	277
duke@435	278
duke@435	279	//------------------------------Identity---------------------------------------
duke@435	280	// Fold (x-y)+y OR y+(x-y) into x
duke@435	281	Node *AddINode::Identity( PhaseTransform *phase ) {
duke@435	282	if( in(1)->Opcode() == Op_SubI && phase->eqv(in(1)->in(2),in(2)) ) {
duke@435	283	return in(1)->in(1);
duke@435	284	}
duke@435	285	else if( in(2)->Opcode() == Op_SubI && phase->eqv(in(2)->in(2),in(1)) ) {
duke@435	286	return in(2)->in(1);
duke@435	287	}
duke@435	288	return AddNode::Identity(phase);
duke@435	289	}
duke@435	290
duke@435	291
duke@435	292	//------------------------------add_ring---------------------------------------
duke@435	293	// Supplied function returns the sum of the inputs. Guaranteed never
duke@435	294	// to be passed a TOP or BOTTOM type, these are filtered out by
duke@435	295	// pre-check.
duke@435	296	const Type *AddINode::add_ring( const Type *t0, const Type *t1 ) const {
duke@435	297	const TypeInt *r0 = t0->is_int(); // Handy access
duke@435	298	const TypeInt *r1 = t1->is_int();
duke@435	299	int lo = r0->_lo + r1->_lo;
duke@435	300	int hi = r0->_hi + r1->_hi;
duke@435	301	if( !(r0->is_con() && r1->is_con()) ) {
duke@435	302	// Not both constants, compute approximate result
duke@435	303	if( (r0->_lo & r1->_lo) < 0 && lo >= 0 ) {
duke@435	304	lo = min_jint; hi = max_jint; // Underflow on the low side
duke@435	305	}
duke@435	306	if( (~(r0->_hi | r1->_hi)) < 0 && hi < 0 ) {
duke@435	307	lo = min_jint; hi = max_jint; // Overflow on the high side
duke@435	308	}
duke@435	309	if( lo > hi ) { // Handle overflow
duke@435	310	lo = min_jint; hi = max_jint;
duke@435	311	}
duke@435	312	} else {
duke@435	313	// both constants, compute precise result using 'lo' and 'hi'
duke@435	314	// Semantics define overflow and underflow for integer addition
duke@435	315	// as expected. In particular: 0x80000000 + 0x80000000 --> 0x0
duke@435	316	}
duke@435	317	return TypeInt::make( lo, hi, MAX2(r0->_widen,r1->_widen) );
duke@435	318	}
duke@435	319
duke@435	320
duke@435	321	//=============================================================================
duke@435	322	//------------------------------Idealize---------------------------------------
duke@435	323	Node *AddLNode::Ideal(PhaseGVN *phase, bool can_reshape) {
duke@435	324	int op1 = in(1)->Opcode();
duke@435	325	int op2 = in(2)->Opcode();
duke@435	326	// Fold (con1-x)+con2 into (con1+con2)-x
duke@435	327	if( op1 == Op_SubL ) {
duke@435	328	const Type *t_sub1 = phase->type( in(1)->in(1) );
duke@435	329	const Type *t_2 = phase->type( in(2) );
duke@435	330	if( t_sub1->singleton() && t_2->singleton() && t_sub1 != Type::TOP && t_2 != Type::TOP )
duke@435	331	return new (phase->C, 3) SubLNode(phase->makecon( add_ring( t_sub1, t_2 ) ),
duke@435	332	in(1)->in(2) );
duke@435	333	// Convert "(a-b)+(c-d)" into "(a+c)-(b+d)"
duke@435	334	if( op2 == Op_SubL ) {
duke@435	335	// Check for dead cycle: d = (a-b)+(c-d)
duke@435	336	assert( in(1)->in(2) != this && in(2)->in(2) != this,
duke@435	337	"dead loop in AddLNode::Ideal" );
duke@435	338	Node *sub = new (phase->C, 3) SubLNode(NULL, NULL);
duke@435	339	sub->init_req(1, phase->transform(new (phase->C, 3) AddLNode(in(1)->in(1), in(2)->in(1) ) ));
duke@435	340	sub->init_req(2, phase->transform(new (phase->C, 3) AddLNode(in(1)->in(2), in(2)->in(2) ) ));
duke@435	341	return sub;
duke@435	342	}
duke@435	343	}
duke@435	344
duke@435	345	// Convert "x+(0-y)" into "(x-y)"
duke@435	346	if( op2 == Op_SubL && phase->type(in(2)->in(1)) == TypeLong::ZERO )
duke@435	347	return new (phase->C, 3) SubLNode(in(1), in(2)->in(2) );
duke@435	348
duke@435	349	// Convert "X+X+X+X+X...+X+Y" into "k*X+Y" or really convert "X+(X+Y)"
duke@435	350	// into "(X<<1)+Y" and let shift-folding happen.
duke@435	351	if( op2 == Op_AddL &&
duke@435	352	in(2)->in(1) == in(1) &&
duke@435	353	op1 != Op_ConL &&
duke@435	354	0 ) {
duke@435	355	Node *shift = phase->transform(new (phase->C, 3) LShiftLNode(in(1),phase->intcon(1)));
duke@435	356	return new (phase->C, 3) AddLNode(shift,in(2)->in(2));
duke@435	357	}
duke@435	358
duke@435	359	return AddNode::Ideal(phase, can_reshape);
duke@435	360	}
duke@435	361
duke@435	362
duke@435	363	//------------------------------Identity---------------------------------------
duke@435	364	// Fold (x-y)+y OR y+(x-y) into x
duke@435	365	Node *AddLNode::Identity( PhaseTransform *phase ) {
duke@435	366	if( in(1)->Opcode() == Op_SubL && phase->eqv(in(1)->in(2),in(2)) ) {
duke@435	367	return in(1)->in(1);
duke@435	368	}
duke@435	369	else if( in(2)->Opcode() == Op_SubL && phase->eqv(in(2)->in(2),in(1)) ) {
duke@435	370	return in(2)->in(1);
duke@435	371	}
duke@435	372	return AddNode::Identity(phase);
duke@435	373	}
duke@435	374
duke@435	375
duke@435	376	//------------------------------add_ring---------------------------------------
duke@435	377	// Supplied function returns the sum of the inputs. Guaranteed never
duke@435	378	// to be passed a TOP or BOTTOM type, these are filtered out by
duke@435	379	// pre-check.
duke@435	380	const Type *AddLNode::add_ring( const Type *t0, const Type *t1 ) const {
duke@435	381	const TypeLong *r0 = t0->is_long(); // Handy access
duke@435	382	const TypeLong *r1 = t1->is_long();
duke@435	383	jlong lo = r0->_lo + r1->_lo;
duke@435	384	jlong hi = r0->_hi + r1->_hi;
duke@435	385	if( !(r0->is_con() && r1->is_con()) ) {
duke@435	386	// Not both constants, compute approximate result
duke@435	387	if( (r0->_lo & r1->_lo) < 0 && lo >= 0 ) {
duke@435	388	lo =min_jlong; hi = max_jlong; // Underflow on the low side
duke@435	389	}
duke@435	390	if( (~(r0->_hi | r1->_hi)) < 0 && hi < 0 ) {
duke@435	391	lo = min_jlong; hi = max_jlong; // Overflow on the high side
duke@435	392	}
duke@435	393	if( lo > hi ) { // Handle overflow
duke@435	394	lo = min_jlong; hi = max_jlong;
duke@435	395	}
duke@435	396	} else {
duke@435	397	// both constants, compute precise result using 'lo' and 'hi'
duke@435	398	// Semantics define overflow and underflow for integer addition
duke@435	399	// as expected. In particular: 0x80000000 + 0x80000000 --> 0x0
duke@435	400	}
duke@435	401	return TypeLong::make( lo, hi, MAX2(r0->_widen,r1->_widen) );
duke@435	402	}
duke@435	403
duke@435	404
duke@435	405	//=============================================================================
duke@435	406	//------------------------------add_of_identity--------------------------------
duke@435	407	// Check for addition of the identity
duke@435	408	const Type *AddFNode::add_of_identity( const Type *t1, const Type *t2 ) const {
duke@435	409	// x ADD 0 should return x unless 'x' is a -zero
duke@435	410	//
duke@435	411	// const Type *zero = add_id(); // The additive identity
duke@435	412	// jfloat f1 = t1->getf();
duke@435	413	// jfloat f2 = t2->getf();
duke@435	414	//
duke@435	415	// if( t1->higher_equal( zero ) ) return t2;
duke@435	416	// if( t2->higher_equal( zero ) ) return t1;
duke@435	417
duke@435	418	return NULL;
duke@435	419	}
duke@435	420
duke@435	421	//------------------------------add_ring---------------------------------------
duke@435	422	// Supplied function returns the sum of the inputs.
duke@435	423	// This also type-checks the inputs for sanity. Guaranteed never to
duke@435	424	// be passed a TOP or BOTTOM type, these are filtered out by pre-check.
duke@435	425	const Type *AddFNode::add_ring( const Type *t0, const Type *t1 ) const {
duke@435	426	// We must be adding 2 float constants.
duke@435	427	return TypeF::make( t0->getf() + t1->getf() );
duke@435	428	}
duke@435	429
duke@435	430	//------------------------------Ideal------------------------------------------
duke@435	431	Node *AddFNode::Ideal(PhaseGVN *phase, bool can_reshape) {
duke@435	432	if( IdealizedNumerics && !phase->C->method()->is_strict() ) {
duke@435	433	return AddNode::Ideal(phase, can_reshape); // commutative and associative transforms
duke@435	434	}
duke@435	435
duke@435	436	// Floating point additions are not associative because of boundary conditions (infinity)
duke@435	437	return commute(this,
duke@435	438	phase->type( in(1) )->singleton(),
duke@435	439	phase->type( in(2) )->singleton() ) ? this : NULL;
duke@435	440	}
duke@435	441
duke@435	442
duke@435	443	//=============================================================================
duke@435	444	//------------------------------add_of_identity--------------------------------
duke@435	445	// Check for addition of the identity
duke@435	446	const Type *AddDNode::add_of_identity( const Type *t1, const Type *t2 ) const {
duke@435	447	// x ADD 0 should return x unless 'x' is a -zero
duke@435	448	//
duke@435	449	// const Type *zero = add_id(); // The additive identity
duke@435	450	// jfloat f1 = t1->getf();
duke@435	451	// jfloat f2 = t2->getf();
duke@435	452	//
duke@435	453	// if( t1->higher_equal( zero ) ) return t2;
duke@435	454	// if( t2->higher_equal( zero ) ) return t1;
duke@435	455
duke@435	456	return NULL;
duke@435	457	}
duke@435	458	//------------------------------add_ring---------------------------------------
duke@435	459	// Supplied function returns the sum of the inputs.
duke@435	460	// This also type-checks the inputs for sanity. Guaranteed never to
duke@435	461	// be passed a TOP or BOTTOM type, these are filtered out by pre-check.
duke@435	462	const Type *AddDNode::add_ring( const Type *t0, const Type *t1 ) const {
duke@435	463	// We must be adding 2 double constants.
duke@435	464	return TypeD::make( t0->getd() + t1->getd() );
duke@435	465	}
duke@435	466
duke@435	467	//------------------------------Ideal------------------------------------------
duke@435	468	Node *AddDNode::Ideal(PhaseGVN *phase, bool can_reshape) {
duke@435	469	if( IdealizedNumerics && !phase->C->method()->is_strict() ) {
duke@435	470	return AddNode::Ideal(phase, can_reshape); // commutative and associative transforms
duke@435	471	}
duke@435	472
duke@435	473	// Floating point additions are not associative because of boundary conditions (infinity)
duke@435	474	return commute(this,
duke@435	475	phase->type( in(1) )->singleton(),
duke@435	476	phase->type( in(2) )->singleton() ) ? this : NULL;
duke@435	477	}
duke@435	478
duke@435	479
duke@435	480	//=============================================================================
duke@435	481	//------------------------------Identity---------------------------------------
duke@435	482	// If one input is a constant 0, return the other input.
duke@435	483	Node *AddPNode::Identity( PhaseTransform *phase ) {
duke@435	484	return ( phase->type( in(Offset) )->higher_equal( TypeX_ZERO ) ) ? in(Address) : this;
duke@435	485	}
duke@435	486
duke@435	487	//------------------------------Idealize---------------------------------------
duke@435	488	Node *AddPNode::Ideal(PhaseGVN *phase, bool can_reshape) {
duke@435	489	// Bail out if dead inputs
duke@435	490	if( phase->type( in(Address) ) == Type::TOP ) return NULL;
duke@435	491
duke@435	492	// If the left input is an add of a constant, flatten the expression tree.
duke@435	493	const Node *n = in(Address);
duke@435	494	if (n->is_AddP() && n->in(Base) == in(Base)) {
duke@435	495	const AddPNode *addp = n->as_AddP(); // Left input is an AddP
duke@435	496	assert( !addp->in(Address)->is_AddP() ||
duke@435	497	addp->in(Address)->as_AddP() != addp,
duke@435	498	"dead loop in AddPNode::Ideal" );
duke@435	499	// Type of left input's right input
duke@435	500	const Type *t = phase->type( addp->in(Offset) );
duke@435	501	if( t == Type::TOP ) return NULL;
duke@435	502	const TypeX *t12 = t->is_intptr_t();
duke@435	503	if( t12->is_con() ) { // Left input is an add of a constant?
duke@435	504	// If the right input is a constant, combine constants
duke@435	505	const Type *temp_t2 = phase->type( in(Offset) );
duke@435	506	if( temp_t2 == Type::TOP ) return NULL;
duke@435	507	const TypeX *t2 = temp_t2->is_intptr_t();
duke@435	508	if( t2->is_con() ) {
duke@435	509	// The Add of the flattened expression
duke@435	510	set_req(Address, addp->in(Address));
duke@435	511	set_req(Offset , phase->MakeConX(t2->get_con() + t12->get_con()));
duke@435	512	return this; // Made progress
duke@435	513	}
duke@435	514	// Else move the constant to the right. ((A+con)+B) into ((A+B)+con)
duke@435	515	set_req(Address, phase->transform(new (phase->C, 4) AddPNode(in(Base),addp->in(Address),in(Offset))));
duke@435	516	set_req(Offset , addp->in(Offset));
duke@435	517	return this;
duke@435	518	}
duke@435	519	}
duke@435	520
duke@435	521	// Raw pointers?
duke@435	522	if( in(Base)->bottom_type() == Type::TOP ) {
duke@435	523	// If this is a NULL+long form (from unsafe accesses), switch to a rawptr.
duke@435	524	if (phase->type(in(Address)) == TypePtr::NULL_PTR) {
duke@435	525	Node* offset = in(Offset);
duke@435	526	return new (phase->C, 2) CastX2PNode(offset);
duke@435	527	}
duke@435	528	}
duke@435	529
duke@435	530	// If the right is an add of a constant, push the offset down.
duke@435	531	// Convert: (ptr + (offset+con)) into (ptr+offset)+con.
duke@435	532	// The idea is to merge array_base+scaled_index groups together,
duke@435	533	// and only have different constant offsets from the same base.
duke@435	534	const Node *add = in(Offset);
duke@435	535	if( add->Opcode() == Op_AddX && add->in(1) != add ) {
duke@435	536	const Type *t22 = phase->type( add->in(2) );
duke@435	537	if( t22->singleton() && (t22 != Type::TOP) ) { // Right input is an add of a constant?
duke@435	538	set_req(Address, phase->transform(new (phase->C, 4) AddPNode(in(Base),in(Address),add->in(1))));
duke@435	539	set_req(Offset, add->in(2));
duke@435	540	return this; // Made progress
duke@435	541	}
duke@435	542	}
duke@435	543
duke@435	544	return NULL; // No progress
duke@435	545	}
duke@435	546
duke@435	547	//------------------------------bottom_type------------------------------------
duke@435	548	// Bottom-type is the pointer-type with unknown offset.
duke@435	549	const Type *AddPNode::bottom_type() const {
duke@435	550	if (in(Address) == NULL) return TypePtr::BOTTOM;
duke@435	551	const TypePtr *tp = in(Address)->bottom_type()->isa_ptr();
duke@435	552	if( !tp ) return Type::TOP; // TOP input means TOP output
duke@435	553	assert( in(Offset)->Opcode() != Op_ConP, "" );
duke@435	554	const Type *t = in(Offset)->bottom_type();
duke@435	555	if( t == Type::TOP )
duke@435	556	return tp->add_offset(Type::OffsetTop);
duke@435	557	const TypeX *tx = t->is_intptr_t();
duke@435	558	intptr_t txoffset = Type::OffsetBot;
duke@435	559	if (tx->is_con()) { // Left input is an add of a constant?
duke@435	560	txoffset = tx->get_con();
duke@435	561	if (txoffset != (int)txoffset)
duke@435	562	txoffset = Type::OffsetBot; // oops: add_offset will choke on it
duke@435	563	}
duke@435	564	return tp->add_offset(txoffset);
duke@435	565	}
duke@435	566
duke@435	567	//------------------------------Value------------------------------------------
duke@435	568	const Type *AddPNode::Value( PhaseTransform *phase ) const {
duke@435	569	// Either input is TOP ==> the result is TOP
duke@435	570	const Type *t1 = phase->type( in(Address) );
duke@435	571	const Type *t2 = phase->type( in(Offset) );
duke@435	572	if( t1 == Type::TOP ) return Type::TOP;
duke@435	573	if( t2 == Type::TOP ) return Type::TOP;
duke@435	574
duke@435	575	// Left input is a pointer
duke@435	576	const TypePtr *p1 = t1->isa_ptr();
duke@435	577	// Right input is an int
duke@435	578	const TypeX *p2 = t2->is_intptr_t();
duke@435	579	// Add 'em
duke@435	580	intptr_t p2offset = Type::OffsetBot;
duke@435	581	if (p2->is_con()) { // Left input is an add of a constant?
duke@435	582	p2offset = p2->get_con();
duke@435	583	if (p2offset != (int)p2offset)
duke@435	584	p2offset = Type::OffsetBot; // oops: add_offset will choke on it
duke@435	585	}
duke@435	586	return p1->add_offset(p2offset);
duke@435	587	}
duke@435	588
duke@435	589	//------------------------Ideal_base_and_offset--------------------------------
duke@435	590	// Split an oop pointer into a base and offset.
duke@435	591	// (The offset might be Type::OffsetBot in the case of an array.)
duke@435	592	// Return the base, or NULL if failure.
duke@435	593	Node* AddPNode::Ideal_base_and_offset(Node* ptr, PhaseTransform* phase,
duke@435	594	// second return value:
duke@435	595	intptr_t& offset) {
duke@435	596	if (ptr->is_AddP()) {
duke@435	597	Node* base = ptr->in(AddPNode::Base);
duke@435	598	Node* addr = ptr->in(AddPNode::Address);
duke@435	599	Node* offs = ptr->in(AddPNode::Offset);
duke@435	600	if (base == addr || base->is_top()) {
duke@435	601	offset = phase->find_intptr_t_con(offs, Type::OffsetBot);
duke@435	602	if (offset != Type::OffsetBot) {
duke@435	603	return addr;
duke@435	604	}
duke@435	605	}
duke@435	606	}
duke@435	607	offset = Type::OffsetBot;
duke@435	608	return NULL;
duke@435	609	}
duke@435	610
never@452	611	//------------------------------unpack_offsets----------------------------------
never@452	612	// Collect the AddP offset values into the elements array, giving up
never@452	613	// if there are more than length.
never@452	614	int AddPNode::unpack_offsets(Node* elements[], int length) {
never@452	615	int count = 0;
never@452	616	Node* addr = this;
never@452	617	Node* base = addr->in(AddPNode::Base);
never@452	618	while (addr->is_AddP()) {
never@452	619	if (addr->in(AddPNode::Base) != base) {
never@452	620	// give up
never@452	621	return -1;
never@452	622	}
never@452	623	elements[count++] = addr->in(AddPNode::Offset);
never@452	624	if (count == length) {
never@452	625	// give up
never@452	626	return -1;
never@452	627	}
never@452	628	addr = addr->in(AddPNode::Address);
never@452	629	}
never@452	630	return count;
never@452	631	}
never@452	632
duke@435	633	//------------------------------match_edge-------------------------------------
duke@435	634	// Do we Match on this edge index or not? Do not match base pointer edge
duke@435	635	uint AddPNode::match_edge(uint idx) const {
duke@435	636	return idx > Base;
duke@435	637	}
duke@435	638
duke@435	639	//---------------------------mach_bottom_type----------------------------------
duke@435	640	// Utility function for use by ADLC. Implements bottom_type for matched AddP.
duke@435	641	const Type *AddPNode::mach_bottom_type( const MachNode* n) {
duke@435	642	Node* base = n->in(Base);
duke@435	643	const Type *t = base->bottom_type();
duke@435	644	if ( t == Type::TOP ) {
duke@435	645	// an untyped pointer
duke@435	646	return TypeRawPtr::BOTTOM;
duke@435	647	}
duke@435	648	const TypePtr* tp = t->isa_oopptr();
duke@435	649	if ( tp == NULL ) return t;
duke@435	650	if ( tp->_offset == TypePtr::OffsetBot ) return tp;
duke@435	651
duke@435	652	// We must carefully add up the various offsets...
duke@435	653	intptr_t offset = 0;
duke@435	654	const TypePtr* tptr = NULL;
duke@435	655
duke@435	656	uint numopnds = n->num_opnds();
duke@435	657	uint index = n->oper_input_base();
duke@435	658	for ( uint i = 1; i < numopnds; i++ ) {
duke@435	659	MachOper *opnd = n->_opnds[i];
duke@435	660	// Check for any interesting operand info.
duke@435	661	// In particular, check for both memory and non-memory operands.
duke@435	662	// %%%%% Clean this up: use xadd_offset
duke@435	663	int con = opnd->constant();
duke@435	664	if ( con == TypePtr::OffsetBot ) goto bottom_out;
duke@435	665	offset += con;
duke@435	666	con = opnd->constant_disp();
duke@435	667	if ( con == TypePtr::OffsetBot ) goto bottom_out;
duke@435	668	offset += con;
duke@435	669	if( opnd->scale() != 0 ) goto bottom_out;
duke@435	670
duke@435	671	// Check each operand input edge. Find the 1 allowed pointer
duke@435	672	// edge. Other edges must be index edges; track exact constant
duke@435	673	// inputs and otherwise assume the worst.
duke@435	674	for ( uint j = opnd->num_edges(); j > 0; j-- ) {
duke@435	675	Node* edge = n->in(index++);
duke@435	676	const Type* et = edge->bottom_type();
duke@435	677	const TypeX* eti = et->isa_intptr_t();
duke@435	678	if ( eti == NULL ) {
duke@435	679	// there must be one pointer among the operands
duke@435	680	guarantee(tptr == NULL, "must be only one pointer operand");
duke@435	681	tptr = et->isa_oopptr();
duke@435	682	guarantee(tptr != NULL, "non-int operand must be pointer");
duke@435	683	continue;
duke@435	684	}
duke@435	685	if ( eti->_hi != eti->_lo ) goto bottom_out;
duke@435	686	offset += eti->_lo;
duke@435	687	}
duke@435	688	}
duke@435	689	guarantee(tptr != NULL, "must be exactly one pointer operand");
duke@435	690	return tptr->add_offset(offset);
duke@435	691
duke@435	692	bottom_out:
duke@435	693	return tp->add_offset(TypePtr::OffsetBot);
duke@435	694	}
duke@435	695
duke@435	696	//=============================================================================
duke@435	697	//------------------------------Identity---------------------------------------
duke@435	698	Node *OrINode::Identity( PhaseTransform *phase ) {
duke@435	699	// x | x => x
duke@435	700	if (phase->eqv(in(1), in(2))) {
duke@435	701	return in(1);
duke@435	702	}
duke@435	703
duke@435	704	return AddNode::Identity(phase);
duke@435	705	}
duke@435	706
duke@435	707	//------------------------------add_ring---------------------------------------
duke@435	708	// Supplied function returns the sum of the inputs IN THE CURRENT RING. For
duke@435	709	// the logical operations the ring's ADD is really a logical OR function.
duke@435	710	// This also type-checks the inputs for sanity. Guaranteed never to
duke@435	711	// be passed a TOP or BOTTOM type, these are filtered out by pre-check.
duke@435	712	const Type *OrINode::add_ring( const Type *t0, const Type *t1 ) const {
duke@435	713	const TypeInt *r0 = t0->is_int(); // Handy access
duke@435	714	const TypeInt *r1 = t1->is_int();
duke@435	715
duke@435	716	// If both args are bool, can figure out better types
duke@435	717	if ( r0 == TypeInt::BOOL ) {
duke@435	718	if ( r1 == TypeInt::ONE) {
duke@435	719	return TypeInt::ONE;
duke@435	720	} else if ( r1 == TypeInt::BOOL ) {
duke@435	721	return TypeInt::BOOL;
duke@435	722	}
duke@435	723	} else if ( r0 == TypeInt::ONE ) {
duke@435	724	if ( r1 == TypeInt::BOOL ) {
duke@435	725	return TypeInt::ONE;
duke@435	726	}
duke@435	727	}
duke@435	728
duke@435	729	// If either input is not a constant, just return all integers.
duke@435	730	if( !r0->is_con() || !r1->is_con() )
duke@435	731	return TypeInt::INT; // Any integer, but still no symbols.
duke@435	732
duke@435	733	// Otherwise just OR them bits.
duke@435	734	return TypeInt::make( r0->get_con() | r1->get_con() );
duke@435	735	}
duke@435	736
duke@435	737	//=============================================================================
duke@435	738	//------------------------------Identity---------------------------------------
duke@435	739	Node *OrLNode::Identity( PhaseTransform *phase ) {
duke@435	740	// x | x => x
duke@435	741	if (phase->eqv(in(1), in(2))) {
duke@435	742	return in(1);
duke@435	743	}
duke@435	744
duke@435	745	return AddNode::Identity(phase);
duke@435	746	}
duke@435	747
duke@435	748	//------------------------------add_ring---------------------------------------
duke@435	749	const Type *OrLNode::add_ring( const Type *t0, const Type *t1 ) const {
duke@435	750	const TypeLong *r0 = t0->is_long(); // Handy access
duke@435	751	const TypeLong *r1 = t1->is_long();
duke@435	752
duke@435	753	// If either input is not a constant, just return all integers.
duke@435	754	if( !r0->is_con() || !r1->is_con() )
duke@435	755	return TypeLong::LONG; // Any integer, but still no symbols.
duke@435	756
duke@435	757	// Otherwise just OR them bits.
duke@435	758	return TypeLong::make( r0->get_con() | r1->get_con() );
duke@435	759	}
duke@435	760
duke@435	761	//=============================================================================
duke@435	762	//------------------------------add_ring---------------------------------------
duke@435	763	// Supplied function returns the sum of the inputs IN THE CURRENT RING. For
duke@435	764	// the logical operations the ring's ADD is really a logical OR function.
duke@435	765	// This also type-checks the inputs for sanity. Guaranteed never to
duke@435	766	// be passed a TOP or BOTTOM type, these are filtered out by pre-check.
duke@435	767	const Type *XorINode::add_ring( const Type *t0, const Type *t1 ) const {
duke@435	768	const TypeInt *r0 = t0->is_int(); // Handy access
duke@435	769	const TypeInt *r1 = t1->is_int();
duke@435	770
duke@435	771	// Complementing a boolean?
duke@435	772	if( r0 == TypeInt::BOOL && ( r1 == TypeInt::ONE
duke@435	773	|| r1 == TypeInt::BOOL))
duke@435	774	return TypeInt::BOOL;
duke@435	775
duke@435	776	if( !r0->is_con() || !r1->is_con() ) // Not constants
duke@435	777	return TypeInt::INT; // Any integer, but still no symbols.
duke@435	778
duke@435	779	// Otherwise just XOR them bits.
duke@435	780	return TypeInt::make( r0->get_con() ^ r1->get_con() );
duke@435	781	}
duke@435	782
duke@435	783	//=============================================================================
duke@435	784	//------------------------------add_ring---------------------------------------
duke@435	785	const Type *XorLNode::add_ring( const Type *t0, const Type *t1 ) const {
duke@435	786	const TypeLong *r0 = t0->is_long(); // Handy access
duke@435	787	const TypeLong *r1 = t1->is_long();
duke@435	788
duke@435	789	// If either input is not a constant, just return all integers.
duke@435	790	if( !r0->is_con() || !r1->is_con() )
duke@435	791	return TypeLong::LONG; // Any integer, but still no symbols.
duke@435	792
duke@435	793	// Otherwise just OR them bits.
duke@435	794	return TypeLong::make( r0->get_con() ^ r1->get_con() );
duke@435	795	}
duke@435	796
duke@435	797	//=============================================================================
duke@435	798	//------------------------------add_ring---------------------------------------
duke@435	799	// Supplied function returns the sum of the inputs.
duke@435	800	const Type *MaxINode::add_ring( const Type *t0, const Type *t1 ) const {
duke@435	801	const TypeInt *r0 = t0->is_int(); // Handy access
duke@435	802	const TypeInt *r1 = t1->is_int();
duke@435	803
duke@435	804	// Otherwise just MAX them bits.
duke@435	805	return TypeInt::make( MAX2(r0->_lo,r1->_lo), MAX2(r0->_hi,r1->_hi), MAX2(r0->_widen,r1->_widen) );
duke@435	806	}
duke@435	807
duke@435	808	//=============================================================================
duke@435	809	//------------------------------Idealize---------------------------------------
duke@435	810	// MINs show up in range-check loop limit calculations. Look for
duke@435	811	// "MIN2(x+c0,MIN2(y,x+c1))". Pick the smaller constant: "MIN2(x+c0,y)"
duke@435	812	Node *MinINode::Ideal(PhaseGVN *phase, bool can_reshape) {
duke@435	813	Node *progress = NULL;
duke@435	814	// Force a right-spline graph
duke@435	815	Node *l = in(1);
duke@435	816	Node *r = in(2);
duke@435	817	// Transform MinI1( MinI2(a,b), c) into MinI1( a, MinI2(b,c) )
duke@435	818	// to force a right-spline graph for the rest of MinINode::Ideal().
duke@435	819	if( l->Opcode() == Op_MinI ) {
duke@435	820	assert( l != l->in(1), "dead loop in MinINode::Ideal" );
duke@435	821	r = phase->transform(new (phase->C, 3) MinINode(l->in(2),r));
duke@435	822	l = l->in(1);
duke@435	823	set_req(1, l);
duke@435	824	set_req(2, r);
duke@435	825	return this;
duke@435	826	}
duke@435	827
duke@435	828	// Get left input & constant
duke@435	829	Node *x = l;
duke@435	830	int x_off = 0;
duke@435	831	if( x->Opcode() == Op_AddI && // Check for "x+c0" and collect constant
duke@435	832	x->in(2)->is_Con() ) {
duke@435	833	const Type *t = x->in(2)->bottom_type();
duke@435	834	if( t == Type::TOP ) return NULL; // No progress
duke@435	835	x_off = t->is_int()->get_con();
duke@435	836	x = x->in(1);
duke@435	837	}
duke@435	838
duke@435	839	// Scan a right-spline-tree for MINs
duke@435	840	Node *y = r;
duke@435	841	int y_off = 0;
duke@435	842	// Check final part of MIN tree
duke@435	843	if( y->Opcode() == Op_AddI && // Check for "y+c1" and collect constant
duke@435	844	y->in(2)->is_Con() ) {
duke@435	845	const Type *t = y->in(2)->bottom_type();
duke@435	846	if( t == Type::TOP ) return NULL; // No progress
duke@435	847	y_off = t->is_int()->get_con();
duke@435	848	y = y->in(1);
duke@435	849	}
duke@435	850	if( x->_idx > y->_idx && r->Opcode() != Op_MinI ) {
duke@435	851	swap_edges(1, 2);
duke@435	852	return this;
duke@435	853	}
duke@435	854
duke@435	855
duke@435	856	if( r->Opcode() == Op_MinI ) {
duke@435	857	assert( r != r->in(2), "dead loop in MinINode::Ideal" );
duke@435	858	y = r->in(1);
duke@435	859	// Check final part of MIN tree
duke@435	860	if( y->Opcode() == Op_AddI &&// Check for "y+c1" and collect constant
duke@435	861	y->in(2)->is_Con() ) {
duke@435	862	const Type *t = y->in(2)->bottom_type();
duke@435	863	if( t == Type::TOP ) return NULL; // No progress
duke@435	864	y_off = t->is_int()->get_con();
duke@435	865	y = y->in(1);
duke@435	866	}
duke@435	867
duke@435	868	if( x->_idx > y->_idx )
duke@435	869	return new (phase->C, 3) MinINode(r->in(1),phase->transform(new (phase->C, 3) MinINode(l,r->in(2))));
duke@435	870
duke@435	871	// See if covers: MIN2(x+c0,MIN2(y+c1,z))
duke@435	872	if( !phase->eqv(x,y) ) return NULL;
duke@435	873	// If (y == x) transform MIN2(x+c0, MIN2(x+c1,z)) into
duke@435	874	// MIN2(x+c0 or x+c1 which less, z).
duke@435	875	return new (phase->C, 3) MinINode(phase->transform(new (phase->C, 3) AddINode(x,phase->intcon(MIN2(x_off,y_off)))),r->in(2));
duke@435	876	} else {
duke@435	877	// See if covers: MIN2(x+c0,y+c1)
duke@435	878	if( !phase->eqv(x,y) ) return NULL;
duke@435	879	// If (y == x) transform MIN2(x+c0,x+c1) into x+c0 or x+c1 which less.
duke@435	880	return new (phase->C, 3) AddINode(x,phase->intcon(MIN2(x_off,y_off)));
duke@435	881	}
duke@435	882
duke@435	883	}
duke@435	884
duke@435	885	//------------------------------add_ring---------------------------------------
duke@435	886	// Supplied function returns the sum of the inputs.
duke@435	887	const Type *MinINode::add_ring( const Type *t0, const Type *t1 ) const {
duke@435	888	const TypeInt *r0 = t0->is_int(); // Handy access
duke@435	889	const TypeInt *r1 = t1->is_int();
duke@435	890
duke@435	891	// Otherwise just MIN them bits.
duke@435	892	return TypeInt::make( MIN2(r0->_lo,r1->_lo), MIN2(r0->_hi,r1->_hi), MAX2(r0->_widen,r1->_widen) );
duke@435	893	}