1 /*
2 * Copyright (c) 2014, 2016, 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 *
37
38 class G1PLABAllocator;
39 class G1EvacuationRootClosures;
40 class HeapRegion;
41 class outputStream;
42
43 class G1ParScanThreadState : public CHeapObj<mtGC> {
44 private:
45 G1CollectedHeap* _g1h;
46 RefToScanQueue* _refs;
47 DirtyCardQueue _dcq;
48 G1SATBCardTableModRefBS* _ct_bs;
49 G1EvacuationRootClosures* _closures;
50
51 G1PLABAllocator* _plab_allocator;
52
53 AgeTable _age_table;
54 InCSetState _dest[InCSetState::Num];
55 // Local tenuring threshold.
56 uint _tenuring_threshold;
57 G1ParScanClosure _scanner;
58
59 int _hash_seed;
60 uint _worker_id;
61
62 // Map from young-age-index (0 == not young, 1 is youngest) to
63 // surviving words. base is what we get back from the malloc call
64 size_t* _surviving_young_words_base;
65 // this points into the array, as we use the first few entries for padding
66 size_t* _surviving_young_words;
67
68 // Indicates whether in the last generation (old) there is no more space
69 // available for allocation.
70 bool _old_gen_is_full;
71
72 #define PADDING_ELEM_NUM (DEFAULT_CACHE_LINE_SIZE / sizeof(size_t))
73
74 DirtyCardQueue& dirty_card_queue() { return _dcq; }
75 G1SATBCardTableModRefBS* ctbs() { return _ct_bs; }
76
77 InCSetState dest(InCSetState original) const {
|
1 /*
2 * Copyright (c) 2014, 2017, 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 *
37
38 class G1PLABAllocator;
39 class G1EvacuationRootClosures;
40 class HeapRegion;
41 class outputStream;
42
43 class G1ParScanThreadState : public CHeapObj<mtGC> {
44 private:
45 G1CollectedHeap* _g1h;
46 RefToScanQueue* _refs;
47 DirtyCardQueue _dcq;
48 G1SATBCardTableModRefBS* _ct_bs;
49 G1EvacuationRootClosures* _closures;
50
51 G1PLABAllocator* _plab_allocator;
52
53 AgeTable _age_table;
54 InCSetState _dest[InCSetState::Num];
55 // Local tenuring threshold.
56 uint _tenuring_threshold;
57 G1ScanEvacuatedObjClosure _scanner;
58
59 int _hash_seed;
60 uint _worker_id;
61
62 // Map from young-age-index (0 == not young, 1 is youngest) to
63 // surviving words. base is what we get back from the malloc call
64 size_t* _surviving_young_words_base;
65 // this points into the array, as we use the first few entries for padding
66 size_t* _surviving_young_words;
67
68 // Indicates whether in the last generation (old) there is no more space
69 // available for allocation.
70 bool _old_gen_is_full;
71
72 #define PADDING_ELEM_NUM (DEFAULT_CACHE_LINE_SIZE / sizeof(size_t))
73
74 DirtyCardQueue& dirty_card_queue() { return _dcq; }
75 G1SATBCardTableModRefBS* ctbs() { return _ct_bs; }
76
77 InCSetState dest(InCSetState original) const {
|