src/share/vm/memory/binaryTreeDictionary.cpp

rev 12310 : [mq]: gcinterface.patch

*** 21,45 ****
   * questions.
   *
   */
  
  #include "precompiled.hpp"
- #include "gc/cms/allocationStats.hpp"
  #include "gc/shared/spaceDecorator.hpp"
  #include "logging/logStream.inline.hpp"
  #include "memory/binaryTreeDictionary.hpp"
  #include "memory/freeBlockDictionary.hpp"
  #include "memory/freeList.hpp"
  #include "memory/metachunk.hpp"
  #include "memory/resourceArea.hpp"
  #include "runtime/globals.hpp"
  #include "utilities/macros.hpp"
  #include "utilities/ostream.hpp"
- #if INCLUDE_ALL_GCS
- #include "gc/cms/adaptiveFreeList.hpp"
- #include "gc/cms/freeChunk.hpp"
- #endif // INCLUDE_ALL_GCS
  
  ////////////////////////////////////////////////////////////////////////////////
  // A binary tree based search structure for free blocks.
  // This is currently used in the Concurrent Mark&Sweep implementation.
  ////////////////////////////////////////////////////////////////////////////////
--- 21,40 ----