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

src/share/vm/interpreter/abstractInterpreter.hpp@bd02caa94611 (annotated)

src/share/vm/interpreter/abstractInterpreter.hpp

Tue, 28 Jul 2009 12:12:40 -0700

author

xdono

date

Tue, 28 Jul 2009 12:12:40 -0700

changeset 1279

bd02caa94611

parent 1161

be93aad57795

child 1335

9987d9d5eb0e

permissions

-rw-r--r--

6862919: Update copyright year
Summary: Update copyright for files that have been modified in 2009, up to 07/09
Reviewed-by: tbell, ohair

duke@435	1	/*
jrose@1145	2	* Copyright 1997-2009 Sun Microsystems, Inc. All Rights Reserved.
duke@435	3	* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
duke@435	4	*
duke@435	5	* This code is free software; you can redistribute it and/or modify it
duke@435	6	* under the terms of the GNU General Public License version 2 only, as
duke@435	7	* published by the Free Software Foundation.
duke@435	8	*
duke@435	9	* This code is distributed in the hope that it will be useful, but WITHOUT
duke@435	10	* ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
duke@435	11	* FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
duke@435	12	* version 2 for more details (a copy is included in the LICENSE file that
duke@435	13	* accompanied this code).
duke@435	14	*
duke@435	15	* You should have received a copy of the GNU General Public License version
duke@435	16	* 2 along with this work; if not, write to the Free Software Foundation,
duke@435	17	* Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
duke@435	18	*
duke@435	19	* Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara,
duke@435	20	* CA 95054 USA or visit www.sun.com if you need additional information or
duke@435	21	* have any questions.
duke@435	22	*
duke@435	23	*/
duke@435	24
twisti@1040	25	// This file contains the platform-independent parts
duke@435	26	// of the abstract interpreter and the abstract interpreter generator.
duke@435	27
duke@435	28	// Organization of the interpreter(s). There exists two different interpreters in hotpot
duke@435	29	// an assembly language version (aka template interpreter) and a high level language version
duke@435	30	// (aka c++ interpreter). Th division of labor is as follows:
duke@435	31
duke@435	32	// Template Interpreter C++ Interpreter Functionality
duke@435	33	//
duke@435	34	// templateTable* bytecodeInterpreter* actual interpretation of bytecodes
duke@435	35	//
duke@435	36	// templateInterpreter* cppInterpreter* generation of assembly code that creates
duke@435	37	// and manages interpreter runtime frames.
duke@435	38	// Also code for populating interpreter
duke@435	39	// frames created during deoptimization.
duke@435	40	//
duke@435	41	// For both template and c++ interpreter. There are common files for aspects of the interpreter
duke@435	42	// that are generic to both interpreters. This is the layout:
duke@435	43	//
duke@435	44	// abstractInterpreter.hpp: generic description of the interpreter.
duke@435	45	// interpreter*: generic frame creation and handling.
duke@435	46	//
duke@435	47
duke@435	48	//------------------------------------------------------------------------------------------------------------------------
duke@435	49	// The C++ interface to the bytecode interpreter(s).
duke@435	50
duke@435	51	class AbstractInterpreter: AllStatic {
duke@435	52	friend class VMStructs;
duke@435	53	friend class Interpreter;
duke@435	54	friend class CppInterpreterGenerator;
duke@435	55	public:
duke@435	56	enum MethodKind {
duke@435	57	zerolocals, // method needs locals initialization
duke@435	58	zerolocals_synchronized, // method needs locals initialization & is synchronized
duke@435	59	native, // native method
duke@435	60	native_synchronized, // native method & is synchronized
duke@435	61	empty, // empty method (code: _return)
duke@435	62	accessor, // accessor method (code: _aload_0, _getfield, _(a|i)return)
duke@435	63	abstract, // abstract method (throws an AbstractMethodException)
jrose@1145	64	method_handle, // java.dyn.MethodHandles::invoke
duke@435	65	java_lang_math_sin, // implementation of java.lang.Math.sin (x)
duke@435	66	java_lang_math_cos, // implementation of java.lang.Math.cos (x)
duke@435	67	java_lang_math_tan, // implementation of java.lang.Math.tan (x)
duke@435	68	java_lang_math_abs, // implementation of java.lang.Math.abs (x)
duke@435	69	java_lang_math_sqrt, // implementation of java.lang.Math.sqrt (x)
duke@435	70	java_lang_math_log, // implementation of java.lang.Math.log (x)
duke@435	71	java_lang_math_log10, // implementation of java.lang.Math.log10 (x)
duke@435	72	number_of_method_entries,
duke@435	73	invalid = -1
duke@435	74	};
duke@435	75
duke@435	76	enum SomeConstants {
duke@435	77	number_of_result_handlers = 10 // number of result handlers for native calls
duke@435	78	};
duke@435	79
duke@435	80	protected:
duke@435	81	static StubQueue* _code; // the interpreter code (codelets)
duke@435	82
duke@435	83	static bool _notice_safepoints; // true if safepoints are activated
duke@435	84
duke@435	85	static address _native_entry_begin; // Region for native entry code
duke@435	86	static address _native_entry_end;
duke@435	87
duke@435	88	// method entry points
duke@435	89	static address _entry_table[number_of_method_entries]; // entry points for a given method
duke@435	90	static address _native_abi_to_tosca[number_of_result_handlers]; // for native method result handlers
duke@435	91	static address _slow_signature_handler; // the native method generic (slow) signature handler
duke@435	92
duke@435	93	static address _rethrow_exception_entry; // rethrows an activation in previous frame
duke@435	94
duke@435	95	friend class AbstractInterpreterGenerator;
duke@435	96	friend class InterpreterGenerator;
duke@435	97	friend class InterpreterMacroAssembler;
duke@435	98
duke@435	99	public:
duke@435	100	// Initialization/debugging
duke@435	101	static void initialize();
duke@435	102	static StubQueue* code() { return _code; }
duke@435	103
duke@435	104
duke@435	105	// Method activation
duke@435	106	static MethodKind method_kind(methodHandle m);
duke@435	107	static address entry_for_kind(MethodKind k) { assert(0 <= k && k < number_of_method_entries, "illegal kind"); return _entry_table[k]; }
duke@435	108	static address entry_for_method(methodHandle m) { return _entry_table[method_kind(m)]; }
duke@435	109
duke@435	110	static void print_method_kind(MethodKind kind) PRODUCT_RETURN;
duke@435	111
duke@435	112	// Runtime support
duke@435	113
duke@435	114	// length = invoke bytecode length (to advance to next bytecode)
duke@435	115	static address deopt_entry (TosState state, int length) { ShouldNotReachHere(); return NULL; }
duke@435	116	static address return_entry (TosState state, int length) { ShouldNotReachHere(); return NULL; }
duke@435	117
duke@435	118	static address rethrow_exception_entry() { return _rethrow_exception_entry; }
duke@435	119
duke@435	120	// Activation size in words for a method that is just being called.
duke@435	121	// Parameters haven't been pushed so count them too.
duke@435	122	static int size_top_interpreter_activation(methodOop method);
duke@435	123
duke@435	124	// Deoptimization support
duke@435	125	static address continuation_for(methodOop method,
duke@435	126	address bcp,
duke@435	127	int callee_parameters,
duke@435	128	bool is_top_frame,
duke@435	129	bool& use_next_mdp);
duke@435	130
duke@435	131	// share implementation of size_activation and layout_activation:
duke@435	132	static int size_activation(methodOop method,
duke@435	133	int temps,
duke@435	134	int popframe_args,
duke@435	135	int monitors,
duke@435	136	int callee_params,
duke@435	137	int callee_locals,
duke@435	138	bool is_top_frame);
duke@435	139
duke@435	140	static int layout_activation(methodOop method,
duke@435	141	int temps,
duke@435	142	int popframe_args,
duke@435	143	int monitors,
duke@435	144	int callee_params,
duke@435	145	int callee_locals,
duke@435	146	frame* caller,
duke@435	147	frame* interpreter_frame,
duke@435	148	bool is_top_frame);
duke@435	149
duke@435	150	// Runtime support
duke@435	151	static bool is_not_reached( methodHandle method, int bci);
duke@435	152	// Safepoint support
duke@435	153	static void notice_safepoints() { ShouldNotReachHere(); } // stops the thread when reaching a safepoint
duke@435	154	static void ignore_safepoints() { ShouldNotReachHere(); } // ignores safepoints
duke@435	155
duke@435	156	// Support for native calls
duke@435	157	static address slow_signature_handler() { return _slow_signature_handler; }
duke@435	158	static address result_handler(BasicType type) { return _native_abi_to_tosca[BasicType_as_index(type)]; }
duke@435	159	static int BasicType_as_index(BasicType type); // computes index into result_handler_by_index table
duke@435	160	static bool in_native_entry(address pc) { return _native_entry_begin <= pc && pc < _native_entry_end; }
duke@435	161	// Debugging/printing
duke@435	162	static void print(); // prints the interpreter code
duke@435	163
duke@435	164	// Support for Tagged Stacks
duke@435	165	//
duke@435	166	// Tags are stored on the Java Expression stack above the value:
duke@435	167	//
duke@435	168	// tag
duke@435	169	// value
duke@435	170	//
duke@435	171	// For double values:
duke@435	172	//
duke@435	173	// tag2
duke@435	174	// high word
duke@435	175	// tag1
duke@435	176	// low word
duke@435	177
duke@435	178	public:
duke@435	179	static int stackElementWords() { return TaggedStackInterpreter ? 2 : 1; }
duke@435	180	static int stackElementSize() { return stackElementWords()*wordSize; }
duke@435	181	static int logStackElementSize() { return
duke@435	182	TaggedStackInterpreter? LogBytesPerWord+1 : LogBytesPerWord; }
duke@435	183
duke@435	184	// Tag is at pointer, value is one below for a stack growing down
duke@435	185	// (or above for stack growing up)
duke@435	186	static int value_offset_in_bytes() {
duke@435	187	return TaggedStackInterpreter ?
duke@435	188	frame::interpreter_frame_expression_stack_direction() * wordSize : 0;
duke@435	189	}
duke@435	190	static int tag_offset_in_bytes() {
duke@435	191	assert(TaggedStackInterpreter, "should not call this");
duke@435	192	return 0;
duke@435	193	}
duke@435	194
duke@435	195	// Tagged Locals
duke@435	196	// Locals are stored relative to Llocals:
duke@435	197	//
duke@435	198	// tag <- Llocals[n]
duke@435	199	// value
duke@435	200	//
duke@435	201	// Category 2 types are indexed as:
duke@435	202	//
duke@435	203	// tag <- Llocals[-n]
duke@435	204	// high word
duke@435	205	// tag <- Llocals[-n+1]
duke@435	206	// low word
duke@435	207	//
duke@435	208
duke@435	209	// Local values relative to locals[n]
duke@435	210	static int local_offset_in_bytes(int n) {
duke@435	211	return ((frame::interpreter_frame_expression_stack_direction() * n) *
duke@435	212	stackElementSize()) + value_offset_in_bytes();
duke@435	213	}
duke@435	214	static int local_tag_offset_in_bytes(int n) {
duke@435	215	assert(TaggedStackInterpreter, "should not call this");
duke@435	216	return ((frame::interpreter_frame_expression_stack_direction() * n) *
duke@435	217	stackElementSize()) + tag_offset_in_bytes();
duke@435	218	}
duke@435	219
jrose@1161	220	// access to stacked values according to type:
jrose@1161	221	static oop* oop_addr_in_slot(intptr_t* slot_addr) {
jrose@1161	222	return (oop*) slot_addr;
jrose@1161	223	}
jrose@1161	224	static jint* int_addr_in_slot(intptr_t* slot_addr) {
jrose@1161	225	if ((int) sizeof(jint) < wordSize && !Bytes::is_Java_byte_ordering_different())
jrose@1161	226	// big-endian LP64
jrose@1161	227	return (jint*)(slot_addr + 1) - 1;
jrose@1161	228	else
jrose@1161	229	return (jint*) slot_addr;
jrose@1161	230	}
jrose@1161	231	static jlong long_in_slot(intptr_t* slot_addr) {
jrose@1161	232	if (sizeof(intptr_t) >= sizeof(jlong)) {
jrose@1161	233	return *(jlong*) slot_addr;
jrose@1161	234	} else if (!TaggedStackInterpreter) {
jrose@1161	235	return Bytes::get_native_u8((address)slot_addr);
jrose@1161	236	} else {
jrose@1161	237	assert(sizeof(intptr_t) * 2 == sizeof(jlong), "ILP32");
jrose@1161	238	// assemble the long in memory order (not arithmetic order)
jrose@1161	239	union { jlong j; jint i[2]; } u;
jrose@1161	240	u.i[0] = (jint) slot_addr[0*stackElementSize()];
jrose@1161	241	u.i[1] = (jint) slot_addr[1*stackElementSize()];
jrose@1161	242	return u.j;
jrose@1161	243	}
jrose@1161	244	}
jrose@1161	245	static void set_long_in_slot(intptr_t* slot_addr, jlong value) {
jrose@1161	246	if (sizeof(intptr_t) >= sizeof(jlong)) {
jrose@1161	247	*(jlong*) slot_addr = value;
jrose@1161	248	} else if (!TaggedStackInterpreter) {
jrose@1161	249	Bytes::put_native_u8((address)slot_addr, value);
jrose@1161	250	} else {
jrose@1161	251	assert(sizeof(intptr_t) * 2 == sizeof(jlong), "ILP32");
jrose@1161	252	// assemble the long in memory order (not arithmetic order)
jrose@1161	253	union { jlong j; jint i[2]; } u;
jrose@1161	254	u.j = value;
jrose@1161	255	slot_addr[0*stackElementSize()] = (intptr_t) u.i[0];
jrose@1161	256	slot_addr[1*stackElementSize()] = (intptr_t) u.i[1];
jrose@1161	257	}
jrose@1161	258	}
jrose@1161	259	static void get_jvalue_in_slot(intptr_t* slot_addr, BasicType type, jvalue* value) {
jrose@1161	260	switch (type) {
jrose@1161	261	case T_BOOLEAN: value->z = *int_addr_in_slot(slot_addr); break;
jrose@1161	262	case T_CHAR: value->c = *int_addr_in_slot(slot_addr); break;
jrose@1161	263	case T_BYTE: value->b = *int_addr_in_slot(slot_addr); break;
jrose@1161	264	case T_SHORT: value->s = *int_addr_in_slot(slot_addr); break;
jrose@1161	265	case T_INT: value->i = *int_addr_in_slot(slot_addr); break;
jrose@1161	266	case T_LONG: value->j = long_in_slot(slot_addr); break;
jrose@1161	267	case T_FLOAT: value->f = *(jfloat*)int_addr_in_slot(slot_addr); break;
jrose@1161	268	case T_DOUBLE: value->d = jdouble_cast(long_in_slot(slot_addr)); break;
jrose@1161	269	case T_OBJECT: value->l = (jobject)*oop_addr_in_slot(slot_addr); break;
jrose@1161	270	default: ShouldNotReachHere();
jrose@1161	271	}
jrose@1161	272	}
jrose@1161	273	static void set_jvalue_in_slot(intptr_t* slot_addr, BasicType type, jvalue* value) {
jrose@1161	274	switch (type) {
jrose@1161	275	case T_BOOLEAN: *int_addr_in_slot(slot_addr) = (value->z != 0); break;
jrose@1161	276	case T_CHAR: *int_addr_in_slot(slot_addr) = value->c; break;
jrose@1161	277	case T_BYTE: *int_addr_in_slot(slot_addr) = value->b; break;
jrose@1161	278	case T_SHORT: *int_addr_in_slot(slot_addr) = value->s; break;
jrose@1161	279	case T_INT: *int_addr_in_slot(slot_addr) = value->i; break;
jrose@1161	280	case T_LONG: set_long_in_slot(slot_addr, value->j); break;
jrose@1161	281	case T_FLOAT: *(jfloat*)int_addr_in_slot(slot_addr) = value->f; break;
jrose@1161	282	case T_DOUBLE: set_long_in_slot(slot_addr, jlong_cast(value->d)); break;
jrose@1161	283	case T_OBJECT: *oop_addr_in_slot(slot_addr) = (oop) value->l; break;
jrose@1161	284	default: ShouldNotReachHere();
jrose@1161	285	}
jrose@1161	286	}
duke@435	287	};
duke@435	288
duke@435	289	//------------------------------------------------------------------------------------------------------------------------
duke@435	290	// The interpreter generator.
duke@435	291
duke@435	292	class Template;
duke@435	293	class AbstractInterpreterGenerator: public StackObj {
duke@435	294	protected:
duke@435	295	InterpreterMacroAssembler* _masm;
duke@435	296
duke@435	297	// shared code sequences
duke@435	298	// Converter for native abi result to tosca result
duke@435	299	address generate_result_handler_for(BasicType type);
duke@435	300	address generate_slow_signature_handler();
duke@435	301
duke@435	302	// entry point generator
duke@435	303	address generate_method_entry(AbstractInterpreter::MethodKind kind);
duke@435	304
duke@435	305	void bang_stack_shadow_pages(bool native_call);
duke@435	306
duke@435	307	void generate_all();
duke@435	308
duke@435	309	public:
duke@435	310	AbstractInterpreterGenerator(StubQueue* _code);
duke@435	311	};