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

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

src/share/vm/code/codeCache.hpp

Wed, 02 Jun 2010 22:45:42 -0700

author

jrose

date

Wed, 02 Jun 2010 22:45:42 -0700

changeset 1934

e9ff18c4ace7

parent 1907

c18cbe5936b8

child 1999

2a47bd84841f

permissions

-rw-r--r--

Merge

duke@435	1	/*
trims@1907	2	* Copyright (c) 1997, 2008, 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
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;
jrose@1424	48	static nmethod* _scavenge_root_nmethods; // linked via nm->scavenge_root_link()
kvn@1637	49	static nmethod* _saved_nmethods; // linked via nm->saved_nmethod_look()
duke@435	50
duke@435	51	static void verify_if_often() PRODUCT_RETURN;
jrose@1424	52
jrose@1424	53	static void mark_scavenge_root_nmethods() PRODUCT_RETURN;
jrose@1424	54	static void verify_perm_nmethods(CodeBlobClosure* f_or_null) PRODUCT_RETURN;
jrose@1424	55
duke@435	56	public:
duke@435	57
duke@435	58	// Initialization
duke@435	59	static void initialize();
duke@435	60
duke@435	61	// Allocation/administration
duke@435	62	static CodeBlob* allocate(int size); // allocates a new CodeBlob
duke@435	63	static void commit(CodeBlob* cb); // called when the allocated CodeBlob has been filled
duke@435	64	static int alignment_unit(); // guaranteed alignment of all CodeBlobs
duke@435	65	static int alignment_offset(); // guaranteed offset of first CodeBlob byte within alignment unit (i.e., allocation header)
duke@435	66	static void free(CodeBlob* cb); // frees a CodeBlob
duke@435	67	static void flush(); // flushes all CodeBlobs
duke@435	68	static bool contains(void *p); // returns whether p is included
duke@435	69	static void blobs_do(void f(CodeBlob* cb)); // iterates over all CodeBlobs
jrose@1424	70	static void blobs_do(CodeBlobClosure* f); // iterates over all CodeBlobs
duke@435	71	static void nmethods_do(void f(nmethod* nm)); // iterates over all nmethods
duke@435	72
duke@435	73	// Lookup
duke@435	74	static CodeBlob* find_blob(void* start);
duke@435	75	static nmethod* find_nmethod(void* start);
duke@435	76
duke@435	77	// Lookup that does not fail if you lookup a zombie method (if you call this, be sure to know
duke@435	78	// what you are doing)
duke@435	79	static CodeBlob* find_blob_unsafe(void* start) {
duke@435	80	CodeBlob* result = (CodeBlob*)_heap->find_start(start);
sgoldman@542	81	// this assert is too strong because the heap code will return the
sgoldman@542	82	// heapblock containing start. That block can often be larger than
sgoldman@542	83	// the codeBlob itself. If you look up an address that is within
sgoldman@542	84	// the heapblock but not in the codeBlob you will assert.
sgoldman@542	85	//
sgoldman@542	86	// Most things will not lookup such bad addresses. However
sgoldman@542	87	// AsyncGetCallTrace can see intermediate frames and get that kind
sgoldman@542	88	// of invalid address and so can a developer using hsfind.
sgoldman@542	89	//
sgoldman@542	90	// The more correct answer is to return NULL if blob_contains() returns
sgoldman@542	91	// false.
sgoldman@542	92	// assert(result == NULL || result->blob_contains((address)start), "found wrong CodeBlob");
sgoldman@542	93
sgoldman@542	94	if (result != NULL && !result->blob_contains((address)start)) {
sgoldman@542	95	result = NULL;
sgoldman@542	96	}
duke@435	97	return result;
duke@435	98	}
duke@435	99
duke@435	100	// Iteration
duke@435	101	static CodeBlob* first();
duke@435	102	static CodeBlob* next (CodeBlob* cb);
duke@435	103	static CodeBlob* alive(CodeBlob *cb);
duke@435	104	static nmethod* alive_nmethod(CodeBlob *cb);
never@1893	105	static nmethod* first_nmethod();
never@1893	106	static nmethod* next_nmethod (CodeBlob* cb);
duke@435	107	static int nof_blobs() { return _number_of_blobs; }
duke@435	108
duke@435	109	// GC support
duke@435	110	static void gc_epilogue();
duke@435	111	static void gc_prologue();
duke@435	112	// If "unloading_occurred" is true, then unloads (i.e., breaks root links
duke@435	113	// to) any unmarked codeBlobs in the cache. Sets "marked_for_unloading"
duke@435	114	// to "true" iff some code got unloaded.
duke@435	115	static void do_unloading(BoolObjectClosure* is_alive,
duke@435	116	OopClosure* keep_alive,
duke@435	117	bool unloading_occurred);
jrose@1424	118	static void oops_do(OopClosure* f) {
jrose@1424	119	CodeBlobToOopClosure oopc(f, /*do_marking=*/ false);
jrose@1424	120	blobs_do(&oopc);
jrose@1424	121	}
jrose@1424	122	static void asserted_non_scavengable_nmethods_do(CodeBlobClosure* f = NULL) PRODUCT_RETURN;
jrose@1424	123	static void scavenge_root_nmethods_do(CodeBlobClosure* f);
jrose@1424	124
jrose@1424	125	static nmethod* scavenge_root_nmethods() { return _scavenge_root_nmethods; }
jrose@1424	126	static void set_scavenge_root_nmethods(nmethod* nm) { _scavenge_root_nmethods = nm; }
jrose@1424	127	static void add_scavenge_root_nmethod(nmethod* nm);
jrose@1424	128	static void drop_scavenge_root_nmethod(nmethod* nm);
jrose@1424	129	static void prune_scavenge_root_nmethods();
duke@435	130
duke@435	131	// Printing/debugging
duke@435	132	static void print() PRODUCT_RETURN; // prints summary
duke@435	133	static void print_internals();
duke@435	134	static void verify(); // verifies the code cache
jrose@1424	135	static void print_trace(const char* event, CodeBlob* cb, int size = 0) PRODUCT_RETURN;
duke@435	136
duke@435	137	// The full limits of the codeCache
duke@435	138	static address low_bound() { return (address) _heap->low_boundary(); }
duke@435	139	static address high_bound() { return (address) _heap->high_boundary(); }
duke@435	140
duke@435	141	// Profiling
duke@435	142	static address first_address(); // first address used for CodeBlobs
duke@435	143	static address last_address(); // last address used for CodeBlobs
duke@435	144	static size_t capacity() { return _heap->capacity(); }
duke@435	145	static size_t max_capacity() { return _heap->max_capacity(); }
duke@435	146	static size_t unallocated_capacity() { return _heap->unallocated_capacity(); }
kvn@1637	147	static bool needs_flushing() { return unallocated_capacity() < CodeCacheFlushingMinimumFreeSpace; }
duke@435	148
duke@435	149	static bool needs_cache_clean() { return _needs_cache_clean; }
duke@435	150	static void set_needs_cache_clean(bool v) { _needs_cache_clean = v; }
duke@435	151	static void clear_inline_caches(); // clear all inline caches
duke@435	152
kvn@1637	153	static nmethod* find_and_remove_saved_code(methodOop m);
kvn@1637	154	static void remove_saved_code(nmethod* nm);
kvn@1637	155	static void speculatively_disconnect(nmethod* nm);
kvn@1637	156
duke@435	157	// Deoptimization
duke@435	158	static int mark_for_deoptimization(DepChange& changes);
duke@435	159	#ifdef HOTSWAP
duke@435	160	static int mark_for_evol_deoptimization(instanceKlassHandle dependee);
duke@435	161	#endif // HOTSWAP
duke@435	162
duke@435	163	static void mark_all_nmethods_for_deoptimization();
duke@435	164	static int mark_for_deoptimization(methodOop dependee);
duke@435	165	static void make_marked_nmethods_zombies();
duke@435	166	static void make_marked_nmethods_not_entrant();
duke@435	167
duke@435	168	// tells how many nmethods have dependencies
duke@435	169	static int number_of_nmethods_with_dependencies();
duke@435	170	};