1 /*
2 * Copyright (c) 2007, Oracle and/or its affiliates. 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 Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
20 * or visit www.oracle.com if you need additional information or have any
21 * questions.
22 *
23 */
24
25 class CardTableRS; // fwd decl
26 class ConcurrentMarkSweepGeneration;
27
28 // A PermGen implemented with a CMS space, collected by a CMS collector.
29 class CMSPermGen: public PermGen {
30 friend class VMStructs;
31
32 protected:
33 // The "generation" view.
34 ConcurrentMarkSweepGeneration* _gen;
35
36 public:
37 CMSPermGen(ReservedSpace rs, size_t initial_byte_size,
38 CardTableRS* ct, FreeBlockDictionary::DictionaryChoice);
39
40 HeapWord* mem_allocate(size_t size);
41
42 void compute_new_size();
43
44 Generation* as_gen() const { return _gen; }
54 // See comments in the constructor for CompactibleFreeListSpace
55 // regarding not using adaptive free lists for a perm gen.
56 ConcurrentMarkSweepGeneration(rs, initial_byte_size, // MinPermHeapExapnsion
57 level, ct, false /* use adaptive freelists */,
58 (FreeBlockDictionary::DictionaryChoice)CMSDictionaryChoice)
59 {}
60
61 void initialize_performance_counters();
62
63 const char* name() const {
64 return "concurrent-mark-sweep perm gen";
65 }
66
67 const char* short_name() const {
68 return "CMS Perm";
69 }
70
71 bool must_be_youngest() const { return false; }
72 bool must_be_oldest() const { return false; }
73 };
|
1 /*
2 * Copyright (c) 2007, 2010, Oracle and/or its affiliates. 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 Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
20 * or visit www.oracle.com if you need additional information or have any
21 * questions.
22 *
23 */
24
25 #ifndef SHARE_VM_GC_IMPLEMENTATION_CONCURRENTMARKSWEEP_CMSPERMGEN_HPP
26 #define SHARE_VM_GC_IMPLEMENTATION_CONCURRENTMARKSWEEP_CMSPERMGEN_HPP
27
28 #include "gc_implementation/concurrentMarkSweep/concurrentMarkSweepGeneration.hpp"
29 #include "memory/permGen.hpp"
30
31 class CardTableRS; // fwd decl
32 class ConcurrentMarkSweepGeneration;
33
34 // A PermGen implemented with a CMS space, collected by a CMS collector.
35 class CMSPermGen: public PermGen {
36 friend class VMStructs;
37
38 protected:
39 // The "generation" view.
40 ConcurrentMarkSweepGeneration* _gen;
41
42 public:
43 CMSPermGen(ReservedSpace rs, size_t initial_byte_size,
44 CardTableRS* ct, FreeBlockDictionary::DictionaryChoice);
45
46 HeapWord* mem_allocate(size_t size);
47
48 void compute_new_size();
49
50 Generation* as_gen() const { return _gen; }
60 // See comments in the constructor for CompactibleFreeListSpace
61 // regarding not using adaptive free lists for a perm gen.
62 ConcurrentMarkSweepGeneration(rs, initial_byte_size, // MinPermHeapExapnsion
63 level, ct, false /* use adaptive freelists */,
64 (FreeBlockDictionary::DictionaryChoice)CMSDictionaryChoice)
65 {}
66
67 void initialize_performance_counters();
68
69 const char* name() const {
70 return "concurrent-mark-sweep perm gen";
71 }
72
73 const char* short_name() const {
74 return "CMS Perm";
75 }
76
77 bool must_be_youngest() const { return false; }
78 bool must_be_oldest() const { return false; }
79 };
80
81 #endif // SHARE_VM_GC_IMPLEMENTATION_CONCURRENTMARKSWEEP_CMSPERMGEN_HPP
|