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

src/share/vm/c1/c1_Canonicalizer.cpp@59766fd005ff (annotated)

src/share/vm/c1/c1_Canonicalizer.cpp

Wed, 13 Apr 2011 17:56:43 -0700

author

johnc

date

Wed, 13 Apr 2011 17:56:43 -0700

changeset 2786

59766fd005ff

parent 2634

425688247f3d

child 3570

80107dc493db

permissions

-rw-r--r--

7035117: G1: nsk/stress/jni/jnistress002 fails with assertion failure
Summary: Allow long type for offset in G1 code in compiler implementations of Unsafe.getObject
Reviewed-by: never, iveresov

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