Fri, 29 Apr 2016 00:06:10 +0800
Added MIPS 64-bit port.
1 /*
2 * Copyright (c) 2002, 2013, 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 */
25 /*
26 * This file has been modified by Loongson Technology in 2015. These
27 * modifications are Copyright (c) 2015 Loongson Technology, and are made
28 * available on the same license terms set forth above.
29 */
31 #ifndef SHARE_VM_GC_IMPLEMENTATION_PARALLELSCAVENGE_PSPROMOTIONMANAGER_HPP
32 #define SHARE_VM_GC_IMPLEMENTATION_PARALLELSCAVENGE_PSPROMOTIONMANAGER_HPP
34 #include "gc_implementation/parallelScavenge/psPromotionLAB.hpp"
35 #include "gc_implementation/shared/gcTrace.hpp"
36 #include "gc_implementation/shared/copyFailedInfo.hpp"
37 #include "memory/allocation.hpp"
38 #include "memory/padded.hpp"
39 #include "utilities/globalDefinitions.hpp"
40 #include "utilities/taskqueue.hpp"
42 //
43 // psPromotionManager is used by a single thread to manage object survival
44 // during a scavenge. The promotion manager contains thread local data only.
45 //
46 // NOTE! Be careful when allocating the stacks on cheap. If you are going
47 // to use a promotion manager in more than one thread, the stacks MUST be
48 // on cheap. This can lead to memory leaks, though, as they are not auto
49 // deallocated.
50 //
51 // FIX ME FIX ME Add a destructor, and don't rely on the user to drain/flush/deallocate!
52 //
54 // Move to some global location
55 #define HAS_BEEN_MOVED 0x1501d01d
56 // End move to some global location
58 class MutableSpace;
59 class PSOldGen;
60 class ParCompactionManager;
62 class PSPromotionManager VALUE_OBJ_CLASS_SPEC {
63 friend class PSScavenge;
64 friend class PSRefProcTaskExecutor;
65 private:
66 static PaddedEnd<PSPromotionManager>* _manager_array;
67 static OopStarTaskQueueSet* _stack_array_depth;
68 static PSOldGen* _old_gen;
69 static MutableSpace* _young_space;
71 #if TASKQUEUE_STATS
72 size_t _masked_pushes;
73 size_t _masked_steals;
74 size_t _arrays_chunked;
75 size_t _array_chunks_processed;
77 void print_taskqueue_stats(uint i) const;
78 void print_local_stats(uint i) const;
79 static void print_stats();
81 void reset_stats();
82 #endif // TASKQUEUE_STATS
84 PSYoungPromotionLAB _young_lab;
85 PSOldPromotionLAB _old_lab;
86 PSOldPromotionLAB _old_lab_oldnuma[4];
87 bool _young_gen_is_full;
88 bool _old_gen_is_full;
90 OopStarTaskQueue _claimed_stack_depth;
91 OverflowTaskQueue<oop, mtGC> _claimed_stack_breadth;
93 bool _totally_drain;
94 uint _target_stack_size;
96 uint _array_chunk_size;
97 uint _min_array_size_for_chunking;
99 PromotionFailedInfo _promotion_failed_info;
101 // Accessors
102 static PSOldGen* old_gen() { return _old_gen; }
103 static MutableSpace* young_space() { return _young_space; }
105 inline static PSPromotionManager* manager_array(int index);
106 template <class T> inline void claim_or_forward_internal_depth(T* p);
108 // On the task queues we push reference locations as well as
109 // partially-scanned arrays (in the latter case, we push an oop to
110 // the from-space image of the array and the length on the
111 // from-space image indicates how many entries on the array we still
112 // need to scan; this is basically how ParNew does partial array
113 // scanning too). To be able to distinguish between reference
114 // locations and partially-scanned array oops we simply mask the
115 // latter oops with 0x01. The next three methods do the masking,
116 // unmasking, and checking whether the oop is masked or not. Notice
117 // that the signature of the mask and unmask methods looks a bit
118 // strange, as they accept and return different types (oop and
119 // oop*). This is because of the difference in types between what
120 // the task queue holds (oop*) and oops to partially-scanned arrays
121 // (oop). We do all the necessary casting in the mask / unmask
122 // methods to avoid sprinkling the rest of the code with more casts.
124 // These are added to the taskqueue so PS_CHUNKED_ARRAY_OOP_MASK (or any
125 // future masks) can't conflict with COMPRESSED_OOP_MASK
126 #define PS_CHUNKED_ARRAY_OOP_MASK 0x2
128 bool is_oop_masked(StarTask p) {
129 // If something is marked chunked it's always treated like wide oop*
130 return (((intptr_t)(oop*)p) & PS_CHUNKED_ARRAY_OOP_MASK) ==
131 PS_CHUNKED_ARRAY_OOP_MASK;
132 }
134 oop* mask_chunked_array_oop(oop obj) {
135 assert(!is_oop_masked((oop*) obj), "invariant");
136 oop* ret = (oop*) (cast_from_oop<uintptr_t>(obj) | PS_CHUNKED_ARRAY_OOP_MASK);
137 assert(is_oop_masked(ret), "invariant");
138 return ret;
139 }
141 oop unmask_chunked_array_oop(StarTask p) {
142 assert(is_oop_masked(p), "invariant");
143 assert(!p.is_narrow(), "chunked array oops cannot be narrow");
144 oop *chunk = (oop*)p; // cast p to oop (uses conversion operator)
145 oop ret = oop((oop*)((uintptr_t)chunk & ~PS_CHUNKED_ARRAY_OOP_MASK));
146 assert(!is_oop_masked((oop*) ret), "invariant");
147 return ret;
148 }
150 template <class T> void process_array_chunk_work(oop obj,
151 int start, int end);
152 void process_array_chunk(oop old);
154 template <class T> void push_depth(T* p) {
155 claimed_stack_depth()->push(p);
156 }
158 protected:
159 static OopStarTaskQueueSet* stack_array_depth() { return _stack_array_depth; }
160 public:
161 // Static
162 static void initialize();
164 static void pre_scavenge();
165 static bool post_scavenge(YoungGCTracer& gc_tracer);
167 static PSPromotionManager* gc_thread_promotion_manager(int index);
168 static PSPromotionManager* vm_thread_promotion_manager();
170 static bool steal_depth(int queue_num, int* seed, StarTask& t) {
171 return stack_array_depth()->steal(queue_num, seed, t);
172 }
174 PSPromotionManager();
176 // Accessors
177 OopStarTaskQueue* claimed_stack_depth() {
178 return &_claimed_stack_depth;
179 }
181 bool young_gen_is_full() { return _young_gen_is_full; }
183 bool old_gen_is_full() { return _old_gen_is_full; }
184 void set_old_gen_is_full(bool state) { _old_gen_is_full = state; }
186 //Stastic methods
187 int get_oop_location(oop o);
188 int get_oop_node_id(oop o, int location);
189 void stastic_scavenge(oop o);
191 // Promotion methods
192 template<bool promote_immediately> oop copy_to_survivor_space(oop o);
193 oop oop_promotion_failed(oop obj, markOop obj_mark);
195 void reset();
197 void flush_labs();
198 void drain_stacks(bool totally_drain) {
199 drain_stacks_depth(totally_drain);
200 }
201 public:
202 void drain_stacks_cond_depth() {
203 if (claimed_stack_depth()->size() > _target_stack_size) {
204 drain_stacks_depth(false);
205 }
206 }
207 void drain_stacks_depth(bool totally_drain);
209 bool stacks_empty() {
210 return claimed_stack_depth()->is_empty();
211 }
213 inline void process_popped_location_depth(StarTask p);
215 template <class T> inline void claim_or_forward_depth(T* p);
217 TASKQUEUE_STATS_ONLY(inline void record_steal(StarTask& p);)
218 };
220 #endif // SHARE_VM_GC_IMPLEMENTATION_PARALLELSCAVENGE_PSPROMOTIONMANAGER_HPP