1.1 --- /dev/null Thu Jan 01 00:00:00 1970 +0000
1.2 +++ b/src/share/vm/gc_implementation/g1/bufferingOopClosure.hpp Wed Apr 27 01:25:04 2016 +0800
1.3 @@ -0,0 +1,101 @@
1.4 +/*
1.5 + * Copyright (c) 2001, 2010, Oracle and/or its affiliates. All rights reserved.
1.6 + * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
1.7 + *
1.8 + * This code is free software; you can redistribute it and/or modify it
1.9 + * under the terms of the GNU General Public License version 2 only, as
1.10 + * published by the Free Software Foundation.
1.11 + *
1.12 + * This code is distributed in the hope that it will be useful, but WITHOUT
1.13 + * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
1.14 + * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
1.15 + * version 2 for more details (a copy is included in the LICENSE file that
1.16 + * accompanied this code).
1.17 + *
1.18 + * You should have received a copy of the GNU General Public License version
1.19 + * 2 along with this work; if not, write to the Free Software Foundation,
1.20 + * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
1.21 + *
1.22 + * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
1.23 + * or visit www.oracle.com if you need additional information or have any
1.24 + * questions.
1.25 + *
1.26 + */
1.27 +
1.28 +#ifndef SHARE_VM_GC_IMPLEMENTATION_G1_BUFFERINGOOPCLOSURE_HPP
1.29 +#define SHARE_VM_GC_IMPLEMENTATION_G1_BUFFERINGOOPCLOSURE_HPP
1.30 +
1.31 +#include "memory/genOopClosures.hpp"
1.32 +#include "memory/generation.hpp"
1.33 +#include "runtime/os.hpp"
1.34 +#include "utilities/taskqueue.hpp"
1.35 +
1.36 +// A BufferingOops closure tries to separate out the cost of finding roots
1.37 +// from the cost of applying closures to them. It maintains an array of
1.38 +// ref-containing locations. Until the array is full, applying the closure
1.39 +// to an oop* merely records that location in the array. Since this
1.40 +// closure app cost is small, an elapsed timer can approximately attribute
1.41 +// all of this cost to the cost of finding the roots. When the array fills
1.42 +// up, the wrapped closure is applied to all elements, keeping track of
1.43 +// this elapsed time of this process, and leaving the array empty.
1.44 +// The caller must be sure to call "done" to process any unprocessed
1.45 +// buffered entriess.
1.46 +
1.47 +class Generation;
1.48 +class HeapRegion;
1.49 +
1.50 +class BufferingOopClosure: public OopClosure {
1.51 +protected:
1.52 + enum PrivateConstants {
1.53 + BufferLength = 1024
1.54 + };
1.55 +
1.56 + StarTask _buffer[BufferLength];
1.57 + StarTask* _buffer_top;
1.58 + StarTask* _buffer_curr;
1.59 +
1.60 + OopClosure* _oc;
1.61 + double _closure_app_seconds;
1.62 +
1.63 + void process_buffer () {
1.64 + double start = os::elapsedTime();
1.65 + for (StarTask* curr = _buffer; curr < _buffer_curr; ++curr) {
1.66 + if (curr->is_narrow()) {
1.67 + assert(UseCompressedOops, "Error");
1.68 + _oc->do_oop((narrowOop*)(*curr));
1.69 + } else {
1.70 + _oc->do_oop((oop*)(*curr));
1.71 + }
1.72 + }
1.73 + _buffer_curr = _buffer;
1.74 + _closure_app_seconds += (os::elapsedTime() - start);
1.75 + }
1.76 +
1.77 + template <class T> inline void do_oop_work(T* p) {
1.78 + if (_buffer_curr == _buffer_top) {
1.79 + process_buffer();
1.80 + }
1.81 + StarTask new_ref(p);
1.82 + *_buffer_curr = new_ref;
1.83 + ++_buffer_curr;
1.84 + }
1.85 +
1.86 +public:
1.87 + virtual void do_oop(narrowOop* p) { do_oop_work(p); }
1.88 + virtual void do_oop(oop* p) { do_oop_work(p); }
1.89 +
1.90 + void done () {
1.91 + if (_buffer_curr > _buffer) {
1.92 + process_buffer();
1.93 + }
1.94 + }
1.95 + double closure_app_seconds () {
1.96 + return _closure_app_seconds;
1.97 + }
1.98 + BufferingOopClosure (OopClosure *oc) :
1.99 + _oc(oc),
1.100 + _buffer_curr(_buffer), _buffer_top(_buffer + BufferLength),
1.101 + _closure_app_seconds(0.0) { }
1.102 +};
1.103 +
1.104 +#endif // SHARE_VM_GC_IMPLEMENTATION_G1_BUFFERINGOOPCLOSURE_HPP
