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

src/share/vm/c1/c1_Canonicalizer.cpp@3a294e483abc (annotated)

src/share/vm/c1/c1_Canonicalizer.cpp

Mon, 13 Sep 2010 12:10:49 -0700

author

iveresov

date

Mon, 13 Sep 2010 12:10:49 -0700

changeset 2146

3a294e483abc

parent 2138

d5d065957597

child 2174

f02a8bbe6ed4

permissions

-rw-r--r--

6919069: client compiler needs to capture more profile information for tiered work
Summary: Added profiling of instanceof and aastore.
Reviewed-by: kvn, jrose, never

duke@435	1	/*
trims@1907	2	* Copyright (c) 1999, 2010, Oracle and/or its affiliates. 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	*
trims@1907	19	* Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
trims@1907	20	* or visit www.oracle.com if you need additional information or have any
trims@1907	21	* questions.
duke@435	22	*
duke@435	23	*/
duke@435	24
duke@435	25	#include "incls/_precompiled.incl"
duke@435	26	#include "incls/_c1_Canonicalizer.cpp.incl"
duke@435	27
duke@435	28
iveresov@1939	29	class PrintValueVisitor: public ValueVisitor {
iveresov@1939	30	void visit(Value* vp) {
iveresov@1939	31	(*vp)->print_line();
iveresov@1939	32	}
iveresov@1939	33	};
duke@435	34
duke@435	35	void Canonicalizer::set_canonical(Value x) {
duke@435	36	assert(x != NULL, "value must exist");
duke@435	37	// Note: we can not currently substitute root nodes which show up in
duke@435	38	// the instruction stream (because the instruction list is embedded
duke@435	39	// in the instructions).
duke@435	40	if (canonical() != x) {
duke@435	41	if (PrintCanonicalization) {
iveresov@1939	42	PrintValueVisitor do_print_value;
iveresov@1939	43	canonical()->input_values_do(&do_print_value);
duke@435	44	canonical()->print_line();
duke@435	45	tty->print_cr("canonicalized to:");
iveresov@1939	46	x->input_values_do(&do_print_value);
duke@435	47	x->print_line();
duke@435	48	tty->cr();
duke@435	49	}
duke@435	50	assert(_canonical->type()->tag() == x->type()->tag(), "types must match");
duke@435	51	_canonical = x;
duke@435	52	}
duke@435	53	}
duke@435	54
duke@435	55
duke@435	56	void Canonicalizer::move_const_to_right(Op2* x) {
duke@435	57	if (x->x()->type()->is_constant() && x->is_commutative()) x->swap_operands();
duke@435	58	}
duke@435	59
duke@435	60
duke@435	61	void Canonicalizer::do_Op2(Op2* x) {
duke@435	62	if (x->x() == x->y()) {
duke@435	63	switch (x->op()) {
duke@435	64	case Bytecodes::_isub: set_constant(0); return;
duke@435	65	case Bytecodes::_lsub: set_constant(jlong_cast(0)); return;
duke@435	66	case Bytecodes::_iand: // fall through
duke@435	67	case Bytecodes::_land: // fall through
duke@435	68	case Bytecodes::_ior: // fall through
duke@435	69	case Bytecodes::_lor : set_canonical(x->x()); return;
duke@435	70	case Bytecodes::_ixor: set_constant(0); return;
duke@435	71	case Bytecodes::_lxor: set_constant(jlong_cast(0)); return;
duke@435	72	}
duke@435	73	}
duke@435	74
duke@435	75	if (x->x()->type()->is_constant() && x->y()->type()->is_constant()) {
duke@435	76	// do constant folding for selected operations
duke@435	77	switch (x->type()->tag()) {
duke@435	78	case intTag:
duke@435	79	{ jint a = x->x()->type()->as_IntConstant()->value();
duke@435	80	jint b = x->y()->type()->as_IntConstant()->value();
duke@435	81	switch (x->op()) {
duke@435	82	case Bytecodes::_iadd: set_constant(a + b); return;
duke@435	83	case Bytecodes::_isub: set_constant(a - b); return;
duke@435	84	case Bytecodes::_imul: set_constant(a * b); return;
duke@435	85	case Bytecodes::_idiv:
duke@435	86	if (b != 0) {
duke@435	87	if (a == min_jint && b == -1) {
duke@435	88	set_constant(min_jint);
duke@435	89	} else {
duke@435	90	set_constant(a / b);
duke@435	91	}
duke@435	92	return;
duke@435	93	}
duke@435	94	break;
duke@435	95	case Bytecodes::_irem:
duke@435	96	if (b != 0) {
duke@435	97	if (a == min_jint && b == -1) {
duke@435	98	set_constant(0);
duke@435	99	} else {
duke@435	100	set_constant(a % b);
duke@435	101	}
duke@435	102	return;
duke@435	103	}
duke@435	104	break;
duke@435	105	case Bytecodes::_iand: set_constant(a & b); return;
duke@435	106	case Bytecodes::_ior : set_constant(a | b); return;
duke@435	107	case Bytecodes::_ixor: set_constant(a ^ b); return;
duke@435	108	}
duke@435	109	}
duke@435	110	break;
duke@435	111	case longTag:
duke@435	112	{ jlong a = x->x()->type()->as_LongConstant()->value();
duke@435	113	jlong b = x->y()->type()->as_LongConstant()->value();
duke@435	114	switch (x->op()) {
duke@435	115	case Bytecodes::_ladd: set_constant(a + b); return;
duke@435	116	case Bytecodes::_lsub: set_constant(a - b); return;
duke@435	117	case Bytecodes::_lmul: set_constant(a * b); return;
duke@435	118	case Bytecodes::_ldiv:
duke@435	119	if (b != 0) {
duke@435	120	set_constant(SharedRuntime::ldiv(b, a));
duke@435	121	return;
duke@435	122	}
duke@435	123	break;
duke@435	124	case Bytecodes::_lrem:
duke@435	125	if (b != 0) {
duke@435	126	set_constant(SharedRuntime::lrem(b, a));
duke@435	127	return;
duke@435	128	}
duke@435	129	break;
duke@435	130	case Bytecodes::_land: set_constant(a & b); return;
duke@435	131	case Bytecodes::_lor : set_constant(a | b); return;
duke@435	132	case Bytecodes::_lxor: set_constant(a ^ b); return;
duke@435	133	}
duke@435	134	}
duke@435	135	break;
duke@435	136	// other cases not implemented (must be extremely careful with floats & doubles!)
duke@435	137	}
duke@435	138	}
duke@435	139	// make sure constant is on the right side, if any
duke@435	140	move_const_to_right(x);
duke@435	141
duke@435	142	if (x->y()->type()->is_constant()) {
duke@435	143	// do constant folding for selected operations
duke@435	144	switch (x->type()->tag()) {
duke@435	145	case intTag:
duke@435	146	if (x->y()->type()->as_IntConstant()->value() == 0) {
duke@435	147	switch (x->op()) {
duke@435	148	case Bytecodes::_iadd: set_canonical(x->x()); return;
duke@435	149	case Bytecodes::_isub: set_canonical(x->x()); return;
duke@435	150	case Bytecodes::_imul: set_constant(0); return;
duke@435	151	// Note: for div and rem, make sure that C semantics
duke@435	152	// corresponds to Java semantics!
duke@435	153	case Bytecodes::_iand: set_constant(0); return;
duke@435	154	case Bytecodes::_ior : set_canonical(x->x()); return;
duke@435	155	}
duke@435	156	}
duke@435	157	break;
duke@435	158	case longTag:
duke@435	159	if (x->y()->type()->as_LongConstant()->value() == (jlong)0) {
duke@435	160	switch (x->op()) {
duke@435	161	case Bytecodes::_ladd: set_canonical(x->x()); return;
duke@435	162	case Bytecodes::_lsub: set_canonical(x->x()); return;
duke@435	163	case Bytecodes::_lmul: set_constant((jlong)0); return;
duke@435	164	// Note: for div and rem, make sure that C semantics
duke@435	165	// corresponds to Java semantics!
duke@435	166	case Bytecodes::_land: set_constant((jlong)0); return;
duke@435	167	case Bytecodes::_lor : set_canonical(x->x()); return;
duke@435	168	}
duke@435	169	}
duke@435	170	break;
duke@435	171	}
duke@435	172	}
duke@435	173	}
duke@435	174
duke@435	175
duke@435	176	void Canonicalizer::do_Phi (Phi* x) {}
duke@435	177	void Canonicalizer::do_Constant (Constant* x) {}
duke@435	178	void Canonicalizer::do_Local (Local* x) {}
duke@435	179	void Canonicalizer::do_LoadField (LoadField* x) {}
duke@435	180
duke@435	181	// checks if v is in the block that is currently processed by
duke@435	182	// GraphBuilder. This is the only block that has not BlockEnd yet.
duke@435	183	static bool in_current_block(Value v) {
duke@435	184	int max_distance = 4;
duke@435	185	while (max_distance > 0 && v != NULL && v->as_BlockEnd() == NULL) {
duke@435	186	v = v->next();
duke@435	187	max_distance--;
duke@435	188	}
duke@435	189	return v == NULL;
duke@435	190	}
duke@435	191
duke@435	192	void Canonicalizer::do_StoreField (StoreField* x) {
duke@435	193	// If a value is going to be stored into a field or array some of
duke@435	194	// the conversions emitted by javac are unneeded because the fields
duke@435	195	// are packed to their natural size.
duke@435	196	Convert* conv = x->value()->as_Convert();
duke@435	197	if (conv) {
duke@435	198	Value value = NULL;
duke@435	199	BasicType type = x->field()->type()->basic_type();
duke@435	200	switch (conv->op()) {
duke@435	201	case Bytecodes::_i2b: if (type == T_BYTE) value = conv->value(); break;
duke@435	202	case Bytecodes::_i2s: if (type == T_SHORT || type == T_BYTE) value = conv->value(); break;
duke@435	203	case Bytecodes::_i2c: if (type == T_CHAR || type == T_BYTE) value = conv->value(); break;
duke@435	204	}
duke@435	205	// limit this optimization to current block
duke@435	206	if (value != NULL && in_current_block(conv)) {
duke@435	207	set_canonical(new StoreField(x->obj(), x->offset(), x->field(), value, x->is_static(),
iveresov@1939	208	x->lock_stack(), x->state_before(), x->is_loaded(), x->is_initialized()));
duke@435	209	return;
duke@435	210	}
duke@435	211	}
duke@435	212
duke@435	213	}
duke@435	214
duke@435	215	void Canonicalizer::do_ArrayLength (ArrayLength* x) {
duke@435	216	NewArray* array = x->array()->as_NewArray();
duke@435	217	if (array != NULL && array->length() != NULL) {
duke@435	218	Constant* length = array->length()->as_Constant();
duke@435	219	if (length != NULL) {
duke@435	220	// do not use the Constant itself, but create a new Constant
duke@435	221	// with same value Otherwise a Constant is live over multiple
duke@435	222	// blocks without being registered in a state array.
duke@435	223	assert(length->type()->as_IntConstant() != NULL, "array length must be integer");
duke@435	224	set_constant(length->type()->as_IntConstant()->value());
duke@435	225	}
duke@435	226	} else {
duke@435	227	LoadField* lf = x->array()->as_LoadField();
twisti@1730	228	if (lf != NULL) {
twisti@1730	229	ciField* field = lf->field();
twisti@1730	230	if (field->is_constant() && field->is_static()) {
twisti@1730	231	// final static field
twisti@1730	232	ciObject* c = field->constant_value().as_object();
twisti@1730	233	if (c->is_array()) {
twisti@1730	234	ciArray* array = (ciArray*) c;
twisti@1730	235	set_constant(array->length());
twisti@1730	236	}
duke@435	237	}
duke@435	238	}
duke@435	239	}
duke@435	240	}
duke@435	241
duke@435	242	void Canonicalizer::do_LoadIndexed (LoadIndexed* x) {}
duke@435	243	void Canonicalizer::do_StoreIndexed (StoreIndexed* x) {
duke@435	244	// If a value is going to be stored into a field or array some of
duke@435	245	// the conversions emitted by javac are unneeded because the fields
duke@435	246	// are packed to their natural size.
duke@435	247	Convert* conv = x->value()->as_Convert();
duke@435	248	if (conv) {
duke@435	249	Value value = NULL;
duke@435	250	BasicType type = x->elt_type();
duke@435	251	switch (conv->op()) {
duke@435	252	case Bytecodes::_i2b: if (type == T_BYTE) value = conv->value(); break;
duke@435	253	case Bytecodes::_i2s: if (type == T_SHORT || type == T_BYTE) value = conv->value(); break;
duke@435	254	case Bytecodes::_i2c: if (type == T_CHAR || type == T_BYTE) value = conv->value(); break;
duke@435	255	}
duke@435	256	// limit this optimization to current block
duke@435	257	if (value != NULL && in_current_block(conv)) {
duke@435	258	set_canonical(new StoreIndexed(x->array(), x->index(), x->length(),
duke@435	259	x->elt_type(), value, x->lock_stack()));
duke@435	260	return;
duke@435	261	}
duke@435	262	}
duke@435	263
duke@435	264
duke@435	265	}
duke@435	266
duke@435	267
duke@435	268	void Canonicalizer::do_NegateOp(NegateOp* x) {
duke@435	269	ValueType* t = x->x()->type();
duke@435	270	if (t->is_constant()) {
duke@435	271	switch (t->tag()) {
duke@435	272	case intTag : set_constant(-t->as_IntConstant ()->value()); return;
duke@435	273	case longTag : set_constant(-t->as_LongConstant ()->value()); return;
duke@435	274	case floatTag : set_constant(-t->as_FloatConstant ()->value()); return;
duke@435	275	case doubleTag: set_constant(-t->as_DoubleConstant()->value()); return;
duke@435	276	default : ShouldNotReachHere();
duke@435	277	}
duke@435	278	}
duke@435	279	}
duke@435	280
duke@435	281
duke@435	282	void Canonicalizer::do_ArithmeticOp (ArithmeticOp* x) { do_Op2(x); }
duke@435	283
duke@435	284
duke@435	285	void Canonicalizer::do_ShiftOp (ShiftOp* x) {
duke@435	286	ValueType* t = x->x()->type();
duke@435	287	ValueType* t2 = x->y()->type();
duke@435	288	if (t->is_constant()) {
duke@435	289	switch (t->tag()) {
duke@435	290	case intTag : if (t->as_IntConstant()->value() == 0) { set_constant(0); return; } break;
duke@435	291	case longTag : if (t->as_LongConstant()->value() == (jlong)0) { set_constant(jlong_cast(0)); return; } break;
duke@435	292	default : ShouldNotReachHere();
duke@435	293	}
duke@435	294	if (t2->is_constant()) {
duke@435	295	if (t->tag() == intTag) {
duke@435	296	int value = t->as_IntConstant()->value();
duke@435	297	int shift = t2->as_IntConstant()->value() & 31;
duke@435	298	jint mask = ~(~0 << (32 - shift));
duke@435	299	if (shift == 0) mask = ~0;
duke@435	300	switch (x->op()) {
duke@435	301	case Bytecodes::_ishl: set_constant(value << shift); return;
duke@435	302	case Bytecodes::_ishr: set_constant(value >> shift); return;
duke@435	303	case Bytecodes::_iushr: set_constant((value >> shift) & mask); return;
duke@435	304	}
duke@435	305	} else if (t->tag() == longTag) {
duke@435	306	jlong value = t->as_LongConstant()->value();
duke@435	307	int shift = t2->as_IntConstant()->value() & 63;
duke@435	308	jlong mask = ~(~jlong_cast(0) << (64 - shift));
duke@435	309	if (shift == 0) mask = ~jlong_cast(0);
duke@435	310	switch (x->op()) {
duke@435	311	case Bytecodes::_lshl: set_constant(value << shift); return;
duke@435	312	case Bytecodes::_lshr: set_constant(value >> shift); return;
duke@435	313	case Bytecodes::_lushr: set_constant((value >> shift) & mask); return;
duke@435	314	}
duke@435	315	}
duke@435	316	}
duke@435	317	}
duke@435	318	if (t2->is_constant()) {
duke@435	319	switch (t2->tag()) {
duke@435	320	case intTag : if (t2->as_IntConstant()->value() == 0) set_canonical(x->x()); return;
duke@435	321	case longTag : if (t2->as_IntConstant()->value() == 0) set_canonical(x->x()); return;
duke@435	322	default : ShouldNotReachHere();
duke@435	323	}
duke@435	324	}
duke@435	325	}
duke@435	326
duke@435	327
duke@435	328	void Canonicalizer::do_LogicOp (LogicOp* x) { do_Op2(x); }
duke@435	329	void Canonicalizer::do_CompareOp (CompareOp* x) {
duke@435	330	if (x->x() == x->y()) {
duke@435	331	switch (x->x()->type()->tag()) {
duke@435	332	case longTag: set_constant(0); break;
duke@435	333	case floatTag: {
duke@435	334	FloatConstant* fc = x->x()->type()->as_FloatConstant();
duke@435	335	if (fc) {
duke@435	336	if (g_isnan(fc->value())) {
duke@435	337	set_constant(x->op() == Bytecodes::_fcmpl ? -1 : 1);
duke@435	338	} else {
duke@435	339	set_constant(0);
duke@435	340	}
duke@435	341	}
duke@435	342	break;
duke@435	343	}
duke@435	344	case doubleTag: {
duke@435	345	DoubleConstant* dc = x->x()->type()->as_DoubleConstant();
duke@435	346	if (dc) {
duke@435	347	if (g_isnan(dc->value())) {
duke@435	348	set_constant(x->op() == Bytecodes::_dcmpl ? -1 : 1);
duke@435	349	} else {
duke@435	350	set_constant(0);
duke@435	351	}
duke@435	352	}
duke@435	353	break;
duke@435	354	}
duke@435	355	}
duke@435	356	} else if (x->x()->type()->is_constant() && x->y()->type()->is_constant()) {
duke@435	357	switch (x->x()->type()->tag()) {
duke@435	358	case longTag: {
duke@435	359	jlong vx = x->x()->type()->as_LongConstant()->value();
duke@435	360	jlong vy = x->y()->type()->as_LongConstant()->value();
duke@435	361	if (vx == vy)
duke@435	362	set_constant(0);
duke@435	363	else if (vx < vy)
duke@435	364	set_constant(-1);
duke@435	365	else
duke@435	366	set_constant(1);
duke@435	367	break;
duke@435	368	}
duke@435	369
duke@435	370	case floatTag: {
duke@435	371	float vx = x->x()->type()->as_FloatConstant()->value();
duke@435	372	float vy = x->y()->type()->as_FloatConstant()->value();
duke@435	373	if (g_isnan(vx) || g_isnan(vy))
duke@435	374	set_constant(x->op() == Bytecodes::_fcmpl ? -1 : 1);
duke@435	375	else if (vx == vy)
duke@435	376	set_constant(0);
duke@435	377	else if (vx < vy)
duke@435	378	set_constant(-1);
duke@435	379	else
duke@435	380	set_constant(1);
duke@435	381	break;
duke@435	382	}
duke@435	383
duke@435	384	case doubleTag: {
duke@435	385	double vx = x->x()->type()->as_DoubleConstant()->value();
duke@435	386	double vy = x->y()->type()->as_DoubleConstant()->value();
duke@435	387	if (g_isnan(vx) || g_isnan(vy))
duke@435	388	set_constant(x->op() == Bytecodes::_dcmpl ? -1 : 1);
duke@435	389	else if (vx == vy)
duke@435	390	set_constant(0);
duke@435	391	else if (vx < vy)
duke@435	392	set_constant(-1);
duke@435	393	else
duke@435	394	set_constant(1);
duke@435	395	break;
duke@435	396	}
duke@435	397	}
duke@435	398
duke@435	399	}
duke@435	400	}
duke@435	401
duke@435	402
duke@435	403	void Canonicalizer::do_IfInstanceOf(IfInstanceOf* x) {}
duke@435	404
duke@435	405	void Canonicalizer::do_IfOp(IfOp* x) {
duke@435	406	// Caution: do not use do_Op2(x) here for now since
duke@435	407	// we map the condition to the op for now!
duke@435	408	move_const_to_right(x);
duke@435	409	}
duke@435	410
duke@435	411
duke@435	412	void Canonicalizer::do_Intrinsic (Intrinsic* x) {
duke@435	413	switch (x->id()) {
duke@435	414	case vmIntrinsics::_floatToRawIntBits : {
duke@435	415	FloatConstant* c = x->argument_at(0)->type()->as_FloatConstant();
duke@435	416	if (c != NULL) {
duke@435	417	JavaValue v;
duke@435	418	v.set_jfloat(c->value());
duke@435	419	set_constant(v.get_jint());
duke@435	420	}
duke@435	421	break;
duke@435	422	}
duke@435	423	case vmIntrinsics::_intBitsToFloat : {
duke@435	424	IntConstant* c = x->argument_at(0)->type()->as_IntConstant();
duke@435	425	if (c != NULL) {
duke@435	426	JavaValue v;
duke@435	427	v.set_jint(c->value());
duke@435	428	set_constant(v.get_jfloat());
duke@435	429	}
duke@435	430	break;
duke@435	431	}
duke@435	432	case vmIntrinsics::_doubleToRawLongBits : {
duke@435	433	DoubleConstant* c = x->argument_at(0)->type()->as_DoubleConstant();
duke@435	434	if (c != NULL) {
duke@435	435	JavaValue v;
duke@435	436	v.set_jdouble(c->value());
duke@435	437	set_constant(v.get_jlong());
duke@435	438	}
duke@435	439	break;
duke@435	440	}
duke@435	441	case vmIntrinsics::_longBitsToDouble : {
duke@435	442	LongConstant* c = x->argument_at(0)->type()->as_LongConstant();
duke@435	443	if (c != NULL) {
duke@435	444	JavaValue v;
duke@435	445	v.set_jlong(c->value());
duke@435	446	set_constant(v.get_jdouble());
duke@435	447	}
duke@435	448	break;
duke@435	449	}
duke@435	450	}
duke@435	451	}
duke@435	452
duke@435	453	void Canonicalizer::do_Convert (Convert* x) {
duke@435	454	if (x->value()->type()->is_constant()) {
duke@435	455	switch (x->op()) {
duke@435	456	case Bytecodes::_i2b: set_constant((int)((x->value()->type()->as_IntConstant()->value() << 24) >> 24)); break;
duke@435	457	case Bytecodes::_i2s: set_constant((int)((x->value()->type()->as_IntConstant()->value() << 16) >> 16)); break;
duke@435	458	case Bytecodes::_i2c: set_constant((int)(x->value()->type()->as_IntConstant()->value() & ((1<<16)-1))); break;
duke@435	459	case Bytecodes::_i2l: set_constant((jlong)(x->value()->type()->as_IntConstant()->value())); break;
duke@435	460	case Bytecodes::_i2f: set_constant((float)(x->value()->type()->as_IntConstant()->value())); break;
duke@435	461	case Bytecodes::_i2d: set_constant((double)(x->value()->type()->as_IntConstant()->value())); break;
duke@435	462	case Bytecodes::_l2i: set_constant((int)(x->value()->type()->as_LongConstant()->value())); break;
duke@435	463	case Bytecodes::_l2f: set_constant(SharedRuntime::l2f(x->value()->type()->as_LongConstant()->value())); break;
duke@435	464	case Bytecodes::_l2d: set_constant(SharedRuntime::l2d(x->value()->type()->as_LongConstant()->value())); break;
duke@435	465	case Bytecodes::_f2d: set_constant((double)(x->value()->type()->as_FloatConstant()->value())); break;
duke@435	466	case Bytecodes::_f2i: set_constant(SharedRuntime::f2i(x->value()->type()->as_FloatConstant()->value())); break;
duke@435	467	case Bytecodes::_f2l: set_constant(SharedRuntime::f2l(x->value()->type()->as_FloatConstant()->value())); break;
duke@435	468	case Bytecodes::_d2f: set_constant((float)(x->value()->type()->as_DoubleConstant()->value())); break;
duke@435	469	case Bytecodes::_d2i: set_constant(SharedRuntime::d2i(x->value()->type()->as_DoubleConstant()->value())); break;
duke@435	470	case Bytecodes::_d2l: set_constant(SharedRuntime::d2l(x->value()->type()->as_DoubleConstant()->value())); break;
duke@435	471	default:
duke@435	472	ShouldNotReachHere();
duke@435	473	}
duke@435	474	}
duke@435	475
duke@435	476	Value value = x->value();
duke@435	477	BasicType type = T_ILLEGAL;
duke@435	478	LoadField* lf = value->as_LoadField();
duke@435	479	if (lf) {
duke@435	480	type = lf->field_type();
duke@435	481	} else {
duke@435	482	LoadIndexed* li = value->as_LoadIndexed();
duke@435	483	if (li) {
duke@435	484	type = li->elt_type();
duke@435	485	} else {
duke@435	486	Convert* conv = value->as_Convert();
duke@435	487	if (conv) {
duke@435	488	switch (conv->op()) {
duke@435	489	case Bytecodes::_i2b: type = T_BYTE; break;
duke@435	490	case Bytecodes::_i2s: type = T_SHORT; break;
duke@435	491	case Bytecodes::_i2c: type = T_CHAR; break;
duke@435	492	}
duke@435	493	}
duke@435	494	}
duke@435	495	}
duke@435	496	if (type != T_ILLEGAL) {
duke@435	497	switch (x->op()) {
duke@435	498	case Bytecodes::_i2b: if (type == T_BYTE) set_canonical(x->value()); break;
duke@435	499	case Bytecodes::_i2s: if (type == T_SHORT || type == T_BYTE) set_canonical(x->value()); break;
duke@435	500	case Bytecodes::_i2c: if (type == T_CHAR) set_canonical(x->value()); break;
duke@435	501	}
duke@435	502	} else {
duke@435	503	Op2* op2 = x->value()->as_Op2();
duke@435	504	if (op2 && op2->op() == Bytecodes::_iand && op2->y()->type()->is_constant()) {
duke@435	505	jint safebits = 0;
duke@435	506	jint mask = op2->y()->type()->as_IntConstant()->value();
duke@435	507	switch (x->op()) {
duke@435	508	case Bytecodes::_i2b: safebits = 0x7f; break;
duke@435	509	case Bytecodes::_i2s: safebits = 0x7fff; break;
duke@435	510	case Bytecodes::_i2c: safebits = 0xffff; break;
duke@435	511	}
duke@435	512	// When casting a masked integer to a smaller signed type, if
duke@435	513	// the mask doesn't include the sign bit the cast isn't needed.
duke@435	514	if (safebits && (mask & ~safebits) == 0) {
duke@435	515	set_canonical(x->value());
duke@435	516	}
duke@435	517	}
duke@435	518	}
duke@435	519
duke@435	520	}
duke@435	521
duke@435	522	void Canonicalizer::do_NullCheck (NullCheck* x) {
duke@435	523	if (x->obj()->as_NewArray() != NULL || x->obj()->as_NewInstance() != NULL) {
duke@435	524	set_canonical(x->obj());
duke@435	525	} else {
duke@435	526	Constant* con = x->obj()->as_Constant();
duke@435	527	if (con) {
duke@435	528	ObjectType* c = con->type()->as_ObjectType();
duke@435	529	if (c && c->is_loaded()) {
duke@435	530	ObjectConstant* oc = c->as_ObjectConstant();
duke@435	531	if (!oc || !oc->value()->is_null_object()) {
duke@435	532	set_canonical(con);
duke@435	533	}
duke@435	534	}
duke@435	535	}
duke@435	536	}
duke@435	537	}
duke@435	538
duke@435	539	void Canonicalizer::do_Invoke (Invoke* x) {}
duke@435	540	void Canonicalizer::do_NewInstance (NewInstance* x) {}
duke@435	541	void Canonicalizer::do_NewTypeArray (NewTypeArray* x) {}
duke@435	542	void Canonicalizer::do_NewObjectArray (NewObjectArray* x) {}
duke@435	543	void Canonicalizer::do_NewMultiArray (NewMultiArray* x) {}
duke@435	544	void Canonicalizer::do_CheckCast (CheckCast* x) {
duke@435	545	if (x->klass()->is_loaded()) {
duke@435	546	Value obj = x->obj();
duke@435	547	ciType* klass = obj->exact_type();
duke@435	548	if (klass == NULL) klass = obj->declared_type();
duke@435	549	if (klass != NULL && klass->is_loaded() && klass->is_subtype_of(x->klass())) {
duke@435	550	set_canonical(obj);
duke@435	551	return;
duke@435	552	}
duke@435	553	// checkcast of null returns null
duke@435	554	if (obj->as_Constant() && obj->type()->as_ObjectType()->constant_value()->is_null_object()) {
duke@435	555	set_canonical(obj);
duke@435	556	}
duke@435	557	}
duke@435	558	}
duke@435	559	void Canonicalizer::do_InstanceOf (InstanceOf* x) {
duke@435	560	if (x->klass()->is_loaded()) {
duke@435	561	Value obj = x->obj();
duke@435	562	ciType* exact = obj->exact_type();
duke@435	563	if (exact != NULL && exact->is_loaded() && (obj->as_NewInstance() || obj->as_NewArray())) {
duke@435	564	set_constant(exact->is_subtype_of(x->klass()) ? 1 : 0);
duke@435	565	return;
duke@435	566	}
duke@435	567	// instanceof null returns false
duke@435	568	if (obj->as_Constant() && obj->type()->as_ObjectType()->constant_value()->is_null_object()) {
duke@435	569	set_constant(0);
duke@435	570	}
duke@435	571	}
duke@435	572
duke@435	573	}
duke@435	574	void Canonicalizer::do_MonitorEnter (MonitorEnter* x) {}
duke@435	575	void Canonicalizer::do_MonitorExit (MonitorExit* x) {}
duke@435	576	void Canonicalizer::do_BlockBegin (BlockBegin* x) {}
duke@435	577	void Canonicalizer::do_Goto (Goto* x) {}
duke@435	578
duke@435	579
duke@435	580	static bool is_true(jlong x, If::Condition cond, jlong y) {
duke@435	581	switch (cond) {
duke@435	582	case If::eql: return x == y;
duke@435	583	case If::neq: return x != y;
duke@435	584	case If::lss: return x < y;
duke@435	585	case If::leq: return x <= y;
duke@435	586	case If::gtr: return x > y;
duke@435	587	case If::geq: return x >= y;
duke@435	588	}
duke@435	589	ShouldNotReachHere();
duke@435	590	return false;
duke@435	591	}
duke@435	592
duke@435	593
duke@435	594	void Canonicalizer::do_If(If* x) {
duke@435	595	// move const to right
duke@435	596	if (x->x()->type()->is_constant()) x->swap_operands();
duke@435	597	// simplify
duke@435	598	const Value l = x->x(); ValueType* lt = l->type();
duke@435	599	const Value r = x->y(); ValueType* rt = r->type();
duke@435	600
duke@435	601	if (l == r && !lt->is_float_kind()) {
duke@435	602	// pattern: If (a cond a) => simplify to Goto
duke@435	603	BlockBegin* sux;
duke@435	604	switch (x->cond()) {
duke@435	605	case If::eql: sux = x->sux_for(true); break;
duke@435	606	case If::neq: sux = x->sux_for(false); break;
duke@435	607	case If::lss: sux = x->sux_for(false); break;
duke@435	608	case If::leq: sux = x->sux_for(true); break;
duke@435	609	case If::gtr: sux = x->sux_for(false); break;
duke@435	610	case If::geq: sux = x->sux_for(true); break;
duke@435	611	}
duke@435	612	// If is a safepoint then the debug information should come from the state_before of the If.
duke@435	613	set_canonical(new Goto(sux, x->state_before(), x->is_safepoint()));
duke@435	614	return;
duke@435	615	}
duke@435	616
duke@435	617	if (lt->is_constant() && rt->is_constant()) {
duke@435	618	if (x->x()->as_Constant() != NULL) {
duke@435	619	// pattern: If (lc cond rc) => simplify to: Goto
duke@435	620	BlockBegin* sux = x->x()->as_Constant()->compare(x->cond(), x->y(),
duke@435	621	x->sux_for(true),
duke@435	622	x->sux_for(false));
duke@435	623	if (sux != NULL) {
duke@435	624	// If is a safepoint then the debug information should come from the state_before of the If.
duke@435	625	set_canonical(new Goto(sux, x->state_before(), x->is_safepoint()));
duke@435	626	}
duke@435	627	}
duke@435	628	} else if (rt->as_IntConstant() != NULL) {
duke@435	629	// pattern: If (l cond rc) => investigate further
duke@435	630	const jint rc = rt->as_IntConstant()->value();
duke@435	631	if (l->as_CompareOp() != NULL) {
duke@435	632	// pattern: If ((a cmp b) cond rc) => simplify to: If (x cond y) or: Goto
duke@435	633	CompareOp* cmp = l->as_CompareOp();
duke@435	634	bool unordered_is_less = cmp->op() == Bytecodes::_fcmpl || cmp->op() == Bytecodes::_dcmpl;
duke@435	635	BlockBegin* lss_sux = x->sux_for(is_true(-1, x->cond(), rc)); // successor for a < b
duke@435	636	BlockBegin* eql_sux = x->sux_for(is_true( 0, x->cond(), rc)); // successor for a = b
duke@435	637	BlockBegin* gtr_sux = x->sux_for(is_true(+1, x->cond(), rc)); // successor for a > b
duke@435	638	BlockBegin* nan_sux = unordered_is_less ? lss_sux : gtr_sux ; // successor for unordered
duke@435	639	// Note: At this point all successors (lss_sux, eql_sux, gtr_sux, nan_sux) are
duke@435	640	// equal to x->tsux() or x->fsux(). Furthermore, nan_sux equals either
duke@435	641	// lss_sux or gtr_sux.
duke@435	642	if (lss_sux == eql_sux && eql_sux == gtr_sux) {
duke@435	643	// all successors identical => simplify to: Goto
duke@435	644	set_canonical(new Goto(lss_sux, x->state_before(), x->is_safepoint()));
duke@435	645	} else {
duke@435	646	// two successors differ and two successors are the same => simplify to: If (x cmp y)
duke@435	647	// determine new condition & successors
duke@435	648	If::Condition cond;
duke@435	649	BlockBegin* tsux = NULL;
duke@435	650	BlockBegin* fsux = NULL;
duke@435	651	if (lss_sux == eql_sux) { cond = If::leq; tsux = lss_sux; fsux = gtr_sux; }
duke@435	652	else if (lss_sux == gtr_sux) { cond = If::neq; tsux = lss_sux; fsux = eql_sux; }
duke@435	653	else if (eql_sux == gtr_sux) { cond = If::geq; tsux = eql_sux; fsux = lss_sux; }
duke@435	654	else { ShouldNotReachHere(); }
iveresov@2138	655	If* canon = new If(cmp->x(), cond, nan_sux == tsux, cmp->y(), tsux, fsux, cmp->state_before(), x->is_safepoint());
duke@435	656	if (cmp->x() == cmp->y()) {
duke@435	657	do_If(canon);
duke@435	658	} else {
iveresov@2138	659	if (compilation()->profile_branches()) {
iveresov@2138	660	// TODO: If profiling, leave floating point comparisons unoptimized.
iveresov@2138	661	// We currently do not support profiling of the unordered case.
iveresov@2138	662	switch(cmp->op()) {
iveresov@2138	663	case Bytecodes::_fcmpl: case Bytecodes::_fcmpg:
iveresov@2138	664	case Bytecodes::_dcmpl: case Bytecodes::_dcmpg:
iveresov@2138	665	set_canonical(x);
iveresov@2138	666	return;
iveresov@2138	667	}
iveresov@2138	668	}
duke@435	669	set_canonical(canon);
duke@435	670	set_bci(cmp->bci());
duke@435	671	}
duke@435	672	}
duke@435	673	} else if (l->as_InstanceOf() != NULL) {
duke@435	674	// NOTE: Code permanently disabled for now since it leaves the old InstanceOf
duke@435	675	// instruction in the graph (it is pinned). Need to fix this at some point.
iveresov@2146	676	// It should also be left in the graph when generating a profiled method version or Goto
iveresov@2146	677	// has to know that it was an InstanceOf.
duke@435	678	return;
duke@435	679	// pattern: If ((obj instanceof klass) cond rc) => simplify to: IfInstanceOf or: Goto
duke@435	680	InstanceOf* inst = l->as_InstanceOf();
duke@435	681	BlockBegin* is_inst_sux = x->sux_for(is_true(1, x->cond(), rc)); // successor for instanceof == 1
duke@435	682	BlockBegin* no_inst_sux = x->sux_for(is_true(0, x->cond(), rc)); // successor for instanceof == 0
duke@435	683	if (is_inst_sux == no_inst_sux && inst->is_loaded()) {
duke@435	684	// both successors identical and klass is loaded => simplify to: Goto
duke@435	685	set_canonical(new Goto(is_inst_sux, x->state_before(), x->is_safepoint()));
duke@435	686	} else {
duke@435	687	// successors differ => simplify to: IfInstanceOf
duke@435	688	set_canonical(new IfInstanceOf(inst->klass(), inst->obj(), true, inst->bci(), is_inst_sux, no_inst_sux));
duke@435	689	}
duke@435	690	}
duke@435	691	} else if (rt == objectNull && (l->as_NewInstance() || l->as_NewArray())) {
duke@435	692	if (x->cond() == Instruction::eql) {
duke@435	693	set_canonical(new Goto(x->fsux(), x->state_before(), x->is_safepoint()));
duke@435	694	} else {
duke@435	695	assert(x->cond() == Instruction::neq, "only other valid case");
duke@435	696	set_canonical(new Goto(x->tsux(), x->state_before(), x->is_safepoint()));
duke@435	697	}
duke@435	698	}
duke@435	699	}
duke@435	700
duke@435	701
duke@435	702	void Canonicalizer::do_TableSwitch(TableSwitch* x) {
duke@435	703	if (x->tag()->type()->is_constant()) {
duke@435	704	int v = x->tag()->type()->as_IntConstant()->value();
duke@435	705	BlockBegin* sux = x->default_sux();
duke@435	706	if (v >= x->lo_key() && v <= x->hi_key()) {
duke@435	707	sux = x->sux_at(v - x->lo_key());
duke@435	708	}
duke@435	709	set_canonical(new Goto(sux, x->state_before(), x->is_safepoint()));
duke@435	710	} else if (x->number_of_sux() == 1) {
duke@435	711	// NOTE: Code permanently disabled for now since the switch statement's
duke@435	712	// tag expression may produce side-effects in which case it must
duke@435	713	// be executed.
duke@435	714	return;
duke@435	715	// simplify to Goto
duke@435	716	set_canonical(new Goto(x->default_sux(), x->state_before(), x->is_safepoint()));
duke@435	717	} else if (x->number_of_sux() == 2) {
duke@435	718	// NOTE: Code permanently disabled for now since it produces two new nodes
duke@435	719	// (Constant & If) and the Canonicalizer cannot return them correctly
duke@435	720	// yet. For now we copied the corresponding code directly into the
duke@435	721	// GraphBuilder (i.e., we should never reach here).
duke@435	722	return;
duke@435	723	// simplify to If
duke@435	724	assert(x->lo_key() == x->hi_key(), "keys must be the same");
duke@435	725	Constant* key = new Constant(new IntConstant(x->lo_key()));
duke@435	726	set_canonical(new If(x->tag(), If::eql, true, key, x->sux_at(0), x->default_sux(), x->state_before(), x->is_safepoint()));
duke@435	727	}
duke@435	728	}
duke@435	729
duke@435	730
duke@435	731	void Canonicalizer::do_LookupSwitch(LookupSwitch* x) {
duke@435	732	if (x->tag()->type()->is_constant()) {
duke@435	733	int v = x->tag()->type()->as_IntConstant()->value();
duke@435	734	BlockBegin* sux = x->default_sux();
duke@435	735	for (int i = 0; i < x->length(); i++) {
duke@435	736	if (v == x->key_at(i)) {
duke@435	737	sux = x->sux_at(i);
duke@435	738	}
duke@435	739	}
duke@435	740	set_canonical(new Goto(sux, x->state_before(), x->is_safepoint()));
duke@435	741	} else if (x->number_of_sux() == 1) {
duke@435	742	// NOTE: Code permanently disabled for now since the switch statement's
duke@435	743	// tag expression may produce side-effects in which case it must
duke@435	744	// be executed.
duke@435	745	return;
duke@435	746	// simplify to Goto
duke@435	747	set_canonical(new Goto(x->default_sux(), x->state_before(), x->is_safepoint()));
duke@435	748	} else if (x->number_of_sux() == 2) {
duke@435	749	// NOTE: Code permanently disabled for now since it produces two new nodes
duke@435	750	// (Constant & If) and the Canonicalizer cannot return them correctly
duke@435	751	// yet. For now we copied the corresponding code directly into the
duke@435	752	// GraphBuilder (i.e., we should never reach here).
duke@435	753	return;
duke@435	754	// simplify to If
duke@435	755	assert(x->length() == 1, "length must be the same");
duke@435	756	Constant* key = new Constant(new IntConstant(x->key_at(0)));
duke@435	757	set_canonical(new If(x->tag(), If::eql, true, key, x->sux_at(0), x->default_sux(), x->state_before(), x->is_safepoint()));
duke@435	758	}
duke@435	759	}
duke@435	760
duke@435	761
duke@435	762	void Canonicalizer::do_Return (Return* x) {}
duke@435	763	void Canonicalizer::do_Throw (Throw* x) {}
duke@435	764	void Canonicalizer::do_Base (Base* x) {}
duke@435	765	void Canonicalizer::do_OsrEntry (OsrEntry* x) {}
duke@435	766	void Canonicalizer::do_ExceptionObject(ExceptionObject* x) {}
duke@435	767
duke@435	768	static bool match_index_and_scale(Instruction* instr,
duke@435	769	Instruction** index,
duke@435	770	int* log2_scale,
duke@435	771	Instruction** instr_to_unpin) {
duke@435	772	*instr_to_unpin = NULL;
duke@435	773
duke@435	774	// Skip conversion ops
duke@435	775	Convert* convert = instr->as_Convert();
duke@435	776	if (convert != NULL) {
duke@435	777	instr = convert->value();
duke@435	778	}
duke@435	779
duke@435	780	ShiftOp* shift = instr->as_ShiftOp();
duke@435	781	if (shift != NULL) {
duke@435	782	if (shift->is_pinned()) {
duke@435	783	*instr_to_unpin = shift;
duke@435	784	}
duke@435	785	// Constant shift value?
duke@435	786	Constant* con = shift->y()->as_Constant();
duke@435	787	if (con == NULL) return false;
duke@435	788	// Well-known type and value?
duke@435	789	IntConstant* val = con->type()->as_IntConstant();
duke@435	790	if (val == NULL) return false;
duke@435	791	if (shift->x()->type() != intType) return false;
duke@435	792	*index = shift->x();
duke@435	793	int tmp_scale = val->value();
duke@435	794	if (tmp_scale >= 0 && tmp_scale < 4) {
duke@435	795	*log2_scale = tmp_scale;
duke@435	796	return true;
duke@435	797	} else {
duke@435	798	return false;
duke@435	799	}
duke@435	800	}
duke@435	801
duke@435	802	ArithmeticOp* arith = instr->as_ArithmeticOp();
duke@435	803	if (arith != NULL) {
duke@435	804	if (arith->is_pinned()) {
duke@435	805	*instr_to_unpin = arith;
duke@435	806	}
duke@435	807	// Check for integer multiply
duke@435	808	if (arith->op() == Bytecodes::_imul) {
duke@435	809	// See if either arg is a known constant
duke@435	810	Constant* con = arith->x()->as_Constant();
duke@435	811	if (con != NULL) {
duke@435	812	*index = arith->y();
duke@435	813	} else {
duke@435	814	con = arith->y()->as_Constant();
duke@435	815	if (con == NULL) return false;
duke@435	816	*index = arith->x();
duke@435	817	}
duke@435	818	if ((*index)->type() != intType) return false;
duke@435	819	// Well-known type and value?
duke@435	820	IntConstant* val = con->type()->as_IntConstant();
duke@435	821	if (val == NULL) return false;
duke@435	822	switch (val->value()) {
duke@435	823	case 1: *log2_scale = 0; return true;
duke@435	824	case 2: *log2_scale = 1; return true;
duke@435	825	case 4: *log2_scale = 2; return true;
duke@435	826	case 8: *log2_scale = 3; return true;
duke@435	827	default: return false;
duke@435	828	}
duke@435	829	}
duke@435	830	}
duke@435	831
duke@435	832	// Unknown instruction sequence; don't touch it
duke@435	833	return false;
duke@435	834	}
duke@435	835
duke@435	836
duke@435	837	static bool match(UnsafeRawOp* x,
duke@435	838	Instruction** base,
duke@435	839	Instruction** index,
duke@435	840	int* log2_scale) {
duke@435	841	Instruction* instr_to_unpin = NULL;
duke@435	842	ArithmeticOp* root = x->base()->as_ArithmeticOp();
duke@435	843	if (root == NULL) return false;
duke@435	844	// Limit ourselves to addition for now
duke@435	845	if (root->op() != Bytecodes::_ladd) return false;
duke@435	846	// Try to find shift or scale op
duke@435	847	if (match_index_and_scale(root->y(), index, log2_scale, &instr_to_unpin)) {
duke@435	848	*base = root->x();
duke@435	849	} else if (match_index_and_scale(root->x(), index, log2_scale, &instr_to_unpin)) {
duke@435	850	*base = root->y();
duke@435	851	} else if (root->y()->as_Convert() != NULL) {
duke@435	852	Convert* convert = root->y()->as_Convert();
duke@435	853	if (convert->op() == Bytecodes::_i2l && convert->value()->type() == intType) {
duke@435	854	// pick base and index, setting scale at 1
duke@435	855	*base = root->x();
duke@435	856	*index = convert->value();
duke@435	857	*log2_scale = 0;
duke@435	858	} else {
duke@435	859	return false;
duke@435	860	}
duke@435	861	} else {
duke@435	862	// doesn't match any expected sequences
duke@435	863	return false;
duke@435	864	}
duke@435	865
duke@435	866	// If the value is pinned then it will be always be computed so
duke@435	867	// there's no profit to reshaping the expression.
duke@435	868	return !root->is_pinned();
duke@435	869	}
duke@435	870
duke@435	871
duke@435	872	void Canonicalizer::do_UnsafeRawOp(UnsafeRawOp* x) {
duke@435	873	Instruction* base = NULL;
duke@435	874	Instruction* index = NULL;
duke@435	875	int log2_scale;
duke@435	876
duke@435	877	if (match(x, &base, &index, &log2_scale)) {
duke@435	878	x->set_base(base);
duke@435	879	x->set_index(index);
duke@435	880	x->set_log2_scale(log2_scale);
duke@435	881	if (PrintUnsafeOptimization) {
duke@435	882	tty->print_cr("Canonicalizer: UnsafeRawOp id %d: base = id %d, index = id %d, log2_scale = %d",
duke@435	883	x->id(), x->base()->id(), x->index()->id(), x->log2_scale());
duke@435	884	}
duke@435	885	}
duke@435	886	}
duke@435	887
duke@435	888	void Canonicalizer::do_RoundFP(RoundFP* x) {}
duke@435	889	void Canonicalizer::do_UnsafeGetRaw(UnsafeGetRaw* x) { if (OptimizeUnsafes) do_UnsafeRawOp(x); }
duke@435	890	void Canonicalizer::do_UnsafePutRaw(UnsafePutRaw* x) { if (OptimizeUnsafes) do_UnsafeRawOp(x); }
duke@435	891	void Canonicalizer::do_UnsafeGetObject(UnsafeGetObject* x) {}
duke@435	892	void Canonicalizer::do_UnsafePutObject(UnsafePutObject* x) {}
duke@435	893	void Canonicalizer::do_UnsafePrefetchRead (UnsafePrefetchRead* x) {}
duke@435	894	void Canonicalizer::do_UnsafePrefetchWrite(UnsafePrefetchWrite* x) {}
duke@435	895	void Canonicalizer::do_ProfileCall(ProfileCall* x) {}
iveresov@2138	896	void Canonicalizer::do_ProfileInvoke(ProfileInvoke* x) {}
iveresov@2138	897