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 #include "precompiled.hpp" 26 #include "gc_implementation/concurrentMarkSweep/cmsPermGen.hpp" 27 #include "gc_implementation/concurrentMarkSweep/concurrentMarkSweepGeneration.inline.hpp" 28 #include "gc_implementation/shared/cSpaceCounters.hpp" 29 #include "gc_interface/collectedHeap.inline.hpp" 30 #include "memory/blockOffsetTable.inline.hpp" 31 #include "memory/compactPermGen.hpp" 32 #include "memory/genCollectedHeap.hpp" 33 #include "memory/generation.inline.hpp" 34 #include "memory/permGen.hpp" 35 #include "memory/universe.hpp" 36 #include "oops/oop.inline.hpp" 37 #include "runtime/java.hpp" 38 39 CMSPermGen::CMSPermGen(ReservedSpace rs, size_t initial_byte_size, 40 CardTableRS* ct, 41 FreeBlockDictionary::DictionaryChoice dictionaryChoice) { 42 CMSPermGenGen* g = 43 new CMSPermGenGen(rs, initial_byte_size, -1, ct); 44 if (g == NULL) { 45 vm_exit_during_initialization("Could not allocate a CompactingPermGen"); 46 } 47 48 g->initialize_performance_counters(); 49 50 _gen = g; 51 } 52 53 HeapWord* CMSPermGen::mem_allocate(size_t size) { 54 Mutex* lock = _gen->freelistLock(); 55 bool lock_owned = lock->owned_by_self(); 56 if (lock_owned) { 57 MutexUnlocker mul(lock); 58 return mem_allocate_in_gen(size, _gen); 59 } else { 60 return mem_allocate_in_gen(size, _gen); 61 } 62 } 63 64 HeapWord* CMSPermGen::request_expand_and_allocate(Generation* gen, 65 size_t size, 66 GCCause::Cause prev_cause /* ignored */) { 67 HeapWord* obj = gen->expand_and_allocate(size, false); 68 if (gen->capacity() >= _capacity_expansion_limit) { 69 set_capacity_expansion_limit(gen->capacity() + MaxPermHeapExpansion); 70 assert(((ConcurrentMarkSweepGeneration*)gen)->should_concurrent_collect(), 71 "Should kick off a collection if one not in progress"); 72 } 73 return obj; 74 } 75 76 void CMSPermGen::compute_new_size() { 77 _gen->compute_new_size(); 78 } 79 80 void CMSPermGenGen::initialize_performance_counters() { 81 82 const char* gen_name = "perm"; 83 84 // Generation Counters - generation 2, 1 subspace 85 _gen_counters = new GenerationCounters(gen_name, 2, 1, &_virtual_space); 86 87 _gc_counters = NULL; 88 89 _space_counters = new GSpaceCounters(gen_name, 0, 90 _virtual_space.reserved_size(), 91 this, _gen_counters); 92 }