Sat, 01 Dec 2007 00:00:00 +0000
Initial load
duke@435 | 1 | /* |
duke@435 | 2 | * Copyright 2001-2006 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 | CompactibleSpace* DefNewGeneration::first_compaction_space() const { |
duke@435 | 26 | return eden(); |
duke@435 | 27 | } |
duke@435 | 28 | |
duke@435 | 29 | HeapWord* DefNewGeneration::allocate(size_t word_size, |
duke@435 | 30 | bool is_tlab) { |
duke@435 | 31 | // This is the slow-path allocation for the DefNewGeneration. |
duke@435 | 32 | // Most allocations are fast-path in compiled code. |
duke@435 | 33 | // We try to allocate from the eden. If that works, we are happy. |
duke@435 | 34 | // Note that since DefNewGeneration supports lock-free allocation, we |
duke@435 | 35 | // have to use it here, as well. |
duke@435 | 36 | HeapWord* result = eden()->par_allocate(word_size); |
duke@435 | 37 | if (result != NULL) { |
duke@435 | 38 | return result; |
duke@435 | 39 | } |
duke@435 | 40 | do { |
duke@435 | 41 | HeapWord* old_limit = eden()->soft_end(); |
duke@435 | 42 | if (old_limit < eden()->end()) { |
duke@435 | 43 | // Tell the next generation we reached a limit. |
duke@435 | 44 | HeapWord* new_limit = |
duke@435 | 45 | next_gen()->allocation_limit_reached(eden(), eden()->top(), word_size); |
duke@435 | 46 | if (new_limit != NULL) { |
duke@435 | 47 | Atomic::cmpxchg_ptr(new_limit, eden()->soft_end_addr(), old_limit); |
duke@435 | 48 | } else { |
duke@435 | 49 | assert(eden()->soft_end() == eden()->end(), |
duke@435 | 50 | "invalid state after allocation_limit_reached returned null"); |
duke@435 | 51 | } |
duke@435 | 52 | } else { |
duke@435 | 53 | // The allocation failed and the soft limit is equal to the hard limit, |
duke@435 | 54 | // there are no reasons to do an attempt to allocate |
duke@435 | 55 | assert(old_limit == eden()->end(), "sanity check"); |
duke@435 | 56 | break; |
duke@435 | 57 | } |
duke@435 | 58 | // Try to allocate until succeeded or the soft limit can't be adjusted |
duke@435 | 59 | result = eden()->par_allocate(word_size); |
duke@435 | 60 | } while (result == NULL); |
duke@435 | 61 | |
duke@435 | 62 | // If the eden is full and the last collection bailed out, we are running |
duke@435 | 63 | // out of heap space, and we try to allocate the from-space, too. |
duke@435 | 64 | // allocate_from_space can't be inlined because that would introduce a |
duke@435 | 65 | // circular dependency at compile time. |
duke@435 | 66 | if (result == NULL) { |
duke@435 | 67 | result = allocate_from_space(word_size); |
duke@435 | 68 | } |
duke@435 | 69 | return result; |
duke@435 | 70 | } |
duke@435 | 71 | |
duke@435 | 72 | HeapWord* DefNewGeneration::par_allocate(size_t word_size, |
duke@435 | 73 | bool is_tlab) { |
duke@435 | 74 | return eden()->par_allocate(word_size); |
duke@435 | 75 | } |
duke@435 | 76 | |
duke@435 | 77 | void DefNewGeneration::gc_prologue(bool full) { |
duke@435 | 78 | // Ensure that _end and _soft_end are the same in eden space. |
duke@435 | 79 | eden()->set_soft_end(eden()->end()); |
duke@435 | 80 | } |
duke@435 | 81 | |
duke@435 | 82 | size_t DefNewGeneration::tlab_capacity() const { |
duke@435 | 83 | return eden()->capacity(); |
duke@435 | 84 | } |
duke@435 | 85 | |
duke@435 | 86 | size_t DefNewGeneration::unsafe_max_tlab_alloc() const { |
duke@435 | 87 | return unsafe_max_alloc_nogc(); |
duke@435 | 88 | } |