|
0
|
1 /*
|
|
|
2 * Copyright 2000-2005 Sun Microsystems, Inc. All Rights Reserved.
|
|
|
3 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
|
|
|
4 *
|
|
|
5 * This code is free software; you can redistribute it and/or modify it
|
|
|
6 * under the terms of the GNU General Public License version 2 only, as
|
|
|
7 * published by the Free Software Foundation.
|
|
|
8 *
|
|
|
9 * This code is distributed in the hope that it will be useful, but WITHOUT
|
|
|
10 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
|
|
|
11 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
|
|
|
12 * version 2 for more details (a copy is included in the LICENSE file that
|
|
|
13 * accompanied this code).
|
|
|
14 *
|
|
|
15 * You should have received a copy of the GNU General Public License version
|
|
|
16 * 2 along with this work; if not, write to the Free Software Foundation,
|
|
|
17 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
|
|
|
18 *
|
|
|
19 * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara,
|
|
|
20 * CA 95054 USA or visit www.sun.com if you need additional information or
|
|
|
21 * have any questions.
|
|
|
22 *
|
|
|
23 */
|
|
|
24
|
|
|
25 // All heaps contains a "permanent generation," containing permanent
|
|
|
26 // (reflective) objects. This is like a regular generation in some ways,
|
|
|
27 // but unlike one in others, and so is split apart.
|
|
|
28
|
|
|
29 class Generation;
|
|
|
30 class GenRemSet;
|
|
|
31 class CSpaceCounters;
|
|
|
32
|
|
|
33 // PermGen models the part of the heap
|
|
|
34
|
|
|
35 class PermGen : public CHeapObj {
|
|
|
36 friend class VMStructs;
|
|
|
37 protected:
|
|
|
38 size_t _capacity_expansion_limit; // maximum expansion allowed without a
|
|
|
39 // full gc occuring
|
|
|
40
|
|
|
41 public:
|
|
|
42 enum Name {
|
|
|
43 MarkSweepCompact, MarkSweep, ConcurrentMarkSweep
|
|
|
44 };
|
|
|
45
|
|
|
46 // Permanent allocation (initialized)
|
|
|
47 virtual HeapWord* mem_allocate(size_t size) = 0;
|
|
|
48
|
|
|
49 // Mark sweep support
|
|
|
50 virtual void compute_new_size() = 0;
|
|
|
51
|
|
|
52 // Ideally, we would use MI (IMHO) but we'll do delegation instead.
|
|
|
53 virtual Generation* as_gen() const = 0;
|
|
|
54
|
|
|
55 virtual void oop_iterate(OopClosure* cl) {
|
|
|
56 Generation* g = as_gen();
|
|
|
57 assert(g != NULL, "as_gen() NULL");
|
|
|
58 g->oop_iterate(cl);
|
|
|
59 }
|
|
|
60
|
|
|
61 virtual void object_iterate(ObjectClosure* cl) {
|
|
|
62 Generation* g = as_gen();
|
|
|
63 assert(g != NULL, "as_gen() NULL");
|
|
|
64 g->object_iterate(cl);
|
|
|
65 }
|
|
|
66
|
|
|
67 // Performance Counter support
|
|
|
68 virtual void update_counters() {
|
|
|
69 Generation* g = as_gen();
|
|
|
70 assert(g != NULL, "as_gen() NULL");
|
|
|
71 g->update_counters();
|
|
|
72 }
|
|
|
73 };
|
