< prev index next >

src/hotspot/share/gc/parallel/adjoiningVirtualSpaces.hpp

Print this page

        

*** 1,7 **** /* ! * Copyright (c) 2003, 2015, Oracle and/or its affiliates. All rights reserved. * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. * * This code is free software; you can redistribute it and/or modify it * under the terms of the GNU General Public License version 2 only, as * published by the Free Software Foundation. --- 1,7 ---- /* ! * Copyright (c) 2003, 2018, Oracle and/or its affiliates. All rights reserved. * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. * * This code is free software; you can redistribute it and/or modify it * under the terms of the GNU General Public License version 2 only, as * published by the Free Software Foundation.
*** 62,83 **** class AdjoiningVirtualSpaces : public CHeapObj<mtGC> { // space at the high end and the low end, respectively PSVirtualSpace* _high; PSVirtualSpace* _low; // The minimum byte size for the low space. It will not // be shrunk below this value. size_t _min_low_byte_size; // Same for the high space size_t _min_high_byte_size; const size_t _alignment; - protected: - // The reserved space spanned by the two spaces. - ReservedSpace _reserved_space; - public: // Allocates two virtual spaces that will be located at the // high and low ends. Does no initialization. AdjoiningVirtualSpaces(ReservedSpace rs, size_t min_low_byte_size, --- 62,83 ---- class AdjoiningVirtualSpaces : public CHeapObj<mtGC> { // space at the high end and the low end, respectively PSVirtualSpace* _high; PSVirtualSpace* _low; + protected: + // The reserved space spanned by the two spaces. + ReservedSpace _reserved_space; + // The minimum byte size for the low space. It will not // be shrunk below this value. size_t _min_low_byte_size; // Same for the high space size_t _min_high_byte_size; const size_t _alignment; public: // Allocates two virtual spaces that will be located at the // high and low ends. Does no initialization. AdjoiningVirtualSpaces(ReservedSpace rs, size_t min_low_byte_size,
< prev index next >