1 /*
2 * Copyright (c) 2014, 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_G1PARSCANTHREADSTATE_HPP
26 #define SHARE_VM_GC_G1_G1PARSCANTHREADSTATE_HPP
27
28 #include "gc/g1/dirtyCardQueue.hpp"
29 #include "gc/g1/g1CollectedHeap.hpp"
30 #include "gc/g1/g1CollectorPolicy.hpp"
31 #include "gc/g1/g1OopClosures.hpp"
32 #include "gc/g1/g1RemSet.hpp"
33 #include "gc/g1/g1SATBCardTableModRefBS.hpp"
34 #include "gc/shared/ageTable.hpp"
35 #include "memory/allocation.hpp"
36 #include "oops/oop.hpp"
37
38 class HeapRegion;
39 class outputStream;
40
41 class G1ParScanThreadState : public StackObj {
42 private:
43 G1CollectedHeap* _g1h;
44 RefToScanQueue* _refs;
45 DirtyCardQueue _dcq;
46 G1SATBCardTableModRefBS* _ct_bs;
47 G1RemSet* _g1_rem;
48
49 G1ParGCAllocator* _g1_par_allocator;
50
51 ageTable _age_table;
52 InCSetState _dest[InCSetState::Num];
53 // Local tenuring threshold.
54 uint _tenuring_threshold;
55 G1ParScanClosure _scanner;
56
57 int _hash_seed;
58 uint _queue_num;
59
60 size_t _term_attempts;
61
62 double _start;
63 double _start_strong_roots;
64 double _strong_roots_time;
65 double _start_term;
66 double _term_time;
67
68 // Map from young-age-index (0 == not young, 1 is youngest) to
69 // surviving words. base is what we get back from the malloc call
70 size_t* _surviving_young_words_base;
71 // this points into the array, as we use the first few entries for padding
72 size_t* _surviving_young_words;
73
74 #define PADDING_ELEM_NUM (DEFAULT_CACHE_LINE_SIZE / sizeof(size_t))
75
76 DirtyCardQueue& dirty_card_queue() { return _dcq; }
77 G1SATBCardTableModRefBS* ctbs() { return _ct_bs; }
78
79 InCSetState dest(InCSetState original) const {
80 assert(original.is_valid(),
81 err_msg("Original state invalid: " CSETSTATE_FORMAT, original.value()));
82 assert(_dest[original.value()].is_valid_gen(),
83 err_msg("Dest state is invalid: " CSETSTATE_FORMAT, _dest[original.value()].value()));
84 return _dest[original.value()];
85 }
86
87 public:
88 G1ParScanThreadState(G1CollectedHeap* g1h, uint queue_num, ReferenceProcessor* rp);
89 ~G1ParScanThreadState();
90
91 ageTable* age_table() { return &_age_table; }
92
93 #ifdef ASSERT
94 bool queue_is_empty() const { return _refs->is_empty(); }
95
96 bool verify_ref(narrowOop* ref) const;
97 bool verify_ref(oop* ref) const;
98 bool verify_task(StarTask ref) const;
99 #endif // ASSERT
100
101 template <class T> void push_on_queue(T* ref);
102
103 template <class T> void update_rs(HeapRegion* from, T* p, uint tid) {
104 // If the new value of the field points to the same region or
105 // is the to-space, we don't need to include it in the Rset updates.
106 if (!from->is_in_reserved(oopDesc::load_decode_heap_oop(p)) && !from->is_survivor()) {
107 size_t card_index = ctbs()->index_for(p);
108 // If the card hasn't been added to the buffer, do it.
109 if (ctbs()->mark_card_deferred(card_index)) {
110 dirty_card_queue().enqueue((jbyte*)ctbs()->byte_for_index(card_index));
111 }
112 }
113 }
114
115 int* hash_seed() { return &_hash_seed; }
116 uint queue_num() { return _queue_num; }
117
118 size_t term_attempts() const { return _term_attempts; }
119 void note_term_attempt() { _term_attempts++; }
120
121 void start_strong_roots() {
122 _start_strong_roots = os::elapsedTime();
123 }
124 void end_strong_roots() {
125 _strong_roots_time += (os::elapsedTime() - _start_strong_roots);
126 }
127 double strong_roots_time() const { return _strong_roots_time; }
128
129 void start_term_time() {
130 note_term_attempt();
131 _start_term = os::elapsedTime();
132 }
133 void end_term_time() {
134 _term_time += (os::elapsedTime() - _start_term);
135 }
136 double term_time() const { return _term_time; }
137
138 double elapsed_time() const {
139 return os::elapsedTime() - _start;
140 }
141
142 static void print_termination_stats_hdr(outputStream* const st = gclog_or_tty);
143 void print_termination_stats(int i, outputStream* const st = gclog_or_tty) const;
144
145 size_t* surviving_young_words() {
146 // We add on to hide entry 0 which accumulates surviving words for
147 // age -1 regions (i.e. non-young ones)
148 return _surviving_young_words;
149 }
150
151 private:
152 #define G1_PARTIAL_ARRAY_MASK 0x2
153
154 inline bool has_partial_array_mask(oop* ref) const {
155 return ((uintptr_t)ref & G1_PARTIAL_ARRAY_MASK) == G1_PARTIAL_ARRAY_MASK;
156 }
157
158 // We never encode partial array oops as narrowOop*, so return false immediately.
159 // This allows the compiler to create optimized code when popping references from
160 // the work queue.
161 inline bool has_partial_array_mask(narrowOop* ref) const {
162 assert(((uintptr_t)ref & G1_PARTIAL_ARRAY_MASK) != G1_PARTIAL_ARRAY_MASK, "Partial array oop reference encoded as narrowOop*");
163 return false;
164 }
165
166 // Only implement set_partial_array_mask() for regular oops, not for narrowOops.
167 // We always encode partial arrays as regular oop, to allow the
168 // specialization for has_partial_array_mask() for narrowOops above.
169 // This means that unintentional use of this method with narrowOops are caught
170 // by the compiler.
171 inline oop* set_partial_array_mask(oop obj) const {
172 assert(((uintptr_t)(void *)obj & G1_PARTIAL_ARRAY_MASK) == 0, "Information loss!");
173 return (oop*) ((uintptr_t)(void *)obj | G1_PARTIAL_ARRAY_MASK);
174 }
175
176 inline oop clear_partial_array_mask(oop* ref) const {
177 return cast_to_oop((intptr_t)ref & ~G1_PARTIAL_ARRAY_MASK);
178 }
179
180 inline void do_oop_partial_array(oop* p);
181
182 // This method is applied to the fields of the objects that have just been copied.
183 template <class T> inline void do_oop_evac(T* p, HeapRegion* from);
184
185 template <class T> inline void deal_with_reference(T* ref_to_scan);
186
187 inline void dispatch_reference(StarTask ref);
188
189 // Tries to allocate word_sz in the PLAB of the next "generation" after trying to
190 // allocate into dest. State is the original (source) cset state for the object
191 // that is allocated for.
192 // Returns a non-NULL pointer if successful, and updates dest if required.
193 HeapWord* allocate_in_next_plab(InCSetState const state,
194 InCSetState* dest,
195 size_t word_sz,
196 AllocationContext_t const context);
197
198 inline InCSetState next_state(InCSetState const state, markOop const m, uint& age);
199 public:
200
201 oop copy_to_survivor_space(InCSetState const state, oop const obj, markOop const old_mark);
202
203 void trim_queue();
204
205 inline void steal_and_trim_queue(RefToScanQueueSet *task_queues);
206
207 // An attempt to evacuate "obj" has failed; take necessary steps.
208 oop handle_evacuation_failure_par(oop obj, markOop m);
209 };
210
211 #endif // SHARE_VM_GC_G1_G1PARSCANTHREADSTATE_HPP