duke@435: /* xdono@631: * Copyright 2001-2008 Sun Microsystems, Inc. All Rights Reserved. duke@435: * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. duke@435: * duke@435: * This code is free software; you can redistribute it and/or modify it duke@435: * under the terms of the GNU General Public License version 2 only, as duke@435: * published by the Free Software Foundation. duke@435: * duke@435: * This code is distributed in the hope that it will be useful, but WITHOUT duke@435: * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or duke@435: * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License duke@435: * version 2 for more details (a copy is included in the LICENSE file that duke@435: * accompanied this code). duke@435: * duke@435: * You should have received a copy of the GNU General Public License version duke@435: * 2 along with this work; if not, write to the Free Software Foundation, duke@435: * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. duke@435: * duke@435: * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara, duke@435: * CA 95054 USA or visit www.sun.com if you need additional information or duke@435: * have any questions. duke@435: * duke@435: */ duke@435: duke@435: // An ImmutableSpace is a viewport into a contiguous range duke@435: // (or subrange) of previously allocated objects. duke@435: duke@435: // Invariant: bottom() and end() are on page_size boundaries and duke@435: // bottom() <= end() duke@435: duke@435: class ImmutableSpace: public CHeapObj { duke@435: friend class VMStructs; duke@435: protected: duke@435: HeapWord* _bottom; duke@435: HeapWord* _end; duke@435: duke@435: public: duke@435: ImmutableSpace() { _bottom = NULL; _end = NULL; } duke@435: HeapWord* bottom() const { return _bottom; } duke@435: HeapWord* end() const { return _end; } duke@435: duke@435: MemRegion region() const { return MemRegion(bottom(), end()); } duke@435: duke@435: // Initialization duke@435: void initialize(MemRegion mr); duke@435: duke@435: bool contains(const void* p) const { return _bottom <= p && p < _end; } duke@435: duke@435: // Size computations. Sizes are in bytes. duke@435: size_t capacity_in_bytes() const { return capacity_in_words() * HeapWordSize; } duke@435: duke@435: // Size computations. Sizes are in heapwords. iveresov@808: size_t capacity_in_words() const { return pointer_delta(end(), bottom()); } iveresov@808: virtual size_t capacity_in_words(Thread*) const { return capacity_in_words(); } duke@435: duke@435: // Iteration. duke@435: virtual void oop_iterate(OopClosure* cl); duke@435: virtual void object_iterate(ObjectClosure* cl); duke@435: duke@435: // Debugging duke@435: virtual void print() const PRODUCT_RETURN; duke@435: virtual void print_short() const PRODUCT_RETURN; iveresov@625: virtual void verify(bool allow_dirty); duke@435: };