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

src/share/vm/opto/stringopts.cpp@83f08886981c (annotated)

src/share/vm/opto/stringopts.cpp

Fri, 11 Mar 2011 07:50:51 -0800

author

kvn

date

Fri, 11 Mar 2011 07:50:51 -0800

changeset 2636

83f08886981c

parent 2413

2ddb2fab82cb

child 2661

b099aaf51bf8

child 2665

9dc311b8473e

permissions

-rw-r--r--

7026631: field _klass is incorrectly set for dual type of TypeAryPtr::OOPS
Summary: add missing check this->dual() != TypeAryPtr::OOPS into TypeAryPtr::klass().
Reviewed-by: never

never@1515	1	/*
trims@1907	2	* Copyright (c) 2009, 2010, Oracle and/or its affiliates. All rights reserved.
never@1515	3	* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
never@1515	4	*
never@1515	5	* This code is free software; you can redistribute it and/or modify it
never@1515	6	* under the terms of the GNU General Public License version 2 only, as
never@1515	7	* published by the Free Software Foundation.
never@1515	8	*
never@1515	9	* This code is distributed in the hope that it will be useful, but WITHOUT
never@1515	10	* ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
never@1515	11	* FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
never@1515	12	* version 2 for more details (a copy is included in the LICENSE file that
never@1515	13	* accompanied this code).
never@1515	14	*
never@1515	15	* You should have received a copy of the GNU General Public License version
never@1515	16	* 2 along with this work; if not, write to the Free Software Foundation,
never@1515	17	* Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
never@1515	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.
never@1515	22	*
never@1515	23	*/
never@1515	24
stefank@2314	25	#include "precompiled.hpp"
stefank@2314	26	#include "compiler/compileLog.hpp"
stefank@2314	27	#include "opto/addnode.hpp"
stefank@2314	28	#include "opto/callGenerator.hpp"
stefank@2314	29	#include "opto/callnode.hpp"
stefank@2314	30	#include "opto/divnode.hpp"
stefank@2314	31	#include "opto/graphKit.hpp"
stefank@2314	32	#include "opto/idealKit.hpp"
stefank@2314	33	#include "opto/rootnode.hpp"
stefank@2314	34	#include "opto/runtime.hpp"
stefank@2314	35	#include "opto/stringopts.hpp"
stefank@2314	36	#include "opto/subnode.hpp"
never@1515	37
never@1515	38	#define __ kit.
never@1515	39
never@1515	40	class StringConcat : public ResourceObj {
never@1515	41	private:
never@1515	42	PhaseStringOpts* _stringopts;
never@1515	43	Node* _string_alloc;
never@1515	44	AllocateNode* _begin; // The allocation the begins the pattern
never@1515	45	CallStaticJavaNode* _end; // The final call of the pattern. Will either be
never@1515	46	// SB.toString or or String.<init>(SB.toString)
never@1515	47	bool _multiple; // indicates this is a fusion of two or more
never@1515	48	// separate StringBuilders
never@1515	49
never@1515	50	Node* _arguments; // The list of arguments to be concatenated
never@1515	51	GrowableArray<int> _mode; // into a String along with a mode flag
never@1515	52	// indicating how to treat the value.
never@1515	53
never@1515	54	Node_List _control; // List of control nodes that will be deleted
never@1515	55	Node_List _uncommon_traps; // Uncommon traps that needs to be rewritten
never@1515	56	// to restart at the initial JVMState.
never@1515	57	public:
never@1515	58	// Mode for converting arguments to Strings
never@1515	59	enum {
never@1515	60	StringMode,
never@1515	61	IntMode,
kvn@2413	62	CharMode,
kvn@2413	63	StringNullCheckMode
never@1515	64	};
never@1515	65
never@1515	66	StringConcat(PhaseStringOpts* stringopts, CallStaticJavaNode* end):
never@1515	67	_end(end),
never@1515	68	_begin(NULL),
never@1515	69	_multiple(false),
never@1515	70	_string_alloc(NULL),
never@1515	71	_stringopts(stringopts) {
never@1515	72	_arguments = new (_stringopts->C, 1) Node(1);
never@1515	73	_arguments->del_req(0);
never@1515	74	}
never@1515	75
never@1515	76	bool validate_control_flow();
never@1515	77
never@1515	78	void merge_add() {
never@1515	79	#if 0
never@1515	80	// XXX This is place holder code for reusing an existing String
never@1515	81	// allocation but the logic for checking the state safety is
never@1515	82	// probably inadequate at the moment.
never@1515	83	CallProjections endprojs;
never@1515	84	sc->end()->extract_projections(&endprojs, false);
never@1515	85	if (endprojs.resproj != NULL) {
never@1515	86	for (SimpleDUIterator i(endprojs.resproj); i.has_next(); i.next()) {
never@1515	87	CallStaticJavaNode *use = i.get()->isa_CallStaticJava();
never@1515	88	if (use != NULL && use->method() != NULL &&
never@2172	89	use->method()->intrinsic_id() == vmIntrinsics::_String_String &&
never@1515	90	use->in(TypeFunc::Parms + 1) == endprojs.resproj) {
never@1515	91	// Found useless new String(sb.toString()) so reuse the newly allocated String
never@1515	92	// when creating the result instead of allocating a new one.
never@1515	93	sc->set_string_alloc(use->in(TypeFunc::Parms));
never@1515	94	sc->set_end(use);
never@1515	95	}
never@1515	96	}
never@1515	97	}
never@1515	98	#endif
never@1515	99	}
never@1515	100
never@1515	101	StringConcat* merge(StringConcat* other, Node* arg);
never@1515	102
never@1515	103	void set_allocation(AllocateNode* alloc) {
never@1515	104	_begin = alloc;
never@1515	105	}
never@1515	106
never@1515	107	void append(Node* value, int mode) {
never@1515	108	_arguments->add_req(value);
never@1515	109	_mode.append(mode);
never@1515	110	}
never@1515	111	void push(Node* value, int mode) {
never@1515	112	_arguments->ins_req(0, value);
never@1515	113	_mode.insert_before(0, mode);
never@1515	114	}
never@1515	115	void push_string(Node* value) {
never@1515	116	push(value, StringMode);
never@1515	117	}
kvn@2413	118	void push_string_null_check(Node* value) {
kvn@2413	119	push(value, StringNullCheckMode);
kvn@2413	120	}
never@1515	121	void push_int(Node* value) {
never@1515	122	push(value, IntMode);
never@1515	123	}
never@1515	124	void push_char(Node* value) {
never@1515	125	push(value, CharMode);
never@1515	126	}
never@1515	127
never@1515	128	Node* argument(int i) {
never@1515	129	return _arguments->in(i);
never@1515	130	}
never@1515	131	void set_argument(int i, Node* value) {
never@1515	132	_arguments->set_req(i, value);
never@1515	133	}
never@1515	134	int num_arguments() {
never@1515	135	return _mode.length();
never@1515	136	}
never@1515	137	int mode(int i) {
never@1515	138	return _mode.at(i);
never@1515	139	}
never@1515	140	void add_control(Node* ctrl) {
never@1515	141	assert(!_control.contains(ctrl), "only push once");
never@1515	142	_control.push(ctrl);
never@1515	143	}
never@1515	144	CallStaticJavaNode* end() { return _end; }
never@1515	145	AllocateNode* begin() { return _begin; }
never@1515	146	Node* string_alloc() { return _string_alloc; }
never@1515	147
never@1515	148	void eliminate_unneeded_control();
never@1515	149	void eliminate_initialize(InitializeNode* init);
never@1515	150	void eliminate_call(CallNode* call);
never@1515	151
never@1515	152	void maybe_log_transform() {
never@1515	153	CompileLog* log = _stringopts->C->log();
never@1515	154	if (log != NULL) {
never@1515	155	log->head("replace_string_concat arguments='%d' string_alloc='%d' multiple='%d'",
never@1515	156	num_arguments(),
never@1515	157	_string_alloc != NULL,
never@1515	158	_multiple);
never@1515	159	JVMState* p = _begin->jvms();
never@1515	160	while (p != NULL) {
never@1515	161	log->elem("jvms bci='%d' method='%d'", p->bci(), log->identify(p->method()));
never@1515	162	p = p->caller();
never@1515	163	}
never@1515	164	log->tail("replace_string_concat");
never@1515	165	}
never@1515	166	}
never@1515	167
never@1515	168	void convert_uncommon_traps(GraphKit& kit, const JVMState* jvms) {
never@1515	169	for (uint u = 0; u < _uncommon_traps.size(); u++) {
never@1515	170	Node* uct = _uncommon_traps.at(u);
never@1515	171
never@1515	172	// Build a new call using the jvms state of the allocate
twisti@2103	173	address call_addr = SharedRuntime::uncommon_trap_blob()->entry_point();
never@1515	174	const TypeFunc* call_type = OptoRuntime::uncommon_trap_Type();
never@1515	175	int size = call_type->domain()->cnt();
never@1515	176	const TypePtr* no_memory_effects = NULL;
never@1515	177	Compile* C = _stringopts->C;
never@1515	178	CallStaticJavaNode* call = new (C, size) CallStaticJavaNode(call_type, call_addr, "uncommon_trap",
never@1515	179	jvms->bci(), no_memory_effects);
never@1515	180	for (int e = 0; e < TypeFunc::Parms; e++) {
never@1515	181	call->init_req(e, uct->in(e));
never@1515	182	}
never@1515	183	// Set the trap request to record intrinsic failure if this trap
never@1515	184	// is taken too many times. Ideally we would handle then traps by
never@1515	185	// doing the original bookkeeping in the MDO so that if it caused
never@1515	186	// the code to be thrown out we could still recompile and use the
never@1515	187	// optimization. Failing the uncommon traps doesn't really mean
never@1515	188	// that the optimization is a bad idea but there's no other way to
never@1515	189	// do the MDO updates currently.
never@1515	190	int trap_request = Deoptimization::make_trap_request(Deoptimization::Reason_intrinsic,
never@1515	191	Deoptimization::Action_make_not_entrant);
never@1515	192	call->init_req(TypeFunc::Parms, __ intcon(trap_request));
never@1515	193	kit.add_safepoint_edges(call);
never@1515	194
never@1515	195	_stringopts->gvn()->transform(call);
never@1515	196	C->gvn_replace_by(uct, call);
never@1515	197	uct->disconnect_inputs(NULL);
never@1515	198	}
never@1515	199	}
never@1515	200
never@1515	201	void cleanup() {
never@1515	202	// disconnect the hook node
never@1515	203	_arguments->disconnect_inputs(NULL);
never@1515	204	}
never@1515	205	};
never@1515	206
never@1515	207
never@1515	208	void StringConcat::eliminate_unneeded_control() {
never@1515	209	eliminate_initialize(begin()->initialization());
never@1515	210	for (uint i = 0; i < _control.size(); i++) {
never@1515	211	Node* n = _control.at(i);
never@1515	212	if (n->is_Call()) {
never@1515	213	if (n != _end) {
never@1515	214	eliminate_call(n->as_Call());
never@1515	215	}
never@1515	216	} else if (n->is_IfTrue()) {
never@1515	217	Compile* C = _stringopts->C;
never@1515	218	C->gvn_replace_by(n, n->in(0)->in(0));
never@1515	219	C->gvn_replace_by(n->in(0), C->top());
never@1515	220	}
never@1515	221	}
never@1515	222	}
never@1515	223
never@1515	224
never@1515	225	StringConcat* StringConcat::merge(StringConcat* other, Node* arg) {
never@1515	226	StringConcat* result = new StringConcat(_stringopts, _end);
never@1515	227	for (uint x = 0; x < _control.size(); x++) {
never@1515	228	Node* n = _control.at(x);
never@1515	229	if (n->is_Call()) {
never@1515	230	result->_control.push(n);
never@1515	231	}
never@1515	232	}
never@1515	233	for (uint x = 0; x < other->_control.size(); x++) {
never@1515	234	Node* n = other->_control.at(x);
never@1515	235	if (n->is_Call()) {
never@1515	236	result->_control.push(n);
never@1515	237	}
never@1515	238	}
never@1515	239	assert(result->_control.contains(other->_end), "what?");
never@1515	240	assert(result->_control.contains(_begin), "what?");
never@1515	241	for (int x = 0; x < num_arguments(); x++) {
never@1515	242	if (argument(x) == arg) {
never@1515	243	// replace the toString result with the all the arguments that
never@1515	244	// made up the other StringConcat
never@1515	245	for (int y = 0; y < other->num_arguments(); y++) {
never@1515	246	result->append(other->argument(y), other->mode(y));
never@1515	247	}
never@1515	248	} else {
never@1515	249	result->append(argument(x), mode(x));
never@1515	250	}
never@1515	251	}
never@1515	252	result->set_allocation(other->_begin);
never@1515	253	result->_multiple = true;
never@1515	254	return result;
never@1515	255	}
never@1515	256
never@1515	257
never@1515	258	void StringConcat::eliminate_call(CallNode* call) {
never@1515	259	Compile* C = _stringopts->C;
never@1515	260	CallProjections projs;
never@1515	261	call->extract_projections(&projs, false);
never@1515	262	if (projs.fallthrough_catchproj != NULL) {
never@1515	263	C->gvn_replace_by(projs.fallthrough_catchproj, call->in(TypeFunc::Control));
never@1515	264	}
never@1515	265	if (projs.fallthrough_memproj != NULL) {
never@1515	266	C->gvn_replace_by(projs.fallthrough_memproj, call->in(TypeFunc::Memory));
never@1515	267	}
never@1515	268	if (projs.catchall_memproj != NULL) {
never@1515	269	C->gvn_replace_by(projs.catchall_memproj, C->top());
never@1515	270	}
never@1515	271	if (projs.fallthrough_ioproj != NULL) {
never@1515	272	C->gvn_replace_by(projs.fallthrough_ioproj, call->in(TypeFunc::I_O));
never@1515	273	}
never@1515	274	if (projs.catchall_ioproj != NULL) {
never@1515	275	C->gvn_replace_by(projs.catchall_ioproj, C->top());
never@1515	276	}
never@1515	277	if (projs.catchall_catchproj != NULL) {
never@1515	278	// EA can't cope with the partially collapsed graph this
never@1515	279	// creates so put it on the worklist to be collapsed later.
never@1515	280	for (SimpleDUIterator i(projs.catchall_catchproj); i.has_next(); i.next()) {
never@1515	281	Node *use = i.get();
never@1515	282	int opc = use->Opcode();
never@1515	283	if (opc == Op_CreateEx || opc == Op_Region) {
never@1515	284	_stringopts->record_dead_node(use);
never@1515	285	}
never@1515	286	}
never@1515	287	C->gvn_replace_by(projs.catchall_catchproj, C->top());
never@1515	288	}
never@1515	289	if (projs.resproj != NULL) {
never@1515	290	C->gvn_replace_by(projs.resproj, C->top());
never@1515	291	}
never@1515	292	C->gvn_replace_by(call, C->top());
never@1515	293	}
never@1515	294
never@1515	295	void StringConcat::eliminate_initialize(InitializeNode* init) {
never@1515	296	Compile* C = _stringopts->C;
never@1515	297
never@1515	298	// Eliminate Initialize node.
never@1515	299	assert(init->outcnt() <= 2, "only a control and memory projection expected");
never@1515	300	assert(init->req() <= InitializeNode::RawStores, "no pending inits");
never@1515	301	Node *ctrl_proj = init->proj_out(TypeFunc::Control);
never@1515	302	if (ctrl_proj != NULL) {
never@1515	303	C->gvn_replace_by(ctrl_proj, init->in(TypeFunc::Control));
never@1515	304	}
never@1515	305	Node *mem_proj = init->proj_out(TypeFunc::Memory);
never@1515	306	if (mem_proj != NULL) {
never@1515	307	Node *mem = init->in(TypeFunc::Memory);
never@1515	308	C->gvn_replace_by(mem_proj, mem);
never@1515	309	}
never@1515	310	C->gvn_replace_by(init, C->top());
never@1515	311	init->disconnect_inputs(NULL);
never@1515	312	}
never@1515	313
never@1515	314	Node_List PhaseStringOpts::collect_toString_calls() {
never@1515	315	Node_List string_calls;
never@1515	316	Node_List worklist;
never@1515	317
never@1515	318	_visited.Clear();
never@1515	319
never@1515	320	// Prime the worklist
never@1515	321	for (uint i = 1; i < C->root()->len(); i++) {
never@1515	322	Node* n = C->root()->in(i);
never@1515	323	if (n != NULL && !_visited.test_set(n->_idx)) {
never@1515	324	worklist.push(n);
never@1515	325	}
never@1515	326	}
never@1515	327
never@1515	328	while (worklist.size() > 0) {
never@1515	329	Node* ctrl = worklist.pop();
never@1515	330	if (ctrl->is_CallStaticJava()) {
never@1515	331	CallStaticJavaNode* csj = ctrl->as_CallStaticJava();
never@1515	332	ciMethod* m = csj->method();
never@1515	333	if (m != NULL &&
never@1515	334	(m->intrinsic_id() == vmIntrinsics::_StringBuffer_toString ||
never@1515	335	m->intrinsic_id() == vmIntrinsics::_StringBuilder_toString)) {
never@1515	336	string_calls.push(csj);
never@1515	337	}
never@1515	338	}
never@1515	339	if (ctrl->in(0) != NULL && !_visited.test_set(ctrl->in(0)->_idx)) {
never@1515	340	worklist.push(ctrl->in(0));
never@1515	341	}
never@1515	342	if (ctrl->is_Region()) {
never@1515	343	for (uint i = 1; i < ctrl->len(); i++) {
never@1515	344	if (ctrl->in(i) != NULL && !_visited.test_set(ctrl->in(i)->_idx)) {
never@1515	345	worklist.push(ctrl->in(i));
never@1515	346	}
never@1515	347	}
never@1515	348	}
never@1515	349	}
never@1515	350	return string_calls;
never@1515	351	}
never@1515	352
never@1515	353
never@1515	354	StringConcat* PhaseStringOpts::build_candidate(CallStaticJavaNode* call) {
never@1515	355	ciMethod* m = call->method();
never@1515	356	ciSymbol* string_sig;
never@1515	357	ciSymbol* int_sig;
never@1515	358	ciSymbol* char_sig;
never@1515	359	if (m->holder() == C->env()->StringBuilder_klass()) {
never@1515	360	string_sig = ciSymbol::String_StringBuilder_signature();
never@1515	361	int_sig = ciSymbol::int_StringBuilder_signature();
never@1515	362	char_sig = ciSymbol::char_StringBuilder_signature();
never@1515	363	} else if (m->holder() == C->env()->StringBuffer_klass()) {
never@1515	364	string_sig = ciSymbol::String_StringBuffer_signature();
never@1515	365	int_sig = ciSymbol::int_StringBuffer_signature();
never@1515	366	char_sig = ciSymbol::char_StringBuffer_signature();
never@1515	367	} else {
never@1515	368	return NULL;
never@1515	369	}
never@1515	370	#ifndef PRODUCT
never@1515	371	if (PrintOptimizeStringConcat) {
never@1515	372	tty->print("considering toString call in ");
never@1515	373	call->jvms()->dump_spec(tty); tty->cr();
never@1515	374	}
never@1515	375	#endif
never@1515	376
never@1515	377	StringConcat* sc = new StringConcat(this, call);
never@1515	378
never@1515	379	AllocateNode* alloc = NULL;
never@1515	380	InitializeNode* init = NULL;
never@1515	381
never@1515	382	// possible opportunity for StringBuilder fusion
never@1515	383	CallStaticJavaNode* cnode = call;
never@1515	384	while (cnode) {
never@1515	385	Node* recv = cnode->in(TypeFunc::Parms)->uncast();
never@1515	386	if (recv->is_Proj()) {
never@1515	387	recv = recv->in(0);
never@1515	388	}
never@1515	389	cnode = recv->isa_CallStaticJava();
never@1515	390	if (cnode == NULL) {
never@1515	391	alloc = recv->isa_Allocate();
never@1515	392	if (alloc == NULL) {
never@1515	393	break;
never@1515	394	}
never@1515	395	// Find the constructor call
never@1515	396	Node* result = alloc->result_cast();
never@1515	397	if (result == NULL || !result->is_CheckCastPP()) {
never@1515	398	// strange looking allocation
never@1515	399	#ifndef PRODUCT
never@1515	400	if (PrintOptimizeStringConcat) {
never@1515	401	tty->print("giving up because allocation looks strange ");
never@1515	402	alloc->jvms()->dump_spec(tty); tty->cr();
never@1515	403	}
never@1515	404	#endif
never@1515	405	break;
never@1515	406	}
never@1515	407	Node* constructor = NULL;
never@1515	408	for (SimpleDUIterator i(result); i.has_next(); i.next()) {
never@1515	409	CallStaticJavaNode *use = i.get()->isa_CallStaticJava();
never@2172	410	if (use != NULL &&
never@2172	411	use->method() != NULL &&
never@2172	412	!use->method()->is_static() &&
never@1515	413	use->method()->name() == ciSymbol::object_initializer_name() &&
never@1515	414	use->method()->holder() == m->holder()) {
never@1515	415	// Matched the constructor.
never@1515	416	ciSymbol* sig = use->method()->signature()->as_symbol();
never@1515	417	if (sig == ciSymbol::void_method_signature() ||
never@1515	418	sig == ciSymbol::int_void_signature() ||
never@1515	419	sig == ciSymbol::string_void_signature()) {
never@1515	420	if (sig == ciSymbol::string_void_signature()) {
never@1515	421	// StringBuilder(String) so pick this up as the first argument
never@1515	422	assert(use->in(TypeFunc::Parms + 1) != NULL, "what?");
kvn@2413	423	const Type* type = _gvn->type(use->in(TypeFunc::Parms + 1));
kvn@2413	424	if (type == TypePtr::NULL_PTR) {
kvn@2413	425	// StringBuilder(null) throws exception.
kvn@2413	426	#ifndef PRODUCT
kvn@2413	427	if (PrintOptimizeStringConcat) {
kvn@2413	428	tty->print("giving up because StringBuilder(null) throws exception");
kvn@2413	429	alloc->jvms()->dump_spec(tty); tty->cr();
kvn@2413	430	}
kvn@2413	431	#endif
kvn@2413	432	return NULL;
kvn@2413	433	}
kvn@2413	434	// StringBuilder(str) argument needs null check.
kvn@2413	435	sc->push_string_null_check(use->in(TypeFunc::Parms + 1));
never@1515	436	}
never@1515	437	// The int variant takes an initial size for the backing
never@1515	438	// array so just treat it like the void version.
never@1515	439	constructor = use;
never@1515	440	} else {
never@1515	441	#ifndef PRODUCT
never@1515	442	if (PrintOptimizeStringConcat) {
never@1515	443	tty->print("unexpected constructor signature: %s", sig->as_utf8());
never@1515	444	}
never@1515	445	#endif
never@1515	446	}
never@1515	447	break;
never@1515	448	}
never@1515	449	}
never@1515	450	if (constructor == NULL) {
never@1515	451	// couldn't find constructor
never@1515	452	#ifndef PRODUCT
never@1515	453	if (PrintOptimizeStringConcat) {
never@1515	454	tty->print("giving up because couldn't find constructor ");
kvn@2413	455	alloc->jvms()->dump_spec(tty); tty->cr();
never@1515	456	}
never@1515	457	#endif
never@1515	458	break;
never@1515	459	}
never@1515	460
never@1515	461	// Walked all the way back and found the constructor call so see
never@1515	462	// if this call converted into a direct string concatenation.
never@1515	463	sc->add_control(call);
never@1515	464	sc->add_control(constructor);
never@1515	465	sc->add_control(alloc);
never@1515	466	sc->set_allocation(alloc);
never@1515	467	if (sc->validate_control_flow()) {
never@1515	468	return sc;
never@1515	469	} else {
never@1515	470	return NULL;
never@1515	471	}
never@1515	472	} else if (cnode->method() == NULL) {
never@1515	473	break;
never@2172	474	} else if (!cnode->method()->is_static() &&
never@2172	475	cnode->method()->holder() == m->holder() &&
never@1515	476	cnode->method()->name() == ciSymbol::append_name() &&
never@1515	477	(cnode->method()->signature()->as_symbol() == string_sig ||
never@1515	478	cnode->method()->signature()->as_symbol() == char_sig ||
never@1515	479	cnode->method()->signature()->as_symbol() == int_sig)) {
never@1515	480	sc->add_control(cnode);
never@1515	481	Node* arg = cnode->in(TypeFunc::Parms + 1);
never@1515	482	if (cnode->method()->signature()->as_symbol() == int_sig) {
never@1515	483	sc->push_int(arg);
never@1515	484	} else if (cnode->method()->signature()->as_symbol() == char_sig) {
never@1515	485	sc->push_char(arg);
never@1515	486	} else {
never@1515	487	if (arg->is_Proj() && arg->in(0)->is_CallStaticJava()) {
never@1515	488	CallStaticJavaNode* csj = arg->in(0)->as_CallStaticJava();
never@1515	489	if (csj->method() != NULL &&
never@2172	490	csj->method()->intrinsic_id() == vmIntrinsics::_Integer_toString) {
never@1515	491	sc->add_control(csj);
never@1515	492	sc->push_int(csj->in(TypeFunc::Parms));
never@1515	493	continue;
never@1515	494	}
never@1515	495	}
never@1515	496	sc->push_string(arg);
never@1515	497	}
never@1515	498	continue;
never@1515	499	} else {
never@1515	500	// some unhandled signature
never@1515	501	#ifndef PRODUCT
never@1515	502	if (PrintOptimizeStringConcat) {
never@1515	503	tty->print("giving up because encountered unexpected signature ");
never@1515	504	cnode->tf()->dump(); tty->cr();
never@1515	505	cnode->in(TypeFunc::Parms + 1)->dump();
never@1515	506	}
never@1515	507	#endif
never@1515	508	break;
never@1515	509	}
never@1515	510	}
never@1515	511	return NULL;
never@1515	512	}
never@1515	513
never@1515	514
never@1515	515	PhaseStringOpts::PhaseStringOpts(PhaseGVN* gvn, Unique_Node_List*):
never@1515	516	Phase(StringOpts),
never@1515	517	_gvn(gvn),
never@1515	518	_visited(Thread::current()->resource_area()) {
never@1515	519
never@1515	520	assert(OptimizeStringConcat, "shouldn't be here");
never@1515	521
never@1515	522	size_table_field = C->env()->Integer_klass()->get_field_by_name(ciSymbol::make("sizeTable"),
never@1515	523	ciSymbol::make("[I"), true);
never@1515	524	if (size_table_field == NULL) {
never@1515	525	// Something wrong so give up.
never@1515	526	assert(false, "why can't we find Integer.sizeTable?");
never@1515	527	return;
never@1515	528	}
never@1515	529
never@1515	530	// Collect the types needed to talk about the various slices of memory
never@1515	531	const TypeInstPtr* string_type = TypeInstPtr::make(TypePtr::NotNull, C->env()->String_klass(),
never@1515	532	false, NULL, 0);
never@1515	533
never@1515	534	const TypePtr* value_field_type = string_type->add_offset(java_lang_String::value_offset_in_bytes());
never@1515	535	const TypePtr* offset_field_type = string_type->add_offset(java_lang_String::offset_offset_in_bytes());
never@1515	536	const TypePtr* count_field_type = string_type->add_offset(java_lang_String::count_offset_in_bytes());
never@1515	537
never@1515	538	value_field_idx = C->get_alias_index(value_field_type);
never@1515	539	count_field_idx = C->get_alias_index(count_field_type);
never@1515	540	offset_field_idx = C->get_alias_index(offset_field_type);
never@1515	541	char_adr_idx = C->get_alias_index(TypeAryPtr::CHARS);
never@1515	542
never@1515	543	// For each locally allocated StringBuffer see if the usages can be
never@1515	544	// collapsed into a single String construction.
never@1515	545
never@1515	546	// Run through the list of allocation looking for SB.toString to see
never@1515	547	// if it's possible to fuse the usage of the SB into a single String
never@1515	548	// construction.
never@1515	549	GrowableArray<StringConcat*> concats;
never@1515	550	Node_List toStrings = collect_toString_calls();
never@1515	551	while (toStrings.size() > 0) {
never@1515	552	StringConcat* sc = build_candidate(toStrings.pop()->as_CallStaticJava());
never@1515	553	if (sc != NULL) {
never@1515	554	concats.push(sc);
never@1515	555	}
never@1515	556	}
never@1515	557
never@1515	558	// try to coalesce separate concats
never@1515	559	restart:
never@1515	560	for (int c = 0; c < concats.length(); c++) {
never@1515	561	StringConcat* sc = concats.at(c);
never@1515	562	for (int i = 0; i < sc->num_arguments(); i++) {
never@1515	563	Node* arg = sc->argument(i);
never@1515	564	if (arg->is_Proj() && arg->in(0)->is_CallStaticJava()) {
never@1515	565	CallStaticJavaNode* csj = arg->in(0)->as_CallStaticJava();
never@1515	566	if (csj->method() != NULL &&
never@2172	567	(csj->method()->intrinsic_id() == vmIntrinsics::_StringBuilder_toString ||
never@2172	568	csj->method()->intrinsic_id() == vmIntrinsics::_StringBuffer_toString)) {
never@1515	569	for (int o = 0; o < concats.length(); o++) {
never@1515	570	if (c == o) continue;
never@1515	571	StringConcat* other = concats.at(o);
never@1515	572	if (other->end() == csj) {
never@1515	573	#ifndef PRODUCT
never@1515	574	if (PrintOptimizeStringConcat) {
never@1515	575	tty->print_cr("considering stacked concats");
never@1515	576	}
never@1515	577	#endif
never@1515	578
never@1515	579	StringConcat* merged = sc->merge(other, arg);
never@1515	580	if (merged->validate_control_flow()) {
never@1515	581	#ifndef PRODUCT
never@1515	582	if (PrintOptimizeStringConcat) {
never@1515	583	tty->print_cr("stacking would succeed");
never@1515	584	}
never@1515	585	#endif
never@1515	586	if (c < o) {
never@1515	587	concats.remove_at(o);
never@1515	588	concats.at_put(c, merged);
never@1515	589	} else {
never@1515	590	concats.remove_at(c);
never@1515	591	concats.at_put(o, merged);
never@1515	592	}
never@1515	593	goto restart;
never@1515	594	} else {
never@1515	595	#ifndef PRODUCT
never@1515	596	if (PrintOptimizeStringConcat) {
never@1515	597	tty->print_cr("stacking would fail");
never@1515	598	}
never@1515	599	#endif
never@1515	600	}
never@1515	601	}
never@1515	602	}
never@1515	603	}
never@1515	604	}
never@1515	605	}
never@1515	606	}
never@1515	607
never@1515	608
never@1515	609	for (int c = 0; c < concats.length(); c++) {
never@1515	610	StringConcat* sc = concats.at(c);
never@1515	611	replace_string_concat(sc);
never@1515	612	}
never@1515	613
never@1515	614	remove_dead_nodes();
never@1515	615	}
never@1515	616
never@1515	617	void PhaseStringOpts::record_dead_node(Node* dead) {
never@1515	618	dead_worklist.push(dead);
never@1515	619	}
never@1515	620
never@1515	621	void PhaseStringOpts::remove_dead_nodes() {
never@1515	622	// Delete any dead nodes to make things clean enough that escape
never@1515	623	// analysis doesn't get unhappy.
never@1515	624	while (dead_worklist.size() > 0) {
never@1515	625	Node* use = dead_worklist.pop();
never@1515	626	int opc = use->Opcode();
never@1515	627	switch (opc) {
never@1515	628	case Op_Region: {
never@1515	629	uint i = 1;
never@1515	630	for (i = 1; i < use->req(); i++) {
never@1515	631	if (use->in(i) != C->top()) {
never@1515	632	break;
never@1515	633	}
never@1515	634	}
never@1515	635	if (i >= use->req()) {
never@1515	636	for (SimpleDUIterator i(use); i.has_next(); i.next()) {
never@1515	637	Node* m = i.get();
never@1515	638	if (m->is_Phi()) {
never@1515	639	dead_worklist.push(m);
never@1515	640	}
never@1515	641	}
never@1515	642	C->gvn_replace_by(use, C->top());
never@1515	643	}
never@1515	644	break;
never@1515	645	}
never@1515	646	case Op_AddP:
never@1515	647	case Op_CreateEx: {
never@1515	648	// Recurisvely clean up references to CreateEx so EA doesn't
never@1515	649	// get unhappy about the partially collapsed graph.
never@1515	650	for (SimpleDUIterator i(use); i.has_next(); i.next()) {
never@1515	651	Node* m = i.get();
never@1515	652	if (m->is_AddP()) {
never@1515	653	dead_worklist.push(m);
never@1515	654	}
never@1515	655	}
never@1515	656	C->gvn_replace_by(use, C->top());
never@1515	657	break;
never@1515	658	}
never@1515	659	case Op_Phi:
never@1515	660	if (use->in(0) == C->top()) {
never@1515	661	C->gvn_replace_by(use, C->top());
never@1515	662	}
never@1515	663	break;
never@1515	664	}
never@1515	665	}
never@1515	666	}
never@1515	667
never@1515	668
never@1515	669	bool StringConcat::validate_control_flow() {
never@1515	670	// We found all the calls and arguments now lets see if it's
never@1515	671	// safe to transform the graph as we would expect.
never@1515	672
never@1515	673	// Check to see if this resulted in too many uncommon traps previously
never@1515	674	if (Compile::current()->too_many_traps(_begin->jvms()->method(), _begin->jvms()->bci(),
never@1515	675	Deoptimization::Reason_intrinsic)) {
never@1515	676	return false;
never@1515	677	}
never@1515	678
never@1515	679	// Walk backwards over the control flow from toString to the
never@1515	680	// allocation and make sure all the control flow is ok. This
never@1515	681	// means it's either going to be eliminated once the calls are
never@1515	682	// removed or it can safely be transformed into an uncommon
never@1515	683	// trap.
never@1515	684
never@1515	685	int null_check_count = 0;
never@1515	686	Unique_Node_List ctrl_path;
never@1515	687
never@1515	688	assert(_control.contains(_begin), "missing");
never@1515	689	assert(_control.contains(_end), "missing");
never@1515	690
never@1515	691	// Collect the nodes that we know about and will eliminate into ctrl_path
never@1515	692	for (uint i = 0; i < _control.size(); i++) {
never@1515	693	// Push the call and it's control projection
never@1515	694	Node* n = _control.at(i);
never@1515	695	if (n->is_Allocate()) {
never@1515	696	AllocateNode* an = n->as_Allocate();
never@1515	697	InitializeNode* init = an->initialization();
never@1515	698	ctrl_path.push(init);
never@1515	699	ctrl_path.push(init->as_Multi()->proj_out(0));
never@1515	700	}
never@1515	701	if (n->is_Call()) {
never@1515	702	CallNode* cn = n->as_Call();
never@1515	703	ctrl_path.push(cn);
never@1515	704	ctrl_path.push(cn->proj_out(0));
never@1515	705	ctrl_path.push(cn->proj_out(0)->unique_out());
never@1515	706	ctrl_path.push(cn->proj_out(0)->unique_out()->as_Catch()->proj_out(0));
never@1515	707	} else {
never@1515	708	ShouldNotReachHere();
never@1515	709	}
never@1515	710	}
never@1515	711
never@1515	712	// Skip backwards through the control checking for unexpected contro flow
never@1515	713	Node* ptr = _end;
never@1515	714	bool fail = false;
never@1515	715	while (ptr != _begin) {
never@1515	716	if (ptr->is_Call() && ctrl_path.member(ptr)) {
never@1515	717	ptr = ptr->in(0);
never@1515	718	} else if (ptr->is_CatchProj() && ctrl_path.member(ptr)) {
never@1515	719	ptr = ptr->in(0)->in(0)->in(0);
never@1515	720	assert(ctrl_path.member(ptr), "should be a known piece of control");
never@1515	721	} else if (ptr->is_IfTrue()) {
never@1515	722	IfNode* iff = ptr->in(0)->as_If();
never@1515	723	BoolNode* b = iff->in(1)->isa_Bool();
never@1515	724	Node* cmp = b->in(1);
never@1515	725	Node* v1 = cmp->in(1);
never@1515	726	Node* v2 = cmp->in(2);
never@1515	727	Node* otherproj = iff->proj_out(1 - ptr->as_Proj()->_con);
never@1515	728
never@1515	729	// Null check of the return of append which can simply be eliminated
never@1515	730	if (b->_test._test == BoolTest::ne &&
never@1515	731	v2->bottom_type() == TypePtr::NULL_PTR &&
never@1515	732	v1->is_Proj() && ctrl_path.member(v1->in(0))) {
never@1515	733	// NULL check of the return value of the append
never@1515	734	null_check_count++;
never@1515	735	if (otherproj->outcnt() == 1) {
never@1515	736	CallStaticJavaNode* call = otherproj->unique_out()->isa_CallStaticJava();
never@1515	737	if (call != NULL && call->_name != NULL && strcmp(call->_name, "uncommon_trap") == 0) {
never@1515	738	ctrl_path.push(call);
never@1515	739	}
never@1515	740	}
never@1515	741	_control.push(ptr);
never@1515	742	ptr = ptr->in(0)->in(0);
never@1515	743	continue;
never@1515	744	}
never@1515	745
never@1515	746	// A test which leads to an uncommon trap which should be safe.
never@1515	747	// Later this trap will be converted into a trap that restarts
never@1515	748	// at the beginning.
never@1515	749	if (otherproj->outcnt() == 1) {
never@1515	750	CallStaticJavaNode* call = otherproj->unique_out()->isa_CallStaticJava();
never@1515	751	if (call != NULL && call->_name != NULL && strcmp(call->_name, "uncommon_trap") == 0) {
never@1515	752	// control flow leads to uct so should be ok
never@1515	753	_uncommon_traps.push(call);
never@1515	754	ctrl_path.push(call);
never@1515	755	ptr = ptr->in(0)->in(0);
never@1515	756	continue;
never@1515	757	}
never@1515	758	}
never@1515	759
never@1515	760	#ifndef PRODUCT
never@1515	761	// Some unexpected control flow we don't know how to handle.
never@1515	762	if (PrintOptimizeStringConcat) {
never@1515	763	tty->print_cr("failing with unknown test");
never@1515	764	b->dump();
never@1515	765	cmp->dump();
never@1515	766	v1->dump();
never@1515	767	v2->dump();
never@1515	768	tty->cr();
never@1515	769	}
never@1515	770	#endif
never@1515	771	break;
never@1515	772	} else if (ptr->is_Proj() && ptr->in(0)->is_Initialize()) {
never@1515	773	ptr = ptr->in(0)->in(0);
never@1515	774	} else if (ptr->is_Region()) {
never@1515	775	Node* copy = ptr->as_Region()->is_copy();
never@1515	776	if (copy != NULL) {
never@1515	777	ptr = copy;
never@1515	778	continue;
never@1515	779	}
never@1515	780	if (ptr->req() == 3 &&
never@1515	781	ptr->in(1) != NULL && ptr->in(1)->is_Proj() &&
never@1515	782	ptr->in(2) != NULL && ptr->in(2)->is_Proj() &&
never@1515	783	ptr->in(1)->in(0) == ptr->in(2)->in(0) &&
never@1515	784	ptr->in(1)->in(0) != NULL && ptr->in(1)->in(0)->is_If()) {
never@1515	785	// Simple diamond.
never@1515	786	// XXX should check for possibly merging stores. simple data merges are ok.
never@1515	787	ptr = ptr->in(1)->in(0)->in(0);
never@1515	788	continue;
never@1515	789	}
never@1515	790	#ifndef PRODUCT
never@1515	791	if (PrintOptimizeStringConcat) {
never@1515	792	tty->print_cr("fusion would fail for region");
never@1515	793	_begin->dump();
never@1515	794	ptr->dump(2);
never@1515	795	}
never@1515	796	#endif
never@1515	797	fail = true;
never@1515	798	break;
never@1515	799	} else {
never@1515	800	// other unknown control
never@1515	801	if (!fail) {
never@1515	802	#ifndef PRODUCT
never@1515	803	if (PrintOptimizeStringConcat) {
never@1515	804	tty->print_cr("fusion would fail for");
never@1515	805	_begin->dump();
never@1515	806	}
never@1515	807	#endif
never@1515	808	fail = true;
never@1515	809	}
never@1515	810	#ifndef PRODUCT
never@1515	811	if (PrintOptimizeStringConcat) {
never@1515	812	ptr->dump();
never@1515	813	}
never@1515	814	#endif
never@1515	815	ptr = ptr->in(0);
never@1515	816	}
never@1515	817	}
never@1515	818	#ifndef PRODUCT
never@1515	819	if (PrintOptimizeStringConcat && fail) {
never@1515	820	tty->cr();
never@1515	821	}
never@1515	822	#endif
never@1515	823	if (fail) return !fail;
never@1515	824
never@1515	825	// Validate that all these results produced are contained within
never@1515	826	// this cluster of objects. First collect all the results produced
never@1515	827	// by calls in the region.
never@1515	828	_stringopts->_visited.Clear();
never@1515	829	Node_List worklist;
never@1515	830	Node* final_result = _end->proj_out(TypeFunc::Parms);
never@1515	831	for (uint i = 0; i < _control.size(); i++) {
never@1515	832	CallNode* cnode = _control.at(i)->isa_Call();
never@1515	833	if (cnode != NULL) {
never@1515	834	_stringopts->_visited.test_set(cnode->_idx);
never@1515	835	}
never@1515	836	Node* result = cnode != NULL ? cnode->proj_out(TypeFunc::Parms) : NULL;
never@1515	837	if (result != NULL && result != final_result) {
never@1515	838	worklist.push(result);
never@1515	839	}
never@1515	840	}
never@1515	841
never@1515	842	Node* last_result = NULL;
never@1515	843	while (worklist.size() > 0) {
never@1515	844	Node* result = worklist.pop();
never@1515	845	if (_stringopts->_visited.test_set(result->_idx))
never@1515	846	continue;
never@1515	847	for (SimpleDUIterator i(result); i.has_next(); i.next()) {
never@1515	848	Node *use = i.get();
never@1515	849	if (ctrl_path.member(use)) {
never@1515	850	// already checked this
never@1515	851	continue;
never@1515	852	}
never@1515	853	int opc = use->Opcode();
never@1515	854	if (opc == Op_CmpP || opc == Op_Node) {
never@1515	855	ctrl_path.push(use);
never@1515	856	continue;
never@1515	857	}
never@1515	858	if (opc == Op_CastPP || opc == Op_CheckCastPP) {
never@1515	859	for (SimpleDUIterator j(use); j.has_next(); j.next()) {
never@1515	860	worklist.push(j.get());
never@1515	861	}
never@1515	862	worklist.push(use->in(1));
never@1515	863	ctrl_path.push(use);
never@1515	864	continue;
never@1515	865	}
never@1515	866	#ifndef PRODUCT
never@1515	867	if (PrintOptimizeStringConcat) {
never@1515	868	if (result != last_result) {
never@1515	869	last_result = result;
never@1515	870	tty->print_cr("extra uses for result:");
never@1515	871	last_result->dump();
never@1515	872	}
never@1515	873	use->dump();
never@1515	874	}
never@1515	875	#endif
never@1515	876	fail = true;
never@1515	877	break;
never@1515	878	}
never@1515	879	}
never@1515	880
never@1515	881	#ifndef PRODUCT
never@1515	882	if (PrintOptimizeStringConcat && !fail) {
never@1515	883	ttyLocker ttyl;
never@1515	884	tty->cr();
never@1515	885	tty->print("fusion would succeed (%d %d) for ", null_check_count, _uncommon_traps.size());
never@1515	886	_begin->jvms()->dump_spec(tty); tty->cr();
never@1515	887	for (int i = 0; i < num_arguments(); i++) {
never@1515	888	argument(i)->dump();
never@1515	889	}
never@1515	890	_control.dump();
never@1515	891	tty->cr();
never@1515	892	}
never@1515	893	#endif
never@1515	894
never@1515	895	return !fail;
never@1515	896	}
never@1515	897
never@1515	898	Node* PhaseStringOpts::fetch_static_field(GraphKit& kit, ciField* field) {
never@1515	899	const TypeKlassPtr* klass_type = TypeKlassPtr::make(field->holder());
never@1515	900	Node* klass_node = __ makecon(klass_type);
never@1515	901	BasicType bt = field->layout_type();
never@1515	902	ciType* field_klass = field->type();
never@1515	903
never@1515	904	const Type *type;
never@1515	905	if( bt == T_OBJECT ) {
never@1515	906	if (!field->type()->is_loaded()) {
never@1515	907	type = TypeInstPtr::BOTTOM;
never@1515	908	} else if (field->is_constant()) {
never@1515	909	// This can happen if the constant oop is non-perm.
never@1515	910	ciObject* con = field->constant_value().as_object();
never@1515	911	// Do not "join" in the previous type; it doesn't add value,
never@1515	912	// and may yield a vacuous result if the field is of interface type.
never@1515	913	type = TypeOopPtr::make_from_constant(con)->isa_oopptr();
never@1515	914	assert(type != NULL, "field singleton type must be consistent");
never@1515	915	} else {
never@1515	916	type = TypeOopPtr::make_from_klass(field_klass->as_klass());
never@1515	917	}
never@1515	918	} else {
never@1515	919	type = Type::get_const_basic_type(bt);
never@1515	920	}
never@1515	921
never@1515	922	return kit.make_load(NULL, kit.basic_plus_adr(klass_node, field->offset_in_bytes()),
never@1515	923	type, T_OBJECT,
never@1515	924	C->get_alias_index(klass_type->add_offset(field->offset_in_bytes())));
never@1515	925	}
never@1515	926
never@1515	927	Node* PhaseStringOpts::int_stringSize(GraphKit& kit, Node* arg) {
never@1515	928	RegionNode *final_merge = new (C, 3) RegionNode(3);
never@1515	929	kit.gvn().set_type(final_merge, Type::CONTROL);
never@1515	930	Node* final_size = new (C, 3) PhiNode(final_merge, TypeInt::INT);
never@1515	931	kit.gvn().set_type(final_size, TypeInt::INT);
never@1515	932
never@1515	933	IfNode* iff = kit.create_and_map_if(kit.control(),
never@1515	934	__ Bool(__ CmpI(arg, __ intcon(0x80000000)), BoolTest::ne),
never@1515	935	PROB_FAIR, COUNT_UNKNOWN);
never@1515	936	Node* is_min = __ IfFalse(iff);
never@1515	937	final_merge->init_req(1, is_min);
never@1515	938	final_size->init_req(1, __ intcon(11));
never@1515	939
never@1515	940	kit.set_control(__ IfTrue(iff));
never@1515	941	if (kit.stopped()) {
never@1515	942	final_merge->init_req(2, C->top());
never@1515	943	final_size->init_req(2, C->top());
never@1515	944	} else {
never@1515	945
never@1515	946	// int size = (i < 0) ? stringSize(-i) + 1 : stringSize(i);
never@1515	947	RegionNode *r = new (C, 3) RegionNode(3);
never@1515	948	kit.gvn().set_type(r, Type::CONTROL);
never@1515	949	Node *phi = new (C, 3) PhiNode(r, TypeInt::INT);
never@1515	950	kit.gvn().set_type(phi, TypeInt::INT);
never@1515	951	Node *size = new (C, 3) PhiNode(r, TypeInt::INT);
never@1515	952	kit.gvn().set_type(size, TypeInt::INT);
never@1515	953	Node* chk = __ CmpI(arg, __ intcon(0));
never@1515	954	Node* p = __ Bool(chk, BoolTest::lt);
never@1515	955	IfNode* iff = kit.create_and_map_if(kit.control(), p, PROB_FAIR, COUNT_UNKNOWN);
never@1515	956	Node* lessthan = __ IfTrue(iff);
never@1515	957	Node* greaterequal = __ IfFalse(iff);
never@1515	958	r->init_req(1, lessthan);
never@1515	959	phi->init_req(1, __ SubI(__ intcon(0), arg));
never@1515	960	size->init_req(1, __ intcon(1));
never@1515	961	r->init_req(2, greaterequal);
never@1515	962	phi->init_req(2, arg);
never@1515	963	size->init_req(2, __ intcon(0));
never@1515	964	kit.set_control(r);
never@1515	965	C->record_for_igvn(r);
never@1515	966	C->record_for_igvn(phi);
never@1515	967	C->record_for_igvn(size);
never@1515	968
never@1515	969	// for (int i=0; ; i++)
never@1515	970	// if (x <= sizeTable[i])
never@1515	971	// return i+1;
never@1515	972	RegionNode *loop = new (C, 3) RegionNode(3);
never@1515	973	loop->init_req(1, kit.control());
never@1515	974	kit.gvn().set_type(loop, Type::CONTROL);
never@1515	975
never@1515	976	Node *index = new (C, 3) PhiNode(loop, TypeInt::INT);
never@1515	977	index->init_req(1, __ intcon(0));
never@1515	978	kit.gvn().set_type(index, TypeInt::INT);
never@1515	979	kit.set_control(loop);
never@1515	980	Node* sizeTable = fetch_static_field(kit, size_table_field);
never@1515	981
never@1515	982	Node* value = kit.load_array_element(NULL, sizeTable, index, TypeAryPtr::INTS);
never@1515	983	C->record_for_igvn(value);
never@1515	984	Node* limit = __ CmpI(phi, value);
never@1515	985	Node* limitb = __ Bool(limit, BoolTest::le);
never@1515	986	IfNode* iff2 = kit.create_and_map_if(kit.control(), limitb, PROB_MIN, COUNT_UNKNOWN);
never@1515	987	Node* lessEqual = __ IfTrue(iff2);
never@1515	988	Node* greater = __ IfFalse(iff2);
never@1515	989
never@1515	990	loop->init_req(2, greater);
never@1515	991	index->init_req(2, __ AddI(index, __ intcon(1)));
never@1515	992
never@1515	993	kit.set_control(lessEqual);
never@1515	994	C->record_for_igvn(loop);
never@1515	995	C->record_for_igvn(index);
never@1515	996
never@1515	997	final_merge->init_req(2, kit.control());
never@1515	998	final_size->init_req(2, __ AddI(__ AddI(index, size), __ intcon(1)));
never@1515	999	}
never@1515	1000
never@1515	1001	kit.set_control(final_merge);
never@1515	1002	C->record_for_igvn(final_merge);
never@1515	1003	C->record_for_igvn(final_size);
never@1515	1004
never@1515	1005	return final_size;
never@1515	1006	}
never@1515	1007
never@1515	1008	void PhaseStringOpts::int_getChars(GraphKit& kit, Node* arg, Node* char_array, Node* start, Node* end) {
never@1515	1009	RegionNode *final_merge = new (C, 4) RegionNode(4);
never@1515	1010	kit.gvn().set_type(final_merge, Type::CONTROL);
never@1515	1011	Node *final_mem = PhiNode::make(final_merge, kit.memory(char_adr_idx), Type::MEMORY, TypeAryPtr::CHARS);
never@1515	1012	kit.gvn().set_type(final_mem, Type::MEMORY);
never@1515	1013
never@1515	1014	// need to handle Integer.MIN_VALUE specially because negating doesn't make it positive
never@1515	1015	{
never@1515	1016	// i == MIN_VALUE
never@1515	1017	IfNode* iff = kit.create_and_map_if(kit.control(),
never@1515	1018	__ Bool(__ CmpI(arg, __ intcon(0x80000000)), BoolTest::ne),
never@1515	1019	PROB_FAIR, COUNT_UNKNOWN);
never@1515	1020
never@1515	1021	Node* old_mem = kit.memory(char_adr_idx);
never@1515	1022
never@1515	1023	kit.set_control(__ IfFalse(iff));
never@1515	1024	if (kit.stopped()) {
never@1515	1025	// Statically not equal to MIN_VALUE so this path is dead
never@1515	1026	final_merge->init_req(3, kit.control());
never@1515	1027	} else {
never@1515	1028	copy_string(kit, __ makecon(TypeInstPtr::make(C->env()->the_min_jint_string())),
never@1515	1029	char_array, start);
never@1515	1030	final_merge->init_req(3, kit.control());
never@1515	1031	final_mem->init_req(3, kit.memory(char_adr_idx));
never@1515	1032	}
never@1515	1033
never@1515	1034	kit.set_control(__ IfTrue(iff));
never@1515	1035	kit.set_memory(old_mem, char_adr_idx);
never@1515	1036	}
never@1515	1037
never@1515	1038
never@1515	1039	// Simplified version of Integer.getChars
never@1515	1040
never@1515	1041	// int q, r;
never@1515	1042	// int charPos = index;
never@1515	1043	Node* charPos = end;
never@1515	1044
never@1515	1045	// char sign = 0;
never@1515	1046
never@1515	1047	Node* i = arg;
never@1515	1048	Node* sign = __ intcon(0);
never@1515	1049
never@1515	1050	// if (i < 0) {
never@1515	1051	// sign = '-';
never@1515	1052	// i = -i;
never@1515	1053	// }
never@1515	1054	{
never@1515	1055	IfNode* iff = kit.create_and_map_if(kit.control(),
never@1515	1056	__ Bool(__ CmpI(arg, __ intcon(0)), BoolTest::lt),
never@1515	1057	PROB_FAIR, COUNT_UNKNOWN);
never@1515	1058
never@1515	1059	RegionNode *merge = new (C, 3) RegionNode(3);
never@1515	1060	kit.gvn().set_type(merge, Type::CONTROL);
never@1515	1061	i = new (C, 3) PhiNode(merge, TypeInt::INT);
never@1515	1062	kit.gvn().set_type(i, TypeInt::INT);
never@1515	1063	sign = new (C, 3) PhiNode(merge, TypeInt::INT);
never@1515	1064	kit.gvn().set_type(sign, TypeInt::INT);
never@1515	1065
never@1515	1066	merge->init_req(1, __ IfTrue(iff));
never@1515	1067	i->init_req(1, __ SubI(__ intcon(0), arg));
never@1515	1068	sign->init_req(1, __ intcon('-'));
never@1515	1069	merge->init_req(2, __ IfFalse(iff));
never@1515	1070	i->init_req(2, arg);
never@1515	1071	sign->init_req(2, __ intcon(0));
never@1515	1072
never@1515	1073	kit.set_control(merge);
never@1515	1074
never@1515	1075	C->record_for_igvn(merge);
never@1515	1076	C->record_for_igvn(i);
never@1515	1077	C->record_for_igvn(sign);
never@1515	1078	}
never@1515	1079
never@1515	1080	// for (;;) {
never@1515	1081	// q = i / 10;
never@1515	1082	// r = i - ((q << 3) + (q << 1)); // r = i-(q*10) ...
never@1515	1083	// buf [--charPos] = digits [r];
never@1515	1084	// i = q;
never@1515	1085	// if (i == 0) break;
never@1515	1086	// }
never@1515	1087
never@1515	1088	{
never@1515	1089	RegionNode *head = new (C, 3) RegionNode(3);
never@1515	1090	head->init_req(1, kit.control());
never@1515	1091	kit.gvn().set_type(head, Type::CONTROL);
never@1515	1092	Node *i_phi = new (C, 3) PhiNode(head, TypeInt::INT);
never@1515	1093	i_phi->init_req(1, i);
never@1515	1094	kit.gvn().set_type(i_phi, TypeInt::INT);
never@1515	1095	charPos = PhiNode::make(head, charPos);
never@1515	1096	kit.gvn().set_type(charPos, TypeInt::INT);
never@1515	1097	Node *mem = PhiNode::make(head, kit.memory(char_adr_idx), Type::MEMORY, TypeAryPtr::CHARS);
never@1515	1098	kit.gvn().set_type(mem, Type::MEMORY);
never@1515	1099	kit.set_control(head);
never@1515	1100	kit.set_memory(mem, char_adr_idx);
never@1515	1101
never@1685	1102	Node* q = __ DivI(NULL, i_phi, __ intcon(10));
never@1515	1103	Node* r = __ SubI(i_phi, __ AddI(__ LShiftI(q, __ intcon(3)),
never@1515	1104	__ LShiftI(q, __ intcon(1))));
never@1515	1105	Node* m1 = __ SubI(charPos, __ intcon(1));
never@1515	1106	Node* ch = __ AddI(r, __ intcon('0'));
never@1515	1107
never@1515	1108	Node* st = __ store_to_memory(kit.control(), kit.array_element_address(char_array, m1, T_CHAR),
never@1515	1109	ch, T_CHAR, char_adr_idx);
never@1515	1110
never@1515	1111
never@1515	1112	IfNode* iff = kit.create_and_map_if(head, __ Bool(__ CmpI(q, __ intcon(0)), BoolTest::ne),
never@1515	1113	PROB_FAIR, COUNT_UNKNOWN);
never@1515	1114	Node* ne = __ IfTrue(iff);
never@1515	1115	Node* eq = __ IfFalse(iff);
never@1515	1116
never@1515	1117	head->init_req(2, ne);
never@1515	1118	mem->init_req(2, st);
never@1515	1119	i_phi->init_req(2, q);
never@1515	1120	charPos->init_req(2, m1);
never@1515	1121
never@1515	1122	charPos = m1;
never@1515	1123
never@1515	1124	kit.set_control(eq);
never@1515	1125	kit.set_memory(st, char_adr_idx);
never@1515	1126
never@1515	1127	C->record_for_igvn(head);
never@1515	1128	C->record_for_igvn(mem);
never@1515	1129	C->record_for_igvn(i_phi);
never@1515	1130	C->record_for_igvn(charPos);
never@1515	1131	}
never@1515	1132
never@1515	1133	{
never@1515	1134	// if (sign != 0) {
never@1515	1135	// buf [--charPos] = sign;
never@1515	1136	// }
never@1515	1137	IfNode* iff = kit.create_and_map_if(kit.control(),
never@1515	1138	__ Bool(__ CmpI(sign, __ intcon(0)), BoolTest::ne),
never@1515	1139	PROB_FAIR, COUNT_UNKNOWN);
never@1515	1140
never@1515	1141	final_merge->init_req(2, __ IfFalse(iff));
never@1515	1142	final_mem->init_req(2, kit.memory(char_adr_idx));
never@1515	1143
never@1515	1144	kit.set_control(__ IfTrue(iff));
never@1515	1145	if (kit.stopped()) {
never@1515	1146	final_merge->init_req(1, C->top());
never@1515	1147	final_mem->init_req(1, C->top());
never@1515	1148	} else {
never@1515	1149	Node* m1 = __ SubI(charPos, __ intcon(1));
never@1515	1150	Node* st = __ store_to_memory(kit.control(), kit.array_element_address(char_array, m1, T_CHAR),
never@1515	1151	sign, T_CHAR, char_adr_idx);
never@1515	1152
never@1515	1153	final_merge->init_req(1, kit.control());
never@1515	1154	final_mem->init_req(1, st);
never@1515	1155	}
never@1515	1156
never@1515	1157	kit.set_control(final_merge);
never@1515	1158	kit.set_memory(final_mem, char_adr_idx);
never@1515	1159
never@1515	1160	C->record_for_igvn(final_merge);
never@1515	1161	C->record_for_igvn(final_mem);
never@1515	1162	}
never@1515	1163	}
never@1515	1164
never@1515	1165
never@1515	1166	Node* PhaseStringOpts::copy_string(GraphKit& kit, Node* str, Node* char_array, Node* start) {
never@1515	1167	Node* string = str;
never@1515	1168	Node* offset = kit.make_load(NULL,
never@1515	1169	kit.basic_plus_adr(string, string, java_lang_String::offset_offset_in_bytes()),
never@1515	1170	TypeInt::INT, T_INT, offset_field_idx);
never@1515	1171	Node* count = kit.make_load(NULL,
never@1515	1172	kit.basic_plus_adr(string, string, java_lang_String::count_offset_in_bytes()),
never@1515	1173	TypeInt::INT, T_INT, count_field_idx);
never@1515	1174	const TypeAryPtr* value_type = TypeAryPtr::make(TypePtr::NotNull,
never@1515	1175	TypeAry::make(TypeInt::CHAR,TypeInt::POS),
never@1515	1176	ciTypeArrayKlass::make(T_CHAR), true, 0);
never@1515	1177	Node* value = kit.make_load(NULL,
never@1515	1178	kit.basic_plus_adr(string, string, java_lang_String::value_offset_in_bytes()),
never@1515	1179	value_type, T_OBJECT, value_field_idx);
never@1515	1180
never@1515	1181	// copy the contents
never@1515	1182	if (offset->is_Con() && count->is_Con() && value->is_Con() && count->get_int() < unroll_string_copy_length) {
never@1515	1183	// For small constant strings just emit individual stores.
never@1515	1184	// A length of 6 seems like a good space/speed tradeof.
never@1515	1185	int c = count->get_int();
never@1515	1186	int o = offset->get_int();
never@1515	1187	const TypeOopPtr* t = kit.gvn().type(value)->isa_oopptr();
never@1515	1188	ciTypeArray* value_array = t->const_oop()->as_type_array();
never@1515	1189	for (int e = 0; e < c; e++) {
never@1515	1190	__ store_to_memory(kit.control(), kit.array_element_address(char_array, start, T_CHAR),
never@1515	1191	__ intcon(value_array->char_at(o + e)), T_CHAR, char_adr_idx);
never@1515	1192	start = __ AddI(start, __ intcon(1));
never@1515	1193	}
never@1515	1194	} else {
never@1515	1195	Node* src_ptr = kit.array_element_address(value, offset, T_CHAR);
never@1515	1196	Node* dst_ptr = kit.array_element_address(char_array, start, T_CHAR);
never@1515	1197	Node* c = count;
never@1515	1198	Node* extra = NULL;
never@1515	1199	#ifdef _LP64
never@1515	1200	c = __ ConvI2L(c);
never@1515	1201	extra = C->top();
never@1515	1202	#endif
never@1515	1203	Node* call = kit.make_runtime_call(GraphKit::RC_LEAF|GraphKit::RC_NO_FP,
never@1515	1204	OptoRuntime::fast_arraycopy_Type(),
never@1515	1205	CAST_FROM_FN_PTR(address, StubRoutines::jshort_disjoint_arraycopy()),
never@1515	1206	"jshort_disjoint_arraycopy", TypeAryPtr::CHARS,
never@1515	1207	src_ptr, dst_ptr, c, extra);
never@1515	1208	start = __ AddI(start, count);
never@1515	1209	}
never@1515	1210	return start;
never@1515	1211	}
never@1515	1212
never@1515	1213
never@1515	1214	void PhaseStringOpts::replace_string_concat(StringConcat* sc) {
never@1515	1215	// Log a little info about the transformation
never@1515	1216	sc->maybe_log_transform();
never@1515	1217
never@1515	1218	// pull the JVMState of the allocation into a SafePointNode to serve as
never@1515	1219	// as a shim for the insertion of the new code.
never@1515	1220	JVMState* jvms = sc->begin()->jvms()->clone_shallow(C);
never@1515	1221	uint size = sc->begin()->req();
never@1515	1222	SafePointNode* map = new (C, size) SafePointNode(size, jvms);
never@1515	1223
never@1515	1224	// copy the control and memory state from the final call into our
never@1515	1225	// new starting state. This allows any preceeding tests to feed
never@1515	1226	// into the new section of code.
never@1515	1227	for (uint i1 = 0; i1 < TypeFunc::Parms; i1++) {
never@1515	1228	map->init_req(i1, sc->end()->in(i1));
never@1515	1229	}
never@1515	1230	// blow away old allocation arguments
never@1515	1231	for (uint i1 = TypeFunc::Parms; i1 < jvms->debug_start(); i1++) {
never@1515	1232	map->init_req(i1, C->top());
never@1515	1233	}
never@1515	1234	// Copy the rest of the inputs for the JVMState
never@1515	1235	for (uint i1 = jvms->debug_start(); i1 < sc->begin()->req(); i1++) {
never@1515	1236	map->init_req(i1, sc->begin()->in(i1));
never@1515	1237	}
never@1515	1238	// Make sure the memory state is a MergeMem for parsing.
never@1515	1239	if (!map->in(TypeFunc::Memory)->is_MergeMem()) {
never@1515	1240	map->set_req(TypeFunc::Memory, MergeMemNode::make(C, map->in(TypeFunc::Memory)));
never@1515	1241	}
never@1515	1242
never@1515	1243	jvms->set_map(map);
never@1515	1244	map->ensure_stack(jvms, jvms->method()->max_stack());
never@1515	1245
never@1515	1246
never@1515	1247	// disconnect all the old StringBuilder calls from the graph
never@1515	1248	sc->eliminate_unneeded_control();
never@1515	1249
never@1515	1250	// At this point all the old work has been completely removed from
never@1515	1251	// the graph and the saved JVMState exists at the point where the
never@1515	1252	// final toString call used to be.
never@1515	1253	GraphKit kit(jvms);
never@1515	1254
never@1515	1255	// There may be uncommon traps which are still using the
never@1515	1256	// intermediate states and these need to be rewritten to point at
never@1515	1257	// the JVMState at the beginning of the transformation.
never@1515	1258	sc->convert_uncommon_traps(kit, jvms);
never@1515	1259
never@1515	1260	// Now insert the logic to compute the size of the string followed
never@1515	1261	// by all the logic to construct array and resulting string.
never@1515	1262
never@1515	1263	Node* null_string = __ makecon(TypeInstPtr::make(C->env()->the_null_string()));
never@1515	1264
never@1515	1265	// Create a region for the overflow checks to merge into.
never@1515	1266	int args = MAX2(sc->num_arguments(), 1);
never@1515	1267	RegionNode* overflow = new (C, args) RegionNode(args);
never@1515	1268	kit.gvn().set_type(overflow, Type::CONTROL);
never@1515	1269
never@1515	1270	// Create a hook node to hold onto the individual sizes since they
never@1515	1271	// are need for the copying phase.
never@1515	1272	Node* string_sizes = new (C, args) Node(args);
never@1515	1273
never@1515	1274	Node* length = __ intcon(0);
never@1515	1275	for (int argi = 0; argi < sc->num_arguments(); argi++) {
never@1515	1276	Node* arg = sc->argument(argi);
never@1515	1277	switch (sc->mode(argi)) {
never@1515	1278	case StringConcat::IntMode: {
never@1515	1279	Node* string_size = int_stringSize(kit, arg);
never@1515	1280
never@1515	1281	// accumulate total
never@1515	1282	length = __ AddI(length, string_size);
never@1515	1283
never@1515	1284	// Cache this value for the use by int_toString
never@1515	1285	string_sizes->init_req(argi, string_size);
never@1515	1286	break;
never@1515	1287	}
kvn@2413	1288	case StringConcat::StringNullCheckMode: {
kvn@2413	1289	const Type* type = kit.gvn().type(arg);
kvn@2413	1290	assert(type != TypePtr::NULL_PTR, "missing check");
kvn@2413	1291	if (!type->higher_equal(TypeInstPtr::NOTNULL)) {
kvn@2413	1292	// Null check with uncommont trap since
kvn@2413	1293	// StringBuilder(null) throws exception.
kvn@2413	1294	// Use special uncommon trap instead of
kvn@2413	1295	// calling normal do_null_check().
kvn@2413	1296	Node* p = __ Bool(__ CmpP(arg, kit.null()), BoolTest::ne);
kvn@2413	1297	IfNode* iff = kit.create_and_map_if(kit.control(), p, PROB_MIN, COUNT_UNKNOWN);
kvn@2413	1298	overflow->add_req(__ IfFalse(iff));
kvn@2413	1299	Node* notnull = __ IfTrue(iff);
kvn@2413	1300	kit.set_control(notnull); // set control for the cast_not_null
kvn@2413	1301	arg = kit.cast_not_null(arg, false);
kvn@2413	1302	sc->set_argument(argi, arg);
kvn@2413	1303	}
kvn@2413	1304	assert(kit.gvn().type(arg)->higher_equal(TypeInstPtr::NOTNULL), "sanity");
kvn@2413	1305	// Fallthrough to add string length.
kvn@2413	1306	}
never@1515	1307	case StringConcat::StringMode: {
never@1515	1308	const Type* type = kit.gvn().type(arg);
never@1515	1309	if (type == TypePtr::NULL_PTR) {
never@1515	1310	// replace the argument with the null checked version
never@1515	1311	arg = null_string;
never@1515	1312	sc->set_argument(argi, arg);
never@1515	1313	} else if (!type->higher_equal(TypeInstPtr::NOTNULL)) {
never@1515	1314	// s = s != null ? s : "null";
never@1515	1315	// length = length + (s.count - s.offset);
never@1515	1316	RegionNode *r = new (C, 3) RegionNode(3);
never@1515	1317	kit.gvn().set_type(r, Type::CONTROL);
never@1685	1318	Node *phi = new (C, 3) PhiNode(r, type);
never@1515	1319	kit.gvn().set_type(phi, phi->bottom_type());
never@1515	1320	Node* p = __ Bool(__ CmpP(arg, kit.null()), BoolTest::ne);
never@1515	1321	IfNode* iff = kit.create_and_map_if(kit.control(), p, PROB_MIN, COUNT_UNKNOWN);
never@1515	1322	Node* notnull = __ IfTrue(iff);
never@1515	1323	Node* isnull = __ IfFalse(iff);
never@1685	1324	kit.set_control(notnull); // set control for the cast_not_null
never@1515	1325	r->init_req(1, notnull);
never@1685	1326	phi->init_req(1, kit.cast_not_null(arg, false));
never@1515	1327	r->init_req(2, isnull);
never@1515	1328	phi->init_req(2, null_string);
never@1515	1329	kit.set_control(r);
never@1515	1330	C->record_for_igvn(r);
never@1515	1331	C->record_for_igvn(phi);
never@1515	1332	// replace the argument with the null checked version
never@1515	1333	arg = phi;
never@1515	1334	sc->set_argument(argi, arg);
never@1515	1335	}
never@1515	1336	// Node* offset = kit.make_load(NULL, kit.basic_plus_adr(arg, arg, offset_offset),
never@1515	1337	// TypeInt::INT, T_INT, offset_field_idx);
never@1515	1338	Node* count = kit.make_load(NULL, kit.basic_plus_adr(arg, arg, java_lang_String::count_offset_in_bytes()),
never@1515	1339	TypeInt::INT, T_INT, count_field_idx);
never@1515	1340	length = __ AddI(length, count);
never@1515	1341	string_sizes->init_req(argi, NULL);
never@1515	1342	break;
never@1515	1343	}
never@1515	1344	case StringConcat::CharMode: {
never@1515	1345	// one character only
never@1515	1346	length = __ AddI(length, __ intcon(1));
never@1515	1347	break;
never@1515	1348	}
never@1515	1349	default:
never@1515	1350	ShouldNotReachHere();
never@1515	1351	}
never@1515	1352	if (argi > 0) {
never@1515	1353	// Check that the sum hasn't overflowed
never@1515	1354	IfNode* iff = kit.create_and_map_if(kit.control(),
never@1515	1355	__ Bool(__ CmpI(length, __ intcon(0)), BoolTest::lt),
never@1515	1356	PROB_MIN, COUNT_UNKNOWN);
never@1515	1357	kit.set_control(__ IfFalse(iff));
never@1515	1358	overflow->set_req(argi, __ IfTrue(iff));
never@1515	1359	}
never@1515	1360	}
never@1515	1361
never@1515	1362	{
never@1515	1363	// Hook
never@1515	1364	PreserveJVMState pjvms(&kit);
never@1515	1365	kit.set_control(overflow);
kvn@2413	1366	C->record_for_igvn(overflow);
never@1515	1367	kit.uncommon_trap(Deoptimization::Reason_intrinsic,
never@1515	1368	Deoptimization::Action_make_not_entrant);
never@1515	1369	}
never@1515	1370
never@1515	1371	// length now contains the number of characters needed for the
never@1515	1372	// char[] so create a new AllocateArray for the char[]
never@1515	1373	Node* char_array = NULL;
never@1515	1374	{
never@1515	1375	PreserveReexecuteState preexecs(&kit);
never@1515	1376	// The original jvms is for an allocation of either a String or
never@1515	1377	// StringBuffer so no stack adjustment is necessary for proper
never@1515	1378	// reexecution. If we deoptimize in the slow path the bytecode
never@1515	1379	// will be reexecuted and the char[] allocation will be thrown away.
never@1515	1380	kit.jvms()->set_should_reexecute(true);
never@1515	1381	char_array = kit.new_array(__ makecon(TypeKlassPtr::make(ciTypeArrayKlass::make(T_CHAR))),
never@1515	1382	length, 1);
never@1515	1383	}
never@1515	1384
never@1515	1385	// Mark the allocation so that zeroing is skipped since the code
never@1515	1386	// below will overwrite the entire array
never@1515	1387	AllocateArrayNode* char_alloc = AllocateArrayNode::Ideal_array_allocation(char_array, _gvn);
never@1515	1388	char_alloc->maybe_set_complete(_gvn);
never@1515	1389
never@1515	1390	// Now copy the string representations into the final char[]
never@1515	1391	Node* start = __ intcon(0);
never@1515	1392	for (int argi = 0; argi < sc->num_arguments(); argi++) {
never@1515	1393	Node* arg = sc->argument(argi);
never@1515	1394	switch (sc->mode(argi)) {
never@1515	1395	case StringConcat::IntMode: {
never@1515	1396	Node* end = __ AddI(start, string_sizes->in(argi));
never@1515	1397	// getChars words backwards so pass the ending point as well as the start
never@1515	1398	int_getChars(kit, arg, char_array, start, end);
never@1515	1399	start = end;
never@1515	1400	break;
never@1515	1401	}
kvn@2413	1402	case StringConcat::StringNullCheckMode:
never@1515	1403	case StringConcat::StringMode: {
never@1515	1404	start = copy_string(kit, arg, char_array, start);
never@1515	1405	break;
never@1515	1406	}
never@1515	1407	case StringConcat::CharMode: {
never@1515	1408	__ store_to_memory(kit.control(), kit.array_element_address(char_array, start, T_CHAR),
never@1515	1409	arg, T_CHAR, char_adr_idx);
never@1515	1410	start = __ AddI(start, __ intcon(1));
never@1515	1411	break;
never@1515	1412	}
never@1515	1413	default:
never@1515	1414	ShouldNotReachHere();
never@1515	1415	}
never@1515	1416	}
never@1515	1417
never@1515	1418	// If we're not reusing an existing String allocation then allocate one here.
never@1515	1419	Node* result = sc->string_alloc();
never@1515	1420	if (result == NULL) {
never@1515	1421	PreserveReexecuteState preexecs(&kit);
never@1515	1422	// The original jvms is for an allocation of either a String or
never@1515	1423	// StringBuffer so no stack adjustment is necessary for proper
never@1515	1424	// reexecution.
never@1515	1425	kit.jvms()->set_should_reexecute(true);
never@1515	1426	result = kit.new_instance(__ makecon(TypeKlassPtr::make(C->env()->String_klass())));
never@1515	1427	}
never@1515	1428
never@1515	1429	// Intialize the string
never@1515	1430	kit.store_to_memory(kit.control(), kit.basic_plus_adr(result, java_lang_String::offset_offset_in_bytes()),
never@1515	1431	__ intcon(0), T_INT, offset_field_idx);
never@1515	1432	kit.store_to_memory(kit.control(), kit.basic_plus_adr(result, java_lang_String::count_offset_in_bytes()),
never@1515	1433	length, T_INT, count_field_idx);
never@1515	1434	kit.store_to_memory(kit.control(), kit.basic_plus_adr(result, java_lang_String::value_offset_in_bytes()),
never@1515	1435	char_array, T_OBJECT, value_field_idx);
never@1515	1436
never@1515	1437	// hook up the outgoing control and result
never@1515	1438	kit.replace_call(sc->end(), result);
never@1515	1439
never@1515	1440	// Unhook any hook nodes
never@1515	1441	string_sizes->disconnect_inputs(NULL);
never@1515	1442	sc->cleanup();
never@1515	1443	}