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

src/share/vm/interpreter/bytecodeHistogram.cpp@feeb96a45707 (annotated)

src/share/vm/interpreter/bytecodeHistogram.cpp

Wed, 28 May 2008 21:06:24 -0700

author

coleenp

date

Wed, 28 May 2008 21:06:24 -0700

changeset 602

feeb96a45707

parent 435

a61af66fc99e

child 1907

c18cbe5936b8

permissions

-rw-r--r--

6696264: assert("narrow oop can never be zero") for GCBasher & ParNewGC
Summary: decouple set_klass() with zeroing the gap when compressed.
Reviewed-by: kvn, ysr, jrose

duke@435	1	/*
duke@435	2	* Copyright 1997-2000 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
duke@435	25	# include "incls/_precompiled.incl"
duke@435	26	# include "incls/_bytecodeHistogram.cpp.incl"
duke@435	27
duke@435	28	// ------------------------------------------------------------------------------------------------
duke@435	29	// Non-product code
duke@435	30	#ifndef PRODUCT
duke@435	31
duke@435	32	// Implementation of BytecodeCounter
duke@435	33
duke@435	34	int BytecodeCounter::_counter_value = 0;
duke@435	35	jlong BytecodeCounter::_reset_time = 0;
duke@435	36
duke@435	37
duke@435	38	void BytecodeCounter::reset() {
duke@435	39	_counter_value = 0;
duke@435	40	_reset_time = os::elapsed_counter();
duke@435	41	}
duke@435	42
duke@435	43
duke@435	44	double BytecodeCounter::elapsed_time() {
duke@435	45	return (double)(os::elapsed_counter() - _reset_time) / (double)os::elapsed_frequency();
duke@435	46	}
duke@435	47
duke@435	48
duke@435	49	double BytecodeCounter::frequency() {
duke@435	50	return (double)counter_value() / elapsed_time();
duke@435	51	}
duke@435	52
duke@435	53
duke@435	54	void BytecodeCounter::print() {
duke@435	55	tty->print_cr(
duke@435	56	"%d bytecodes executed in %.1fs (%.3fMHz)",
duke@435	57	counter_value(),
duke@435	58	elapsed_time(),
duke@435	59	frequency() / 1000000.0
duke@435	60	);
duke@435	61	}
duke@435	62
duke@435	63
duke@435	64	// Helper class for sorting
duke@435	65
duke@435	66	class HistoEntry: public ResourceObj {
duke@435	67	private:
duke@435	68	int _index;
duke@435	69	int _count;
duke@435	70
duke@435	71	public:
duke@435	72	HistoEntry(int index, int count) { _index = index; _count = count; }
duke@435	73	int index() const { return _index; }
duke@435	74	int count() const { return _count; }
duke@435	75
duke@435	76	static int compare(HistoEntry** x, HistoEntry** y) { return (*x)->count() - (*y)->count(); }
duke@435	77	};
duke@435	78
duke@435	79
duke@435	80	// Helper functions
duke@435	81
duke@435	82	static GrowableArray<HistoEntry*>* sorted_array(int* array, int length) {
duke@435	83	GrowableArray<HistoEntry*>* a = new GrowableArray<HistoEntry*>(length);
duke@435	84	int i = length;
duke@435	85	while (i-- > 0) a->append(new HistoEntry(i, array[i]));
duke@435	86	a->sort(HistoEntry::compare);
duke@435	87	return a;
duke@435	88	}
duke@435	89
duke@435	90
duke@435	91	static int total_count(GrowableArray<HistoEntry*>* profile) {
duke@435	92	int sum = 0;
duke@435	93	int i = profile->length();
duke@435	94	while (i-- > 0) sum += profile->at(i)->count();
duke@435	95	return sum;
duke@435	96	}
duke@435	97
duke@435	98
duke@435	99	static const char* name_for(int i) {
duke@435	100	return Bytecodes::is_defined(i) ? Bytecodes::name(Bytecodes::cast(i)) : "xxxunusedxxx";
duke@435	101	}
duke@435	102
duke@435	103
duke@435	104	// Implementation of BytecodeHistogram
duke@435	105
duke@435	106	int BytecodeHistogram::_counters[Bytecodes::number_of_codes];
duke@435	107
duke@435	108
duke@435	109	void BytecodeHistogram::reset() {
duke@435	110	int i = Bytecodes::number_of_codes;
duke@435	111	while (i-- > 0) _counters[i] = 0;
duke@435	112	}
duke@435	113
duke@435	114
duke@435	115	void BytecodeHistogram::print(float cutoff) {
duke@435	116	ResourceMark rm;
duke@435	117	GrowableArray<HistoEntry*>* profile = sorted_array(_counters, Bytecodes::number_of_codes);
duke@435	118	// print profile
duke@435	119	int tot = total_count(profile);
duke@435	120	int abs_sum = 0;
duke@435	121	tty->cr(); //0123456789012345678901234567890123456789012345678901234567890123456789
duke@435	122	tty->print_cr("Histogram of %d executed bytecodes:", tot);
duke@435	123	tty->cr();
duke@435	124	tty->print_cr(" absolute relative code name");
duke@435	125	tty->print_cr("----------------------------------------------------------------------");
duke@435	126	int i = profile->length();
duke@435	127	while (i-- > 0) {
duke@435	128	HistoEntry* e = profile->at(i);
duke@435	129	int abs = e->count();
duke@435	130	float rel = abs * 100.0F / tot;
duke@435	131	if (cutoff <= rel) {
duke@435	132	tty->print_cr("%10d %7.2f%% %02x %s", abs, rel, e->index(), name_for(e->index()));
duke@435	133	abs_sum += abs;
duke@435	134	}
duke@435	135	}
duke@435	136	tty->print_cr("----------------------------------------------------------------------");
duke@435	137	float rel_sum = abs_sum * 100.0F / tot;
duke@435	138	tty->print_cr("%10d %7.2f%% (cutoff = %.2f%%)", abs_sum, rel_sum, cutoff);
duke@435	139	tty->cr();
duke@435	140	}
duke@435	141
duke@435	142
duke@435	143	// Implementation of BytecodePairHistogram
duke@435	144
duke@435	145	int BytecodePairHistogram::_index;
duke@435	146	int BytecodePairHistogram::_counters[BytecodePairHistogram::number_of_pairs];
duke@435	147
duke@435	148
duke@435	149	void BytecodePairHistogram::reset() {
duke@435	150	_index = Bytecodes::_nop << log2_number_of_codes;
duke@435	151
duke@435	152	int i = number_of_pairs;
duke@435	153	while (i-- > 0) _counters[i] = 0;
duke@435	154	}
duke@435	155
duke@435	156
duke@435	157	void BytecodePairHistogram::print(float cutoff) {
duke@435	158	ResourceMark rm;
duke@435	159	GrowableArray<HistoEntry*>* profile = sorted_array(_counters, number_of_pairs);
duke@435	160	// print profile
duke@435	161	int tot = total_count(profile);
duke@435	162	int abs_sum = 0;
duke@435	163	tty->cr(); //0123456789012345678901234567890123456789012345678901234567890123456789
duke@435	164	tty->print_cr("Histogram of %d executed bytecode pairs:", tot);
duke@435	165	tty->cr();
duke@435	166	tty->print_cr(" absolute relative codes 1st bytecode 2nd bytecode");
duke@435	167	tty->print_cr("----------------------------------------------------------------------");
duke@435	168	int i = profile->length();
duke@435	169	while (i-- > 0) {
duke@435	170	HistoEntry* e = profile->at(i);
duke@435	171	int abs = e->count();
duke@435	172	float rel = abs * 100.0F / tot;
duke@435	173	if (cutoff <= rel) {
duke@435	174	int c1 = e->index() % number_of_codes;
duke@435	175	int c2 = e->index() / number_of_codes;
duke@435	176	tty->print_cr("%10d %6.3f%% %02x %02x %-19s %s", abs, rel, c1, c2, name_for(c1), name_for(c2));
duke@435	177	abs_sum += abs;
duke@435	178	}
duke@435	179	}
duke@435	180	tty->print_cr("----------------------------------------------------------------------");
duke@435	181	float rel_sum = abs_sum * 100.0F / tot;
duke@435	182	tty->print_cr("%10d %6.3f%% (cutoff = %.3f%%)", abs_sum, rel_sum, cutoff);
duke@435	183	tty->cr();
duke@435	184	}
duke@435	185
duke@435	186	#endif