1.1 --- a/src/share/vm/gc_implementation/concurrentMarkSweep/binaryTreeDictionary.hpp Tue Nov 23 15:01:43 2010 -0500
1.2 +++ b/src/share/vm/gc_implementation/concurrentMarkSweep/binaryTreeDictionary.hpp Tue Nov 23 13:22:55 2010 -0800
1.3 @@ -1,5 +1,5 @@
1.4 /*
1.5 - * Copyright (c) 2001, 2008, Oracle and/or its affiliates. All rights reserved.
1.6 + * Copyright (c) 2001, 2010, Oracle and/or its affiliates. All rights reserved.
1.7 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
1.8 *
1.9 * This code is free software; you can redistribute it and/or modify it
1.10 @@ -22,6 +22,12 @@
1.11 *
1.12 */
1.13
1.14 +#ifndef SHARE_VM_GC_IMPLEMENTATION_CONCURRENTMARKSWEEP_BINARYTREEDICTIONARY_HPP
1.15 +#define SHARE_VM_GC_IMPLEMENTATION_CONCURRENTMARKSWEEP_BINARYTREEDICTIONARY_HPP
1.16 +
1.17 +#include "gc_implementation/concurrentMarkSweep/freeBlockDictionary.hpp"
1.18 +#include "gc_implementation/concurrentMarkSweep/freeList.hpp"
1.19 +
1.20 /*
1.21 * A binary tree based search structure for free blocks.
1.22 * This is currently used in the Concurrent Mark&Sweep implementation.
1.23 @@ -286,3 +292,5 @@
1.24
1.25 void verify() const;
1.26 };
1.27 +
1.28 +#endif // SHARE_VM_GC_IMPLEMENTATION_CONCURRENTMARKSWEEP_BINARYTREEDICTIONARY_HPP
