src/share/vm/memory/freeList.cpp

rev 8362 : 8079792: GC directory structure cleanup
Reviewed-by:

*** 1,7 ****
  /*
!  * Copyright (c) 2001, 2014, 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, 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.
*** 21,40 ****
   * questions.
   *
   */
  
  #include "precompiled.hpp"
! #include "gc_interface/collectedHeap.hpp"
  #include "memory/freeBlockDictionary.hpp"
  #include "memory/freeList.hpp"
  #include "memory/metachunk.hpp"
  #include "runtime/globals.hpp"
  #include "runtime/mutex.hpp"
  #include "runtime/vmThread.hpp"
  #include "utilities/macros.hpp"
  #if INCLUDE_ALL_GCS
! #include "gc_implementation/concurrentMarkSweep/freeChunk.hpp"
  #endif // INCLUDE_ALL_GCS
  
  // Free list.  A FreeList is used to access a linked list of chunks
  // of space in the heap.  The head and tail are maintained so that
  // items can be (as in the current implementation) added at the
--- 21,40 ----
   * questions.
   *
   */
  
  #include "precompiled.hpp"
! #include "gc/shared/collectedHeap.hpp"
  #include "memory/freeBlockDictionary.hpp"
  #include "memory/freeList.hpp"
  #include "memory/metachunk.hpp"
  #include "runtime/globals.hpp"
  #include "runtime/mutex.hpp"
  #include "runtime/vmThread.hpp"
  #include "utilities/macros.hpp"
  #if INCLUDE_ALL_GCS
! #include "gc/cms/freeChunk.hpp"
  #endif // INCLUDE_ALL_GCS
  
  // Free list.  A FreeList is used to access a linked list of chunks
  // of space in the heap.  The head and tail are maintained so that
  // items can be (as in the current implementation) added at the