< prev index next >

src/share/vm/memory/binaryTreeDictionary.hpp

Print this page




  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 #ifndef SHARE_VM_MEMORY_BINARYTREEDICTIONARY_HPP
  26 #define SHARE_VM_MEMORY_BINARYTREEDICTIONARY_HPP
  27 
  28 #include "memory/freeBlockDictionary.hpp"
  29 #include "memory/freeList.hpp"

  30 
  31 /*
  32  * A binary tree based search structure for free blocks.
  33  * This is currently used in the Concurrent Mark&Sweep implementation, but
  34  * will be used for free block management for metadata.
  35  */
  36 
  37 // A TreeList is a FreeList which can be used to maintain a
  38 // binary tree of free lists.
  39 
  40 template <class Chunk_t, class FreeList_t> class TreeChunk;
  41 template <class Chunk_t, class FreeList_t> class BinaryTreeDictionary;
  42 template <class Chunk_t, class FreeList_t> class AscendTreeCensusClosure;
  43 template <class Chunk_t, class FreeList_t> class DescendTreeCensusClosure;
  44 template <class Chunk_t, class FreeList_t> class DescendTreeSearchClosure;
  45 
  46 class FreeChunk;
  47 template <class> class AdaptiveFreeList;
  48 typedef BinaryTreeDictionary<FreeChunk, AdaptiveFreeList<FreeChunk> > AFLBinaryTreeDictionary;
  49 




  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 #ifndef SHARE_VM_MEMORY_BINARYTREEDICTIONARY_HPP
  26 #define SHARE_VM_MEMORY_BINARYTREEDICTIONARY_HPP
  27 
  28 #include "memory/freeBlockDictionary.hpp"
  29 #include "memory/freeList.hpp"
  30 #include "memory/memRegion.hpp"
  31 
  32 /*
  33  * A binary tree based search structure for free blocks.
  34  * This is currently used in the Concurrent Mark&Sweep implementation, but
  35  * will be used for free block management for metadata.
  36  */
  37 
  38 // A TreeList is a FreeList which can be used to maintain a
  39 // binary tree of free lists.
  40 
  41 template <class Chunk_t, class FreeList_t> class TreeChunk;
  42 template <class Chunk_t, class FreeList_t> class BinaryTreeDictionary;
  43 template <class Chunk_t, class FreeList_t> class AscendTreeCensusClosure;
  44 template <class Chunk_t, class FreeList_t> class DescendTreeCensusClosure;
  45 template <class Chunk_t, class FreeList_t> class DescendTreeSearchClosure;
  46 
  47 class FreeChunk;
  48 template <class> class AdaptiveFreeList;
  49 typedef BinaryTreeDictionary<FreeChunk, AdaptiveFreeList<FreeChunk> > AFLBinaryTreeDictionary;
  50 


< prev index next >