src/share/vm/gc_implementation/parallelScavenge/parMarkBitMap.hpp

*** 1,7 ****
  /*
!  * Copyright (c) 2005, 2009, 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) 2005, 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,29 ****
--- 20,35 ----
   * or visit www.oracle.com if you need additional information or have any
   * questions.
   *
   */
  
+ #ifndef SHARE_VM_GC_IMPLEMENTATION_PARALLELSCAVENGE_PARMARKBITMAP_HPP
+ #define SHARE_VM_GC_IMPLEMENTATION_PARALLELSCAVENGE_PARMARKBITMAP_HPP
+ 
+ #include "gc_implementation/parallelScavenge/psVirtualspace.hpp"
+ #include "utilities/bitMap.inline.hpp"
+ 
  class oopDesc;
  class ParMarkBitMapClosure;
  
  class ParMarkBitMap: public CHeapObj
  {
*** 424,428 ****
--- 430,436 ----
    // Allow one past the last valid address; useful for loop bounds.
    assert(addr >= region_start(), "addr too small");
    assert(addr <= region_start() + region_size(), "addr too big");
  }
  #endif  // #ifdef ASSERT
+ 
+ #endif // SHARE_VM_GC_IMPLEMENTATION_PARALLELSCAVENGE_PARMARKBITMAP_HPP