src/share/vm/gc_implementation/concurrentMarkSweep/binaryTreeDictionary.cpp
Print this page
*** 1,7 ****
/*
! * Copyright (c) 2001, 2008, 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) 2001, 2010, 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.
*** 20,31 ****
* or visit www.oracle.com if you need additional information or have any
* questions.
*
*/
! # include "incls/_precompiled.incl"
! # include "incls/_binaryTreeDictionary.cpp.incl"
////////////////////////////////////////////////////////////////////////////////
// A binary tree based search structure for free blocks.
// This is currently used in the Concurrent Mark&Sweep implementation.
////////////////////////////////////////////////////////////////////////////////
--- 20,36 ----
* or visit www.oracle.com if you need additional information or have any
* questions.
*
*/
! #include "precompiled.hpp"
! #include "gc_implementation/concurrentMarkSweep/binaryTreeDictionary.hpp"
! #include "gc_implementation/shared/allocationStats.hpp"
! #include "gc_implementation/shared/spaceDecorator.hpp"
! #include "memory/space.inline.hpp"
! #include "runtime/globals.hpp"
! #include "utilities/ostream.hpp"
////////////////////////////////////////////////////////////////////////////////
// A binary tree based search structure for free blocks.
// This is currently used in the Concurrent Mark&Sweep implementation.
////////////////////////////////////////////////////////////////////////////////