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

src/share/vm/prims/methodComparator.hpp@f95d63e2154a (annotated)

src/share/vm/prims/methodComparator.hpp

Tue, 23 Nov 2010 13:22:55 -0800

author

stefank

date

Tue, 23 Nov 2010 13:22:55 -0800

changeset 2314

f95d63e2154a

parent 2268

3b2dea75431e

child 4037

da91efe96a93

permissions

-rw-r--r--

6989984: Use standard include model for Hospot
Summary: Replaced MakeDeps and the includeDB files with more standardized solutions.
Reviewed-by: coleenp, kvn, kamg

duke@435	1	/*
jrose@2268	2	* Copyright (c) 2000, 2010, Oracle and/or its affiliates. All rights reserved.
duke@435	3	* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
duke@435	4	*
duke@435	5	* This code is free software; you can redistribute it and/or modify it
duke@435	6	* under the terms of the GNU General Public License version 2 only, as
duke@435	7	* published by the Free Software Foundation.
duke@435	8	*
duke@435	9	* This code is distributed in the hope that it will be useful, but WITHOUT
duke@435	10	* ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
duke@435	11	* FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
duke@435	12	* version 2 for more details (a copy is included in the LICENSE file that
duke@435	13	* accompanied this code).
duke@435	14	*
duke@435	15	* You should have received a copy of the GNU General Public License version
duke@435	16	* 2 along with this work; if not, write to the Free Software Foundation,
duke@435	17	* Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
duke@435	18	*
trims@1907	19	* Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
trims@1907	20	* or visit www.oracle.com if you need additional information or have any
trims@1907	21	* questions.
duke@435	22	*
duke@435	23	*/
duke@435	24
stefank@2314	25	#ifndef SHARE_VM_PRIMS_METHODCOMPARATOR_HPP
stefank@2314	26	#define SHARE_VM_PRIMS_METHODCOMPARATOR_HPP
stefank@2314	27
stefank@2314	28	#include "interpreter/bytecodeStream.hpp"
stefank@2314	29	#include "oops/constantPoolOop.hpp"
stefank@2314	30	#include "oops/methodOop.hpp"
stefank@2314	31
duke@435	32	class BciMap;
duke@435	33
duke@435	34	// methodComparator provides an interface for determining if methods of
duke@435	35	// different versions of classes are equivalent or switchable
duke@435	36
duke@435	37	class MethodComparator {
duke@435	38	private:
duke@435	39	static BytecodeStream *_s_old, *_s_new;
duke@435	40	static constantPoolOop _old_cp, _new_cp;
duke@435	41	static BciMap *_bci_map;
duke@435	42	static bool _switchable_test;
duke@435	43	static GrowableArray<int> *_fwd_jmps;
duke@435	44
duke@435	45	static bool args_same(Bytecodes::Code c_old, Bytecodes::Code c_new);
jrose@2268	46	static bool pool_constants_same(int cpi_old, int cpi_new);
duke@435	47	static int check_stack_and_locals_size(methodOop old_method, methodOop new_method);
duke@435	48
duke@435	49	public:
duke@435	50	// Check if the new method is equivalent to the old one modulo constant pool (EMCP).
duke@435	51	// Intuitive definition: two versions of the same method are EMCP, if they don't differ
duke@435	52	// on the source code level. Practically, we check whether the only difference between
duke@435	53	// method versions is some constantpool indices embedded into the bytecodes, and whether
duke@435	54	// these indices eventually point to the same constants for both method versions.
duke@435	55	static bool methods_EMCP(methodOop old_method, methodOop new_method);
duke@435	56
duke@435	57	static bool methods_switchable(methodOop old_method, methodOop new_method, BciMap &bci_map);
duke@435	58	};
duke@435	59
duke@435	60
duke@435	61	// ByteCode Index Map. For two versions of the same method, where the new version may contain
duke@435	62	// fragments not found in the old version, provides a mapping from an index of a bytecode in
duke@435	63	// the old method to the index of the same bytecode in the new method.
duke@435	64
duke@435	65	class BciMap {
duke@435	66	private:
duke@435	67	int *_old_bci, *_new_st_bci, *_new_end_bci;
duke@435	68	int _cur_size, _cur_pos;
duke@435	69	int _pos;
duke@435	70
duke@435	71	public:
duke@435	72	BciMap() {
duke@435	73	_cur_size = 50;
duke@435	74	_old_bci = (int*) malloc(sizeof(int) * _cur_size);
duke@435	75	_new_st_bci = (int*) malloc(sizeof(int) * _cur_size);
duke@435	76	_new_end_bci = (int*) malloc(sizeof(int) * _cur_size);
duke@435	77	_cur_pos = 0;
duke@435	78	}
duke@435	79
duke@435	80	~BciMap() {
duke@435	81	free(_old_bci);
duke@435	82	free(_new_st_bci);
duke@435	83	free(_new_end_bci);
duke@435	84	}
duke@435	85
duke@435	86	// Store the position of an added fragment, e.g.
duke@435	87	//
duke@435	88	// |<- old_bci
duke@435	89	// -----------------------------------------
duke@435	90	// Old method |invokevirtual 5|aload 1|...
duke@435	91	// -----------------------------------------
duke@435	92	//
duke@435	93	// |<- new_st_bci |<- new_end_bci
duke@435	94	// --------------------------------------------------------------------
duke@435	95	// New method |invokevirual 5|aload 2|invokevirtual 6|aload 1|...
duke@435	96	// --------------------------------------------------------------------
duke@435	97	// ^^^^^^^^^^^^^^^^^^^^^^^^
duke@435	98	// Added fragment
duke@435	99
duke@435	100	void store_fragment_location(int old_bci, int new_st_bci, int new_end_bci) {
duke@435	101	if (_cur_pos == _cur_size) {
duke@435	102	_cur_size += 10;
duke@435	103	_old_bci = (int*) realloc(_old_bci, sizeof(int) * _cur_size);
duke@435	104	_new_st_bci = (int*) realloc(_new_st_bci, sizeof(int) * _cur_size);
duke@435	105	_new_end_bci = (int*) realloc(_new_end_bci, sizeof(int) * _cur_size);
duke@435	106	}
duke@435	107	_old_bci[_cur_pos] = old_bci;
duke@435	108	_new_st_bci[_cur_pos] = new_st_bci;
duke@435	109	_new_end_bci[_cur_pos] = new_end_bci;
duke@435	110	_cur_pos++;
duke@435	111	}
duke@435	112
duke@435	113	int new_bci_for_old(int old_bci) {
duke@435	114	if (_cur_pos == 0 || old_bci < _old_bci[0]) return old_bci;
duke@435	115	_pos = 1;
duke@435	116	while (_pos < _cur_pos && old_bci >= _old_bci[_pos])
duke@435	117	_pos++;
duke@435	118	return _new_end_bci[_pos-1] + (old_bci - _old_bci[_pos-1]);
duke@435	119	}
duke@435	120
duke@435	121	// Test if two indexes - one in the old method and another in the new one - correspond
duke@435	122	// to the same bytecode
duke@435	123	bool old_and_new_locations_same(int old_dest_bci, int new_dest_bci) {
duke@435	124	if (new_bci_for_old(old_dest_bci) == new_dest_bci)
duke@435	125	return true;
duke@435	126	else if (_old_bci[_pos-1] == old_dest_bci)
duke@435	127	return (new_dest_bci == _new_st_bci[_pos-1]);
duke@435	128	else return false;
duke@435	129	}
duke@435	130	};
stefank@2314	131
stefank@2314	132	#endif // SHARE_VM_PRIMS_METHODCOMPARATOR_HPP