0N/A/*
1879N/A * Copyright (c) 2002, 2010, Oracle and/or its affiliates. All rights reserved.
0N/A * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
0N/A *
0N/A * This code is free software; you can redistribute it and/or modify it
0N/A * under the terms of the GNU General Public License version 2 only, as
0N/A * published by the Free Software Foundation.
0N/A *
0N/A * This code is distributed in the hope that it will be useful, but WITHOUT
0N/A * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
0N/A * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
0N/A * version 2 for more details (a copy is included in the LICENSE file that
0N/A * accompanied this code).
0N/A *
0N/A * You should have received a copy of the GNU General Public License version
0N/A * 2 along with this work; if not, write to the Free Software Foundation,
0N/A * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
0N/A *
1472N/A * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
1472N/A * or visit www.oracle.com if you need additional information or have any
1472N/A * questions.
0N/A *
0N/A */
0N/A
1879N/A#ifndef SHARE_VM_GC_IMPLEMENTATION_PARALLELSCAVENGE_PSPROMOTIONLAB_HPP
1879N/A#define SHARE_VM_GC_IMPLEMENTATION_PARALLELSCAVENGE_PSPROMOTIONLAB_HPP
1879N/A
1879N/A#include "gc_implementation/parallelScavenge/objectStartArray.hpp"
1879N/A#include "memory/allocation.hpp"
1879N/A
0N/A//
0N/A// PSPromotionLAB is a parallel scavenge promotion lab. This class acts very
0N/A// much like a MutableSpace. We couldn't embed a MutableSpace, though, as
0N/A// it has a considerable number of asserts and invariants that are violated.
0N/A//
0N/A
0N/Aclass ObjectStartArray;
0N/A
3863N/Aclass PSPromotionLAB : public CHeapObj<mtGC> {
0N/A protected:
113N/A static size_t filler_header_size;
0N/A
0N/A enum LabState {
0N/A needs_flush,
0N/A flushed,
0N/A zero_size
0N/A };
0N/A
0N/A HeapWord* _top;
0N/A HeapWord* _bottom;
0N/A HeapWord* _end;
0N/A LabState _state;
0N/A
0N/A void set_top(HeapWord* value) { _top = value; }
0N/A void set_bottom(HeapWord* value) { _bottom = value; }
0N/A void set_end(HeapWord* value) { _end = value; }
0N/A
0N/A // The shared initialize code invokes this.
0N/A debug_only(virtual bool lab_is_valid(MemRegion lab) { return false; });
0N/A
0N/A PSPromotionLAB() : _top(NULL), _bottom(NULL), _end(NULL) { }
0N/A
0N/A public:
0N/A // Filling and flushing.
0N/A void initialize(MemRegion lab);
0N/A
0N/A virtual void flush();
0N/A
0N/A // Accessors
0N/A HeapWord* bottom() const { return _bottom; }
0N/A HeapWord* end() const { return _end; }
0N/A HeapWord* top() const { return _top; }
0N/A
0N/A bool is_flushed() { return _state == flushed; }
0N/A
2821N/A bool unallocate_object(HeapWord* obj, size_t obj_size);
0N/A
0N/A // Returns a subregion containing all objects in this space.
0N/A MemRegion used_region() { return MemRegion(bottom(), top()); }
0N/A
0N/A // Boolean querries.
0N/A bool is_empty() const { return used() == 0; }
0N/A bool not_empty() const { return used() > 0; }
0N/A bool contains(const void* p) const { return _bottom <= p && p < _end; }
0N/A
0N/A // Size computations. Sizes are in bytes.
0N/A size_t capacity() const { return byte_size(bottom(), end()); }
0N/A size_t used() const { return byte_size(bottom(), top()); }
0N/A size_t free() const { return byte_size(top(), end()); }
0N/A};
0N/A
0N/Aclass PSYoungPromotionLAB : public PSPromotionLAB {
0N/A public:
0N/A PSYoungPromotionLAB() { }
0N/A
0N/A // Not MT safe
0N/A HeapWord* allocate(size_t size) {
0N/A // Can't assert this, when young fills, we keep the LAB around, but flushed.
0N/A // assert(_state != flushed, "Sanity");
0N/A HeapWord* obj = top();
0N/A HeapWord* new_top = obj + size;
0N/A // The 'new_top>obj' check is needed to detect overflow of obj+size.
0N/A if (new_top > obj && new_top <= end()) {
0N/A set_top(new_top);
0N/A assert(is_object_aligned((intptr_t)obj) && is_object_aligned((intptr_t)new_top),
0N/A "checking alignment");
0N/A return obj;
0N/A }
0N/A
0N/A return NULL;
0N/A }
0N/A
0N/A debug_only(virtual bool lab_is_valid(MemRegion lab));
0N/A};
0N/A
0N/Aclass PSOldPromotionLAB : public PSPromotionLAB {
0N/A private:
0N/A ObjectStartArray* _start_array;
0N/A
0N/A public:
0N/A PSOldPromotionLAB() : _start_array(NULL) { }
0N/A PSOldPromotionLAB(ObjectStartArray* start_array) : _start_array(start_array) { }
0N/A
0N/A void set_start_array(ObjectStartArray* start_array) { _start_array = start_array; }
0N/A
0N/A void flush();
0N/A
0N/A // Not MT safe
0N/A HeapWord* allocate(size_t size) {
0N/A // Cannot test for this now that we're doing promotion failures
0N/A // assert(_state != flushed, "Sanity");
0N/A assert(_start_array != NULL, "Sanity");
0N/A HeapWord* obj = top();
0N/A HeapWord* new_top = obj + size;
0N/A // The 'new_top>obj' check is needed to detect overflow of obj+size.
0N/A if (new_top > obj && new_top <= end()) {
0N/A set_top(new_top);
0N/A assert(is_object_aligned((intptr_t)obj) && is_object_aligned((intptr_t)new_top),
0N/A "checking alignment");
0N/A _start_array->allocate_block(obj);
0N/A return obj;
0N/A }
0N/A
0N/A return NULL;
0N/A }
0N/A
0N/A debug_only(virtual bool lab_is_valid(MemRegion lab));
0N/A};
1879N/A
1879N/A#endif // SHARE_VM_GC_IMPLEMENTATION_PARALLELSCAVENGE_PSPROMOTIONLAB_HPP