1 /*
2 * Copyright (c) 2001, 2007, 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 // A BufferingOops closure tries to separate out the cost of finding roots
26 // from the cost of applying closures to them. It maintains an array of
27 // ref-containing locations. Until the array is full, applying the closure
28 // to an oop* merely records that location in the array. Since this
29 // closure app cost is small, an elapsed timer can approximately attribute
30 // all of this cost to the cost of finding the roots. When the array fills
31 // up, the wrapped closure is applied to all elements, keeping track of
32 // this elapsed time of this process, and leaving the array empty.
33 // The caller must be sure to call "done" to process any unprocessed
34 // buffered entriess.
35
36 class Generation;
37 class HeapRegion;
38
39 class BufferingOopClosure: public OopClosure {
40 protected:
41 enum PrivateConstants {
42 BufferLength = 1024
43 };
44
184 *_buffer_curr = new_ref;
185 ++_buffer_curr;
186 *_hr_curr = _from;
187 ++_hr_curr;
188 }
189 void done () {
190 if (_buffer_curr > _buffer) {
191 assert(_hr_curr > _hr_buffer, "_hr_curr should be consistent with _buffer_curr");
192 process_buffer();
193 }
194 }
195 double closure_app_seconds () {
196 return _closure_app_seconds;
197 }
198 BufferingOopsInHeapRegionClosure (OopsInHeapRegionClosure *oc) :
199 _oc(oc),
200 _buffer_curr(_buffer), _buffer_top(_buffer + BufferLength),
201 _hr_curr(_hr_buffer),
202 _closure_app_seconds(0.0) { }
203 };
|
1 /*
2 * Copyright (c) 2001, 2010, 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/genOopClosures.hpp"
29 #include "memory/generation.hpp"
30 #include "runtime/os.hpp"
31 #include "utilities/taskqueue.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 entriess.
43
44 class Generation;
45 class HeapRegion;
46
47 class BufferingOopClosure: public OopClosure {
48 protected:
49 enum PrivateConstants {
50 BufferLength = 1024
51 };
52
192 *_buffer_curr = new_ref;
193 ++_buffer_curr;
194 *_hr_curr = _from;
195 ++_hr_curr;
196 }
197 void done () {
198 if (_buffer_curr > _buffer) {
199 assert(_hr_curr > _hr_buffer, "_hr_curr should be consistent with _buffer_curr");
200 process_buffer();
201 }
202 }
203 double closure_app_seconds () {
204 return _closure_app_seconds;
205 }
206 BufferingOopsInHeapRegionClosure (OopsInHeapRegionClosure *oc) :
207 _oc(oc),
208 _buffer_curr(_buffer), _buffer_top(_buffer + BufferLength),
209 _hr_curr(_hr_buffer),
210 _closure_app_seconds(0.0) { }
211 };
212
213 #endif // SHARE_VM_GC_IMPLEMENTATION_G1_BUFFERINGOOPCLOSURE_HPP
|