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

src/share/vm/oops/oop.cpp@443791f333a2 (annotated)

src/share/vm/oops/oop.cpp

Tue, 14 Oct 2008 10:15:33 -0400

author

coleenp

date

Tue, 14 Oct 2008 10:15:33 -0400

changeset 833

443791f333a2

parent 631

d1605aabd0a1

child 1100

c89f86385056

permissions

-rw-r--r--

6700107: java/lang/Class/forName/TooManyDimensions.java crashes with SIGSEGV in c2 compiler with fastdebug
Summary: objArrayKlass::compute_modifier_flags was unnecessarily recursive
Reviewed-by: kamg

duke@435	1	/*
xdono@631	2	* Copyright 1997-2008 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/_oop.cpp.incl"
duke@435	27
duke@435	28	bool always_do_update_barrier = false;
duke@435	29
duke@435	30	BarrierSet* oopDesc::_bs = NULL;
duke@435	31
duke@435	32	#ifdef PRODUCT
duke@435	33	void oopDesc::print_on(outputStream* st) const {}
duke@435	34	void oopDesc::print_value_on(outputStream* st) const {}
duke@435	35	void oopDesc::print_address_on(outputStream* st) const {}
duke@435	36	char* oopDesc::print_value_string() { return NULL; }
duke@435	37	char* oopDesc::print_string() { return NULL; }
duke@435	38	void oopDesc::print() {}
duke@435	39	void oopDesc::print_value() {}
duke@435	40	void oopDesc::print_address() {}
duke@435	41	#else
duke@435	42	void oopDesc::print_on(outputStream* st) const {
duke@435	43	if (this == NULL) {
duke@435	44	st->print_cr("NULL");
duke@435	45	} else {
duke@435	46	blueprint()->oop_print_on(oop(this), st);
duke@435	47	}
duke@435	48	}
duke@435	49
duke@435	50	void oopDesc::print_value_on(outputStream* st) const {
duke@435	51	oop obj = oop(this);
duke@435	52	if (this == NULL) {
duke@435	53	st->print("NULL");
duke@435	54	} else if (java_lang_String::is_instance(obj)) {
duke@435	55	java_lang_String::print(obj, st);
duke@435	56	if (PrintOopAddress) print_address_on(st);
duke@435	57	#ifdef ASSERT
duke@435	58	} else if (!Universe::heap()->is_in(obj) || !Universe::heap()->is_in(klass())) {
duke@435	59	st->print("### BAD OOP %p ###", (address)obj);
duke@435	60	#endif
duke@435	61	} else {
duke@435	62	blueprint()->oop_print_value_on(obj, st);
duke@435	63	}
duke@435	64	}
duke@435	65
duke@435	66	void oopDesc::print_address_on(outputStream* st) const {
duke@435	67	if (PrintOopAddress) {
duke@435	68	st->print("{");
duke@435	69	if (PrintOopAddress) {
duke@435	70	st->print(INTPTR_FORMAT, this);
duke@435	71	}
duke@435	72	st->print("}");
duke@435	73	}
duke@435	74	}
duke@435	75
duke@435	76	void oopDesc::print() { print_on(tty); }
duke@435	77
duke@435	78	void oopDesc::print_value() { print_value_on(tty); }
duke@435	79
duke@435	80	void oopDesc::print_address() { print_address_on(tty); }
duke@435	81
duke@435	82	char* oopDesc::print_string() {
duke@435	83	stringStream* st = new stringStream();
duke@435	84	print_on(st);
duke@435	85	return st->as_string();
duke@435	86	}
duke@435	87
duke@435	88	char* oopDesc::print_value_string() {
duke@435	89	stringStream* st = new stringStream();
duke@435	90	print_value_on(st);
duke@435	91	return st->as_string();
duke@435	92	}
duke@435	93
duke@435	94	#endif // PRODUCT
duke@435	95
duke@435	96	void oopDesc::verify_on(outputStream* st) {
duke@435	97	if (this != NULL) {
duke@435	98	blueprint()->oop_verify_on(this, st);
duke@435	99	}
duke@435	100	}
duke@435	101
duke@435	102
duke@435	103	void oopDesc::verify() {
duke@435	104	verify_on(tty);
duke@435	105	}
duke@435	106
duke@435	107
coleenp@548	108	// XXX verify_old_oop doesn't do anything (should we remove?)
duke@435	109	void oopDesc::verify_old_oop(oop* p, bool allow_dirty) {
duke@435	110	blueprint()->oop_verify_old_oop(this, p, allow_dirty);
duke@435	111	}
duke@435	112
coleenp@548	113	void oopDesc::verify_old_oop(narrowOop* p, bool allow_dirty) {
coleenp@548	114	blueprint()->oop_verify_old_oop(this, p, allow_dirty);
coleenp@548	115	}
duke@435	116
duke@435	117	bool oopDesc::partially_loaded() {
duke@435	118	return blueprint()->oop_partially_loaded(this);
duke@435	119	}
duke@435	120
duke@435	121
duke@435	122	void oopDesc::set_partially_loaded() {
duke@435	123	blueprint()->oop_set_partially_loaded(this);
duke@435	124	}
duke@435	125
duke@435	126
duke@435	127	intptr_t oopDesc::slow_identity_hash() {
duke@435	128	// slow case; we have to acquire the micro lock in order to locate the header
duke@435	129	ResetNoHandleMark rnm; // Might be called from LEAF/QUICK ENTRY
duke@435	130	HandleMark hm;
duke@435	131	Handle object((oop)this);
duke@435	132	assert(!is_shared_readonly(), "using identity hash on readonly object?");
duke@435	133	return ObjectSynchronizer::identity_hash_value_for(object);
duke@435	134	}
duke@435	135
duke@435	136	VerifyOopClosure VerifyOopClosure::verify_oop;
coleenp@548	137
coleenp@548	138	void VerifyOopClosure::do_oop(oop* p) { VerifyOopClosure::do_oop_work(p); }
coleenp@548	139	void VerifyOopClosure::do_oop(narrowOop* p) { VerifyOopClosure::do_oop_work(p); }