src/share/vm/gc_implementation/g1/bufferingOopClosure.hpp

*** 1,7 ****
  /*
!  * Copyright (c) 2001, 2007, 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, 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,37 ----
   * or visit www.oracle.com if you need additional information or have any
   * questions.
   *
   */
  
+ #ifndef SHARE_VM_GC_IMPLEMENTATION_G1_BUFFERINGOOPCLOSURE_HPP
+ #define SHARE_VM_GC_IMPLEMENTATION_G1_BUFFERINGOOPCLOSURE_HPP
+ 
+ #include "memory/genOopClosures.hpp"
+ #include "memory/generation.hpp"
+ #include "runtime/os.hpp"
+ #include "utilities/taskqueue.hpp"
+ 
  // A BufferingOops closure tries to separate out the cost of finding roots
  // from the cost of applying closures to them.  It maintains an array of
  // ref-containing locations.  Until the array is full, applying the closure
  // to an oop* merely records that location in the array.  Since this
  // closure app cost is small, an elapsed timer can approximately attribute
*** 199,203 ****
--- 207,213 ----
      _oc(oc),
      _buffer_curr(_buffer), _buffer_top(_buffer + BufferLength),
      _hr_curr(_hr_buffer),
      _closure_app_seconds(0.0) { }
  };
+ 
+ #endif // SHARE_VM_GC_IMPLEMENTATION_G1_BUFFERINGOOPCLOSURE_HPP