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

src/share/vm/code/codeCache.hpp@a61af66fc99e (annotated)

src/share/vm/code/codeCache.hpp

Sat, 01 Dec 2007 00:00:00 +0000

author

duke

date

Sat, 01 Dec 2007 00:00:00 +0000

changeset 435

a61af66fc99e

child 542

93b6525e3b82

permissions

-rw-r--r--

Initial load

duke@435	1	/*
duke@435	2	* Copyright 1997-2007 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	// The CodeCache implements the code cache for various pieces of generated
duke@435	26	// code, e.g., compiled java methods, runtime stubs, transition frames, etc.
duke@435	27	// The entries in the CodeCache are all CodeBlob's.
duke@435	28
duke@435	29	// Implementation:
duke@435	30	// - Each CodeBlob occupies one chunk of memory.
duke@435	31	// - Like the offset table in oldspace the zone has at table for
duke@435	32	// locating a method given a addess of an instruction.
duke@435	33
duke@435	34	class OopClosure;
duke@435	35	class DepChange;
duke@435	36
duke@435	37	class CodeCache : AllStatic {
duke@435	38	friend class VMStructs;
duke@435	39	private:
duke@435	40	// CodeHeap is malloc()'ed at startup and never deleted during shutdown,
duke@435	41	// so that the generated assembly code is always there when it's needed.
duke@435	42	// This may cause memory leak, but is necessary, for now. See 4423824,
duke@435	43	// 4422213 or 4436291 for details.
duke@435	44	static CodeHeap * _heap;
duke@435	45	static int _number_of_blobs;
duke@435	46	static int _number_of_nmethods_with_dependencies;
duke@435	47	static bool _needs_cache_clean;
duke@435	48
duke@435	49	static void verify_if_often() PRODUCT_RETURN;
duke@435	50	public:
duke@435	51
duke@435	52	// Initialization
duke@435	53	static void initialize();
duke@435	54
duke@435	55	// Allocation/administration
duke@435	56	static CodeBlob* allocate(int size); // allocates a new CodeBlob
duke@435	57	static void commit(CodeBlob* cb); // called when the allocated CodeBlob has been filled
duke@435	58	static int alignment_unit(); // guaranteed alignment of all CodeBlobs
duke@435	59	static int alignment_offset(); // guaranteed offset of first CodeBlob byte within alignment unit (i.e., allocation header)
duke@435	60	static void free(CodeBlob* cb); // frees a CodeBlob
duke@435	61	static void flush(); // flushes all CodeBlobs
duke@435	62	static bool contains(void *p); // returns whether p is included
duke@435	63	static void blobs_do(void f(CodeBlob* cb)); // iterates over all CodeBlobs
duke@435	64	static void nmethods_do(void f(nmethod* nm)); // iterates over all nmethods
duke@435	65
duke@435	66	// Lookup
duke@435	67	static CodeBlob* find_blob(void* start);
duke@435	68	static nmethod* find_nmethod(void* start);
duke@435	69
duke@435	70	// Lookup that does not fail if you lookup a zombie method (if you call this, be sure to know
duke@435	71	// what you are doing)
duke@435	72	static CodeBlob* find_blob_unsafe(void* start) {
duke@435	73	CodeBlob* result = (CodeBlob*)_heap->find_start(start);
duke@435	74	assert(result == NULL || result->blob_contains((address)start), "found wrong CodeBlob");
duke@435	75	return result;
duke@435	76	}
duke@435	77
duke@435	78	// Iteration
duke@435	79	static CodeBlob* first();
duke@435	80	static CodeBlob* next (CodeBlob* cb);
duke@435	81	static CodeBlob* alive(CodeBlob *cb);
duke@435	82	static nmethod* alive_nmethod(CodeBlob *cb);
duke@435	83	static int nof_blobs() { return _number_of_blobs; }
duke@435	84
duke@435	85	// GC support
duke@435	86	static void gc_epilogue();
duke@435	87	static void gc_prologue();
duke@435	88	// If "unloading_occurred" is true, then unloads (i.e., breaks root links
duke@435	89	// to) any unmarked codeBlobs in the cache. Sets "marked_for_unloading"
duke@435	90	// to "true" iff some code got unloaded.
duke@435	91	static void do_unloading(BoolObjectClosure* is_alive,
duke@435	92	OopClosure* keep_alive,
duke@435	93	bool unloading_occurred);
duke@435	94	static void oops_do(OopClosure* f);
duke@435	95
duke@435	96	// Printing/debugging
duke@435	97	static void print() PRODUCT_RETURN; // prints summary
duke@435	98	static void print_internals();
duke@435	99	static void verify(); // verifies the code cache
duke@435	100
duke@435	101	// The full limits of the codeCache
duke@435	102	static address low_bound() { return (address) _heap->low_boundary(); }
duke@435	103	static address high_bound() { return (address) _heap->high_boundary(); }
duke@435	104
duke@435	105	// Profiling
duke@435	106	static address first_address(); // first address used for CodeBlobs
duke@435	107	static address last_address(); // last address used for CodeBlobs
duke@435	108	static size_t capacity() { return _heap->capacity(); }
duke@435	109	static size_t max_capacity() { return _heap->max_capacity(); }
duke@435	110	static size_t unallocated_capacity() { return _heap->unallocated_capacity(); }
duke@435	111
duke@435	112	static bool needs_cache_clean() { return _needs_cache_clean; }
duke@435	113	static void set_needs_cache_clean(bool v) { _needs_cache_clean = v; }
duke@435	114	static void clear_inline_caches(); // clear all inline caches
duke@435	115
duke@435	116	// Deoptimization
duke@435	117	static int mark_for_deoptimization(DepChange& changes);
duke@435	118	#ifdef HOTSWAP
duke@435	119	static int mark_for_evol_deoptimization(instanceKlassHandle dependee);
duke@435	120	#endif // HOTSWAP
duke@435	121
duke@435	122	static void mark_all_nmethods_for_deoptimization();
duke@435	123	static int mark_for_deoptimization(methodOop dependee);
duke@435	124	static void make_marked_nmethods_zombies();
duke@435	125	static void make_marked_nmethods_not_entrant();
duke@435	126
duke@435	127	// tells how many nmethods have dependencies
duke@435	128	static int number_of_nmethods_with_dependencies();
duke@435	129	};