Print this page
| Split |
Close |
| Expand all |
| Collapse all |
--- old/src/share/vm/ci/ciMethodData.hpp
+++ new/src/share/vm/ci/ciMethodData.hpp
1 1 /*
2 - * Copyright (c) 2001, 2010, Oracle and/or its affiliates. All rights reserved.
2 + * Copyright (c) 2001, 2011, Oracle and/or its affiliates. All rights reserved.
3 3 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
4 4 *
5 5 * This code is free software; you can redistribute it and/or modify it
6 6 * under the terms of the GNU General Public License version 2 only, as
7 7 * published by the Free Software Foundation.
8 8 *
9 9 * This code is distributed in the hope that it will be useful, but WITHOUT
10 10 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
11 11 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
12 12 * version 2 for more details (a copy is included in the LICENSE file that
13 13 * accompanied this code).
14 14 *
15 15 * You should have received a copy of the GNU General Public License version
16 16 * 2 along with this work; if not, write to the Free Software Foundation,
17 17 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
18 18 *
19 19 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
20 20 * or visit www.oracle.com if you need additional information or have any
21 21 * questions.
22 22 *
23 23 */
24 24
25 25 #ifndef SHARE_VM_CI_CIMETHODDATA_HPP
26 26 #define SHARE_VM_CI_CIMETHODDATA_HPP
27 27
28 28 #include "ci/ciClassList.hpp"
29 29 #include "ci/ciKlass.hpp"
30 30 #include "ci/ciObject.hpp"
31 31 #include "ci/ciUtilities.hpp"
32 32 #include "oops/methodDataOop.hpp"
33 33 #include "oops/oop.inline.hpp"
34 34
35 35 class ciBitData;
36 36 class ciCounterData;
37 37 class ciJumpData;
38 38 class ciReceiverTypeData;
39 39 class ciRetData;
40 40 class ciBranchData;
41 41 class ciArrayData;
42 42 class ciMultiBranchData;
43 43 class ciArgInfoData;
44 44
45 45 typedef ProfileData ciProfileData;
46 46
47 47 class ciBitData : public BitData {
48 48 public:
49 49 ciBitData(DataLayout* layout) : BitData(layout) {};
50 50 };
51 51
52 52 class ciCounterData : public CounterData {
53 53 public:
54 54 ciCounterData(DataLayout* layout) : CounterData(layout) {};
55 55 };
56 56
57 57 class ciJumpData : public JumpData {
58 58 public:
59 59 ciJumpData(DataLayout* layout) : JumpData(layout) {};
60 60 };
61 61
62 62 class ciReceiverTypeData : public ReceiverTypeData {
63 63 public:
64 64 ciReceiverTypeData(DataLayout* layout) : ReceiverTypeData(layout) {};
65 65
66 66 void set_receiver(uint row, ciKlass* recv) {
67 67 assert((uint)row < row_limit(), "oob");
68 68 set_intptr_at(receiver0_offset + row * receiver_type_row_cell_count,
69 69 (intptr_t) recv);
70 70 }
71 71
72 72 ciKlass* receiver(uint row) {
73 73 assert((uint)row < row_limit(), "oob");
74 74 ciObject* recv = (ciObject*)intptr_at(receiver0_offset + row * receiver_type_row_cell_count);
75 75 assert(recv == NULL || recv->is_klass(), "wrong type");
76 76 return (ciKlass*)recv;
77 77 }
78 78
79 79 // Copy & translate from oop based ReceiverTypeData
80 80 virtual void translate_from(ProfileData* data) {
81 81 translate_receiver_data_from(data);
82 82 }
83 83 void translate_receiver_data_from(ProfileData* data);
84 84 #ifndef PRODUCT
85 85 void print_data_on(outputStream* st);
86 86 void print_receiver_data_on(outputStream* st);
87 87 #endif
88 88 };
89 89
90 90 class ciVirtualCallData : public VirtualCallData {
91 91 // Fake multiple inheritance... It's a ciReceiverTypeData also.
92 92 ciReceiverTypeData* rtd_super() { return (ciReceiverTypeData*) this; }
93 93
94 94 public:
95 95 ciVirtualCallData(DataLayout* layout) : VirtualCallData(layout) {};
96 96
97 97 void set_receiver(uint row, ciKlass* recv) {
98 98 rtd_super()->set_receiver(row, recv);
99 99 }
100 100
101 101 ciKlass* receiver(uint row) {
102 102 return rtd_super()->receiver(row);
103 103 }
104 104
105 105 // Copy & translate from oop based VirtualCallData
106 106 virtual void translate_from(ProfileData* data) {
107 107 rtd_super()->translate_receiver_data_from(data);
108 108 }
109 109 #ifndef PRODUCT
110 110 void print_data_on(outputStream* st);
111 111 #endif
112 112 };
113 113
114 114
115 115 class ciRetData : public RetData {
116 116 public:
117 117 ciRetData(DataLayout* layout) : RetData(layout) {};
118 118 };
119 119
120 120 class ciBranchData : public BranchData {
121 121 public:
122 122 ciBranchData(DataLayout* layout) : BranchData(layout) {};
123 123 };
124 124
125 125 class ciArrayData : public ArrayData {
126 126 public:
127 127 ciArrayData(DataLayout* layout) : ArrayData(layout) {};
128 128 };
129 129
130 130 class ciMultiBranchData : public MultiBranchData {
131 131 public:
132 132 ciMultiBranchData(DataLayout* layout) : MultiBranchData(layout) {};
133 133 };
134 134
135 135 class ciArgInfoData : public ArgInfoData {
136 136 public:
137 137 ciArgInfoData(DataLayout* layout) : ArgInfoData(layout) {};
138 138 };
139 139
140 140 // ciMethodData
141 141 //
142 142 // This class represents a methodDataOop in the HotSpot virtual
143 143 // machine.
144 144
145 145 class ciMethodData : public ciObject {
146 146 CI_PACKAGE_ACCESS
147 147
148 148 private:
149 149 // Size in bytes
150 150 int _data_size;
151 151 int _extra_data_size;
152 152
153 153 // Data entries
154 154 intptr_t* _data;
155 155
156 156 // Cached hint for data_before()
157 157 int _hint_di;
158 158
159 159 // Is data attached? And is it mature?
160 160 enum { empty_state, immature_state, mature_state };
161 161 u_char _state;
162 162
163 163 // Set this true if empty extra_data slots are ever witnessed.
164 164 u_char _saw_free_extra_data;
165 165
166 166 // Support for interprocedural escape analysis
167 167 intx _eflags; // flags on escape information
168 168 intx _arg_local; // bit set of non-escaping arguments
169 169 intx _arg_stack; // bit set of stack-allocatable arguments
170 170 intx _arg_returned; // bit set of returned arguments
171 171
172 172 // Maturity of the oop when the snapshot is taken.
173 173 int _current_mileage;
174 174
175 175 // These counters hold the age of MDO in tiered. In tiered we can have the same method
176 176 // running at different compilation levels concurrently. So, in order to precisely measure
177 177 // its maturity we need separate counters.
178 178 int _invocation_counter;
179 179 int _backedge_counter;
180 180
181 181 // Coherent snapshot of original header.
182 182 methodDataOopDesc _orig;
183 183
184 184 ciMethodData(methodDataHandle h_md);
185 185 ciMethodData();
186 186
187 187 // Accessors
188 188 int data_size() const { return _data_size; }
189 189 int extra_data_size() const { return _extra_data_size; }
190 190 intptr_t * data() const { return _data; }
191 191
192 192 methodDataOop get_methodDataOop() const {
193 193 if (handle() == NULL) return NULL;
194 194 methodDataOop mdo = (methodDataOop)get_oop();
195 195 assert(mdo != NULL, "illegal use of unloaded method data");
196 196 return mdo;
197 197 }
198 198
199 199 const char* type_string() { return "ciMethodData"; }
200 200
201 201 void print_impl(outputStream* st);
202 202
203 203 DataLayout* data_layout_at(int data_index) const {
204 204 assert(data_index % sizeof(intptr_t) == 0, "unaligned");
205 205 return (DataLayout*) (((address)_data) + data_index);
206 206 }
207 207
208 208 bool out_of_bounds(int data_index) {
209 209 return data_index >= data_size();
210 210 }
211 211
212 212 // hint accessors
213 213 int hint_di() const { return _hint_di; }
214 214 void set_hint_di(int di) {
215 215 assert(!out_of_bounds(di), "hint_di out of bounds");
216 216 _hint_di = di;
217 217 }
218 218 ciProfileData* data_before(int bci) {
219 219 // avoid SEGV on this edge case
220 220 if (data_size() == 0)
221 221 return NULL;
222 222 int hint = hint_di();
223 223 if (data_layout_at(hint)->bci() <= bci)
224 224 return data_at(hint);
225 225 return first_data();
|
↓ open down ↓ |
213 lines elided |
↑ open up ↑ |
226 226 }
227 227
228 228
229 229 // What is the index of the first data entry?
230 230 int first_di() { return 0; }
231 231
232 232 ciArgInfoData *arg_info() const;
233 233
234 234 public:
235 235 bool is_method_data() { return true; }
236 - bool is_empty() { return _state == empty_state; }
236 +
237 + void set_mature() { _state = mature_state; }
238 +
239 + bool is_empty() { return _state == empty_state; }
237 240 bool is_mature() { return _state == mature_state; }
238 241
239 242 int creation_mileage() { return _orig.creation_mileage(); }
240 243 int current_mileage() { return _current_mileage; }
241 244
242 245 int invocation_count() { return _invocation_counter; }
243 246 int backedge_count() { return _backedge_counter; }
244 247 // Transfer information about the method to methodDataOop.
245 248 // would_profile means we would like to profile this method,
246 249 // meaning it's not trivial.
247 250 void set_would_profile(bool p);
248 251 // Also set the numer of loops and blocks in the method.
249 252 // Again, this is used to determine if a method is trivial.
250 253 void set_compilation_stats(short loops, short blocks);
251 254
252 255 void load_data();
253 256
254 257 // Convert a dp (data pointer) to a di (data index).
255 258 int dp_to_di(address dp) {
256 259 return dp - ((address)_data);
257 260 }
258 261
259 262 // Get the data at an arbitrary (sort of) data index.
260 263 ciProfileData* data_at(int data_index);
261 264
262 265 // Walk through the data in order.
263 266 ciProfileData* first_data() { return data_at(first_di()); }
264 267 ciProfileData* next_data(ciProfileData* current);
265 268 bool is_valid(ciProfileData* current) { return current != NULL; }
266 269
267 270 // Get the data at an arbitrary bci, or NULL if there is none.
268 271 ciProfileData* bci_to_data(int bci);
269 272 ciProfileData* bci_to_extra_data(int bci, bool create_if_missing);
270 273
271 274 uint overflow_trap_count() const {
272 275 return _orig.overflow_trap_count();
273 276 }
274 277 uint overflow_recompile_count() const {
275 278 return _orig.overflow_recompile_count();
276 279 }
277 280 uint decompile_count() const {
278 281 return _orig.decompile_count();
279 282 }
280 283 uint trap_count(int reason) const {
281 284 return _orig.trap_count(reason);
282 285 }
283 286 uint trap_reason_limit() const { return _orig.trap_reason_limit(); }
284 287 uint trap_count_limit() const { return _orig.trap_count_limit(); }
285 288
286 289 // Helpful query functions that decode trap_state.
287 290 int has_trap_at(ciProfileData* data, int reason);
288 291 int has_trap_at(int bci, int reason) {
289 292 return has_trap_at(bci_to_data(bci), reason);
290 293 }
291 294 int trap_recompiled_at(ciProfileData* data);
292 295 int trap_recompiled_at(int bci) {
293 296 return trap_recompiled_at(bci_to_data(bci));
294 297 }
295 298
296 299 void clear_escape_info();
297 300 bool has_escape_info();
298 301 void update_escape_info();
299 302
300 303 void set_eflag(methodDataOopDesc::EscapeFlag f);
301 304 void clear_eflag(methodDataOopDesc::EscapeFlag f);
302 305 bool eflag_set(methodDataOopDesc::EscapeFlag f) const;
303 306
304 307 void set_arg_local(int i);
305 308 void set_arg_stack(int i);
306 309 void set_arg_returned(int i);
307 310 void set_arg_modified(int arg, uint val);
308 311
309 312 bool is_arg_local(int i) const;
310 313 bool is_arg_stack(int i) const;
311 314 bool is_arg_returned(int i) const;
312 315 uint arg_modified(int arg) const;
313 316
314 317 // Code generation helper
315 318 ByteSize offset_of_slot(ciProfileData* data, ByteSize slot_offset_in_data);
316 319 int byte_offset_of_slot(ciProfileData* data, ByteSize slot_offset_in_data) { return in_bytes(offset_of_slot(data, slot_offset_in_data)); }
317 320
318 321 #ifndef PRODUCT
319 322 // printing support for method data
320 323 void print();
321 324 void print_data_on(outputStream* st);
322 325 #endif
323 326 };
324 327
325 328 #endif // SHARE_VM_CI_CIMETHODDATA_HPP
|
↓ open down ↓ |
79 lines elided |
↑ open up ↑ |
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX