|
0
|
1 /*
|
|
|
2 * Copyright 1999-2007 Sun Microsystems, Inc. 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 Sun Microsystems, Inc., 4150 Network Circle, Santa Clara,
|
|
|
20 * CA 95054 USA or visit www.sun.com if you need additional information or
|
|
|
21 * have any questions.
|
|
|
22 *
|
|
|
23 */
|
|
|
24
|
|
|
25 class GlobalTLABStats;
|
|
|
26
|
|
|
27 // ThreadLocalAllocBuffer: a descriptor for thread-local storage used by
|
|
|
28 // the threads for allocation.
|
|
|
29 // It is thread-private at any time, but maybe multiplexed over
|
|
|
30 // time across multiple threads. The park()/unpark() pair is
|
|
|
31 // used to make it avaiable for such multiplexing.
|
|
|
32 class ThreadLocalAllocBuffer: public CHeapObj {
|
|
|
33 friend class VMStructs;
|
|
|
34 private:
|
|
|
35 HeapWord* _start; // address of TLAB
|
|
|
36 HeapWord* _top; // address after last allocation
|
|
|
37 HeapWord* _pf_top; // allocation prefetch watermark
|
|
|
38 HeapWord* _end; // allocation end (excluding alignment_reserve)
|
|
|
39 size_t _desired_size; // desired size (including alignment_reserve)
|
|
|
40 size_t _refill_waste_limit; // hold onto tlab if free() is larger than this
|
|
|
41
|
|
|
42 static unsigned _target_refills; // expected number of refills between GCs
|
|
|
43
|
|
|
44 unsigned _number_of_refills;
|
|
|
45 unsigned _fast_refill_waste;
|
|
|
46 unsigned _slow_refill_waste;
|
|
|
47 unsigned _gc_waste;
|
|
|
48 unsigned _slow_allocations;
|
|
|
49
|
|
|
50 AdaptiveWeightedAverage _allocation_fraction; // fraction of eden allocated in tlabs
|
|
|
51
|
|
|
52 void accumulate_statistics();
|
|
|
53 void initialize_statistics();
|
|
|
54
|
|
|
55 void set_start(HeapWord* start) { _start = start; }
|
|
|
56 void set_end(HeapWord* end) { _end = end; }
|
|
|
57 void set_top(HeapWord* top) { _top = top; }
|
|
|
58 void set_pf_top(HeapWord* pf_top) { _pf_top = pf_top; }
|
|
|
59 void set_desired_size(size_t desired_size) { _desired_size = desired_size; }
|
|
|
60 void set_refill_waste_limit(size_t waste) { _refill_waste_limit = waste; }
|
|
|
61
|
|
|
62 size_t initial_refill_waste_limit() { return desired_size() / TLABRefillWasteFraction; }
|
|
|
63
|
|
|
64 static int target_refills() { return _target_refills; }
|
|
|
65 size_t initial_desired_size();
|
|
|
66
|
|
|
67 size_t remaining() const { return end() == NULL ? 0 : pointer_delta(hard_end(), top()); }
|
|
|
68
|
|
|
69 // Make parsable and release it.
|
|
|
70 void reset();
|
|
|
71
|
|
|
72 // Resize based on amount of allocation, etc.
|
|
|
73 void resize();
|
|
|
74
|
|
|
75 void invariants() const { assert(top() >= start() && top() <= end(), "invalid tlab"); }
|
|
|
76
|
|
|
77 void initialize(HeapWord* start, HeapWord* top, HeapWord* end);
|
|
|
78
|
|
|
79 void print_stats(const char* tag);
|
|
|
80
|
|
|
81 Thread* myThread();
|
|
|
82
|
|
|
83 // statistics
|
|
|
84
|
|
|
85 int number_of_refills() const { return _number_of_refills; }
|
|
|
86 int fast_refill_waste() const { return _fast_refill_waste; }
|
|
|
87 int slow_refill_waste() const { return _slow_refill_waste; }
|
|
|
88 int gc_waste() const { return _gc_waste; }
|
|
|
89 int slow_allocations() const { return _slow_allocations; }
|
|
|
90
|
|
|
91 static GlobalTLABStats* _global_stats;
|
|
|
92 static GlobalTLABStats* global_stats() { return _global_stats; }
|
|
|
93
|
|
|
94 public:
|
|
|
95 ThreadLocalAllocBuffer() : _allocation_fraction(TLABAllocationWeight) {
|
|
|
96 // do nothing. tlabs must be inited by initialize() calls
|
|
|
97 }
|
|
|
98
|
|
|
99 static const size_t min_size() { return align_object_size(MinTLABSize / HeapWordSize); }
|
|
|
100 static const size_t max_size();
|
|
|
101
|
|
|
102 HeapWord* start() const { return _start; }
|
|
|
103 HeapWord* end() const { return _end; }
|
|
|
104 HeapWord* hard_end() const { return _end + alignment_reserve(); }
|
|
|
105 HeapWord* top() const { return _top; }
|
|
|
106 HeapWord* pf_top() const { return _pf_top; }
|
|
|
107 size_t desired_size() const { return _desired_size; }
|
|
|
108 size_t free() const { return pointer_delta(end(), top()); }
|
|
|
109 // Don't discard tlab if remaining space is larger than this.
|
|
|
110 size_t refill_waste_limit() const { return _refill_waste_limit; }
|
|
|
111
|
|
|
112 // Allocate size HeapWords. The memory is NOT initialized to zero.
|
|
|
113 inline HeapWord* allocate(size_t size);
|
|
|
114 static size_t alignment_reserve() { return align_object_size(typeArrayOopDesc::header_size(T_INT)); }
|
|
|
115 static size_t alignment_reserve_in_bytes() { return alignment_reserve() * HeapWordSize; }
|
|
|
116
|
|
|
117 // Return tlab size or remaining space in eden such that the
|
|
|
118 // space is large enough to hold obj_size and necessary fill space.
|
|
|
119 // Otherwise return 0;
|
|
|
120 inline size_t compute_size(size_t obj_size);
|
|
|
121
|
|
|
122 // Record slow allocation
|
|
|
123 inline void record_slow_allocation(size_t obj_size);
|
|
|
124
|
|
|
125 // Initialization at startup
|
|
|
126 static void startup_initialization();
|
|
|
127
|
|
|
128 // Make an in-use tlab parsable, optionally also retiring it.
|
|
|
129 void make_parsable(bool retire);
|
|
|
130
|
|
|
131 // Retire in-use tlab before allocation of a new tlab
|
|
|
132 void clear_before_allocation();
|
|
|
133
|
|
|
134 // Accumulate statistics across all tlabs before gc
|
|
|
135 static void accumulate_statistics_before_gc();
|
|
|
136
|
|
|
137 // Resize tlabs for all threads
|
|
|
138 static void resize_all_tlabs();
|
|
|
139
|
|
|
140 void fill(HeapWord* start, HeapWord* top, size_t new_size);
|
|
|
141 void initialize();
|
|
|
142
|
|
|
143 static size_t refill_waste_limit_increment() { return TLABWasteIncrement; }
|
|
|
144
|
|
|
145 // Code generation support
|
|
|
146 static ByteSize start_offset() { return byte_offset_of(ThreadLocalAllocBuffer, _start); }
|
|
|
147 static ByteSize end_offset() { return byte_offset_of(ThreadLocalAllocBuffer, _end ); }
|
|
|
148 static ByteSize top_offset() { return byte_offset_of(ThreadLocalAllocBuffer, _top ); }
|
|
|
149 static ByteSize pf_top_offset() { return byte_offset_of(ThreadLocalAllocBuffer, _pf_top ); }
|
|
|
150 static ByteSize size_offset() { return byte_offset_of(ThreadLocalAllocBuffer, _desired_size ); }
|
|
|
151 static ByteSize refill_waste_limit_offset() { return byte_offset_of(ThreadLocalAllocBuffer, _refill_waste_limit ); }
|
|
|
152
|
|
|
153 static ByteSize number_of_refills_offset() { return byte_offset_of(ThreadLocalAllocBuffer, _number_of_refills ); }
|
|
|
154 static ByteSize fast_refill_waste_offset() { return byte_offset_of(ThreadLocalAllocBuffer, _fast_refill_waste ); }
|
|
|
155 static ByteSize slow_allocations_offset() { return byte_offset_of(ThreadLocalAllocBuffer, _slow_allocations ); }
|
|
|
156
|
|
|
157 void verify();
|
|
|
158 };
|
|
|
159
|
|
|
160 class GlobalTLABStats: public CHeapObj {
|
|
|
161 private:
|
|
|
162
|
|
|
163 // Accumulate perfdata in private variables because
|
|
|
164 // PerfData should be write-only for security reasons
|
|
|
165 // (see perfData.hpp)
|
|
|
166 unsigned _allocating_threads;
|
|
|
167 unsigned _total_refills;
|
|
|
168 unsigned _max_refills;
|
|
|
169 size_t _total_allocation;
|
|
|
170 size_t _total_gc_waste;
|
|
|
171 size_t _max_gc_waste;
|
|
|
172 size_t _total_slow_refill_waste;
|
|
|
173 size_t _max_slow_refill_waste;
|
|
|
174 size_t _total_fast_refill_waste;
|
|
|
175 size_t _max_fast_refill_waste;
|
|
|
176 unsigned _total_slow_allocations;
|
|
|
177 unsigned _max_slow_allocations;
|
|
|
178
|
|
|
179 PerfVariable* _perf_allocating_threads;
|
|
|
180 PerfVariable* _perf_total_refills;
|
|
|
181 PerfVariable* _perf_max_refills;
|
|
|
182 PerfVariable* _perf_allocation;
|
|
|
183 PerfVariable* _perf_gc_waste;
|
|
|
184 PerfVariable* _perf_max_gc_waste;
|
|
|
185 PerfVariable* _perf_slow_refill_waste;
|
|
|
186 PerfVariable* _perf_max_slow_refill_waste;
|
|
|
187 PerfVariable* _perf_fast_refill_waste;
|
|
|
188 PerfVariable* _perf_max_fast_refill_waste;
|
|
|
189 PerfVariable* _perf_slow_allocations;
|
|
|
190 PerfVariable* _perf_max_slow_allocations;
|
|
|
191
|
|
|
192 AdaptiveWeightedAverage _allocating_threads_avg;
|
|
|
193
|
|
|
194 public:
|
|
|
195 GlobalTLABStats();
|
|
|
196
|
|
|
197 // Initialize all counters
|
|
|
198 void initialize();
|
|
|
199
|
|
|
200 // Write all perf counters to the perf_counters
|
|
|
201 void publish();
|
|
|
202
|
|
|
203 void print();
|
|
|
204
|
|
|
205 // Accessors
|
|
|
206 unsigned allocating_threads_avg() {
|
|
|
207 return MAX2((unsigned)(_allocating_threads_avg.average() + 0.5), 1U);
|
|
|
208 }
|
|
|
209
|
|
|
210 size_t allocation() {
|
|
|
211 return _total_allocation;
|
|
|
212 }
|
|
|
213
|
|
|
214 // Update methods
|
|
|
215
|
|
|
216 void update_allocating_threads() {
|
|
|
217 _allocating_threads++;
|
|
|
218 }
|
|
|
219 void update_number_of_refills(unsigned value) {
|
|
|
220 _total_refills += value;
|
|
|
221 _max_refills = MAX2(_max_refills, value);
|
|
|
222 }
|
|
|
223 void update_allocation(size_t value) {
|
|
|
224 _total_allocation += value;
|
|
|
225 }
|
|
|
226 void update_gc_waste(size_t value) {
|
|
|
227 _total_gc_waste += value;
|
|
|
228 _max_gc_waste = MAX2(_max_gc_waste, value);
|
|
|
229 }
|
|
|
230 void update_fast_refill_waste(size_t value) {
|
|
|
231 _total_fast_refill_waste += value;
|
|
|
232 _max_fast_refill_waste = MAX2(_max_fast_refill_waste, value);
|
|
|
233 }
|
|
|
234 void update_slow_refill_waste(size_t value) {
|
|
|
235 _total_slow_refill_waste += value;
|
|
|
236 _max_slow_refill_waste = MAX2(_max_slow_refill_waste, value);
|
|
|
237 }
|
|
|
238 void update_slow_allocations(unsigned value) {
|
|
|
239 _total_slow_allocations += value;
|
|
|
240 _max_slow_allocations = MAX2(_max_slow_allocations, value);
|
|
|
241 }
|
|
|
242 };
|
