< prev index next >

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

Print this page
rev 8362 : [mq]: hotspot
   1 /*
   2  * Copyright (c) 2001, 2014, Oracle and/or its affiliates. All rights reserved.
   3  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
   4  *
   5  * This code is free software; you can redistribute it and/or modify it
   6  * under the terms of the GNU General Public License version 2 only, as
   7  * published by the Free Software Foundation.
   8  *
   9  * This code is distributed in the hope that it will be useful, but WITHOUT
  10  * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
  11  * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
  12  * version 2 for more details (a copy is included in the LICENSE file that
  13  * accompanied this code).
  14  *
  15  * You should have received a copy of the GNU General Public License version
  16  * 2 along with this work; if not, write to the Free Software Foundation,
  17  * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
  18  *
  19  * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
  20  * or visit www.oracle.com if you need additional information or have any
  21  * questions.
  22  *
  23  */
  24 
  25 #ifndef SHARE_VM_GC_IMPLEMENTATION_G1_BUFFERINGOOPCLOSURE_HPP
  26 #define SHARE_VM_GC_IMPLEMENTATION_G1_BUFFERINGOOPCLOSURE_HPP
  27 
  28 #include "memory/iterator.hpp"
  29 #include "oops/oopsHierarchy.hpp"
  30 #include "runtime/os.hpp"
  31 #include "utilities/debug.hpp"
  32 
  33 // A BufferingOops closure tries to separate out the cost of finding roots
  34 // from the cost of applying closures to them.  It maintains an array of
  35 // ref-containing locations.  Until the array is full, applying the closure
  36 // to an oop* merely records that location in the array.  Since this
  37 // closure app cost is small, an elapsed timer can approximately attribute
  38 // all of this cost to the cost of finding the roots.  When the array fills
  39 // up, the wrapped closure is applied to all elements, keeping track of
  40 // this elapsed time of this process, and leaving the array empty.
  41 // The caller must be sure to call "done" to process any unprocessed
  42 // buffered entries.
  43 
  44 class BufferingOopClosure: public OopClosure {
  45   friend class TestBufferingOopClosure;
  46 protected:


 124     add_oop(p);
 125   }
 126 
 127   void done() {
 128     if (!is_buffer_empty()) {
 129       process_buffer();
 130     }
 131   }
 132 
 133   double closure_app_seconds() {
 134     return _closure_app_seconds;
 135   }
 136 
 137   BufferingOopClosure(OopClosure *oc) :
 138     _oc(oc),
 139     _oop_top(_buffer),
 140     _narrowOop_bottom(_buffer + BufferLength - 1),
 141     _closure_app_seconds(0.0) { }
 142 };
 143 
 144 #endif // SHARE_VM_GC_IMPLEMENTATION_G1_BUFFERINGOOPCLOSURE_HPP
   1 /*
   2  * Copyright (c) 2001, 2015, Oracle and/or its affiliates. All rights reserved.
   3  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
   4  *
   5  * This code is free software; you can redistribute it and/or modify it
   6  * under the terms of the GNU General Public License version 2 only, as
   7  * published by the Free Software Foundation.
   8  *
   9  * This code is distributed in the hope that it will be useful, but WITHOUT
  10  * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
  11  * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
  12  * version 2 for more details (a copy is included in the LICENSE file that
  13  * accompanied this code).
  14  *
  15  * You should have received a copy of the GNU General Public License version
  16  * 2 along with this work; if not, write to the Free Software Foundation,
  17  * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
  18  *
  19  * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
  20  * or visit www.oracle.com if you need additional information or have any
  21  * questions.
  22  *
  23  */
  24 
  25 #ifndef SHARE_VM_GC_G1_BUFFERINGOOPCLOSURE_HPP
  26 #define SHARE_VM_GC_G1_BUFFERINGOOPCLOSURE_HPP
  27 
  28 #include "memory/iterator.hpp"
  29 #include "oops/oopsHierarchy.hpp"
  30 #include "runtime/os.hpp"
  31 #include "utilities/debug.hpp"
  32 
  33 // A BufferingOops closure tries to separate out the cost of finding roots
  34 // from the cost of applying closures to them.  It maintains an array of
  35 // ref-containing locations.  Until the array is full, applying the closure
  36 // to an oop* merely records that location in the array.  Since this
  37 // closure app cost is small, an elapsed timer can approximately attribute
  38 // all of this cost to the cost of finding the roots.  When the array fills
  39 // up, the wrapped closure is applied to all elements, keeping track of
  40 // this elapsed time of this process, and leaving the array empty.
  41 // The caller must be sure to call "done" to process any unprocessed
  42 // buffered entries.
  43 
  44 class BufferingOopClosure: public OopClosure {
  45   friend class TestBufferingOopClosure;
  46 protected:


 124     add_oop(p);
 125   }
 126 
 127   void done() {
 128     if (!is_buffer_empty()) {
 129       process_buffer();
 130     }
 131   }
 132 
 133   double closure_app_seconds() {
 134     return _closure_app_seconds;
 135   }
 136 
 137   BufferingOopClosure(OopClosure *oc) :
 138     _oc(oc),
 139     _oop_top(_buffer),
 140     _narrowOop_bottom(_buffer + BufferLength - 1),
 141     _closure_app_seconds(0.0) { }
 142 };
 143 
 144 #endif // SHARE_VM_GC_G1_BUFFERINGOOPCLOSURE_HPP
< prev index next >