src/share/vm/memory/binaryTreeDictionary.cpp

rev 8362 : [mq]: hotspot

@@ -1,7 +1,7 @@
 /*
- * Copyright (c) 2001, 2014, Oracle and/or its affiliates. All rights reserved.
+ * 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,23 +21,22 @@
  * questions.
  *
  */
 
 #include "precompiled.hpp"
-#include "gc_implementation/shared/allocationStats.hpp"
-#include "gc_implementation/shared/spaceDecorator.hpp"
+#include "gc/shared/allocationStats.hpp"
+#include "gc/shared/spaceDecorator.hpp"
 #include "memory/binaryTreeDictionary.hpp"
-#include "memory/freeList.hpp"
 #include "memory/freeBlockDictionary.hpp"
+#include "memory/freeList.hpp"
 #include "memory/metachunk.hpp"
 #include "runtime/globals.hpp"
-#include "utilities/ostream.hpp"
 #include "utilities/macros.hpp"
+#include "utilities/ostream.hpp"
 #if INCLUDE_ALL_GCS
-#include "gc_implementation/concurrentMarkSweep/adaptiveFreeList.hpp"
-#include "gc_implementation/concurrentMarkSweep/freeChunk.hpp"
-#include "gc_implementation/concurrentMarkSweep/freeChunk.hpp"
+#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.