Tue, 25 Feb 2014 18:16:24 +0100
8031752: Failed speculative optimizations should be reattempted when root of compilation is different
Summary: support for speculative traps that keep track of the root of the compilation in which a trap occurs.
Reviewed-by: kvn, twisti
1 /*
2 * Copyright (c) 2000, 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 #include "precompiled.hpp"
26 #include "classfile/systemDictionary.hpp"
27 #include "interpreter/bytecode.hpp"
28 #include "interpreter/bytecodeStream.hpp"
29 #include "interpreter/linkResolver.hpp"
30 #include "memory/heapInspection.hpp"
31 #include "oops/methodData.hpp"
32 #include "prims/jvmtiRedefineClasses.hpp"
33 #include "runtime/compilationPolicy.hpp"
34 #include "runtime/deoptimization.hpp"
35 #include "runtime/handles.inline.hpp"
37 // ==================================================================
38 // DataLayout
39 //
40 // Overlay for generic profiling data.
42 // Some types of data layouts need a length field.
43 bool DataLayout::needs_array_len(u1 tag) {
44 return (tag == multi_branch_data_tag) || (tag == arg_info_data_tag) || (tag == parameters_type_data_tag);
45 }
47 // Perform generic initialization of the data. More specific
48 // initialization occurs in overrides of ProfileData::post_initialize.
49 void DataLayout::initialize(u1 tag, u2 bci, int cell_count) {
50 _header._bits = (intptr_t)0;
51 _header._struct._tag = tag;
52 _header._struct._bci = bci;
53 for (int i = 0; i < cell_count; i++) {
54 set_cell_at(i, (intptr_t)0);
55 }
56 if (needs_array_len(tag)) {
57 set_cell_at(ArrayData::array_len_off_set, cell_count - 1); // -1 for header.
58 }
59 if (tag == call_type_data_tag) {
60 CallTypeData::initialize(this, cell_count);
61 } else if (tag == virtual_call_type_data_tag) {
62 VirtualCallTypeData::initialize(this, cell_count);
63 }
64 }
66 void DataLayout::clean_weak_klass_links(BoolObjectClosure* cl) {
67 ResourceMark m;
68 data_in()->clean_weak_klass_links(cl);
69 }
72 // ==================================================================
73 // ProfileData
74 //
75 // A ProfileData object is created to refer to a section of profiling
76 // data in a structured way.
78 // Constructor for invalid ProfileData.
79 ProfileData::ProfileData() {
80 _data = NULL;
81 }
83 char* ProfileData::print_data_on_helper(const MethodData* md) const {
84 DataLayout* dp = md->extra_data_base();
85 DataLayout* end = md->extra_data_limit();
86 stringStream ss;
87 for (;; dp = MethodData::next_extra(dp)) {
88 assert(dp < end, "moved past end of extra data");
89 switch(dp->tag()) {
90 case DataLayout::speculative_trap_data_tag:
91 if (dp->bci() == bci()) {
92 SpeculativeTrapData* data = new SpeculativeTrapData(dp);
93 int trap = data->trap_state();
94 char buf[100];
95 ss.print("trap/");
96 data->method()->print_short_name(&ss);
97 ss.print("(%s) ", Deoptimization::format_trap_state(buf, sizeof(buf), trap));
98 }
99 break;
100 case DataLayout::bit_data_tag:
101 break;
102 case DataLayout::no_tag:
103 case DataLayout::arg_info_data_tag:
104 return ss.as_string();
105 break;
106 default:
107 fatal(err_msg("unexpected tag %d", dp->tag()));
108 }
109 }
110 return NULL;
111 }
113 void ProfileData::print_data_on(outputStream* st, const MethodData* md) const {
114 print_data_on(st, print_data_on_helper(md));
115 }
117 #ifndef PRODUCT
118 void ProfileData::print_shared(outputStream* st, const char* name, const char* extra) const {
119 st->print("bci: %d", bci());
120 st->fill_to(tab_width_one);
121 st->print("%s", name);
122 tab(st);
123 int trap = trap_state();
124 if (trap != 0) {
125 char buf[100];
126 st->print("trap(%s) ", Deoptimization::format_trap_state(buf, sizeof(buf), trap));
127 }
128 if (extra != NULL) {
129 st->print(extra);
130 }
131 int flags = data()->flags();
132 if (flags != 0) {
133 st->print("flags(%d) ", flags);
134 }
135 }
137 void ProfileData::tab(outputStream* st, bool first) const {
138 st->fill_to(first ? tab_width_one : tab_width_two);
139 }
140 #endif // !PRODUCT
142 // ==================================================================
143 // BitData
144 //
145 // A BitData corresponds to a one-bit flag. This is used to indicate
146 // whether a checkcast bytecode has seen a null value.
149 #ifndef PRODUCT
150 void BitData::print_data_on(outputStream* st, const char* extra) const {
151 print_shared(st, "BitData", extra);
152 }
153 #endif // !PRODUCT
155 // ==================================================================
156 // CounterData
157 //
158 // A CounterData corresponds to a simple counter.
160 #ifndef PRODUCT
161 void CounterData::print_data_on(outputStream* st, const char* extra) const {
162 print_shared(st, "CounterData", extra);
163 st->print_cr("count(%u)", count());
164 }
165 #endif // !PRODUCT
167 // ==================================================================
168 // JumpData
169 //
170 // A JumpData is used to access profiling information for a direct
171 // branch. It is a counter, used for counting the number of branches,
172 // plus a data displacement, used for realigning the data pointer to
173 // the corresponding target bci.
175 void JumpData::post_initialize(BytecodeStream* stream, MethodData* mdo) {
176 assert(stream->bci() == bci(), "wrong pos");
177 int target;
178 Bytecodes::Code c = stream->code();
179 if (c == Bytecodes::_goto_w || c == Bytecodes::_jsr_w) {
180 target = stream->dest_w();
181 } else {
182 target = stream->dest();
183 }
184 int my_di = mdo->dp_to_di(dp());
185 int target_di = mdo->bci_to_di(target);
186 int offset = target_di - my_di;
187 set_displacement(offset);
188 }
190 #ifndef PRODUCT
191 void JumpData::print_data_on(outputStream* st, const char* extra) const {
192 print_shared(st, "JumpData", extra);
193 st->print_cr("taken(%u) displacement(%d)", taken(), displacement());
194 }
195 #endif // !PRODUCT
197 int TypeStackSlotEntries::compute_cell_count(Symbol* signature, bool include_receiver, int max) {
198 // Parameter profiling include the receiver
199 int args_count = include_receiver ? 1 : 0;
200 ResourceMark rm;
201 SignatureStream ss(signature);
202 args_count += ss.reference_parameter_count();
203 args_count = MIN2(args_count, max);
204 return args_count * per_arg_cell_count;
205 }
207 int TypeEntriesAtCall::compute_cell_count(BytecodeStream* stream) {
208 assert(Bytecodes::is_invoke(stream->code()), "should be invoke");
209 assert(TypeStackSlotEntries::per_arg_count() > ReturnTypeEntry::static_cell_count(), "code to test for arguments/results broken");
210 Bytecode_invoke inv(stream->method(), stream->bci());
211 int args_cell = 0;
212 if (arguments_profiling_enabled()) {
213 args_cell = TypeStackSlotEntries::compute_cell_count(inv.signature(), false, TypeProfileArgsLimit);
214 }
215 int ret_cell = 0;
216 if (return_profiling_enabled() && (inv.result_type() == T_OBJECT || inv.result_type() == T_ARRAY)) {
217 ret_cell = ReturnTypeEntry::static_cell_count();
218 }
219 int header_cell = 0;
220 if (args_cell + ret_cell > 0) {
221 header_cell = header_cell_count();
222 }
224 return header_cell + args_cell + ret_cell;
225 }
227 class ArgumentOffsetComputer : public SignatureInfo {
228 private:
229 int _max;
230 GrowableArray<int> _offsets;
232 void set(int size, BasicType type) { _size += size; }
233 void do_object(int begin, int end) {
234 if (_offsets.length() < _max) {
235 _offsets.push(_size);
236 }
237 SignatureInfo::do_object(begin, end);
238 }
239 void do_array (int begin, int end) {
240 if (_offsets.length() < _max) {
241 _offsets.push(_size);
242 }
243 SignatureInfo::do_array(begin, end);
244 }
246 public:
247 ArgumentOffsetComputer(Symbol* signature, int max)
248 : SignatureInfo(signature), _max(max), _offsets(Thread::current(), max) {
249 }
251 int total() { lazy_iterate_parameters(); return _size; }
253 int off_at(int i) const { return _offsets.at(i); }
254 };
256 void TypeStackSlotEntries::post_initialize(Symbol* signature, bool has_receiver, bool include_receiver) {
257 ResourceMark rm;
258 int start = 0;
259 // Parameter profiling include the receiver
260 if (include_receiver && has_receiver) {
261 set_stack_slot(0, 0);
262 set_type(0, type_none());
263 start += 1;
264 }
265 ArgumentOffsetComputer aos(signature, _number_of_entries-start);
266 aos.total();
267 for (int i = start; i < _number_of_entries; i++) {
268 set_stack_slot(i, aos.off_at(i-start) + (has_receiver ? 1 : 0));
269 set_type(i, type_none());
270 }
271 }
273 void CallTypeData::post_initialize(BytecodeStream* stream, MethodData* mdo) {
274 assert(Bytecodes::is_invoke(stream->code()), "should be invoke");
275 Bytecode_invoke inv(stream->method(), stream->bci());
277 SignatureStream ss(inv.signature());
278 if (has_arguments()) {
279 #ifdef ASSERT
280 ResourceMark rm;
281 int count = MIN2(ss.reference_parameter_count(), (int)TypeProfileArgsLimit);
282 assert(count > 0, "room for args type but none found?");
283 check_number_of_arguments(count);
284 #endif
285 _args.post_initialize(inv.signature(), inv.has_receiver(), false);
286 }
288 if (has_return()) {
289 assert(inv.result_type() == T_OBJECT || inv.result_type() == T_ARRAY, "room for a ret type but doesn't return obj?");
290 _ret.post_initialize();
291 }
292 }
294 void VirtualCallTypeData::post_initialize(BytecodeStream* stream, MethodData* mdo) {
295 assert(Bytecodes::is_invoke(stream->code()), "should be invoke");
296 Bytecode_invoke inv(stream->method(), stream->bci());
298 if (has_arguments()) {
299 #ifdef ASSERT
300 ResourceMark rm;
301 SignatureStream ss(inv.signature());
302 int count = MIN2(ss.reference_parameter_count(), (int)TypeProfileArgsLimit);
303 assert(count > 0, "room for args type but none found?");
304 check_number_of_arguments(count);
305 #endif
306 _args.post_initialize(inv.signature(), inv.has_receiver(), false);
307 }
309 if (has_return()) {
310 assert(inv.result_type() == T_OBJECT || inv.result_type() == T_ARRAY, "room for a ret type but doesn't return obj?");
311 _ret.post_initialize();
312 }
313 }
315 bool TypeEntries::is_loader_alive(BoolObjectClosure* is_alive_cl, intptr_t p) {
316 Klass* k = (Klass*)klass_part(p);
317 return k != NULL && k->is_loader_alive(is_alive_cl);
318 }
320 void TypeStackSlotEntries::clean_weak_klass_links(BoolObjectClosure* is_alive_cl) {
321 for (int i = 0; i < _number_of_entries; i++) {
322 intptr_t p = type(i);
323 if (!is_loader_alive(is_alive_cl, p)) {
324 set_type(i, with_status((Klass*)NULL, p));
325 }
326 }
327 }
329 void ReturnTypeEntry::clean_weak_klass_links(BoolObjectClosure* is_alive_cl) {
330 intptr_t p = type();
331 if (!is_loader_alive(is_alive_cl, p)) {
332 set_type(with_status((Klass*)NULL, p));
333 }
334 }
336 bool TypeEntriesAtCall::return_profiling_enabled() {
337 return MethodData::profile_return();
338 }
340 bool TypeEntriesAtCall::arguments_profiling_enabled() {
341 return MethodData::profile_arguments();
342 }
344 #ifndef PRODUCT
345 void TypeEntries::print_klass(outputStream* st, intptr_t k) {
346 if (is_type_none(k)) {
347 st->print("none");
348 } else if (is_type_unknown(k)) {
349 st->print("unknown");
350 } else {
351 valid_klass(k)->print_value_on(st);
352 }
353 if (was_null_seen(k)) {
354 st->print(" (null seen)");
355 }
356 }
358 void TypeStackSlotEntries::print_data_on(outputStream* st) const {
359 for (int i = 0; i < _number_of_entries; i++) {
360 _pd->tab(st);
361 st->print("%d: stack(%u) ", i, stack_slot(i));
362 print_klass(st, type(i));
363 st->cr();
364 }
365 }
367 void ReturnTypeEntry::print_data_on(outputStream* st) const {
368 _pd->tab(st);
369 print_klass(st, type());
370 st->cr();
371 }
373 void CallTypeData::print_data_on(outputStream* st, const char* extra) const {
374 CounterData::print_data_on(st, extra);
375 if (has_arguments()) {
376 tab(st, true);
377 st->print("argument types");
378 _args.print_data_on(st);
379 }
380 if (has_return()) {
381 tab(st, true);
382 st->print("return type");
383 _ret.print_data_on(st);
384 }
385 }
387 void VirtualCallTypeData::print_data_on(outputStream* st, const char* extra) const {
388 VirtualCallData::print_data_on(st, extra);
389 if (has_arguments()) {
390 tab(st, true);
391 st->print("argument types");
392 _args.print_data_on(st);
393 }
394 if (has_return()) {
395 tab(st, true);
396 st->print("return type");
397 _ret.print_data_on(st);
398 }
399 }
400 #endif
402 // ==================================================================
403 // ReceiverTypeData
404 //
405 // A ReceiverTypeData is used to access profiling information about a
406 // dynamic type check. It consists of a counter which counts the total times
407 // that the check is reached, and a series of (Klass*, count) pairs
408 // which are used to store a type profile for the receiver of the check.
410 void ReceiverTypeData::clean_weak_klass_links(BoolObjectClosure* is_alive_cl) {
411 for (uint row = 0; row < row_limit(); row++) {
412 Klass* p = receiver(row);
413 if (p != NULL && !p->is_loader_alive(is_alive_cl)) {
414 clear_row(row);
415 }
416 }
417 }
419 #ifndef PRODUCT
420 void ReceiverTypeData::print_receiver_data_on(outputStream* st) const {
421 uint row;
422 int entries = 0;
423 for (row = 0; row < row_limit(); row++) {
424 if (receiver(row) != NULL) entries++;
425 }
426 st->print_cr("count(%u) entries(%u)", count(), entries);
427 int total = count();
428 for (row = 0; row < row_limit(); row++) {
429 if (receiver(row) != NULL) {
430 total += receiver_count(row);
431 }
432 }
433 for (row = 0; row < row_limit(); row++) {
434 if (receiver(row) != NULL) {
435 tab(st);
436 receiver(row)->print_value_on(st);
437 st->print_cr("(%u %4.2f)", receiver_count(row), (float) receiver_count(row) / (float) total);
438 }
439 }
440 }
441 void ReceiverTypeData::print_data_on(outputStream* st, const char* extra) const {
442 print_shared(st, "ReceiverTypeData", extra);
443 print_receiver_data_on(st);
444 }
445 void VirtualCallData::print_data_on(outputStream* st, const char* extra) const {
446 print_shared(st, "VirtualCallData", extra);
447 print_receiver_data_on(st);
448 }
449 #endif // !PRODUCT
451 // ==================================================================
452 // RetData
453 //
454 // A RetData is used to access profiling information for a ret bytecode.
455 // It is composed of a count of the number of times that the ret has
456 // been executed, followed by a series of triples of the form
457 // (bci, count, di) which count the number of times that some bci was the
458 // target of the ret and cache a corresponding displacement.
460 void RetData::post_initialize(BytecodeStream* stream, MethodData* mdo) {
461 for (uint row = 0; row < row_limit(); row++) {
462 set_bci_displacement(row, -1);
463 set_bci(row, no_bci);
464 }
465 // release so other threads see a consistent state. bci is used as
466 // a valid flag for bci_displacement.
467 OrderAccess::release();
468 }
470 // This routine needs to atomically update the RetData structure, so the
471 // caller needs to hold the RetData_lock before it gets here. Since taking
472 // the lock can block (and allow GC) and since RetData is a ProfileData is a
473 // wrapper around a derived oop, taking the lock in _this_ method will
474 // basically cause the 'this' pointer's _data field to contain junk after the
475 // lock. We require the caller to take the lock before making the ProfileData
476 // structure. Currently the only caller is InterpreterRuntime::update_mdp_for_ret
477 address RetData::fixup_ret(int return_bci, MethodData* h_mdo) {
478 // First find the mdp which corresponds to the return bci.
479 address mdp = h_mdo->bci_to_dp(return_bci);
481 // Now check to see if any of the cache slots are open.
482 for (uint row = 0; row < row_limit(); row++) {
483 if (bci(row) == no_bci) {
484 set_bci_displacement(row, mdp - dp());
485 set_bci_count(row, DataLayout::counter_increment);
486 // Barrier to ensure displacement is written before the bci; allows
487 // the interpreter to read displacement without fear of race condition.
488 release_set_bci(row, return_bci);
489 break;
490 }
491 }
492 return mdp;
493 }
496 #ifndef PRODUCT
497 void RetData::print_data_on(outputStream* st, const char* extra) const {
498 print_shared(st, "RetData", extra);
499 uint row;
500 int entries = 0;
501 for (row = 0; row < row_limit(); row++) {
502 if (bci(row) != no_bci) entries++;
503 }
504 st->print_cr("count(%u) entries(%u)", count(), entries);
505 for (row = 0; row < row_limit(); row++) {
506 if (bci(row) != no_bci) {
507 tab(st);
508 st->print_cr("bci(%d: count(%u) displacement(%d))",
509 bci(row), bci_count(row), bci_displacement(row));
510 }
511 }
512 }
513 #endif // !PRODUCT
515 // ==================================================================
516 // BranchData
517 //
518 // A BranchData is used to access profiling data for a two-way branch.
519 // It consists of taken and not_taken counts as well as a data displacement
520 // for the taken case.
522 void BranchData::post_initialize(BytecodeStream* stream, MethodData* mdo) {
523 assert(stream->bci() == bci(), "wrong pos");
524 int target = stream->dest();
525 int my_di = mdo->dp_to_di(dp());
526 int target_di = mdo->bci_to_di(target);
527 int offset = target_di - my_di;
528 set_displacement(offset);
529 }
531 #ifndef PRODUCT
532 void BranchData::print_data_on(outputStream* st, const char* extra) const {
533 print_shared(st, "BranchData", extra);
534 st->print_cr("taken(%u) displacement(%d)",
535 taken(), displacement());
536 tab(st);
537 st->print_cr("not taken(%u)", not_taken());
538 }
539 #endif
541 // ==================================================================
542 // MultiBranchData
543 //
544 // A MultiBranchData is used to access profiling information for
545 // a multi-way branch (*switch bytecodes). It consists of a series
546 // of (count, displacement) pairs, which count the number of times each
547 // case was taken and specify the data displacment for each branch target.
549 int MultiBranchData::compute_cell_count(BytecodeStream* stream) {
550 int cell_count = 0;
551 if (stream->code() == Bytecodes::_tableswitch) {
552 Bytecode_tableswitch sw(stream->method()(), stream->bcp());
553 cell_count = 1 + per_case_cell_count * (1 + sw.length()); // 1 for default
554 } else {
555 Bytecode_lookupswitch sw(stream->method()(), stream->bcp());
556 cell_count = 1 + per_case_cell_count * (sw.number_of_pairs() + 1); // 1 for default
557 }
558 return cell_count;
559 }
561 void MultiBranchData::post_initialize(BytecodeStream* stream,
562 MethodData* mdo) {
563 assert(stream->bci() == bci(), "wrong pos");
564 int target;
565 int my_di;
566 int target_di;
567 int offset;
568 if (stream->code() == Bytecodes::_tableswitch) {
569 Bytecode_tableswitch sw(stream->method()(), stream->bcp());
570 int len = sw.length();
571 assert(array_len() == per_case_cell_count * (len + 1), "wrong len");
572 for (int count = 0; count < len; count++) {
573 target = sw.dest_offset_at(count) + bci();
574 my_di = mdo->dp_to_di(dp());
575 target_di = mdo->bci_to_di(target);
576 offset = target_di - my_di;
577 set_displacement_at(count, offset);
578 }
579 target = sw.default_offset() + bci();
580 my_di = mdo->dp_to_di(dp());
581 target_di = mdo->bci_to_di(target);
582 offset = target_di - my_di;
583 set_default_displacement(offset);
585 } else {
586 Bytecode_lookupswitch sw(stream->method()(), stream->bcp());
587 int npairs = sw.number_of_pairs();
588 assert(array_len() == per_case_cell_count * (npairs + 1), "wrong len");
589 for (int count = 0; count < npairs; count++) {
590 LookupswitchPair pair = sw.pair_at(count);
591 target = pair.offset() + bci();
592 my_di = mdo->dp_to_di(dp());
593 target_di = mdo->bci_to_di(target);
594 offset = target_di - my_di;
595 set_displacement_at(count, offset);
596 }
597 target = sw.default_offset() + bci();
598 my_di = mdo->dp_to_di(dp());
599 target_di = mdo->bci_to_di(target);
600 offset = target_di - my_di;
601 set_default_displacement(offset);
602 }
603 }
605 #ifndef PRODUCT
606 void MultiBranchData::print_data_on(outputStream* st, const char* extra) const {
607 print_shared(st, "MultiBranchData", extra);
608 st->print_cr("default_count(%u) displacement(%d)",
609 default_count(), default_displacement());
610 int cases = number_of_cases();
611 for (int i = 0; i < cases; i++) {
612 tab(st);
613 st->print_cr("count(%u) displacement(%d)",
614 count_at(i), displacement_at(i));
615 }
616 }
617 #endif
619 #ifndef PRODUCT
620 void ArgInfoData::print_data_on(outputStream* st, const char* extra) const {
621 print_shared(st, "ArgInfoData", extra);
622 int nargs = number_of_args();
623 for (int i = 0; i < nargs; i++) {
624 st->print(" 0x%x", arg_modified(i));
625 }
626 st->cr();
627 }
629 #endif
631 int ParametersTypeData::compute_cell_count(Method* m) {
632 if (!MethodData::profile_parameters_for_method(m)) {
633 return 0;
634 }
635 int max = TypeProfileParmsLimit == -1 ? INT_MAX : TypeProfileParmsLimit;
636 int obj_args = TypeStackSlotEntries::compute_cell_count(m->signature(), !m->is_static(), max);
637 if (obj_args > 0) {
638 return obj_args + 1; // 1 cell for array len
639 }
640 return 0;
641 }
643 void ParametersTypeData::post_initialize(BytecodeStream* stream, MethodData* mdo) {
644 _parameters.post_initialize(mdo->method()->signature(), !mdo->method()->is_static(), true);
645 }
647 bool ParametersTypeData::profiling_enabled() {
648 return MethodData::profile_parameters();
649 }
651 #ifndef PRODUCT
652 void ParametersTypeData::print_data_on(outputStream* st, const char* extra) const {
653 st->print("parameter types", extra);
654 _parameters.print_data_on(st);
655 }
657 void SpeculativeTrapData::print_data_on(outputStream* st, const char* extra) const {
658 print_shared(st, "SpeculativeTrapData", extra);
659 tab(st);
660 method()->print_short_name(st);
661 st->cr();
662 }
663 #endif
665 // ==================================================================
666 // MethodData*
667 //
668 // A MethodData* holds information which has been collected about
669 // a method.
671 MethodData* MethodData::allocate(ClassLoaderData* loader_data, methodHandle method, TRAPS) {
672 int size = MethodData::compute_allocation_size_in_words(method);
674 return new (loader_data, size, false, MetaspaceObj::MethodDataType, THREAD)
675 MethodData(method(), size, CHECK_NULL);
676 }
678 int MethodData::bytecode_cell_count(Bytecodes::Code code) {
679 #if defined(COMPILER1) && !defined(COMPILER2)
680 return no_profile_data;
681 #else
682 switch (code) {
683 case Bytecodes::_checkcast:
684 case Bytecodes::_instanceof:
685 case Bytecodes::_aastore:
686 if (TypeProfileCasts) {
687 return ReceiverTypeData::static_cell_count();
688 } else {
689 return BitData::static_cell_count();
690 }
691 case Bytecodes::_invokespecial:
692 case Bytecodes::_invokestatic:
693 if (MethodData::profile_arguments() || MethodData::profile_return()) {
694 return variable_cell_count;
695 } else {
696 return CounterData::static_cell_count();
697 }
698 case Bytecodes::_goto:
699 case Bytecodes::_goto_w:
700 case Bytecodes::_jsr:
701 case Bytecodes::_jsr_w:
702 return JumpData::static_cell_count();
703 case Bytecodes::_invokevirtual:
704 case Bytecodes::_invokeinterface:
705 if (MethodData::profile_arguments() || MethodData::profile_return()) {
706 return variable_cell_count;
707 } else {
708 return VirtualCallData::static_cell_count();
709 }
710 case Bytecodes::_invokedynamic:
711 if (MethodData::profile_arguments() || MethodData::profile_return()) {
712 return variable_cell_count;
713 } else {
714 return CounterData::static_cell_count();
715 }
716 case Bytecodes::_ret:
717 return RetData::static_cell_count();
718 case Bytecodes::_ifeq:
719 case Bytecodes::_ifne:
720 case Bytecodes::_iflt:
721 case Bytecodes::_ifge:
722 case Bytecodes::_ifgt:
723 case Bytecodes::_ifle:
724 case Bytecodes::_if_icmpeq:
725 case Bytecodes::_if_icmpne:
726 case Bytecodes::_if_icmplt:
727 case Bytecodes::_if_icmpge:
728 case Bytecodes::_if_icmpgt:
729 case Bytecodes::_if_icmple:
730 case Bytecodes::_if_acmpeq:
731 case Bytecodes::_if_acmpne:
732 case Bytecodes::_ifnull:
733 case Bytecodes::_ifnonnull:
734 return BranchData::static_cell_count();
735 case Bytecodes::_lookupswitch:
736 case Bytecodes::_tableswitch:
737 return variable_cell_count;
738 }
739 return no_profile_data;
740 #endif
741 }
743 // Compute the size of the profiling information corresponding to
744 // the current bytecode.
745 int MethodData::compute_data_size(BytecodeStream* stream) {
746 int cell_count = bytecode_cell_count(stream->code());
747 if (cell_count == no_profile_data) {
748 return 0;
749 }
750 if (cell_count == variable_cell_count) {
751 switch (stream->code()) {
752 case Bytecodes::_lookupswitch:
753 case Bytecodes::_tableswitch:
754 cell_count = MultiBranchData::compute_cell_count(stream);
755 break;
756 case Bytecodes::_invokespecial:
757 case Bytecodes::_invokestatic:
758 case Bytecodes::_invokedynamic:
759 assert(MethodData::profile_arguments() || MethodData::profile_return(), "should be collecting args profile");
760 if (profile_arguments_for_invoke(stream->method(), stream->bci()) ||
761 profile_return_for_invoke(stream->method(), stream->bci())) {
762 cell_count = CallTypeData::compute_cell_count(stream);
763 } else {
764 cell_count = CounterData::static_cell_count();
765 }
766 break;
767 case Bytecodes::_invokevirtual:
768 case Bytecodes::_invokeinterface: {
769 assert(MethodData::profile_arguments() || MethodData::profile_return(), "should be collecting args profile");
770 if (profile_arguments_for_invoke(stream->method(), stream->bci()) ||
771 profile_return_for_invoke(stream->method(), stream->bci())) {
772 cell_count = VirtualCallTypeData::compute_cell_count(stream);
773 } else {
774 cell_count = VirtualCallData::static_cell_count();
775 }
776 break;
777 }
778 default:
779 fatal("unexpected bytecode for var length profile data");
780 }
781 }
782 // Note: cell_count might be zero, meaning that there is just
783 // a DataLayout header, with no extra cells.
784 assert(cell_count >= 0, "sanity");
785 return DataLayout::compute_size_in_bytes(cell_count);
786 }
788 bool MethodData::is_speculative_trap_bytecode(Bytecodes::Code code) {
789 // Bytecodes for which we may use speculation
790 switch (code) {
791 case Bytecodes::_checkcast:
792 case Bytecodes::_instanceof:
793 case Bytecodes::_aastore:
794 case Bytecodes::_invokevirtual:
795 case Bytecodes::_invokeinterface:
796 case Bytecodes::_if_acmpeq:
797 case Bytecodes::_if_acmpne:
798 case Bytecodes::_invokestatic:
799 #ifdef COMPILER2
800 return UseTypeSpeculation;
801 #endif
802 default:
803 return false;
804 }
805 return false;
806 }
808 int MethodData::compute_extra_data_count(int data_size, int empty_bc_count, bool needs_speculative_traps) {
809 if (ProfileTraps) {
810 // Assume that up to 3% of BCIs with no MDP will need to allocate one.
811 int extra_data_count = (uint)(empty_bc_count * 3) / 128 + 1;
812 // If the method is large, let the extra BCIs grow numerous (to ~1%).
813 int one_percent_of_data
814 = (uint)data_size / (DataLayout::header_size_in_bytes()*128);
815 if (extra_data_count < one_percent_of_data)
816 extra_data_count = one_percent_of_data;
817 if (extra_data_count > empty_bc_count)
818 extra_data_count = empty_bc_count; // no need for more
820 // Make sure we have a minimum number of extra data slots to
821 // allocate SpeculativeTrapData entries. We would want to have one
822 // entry per compilation that inlines this method and for which
823 // some type speculation assumption fails. So the room we need for
824 // the SpeculativeTrapData entries doesn't directly depend on the
825 // size of the method. Because it's hard to estimate, we reserve
826 // space for an arbitrary number of entries.
827 int spec_data_count = (needs_speculative_traps ? SpecTrapLimitExtraEntries : 0) *
828 (SpeculativeTrapData::static_cell_count() + DataLayout::header_size_in_cells());
830 return MAX2(extra_data_count, spec_data_count);
831 } else {
832 return 0;
833 }
834 }
836 // Compute the size of the MethodData* necessary to store
837 // profiling information about a given method. Size is in bytes.
838 int MethodData::compute_allocation_size_in_bytes(methodHandle method) {
839 int data_size = 0;
840 BytecodeStream stream(method);
841 Bytecodes::Code c;
842 int empty_bc_count = 0; // number of bytecodes lacking data
843 bool needs_speculative_traps = false;
844 while ((c = stream.next()) >= 0) {
845 int size_in_bytes = compute_data_size(&stream);
846 data_size += size_in_bytes;
847 if (size_in_bytes == 0) empty_bc_count += 1;
848 needs_speculative_traps = needs_speculative_traps || is_speculative_trap_bytecode(c);
849 }
850 int object_size = in_bytes(data_offset()) + data_size;
852 // Add some extra DataLayout cells (at least one) to track stray traps.
853 int extra_data_count = compute_extra_data_count(data_size, empty_bc_count, needs_speculative_traps);
854 object_size += extra_data_count * DataLayout::compute_size_in_bytes(0);
856 // Add a cell to record information about modified arguments.
857 int arg_size = method->size_of_parameters();
858 object_size += DataLayout::compute_size_in_bytes(arg_size+1);
860 // Reserve room for an area of the MDO dedicated to profiling of
861 // parameters
862 int args_cell = ParametersTypeData::compute_cell_count(method());
863 if (args_cell > 0) {
864 object_size += DataLayout::compute_size_in_bytes(args_cell);
865 }
866 return object_size;
867 }
869 // Compute the size of the MethodData* necessary to store
870 // profiling information about a given method. Size is in words
871 int MethodData::compute_allocation_size_in_words(methodHandle method) {
872 int byte_size = compute_allocation_size_in_bytes(method);
873 int word_size = align_size_up(byte_size, BytesPerWord) / BytesPerWord;
874 return align_object_size(word_size);
875 }
877 // Initialize an individual data segment. Returns the size of
878 // the segment in bytes.
879 int MethodData::initialize_data(BytecodeStream* stream,
880 int data_index) {
881 #if defined(COMPILER1) && !defined(COMPILER2)
882 return 0;
883 #else
884 int cell_count = -1;
885 int tag = DataLayout::no_tag;
886 DataLayout* data_layout = data_layout_at(data_index);
887 Bytecodes::Code c = stream->code();
888 switch (c) {
889 case Bytecodes::_checkcast:
890 case Bytecodes::_instanceof:
891 case Bytecodes::_aastore:
892 if (TypeProfileCasts) {
893 cell_count = ReceiverTypeData::static_cell_count();
894 tag = DataLayout::receiver_type_data_tag;
895 } else {
896 cell_count = BitData::static_cell_count();
897 tag = DataLayout::bit_data_tag;
898 }
899 break;
900 case Bytecodes::_invokespecial:
901 case Bytecodes::_invokestatic: {
902 int counter_data_cell_count = CounterData::static_cell_count();
903 if (profile_arguments_for_invoke(stream->method(), stream->bci()) ||
904 profile_return_for_invoke(stream->method(), stream->bci())) {
905 cell_count = CallTypeData::compute_cell_count(stream);
906 } else {
907 cell_count = counter_data_cell_count;
908 }
909 if (cell_count > counter_data_cell_count) {
910 tag = DataLayout::call_type_data_tag;
911 } else {
912 tag = DataLayout::counter_data_tag;
913 }
914 break;
915 }
916 case Bytecodes::_goto:
917 case Bytecodes::_goto_w:
918 case Bytecodes::_jsr:
919 case Bytecodes::_jsr_w:
920 cell_count = JumpData::static_cell_count();
921 tag = DataLayout::jump_data_tag;
922 break;
923 case Bytecodes::_invokevirtual:
924 case Bytecodes::_invokeinterface: {
925 int virtual_call_data_cell_count = VirtualCallData::static_cell_count();
926 if (profile_arguments_for_invoke(stream->method(), stream->bci()) ||
927 profile_return_for_invoke(stream->method(), stream->bci())) {
928 cell_count = VirtualCallTypeData::compute_cell_count(stream);
929 } else {
930 cell_count = virtual_call_data_cell_count;
931 }
932 if (cell_count > virtual_call_data_cell_count) {
933 tag = DataLayout::virtual_call_type_data_tag;
934 } else {
935 tag = DataLayout::virtual_call_data_tag;
936 }
937 break;
938 }
939 case Bytecodes::_invokedynamic: {
940 // %%% should make a type profile for any invokedynamic that takes a ref argument
941 int counter_data_cell_count = CounterData::static_cell_count();
942 if (profile_arguments_for_invoke(stream->method(), stream->bci()) ||
943 profile_return_for_invoke(stream->method(), stream->bci())) {
944 cell_count = CallTypeData::compute_cell_count(stream);
945 } else {
946 cell_count = counter_data_cell_count;
947 }
948 if (cell_count > counter_data_cell_count) {
949 tag = DataLayout::call_type_data_tag;
950 } else {
951 tag = DataLayout::counter_data_tag;
952 }
953 break;
954 }
955 case Bytecodes::_ret:
956 cell_count = RetData::static_cell_count();
957 tag = DataLayout::ret_data_tag;
958 break;
959 case Bytecodes::_ifeq:
960 case Bytecodes::_ifne:
961 case Bytecodes::_iflt:
962 case Bytecodes::_ifge:
963 case Bytecodes::_ifgt:
964 case Bytecodes::_ifle:
965 case Bytecodes::_if_icmpeq:
966 case Bytecodes::_if_icmpne:
967 case Bytecodes::_if_icmplt:
968 case Bytecodes::_if_icmpge:
969 case Bytecodes::_if_icmpgt:
970 case Bytecodes::_if_icmple:
971 case Bytecodes::_if_acmpeq:
972 case Bytecodes::_if_acmpne:
973 case Bytecodes::_ifnull:
974 case Bytecodes::_ifnonnull:
975 cell_count = BranchData::static_cell_count();
976 tag = DataLayout::branch_data_tag;
977 break;
978 case Bytecodes::_lookupswitch:
979 case Bytecodes::_tableswitch:
980 cell_count = MultiBranchData::compute_cell_count(stream);
981 tag = DataLayout::multi_branch_data_tag;
982 break;
983 }
984 assert(tag == DataLayout::multi_branch_data_tag ||
985 ((MethodData::profile_arguments() || MethodData::profile_return()) &&
986 (tag == DataLayout::call_type_data_tag ||
987 tag == DataLayout::counter_data_tag ||
988 tag == DataLayout::virtual_call_type_data_tag ||
989 tag == DataLayout::virtual_call_data_tag)) ||
990 cell_count == bytecode_cell_count(c), "cell counts must agree");
991 if (cell_count >= 0) {
992 assert(tag != DataLayout::no_tag, "bad tag");
993 assert(bytecode_has_profile(c), "agree w/ BHP");
994 data_layout->initialize(tag, stream->bci(), cell_count);
995 return DataLayout::compute_size_in_bytes(cell_count);
996 } else {
997 assert(!bytecode_has_profile(c), "agree w/ !BHP");
998 return 0;
999 }
1000 #endif
1001 }
1003 // Get the data at an arbitrary (sort of) data index.
1004 ProfileData* MethodData::data_at(int data_index) const {
1005 if (out_of_bounds(data_index)) {
1006 return NULL;
1007 }
1008 DataLayout* data_layout = data_layout_at(data_index);
1009 return data_layout->data_in();
1010 }
1012 ProfileData* DataLayout::data_in() {
1013 switch (tag()) {
1014 case DataLayout::no_tag:
1015 default:
1016 ShouldNotReachHere();
1017 return NULL;
1018 case DataLayout::bit_data_tag:
1019 return new BitData(this);
1020 case DataLayout::counter_data_tag:
1021 return new CounterData(this);
1022 case DataLayout::jump_data_tag:
1023 return new JumpData(this);
1024 case DataLayout::receiver_type_data_tag:
1025 return new ReceiverTypeData(this);
1026 case DataLayout::virtual_call_data_tag:
1027 return new VirtualCallData(this);
1028 case DataLayout::ret_data_tag:
1029 return new RetData(this);
1030 case DataLayout::branch_data_tag:
1031 return new BranchData(this);
1032 case DataLayout::multi_branch_data_tag:
1033 return new MultiBranchData(this);
1034 case DataLayout::arg_info_data_tag:
1035 return new ArgInfoData(this);
1036 case DataLayout::call_type_data_tag:
1037 return new CallTypeData(this);
1038 case DataLayout::virtual_call_type_data_tag:
1039 return new VirtualCallTypeData(this);
1040 case DataLayout::parameters_type_data_tag:
1041 return new ParametersTypeData(this);
1042 };
1043 }
1045 // Iteration over data.
1046 ProfileData* MethodData::next_data(ProfileData* current) const {
1047 int current_index = dp_to_di(current->dp());
1048 int next_index = current_index + current->size_in_bytes();
1049 ProfileData* next = data_at(next_index);
1050 return next;
1051 }
1053 // Give each of the data entries a chance to perform specific
1054 // data initialization.
1055 void MethodData::post_initialize(BytecodeStream* stream) {
1056 ResourceMark rm;
1057 ProfileData* data;
1058 for (data = first_data(); is_valid(data); data = next_data(data)) {
1059 stream->set_start(data->bci());
1060 stream->next();
1061 data->post_initialize(stream, this);
1062 }
1063 if (_parameters_type_data_di != -1) {
1064 parameters_type_data()->post_initialize(NULL, this);
1065 }
1066 }
1068 // Initialize the MethodData* corresponding to a given method.
1069 MethodData::MethodData(methodHandle method, int size, TRAPS) {
1070 No_Safepoint_Verifier no_safepoint; // init function atomic wrt GC
1071 ResourceMark rm;
1072 // Set the method back-pointer.
1073 _method = method();
1075 init();
1076 set_creation_mileage(mileage_of(method()));
1078 // Go through the bytecodes and allocate and initialize the
1079 // corresponding data cells.
1080 int data_size = 0;
1081 int empty_bc_count = 0; // number of bytecodes lacking data
1082 _data[0] = 0; // apparently not set below.
1083 BytecodeStream stream(method);
1084 Bytecodes::Code c;
1085 bool needs_speculative_traps = false;
1086 while ((c = stream.next()) >= 0) {
1087 int size_in_bytes = initialize_data(&stream, data_size);
1088 data_size += size_in_bytes;
1089 if (size_in_bytes == 0) empty_bc_count += 1;
1090 needs_speculative_traps = needs_speculative_traps || is_speculative_trap_bytecode(c);
1091 }
1092 _data_size = data_size;
1093 int object_size = in_bytes(data_offset()) + data_size;
1095 // Add some extra DataLayout cells (at least one) to track stray traps.
1096 int extra_data_count = compute_extra_data_count(data_size, empty_bc_count, needs_speculative_traps);
1097 int extra_size = extra_data_count * DataLayout::compute_size_in_bytes(0);
1099 // Let's zero the space for the extra data
1100 Copy::zero_to_bytes(((address)_data) + data_size, extra_size);
1102 // Add a cell to record information about modified arguments.
1103 // Set up _args_modified array after traps cells so that
1104 // the code for traps cells works.
1105 DataLayout *dp = data_layout_at(data_size + extra_size);
1107 int arg_size = method->size_of_parameters();
1108 dp->initialize(DataLayout::arg_info_data_tag, 0, arg_size+1);
1110 int arg_data_size = DataLayout::compute_size_in_bytes(arg_size+1);
1111 object_size += extra_size + arg_data_size;
1113 int parms_cell = ParametersTypeData::compute_cell_count(method());
1114 // If we are profiling parameters, we reserver an area near the end
1115 // of the MDO after the slots for bytecodes (because there's no bci
1116 // for method entry so they don't fit with the framework for the
1117 // profiling of bytecodes). We store the offset within the MDO of
1118 // this area (or -1 if no parameter is profiled)
1119 if (parms_cell > 0) {
1120 object_size += DataLayout::compute_size_in_bytes(parms_cell);
1121 _parameters_type_data_di = data_size + extra_size + arg_data_size;
1122 DataLayout *dp = data_layout_at(data_size + extra_size + arg_data_size);
1123 dp->initialize(DataLayout::parameters_type_data_tag, 0, parms_cell);
1124 } else {
1125 _parameters_type_data_di = -1;
1126 }
1128 // Set an initial hint. Don't use set_hint_di() because
1129 // first_di() may be out of bounds if data_size is 0.
1130 // In that situation, _hint_di is never used, but at
1131 // least well-defined.
1132 _hint_di = first_di();
1134 post_initialize(&stream);
1136 set_size(object_size);
1137 }
1139 void MethodData::init() {
1140 _invocation_counter.init();
1141 _backedge_counter.init();
1142 _invocation_counter_start = 0;
1143 _backedge_counter_start = 0;
1144 _num_loops = 0;
1145 _num_blocks = 0;
1146 _highest_comp_level = 0;
1147 _highest_osr_comp_level = 0;
1148 _would_profile = true;
1150 // Initialize flags and trap history.
1151 _nof_decompiles = 0;
1152 _nof_overflow_recompiles = 0;
1153 _nof_overflow_traps = 0;
1154 clear_escape_info();
1155 assert(sizeof(_trap_hist) % sizeof(HeapWord) == 0, "align");
1156 Copy::zero_to_words((HeapWord*) &_trap_hist,
1157 sizeof(_trap_hist) / sizeof(HeapWord));
1158 }
1160 // Get a measure of how much mileage the method has on it.
1161 int MethodData::mileage_of(Method* method) {
1162 int mileage = 0;
1163 if (TieredCompilation) {
1164 mileage = MAX2(method->invocation_count(), method->backedge_count());
1165 } else {
1166 int iic = method->interpreter_invocation_count();
1167 if (mileage < iic) mileage = iic;
1168 MethodCounters* mcs = method->method_counters();
1169 if (mcs != NULL) {
1170 InvocationCounter* ic = mcs->invocation_counter();
1171 InvocationCounter* bc = mcs->backedge_counter();
1172 int icval = ic->count();
1173 if (ic->carry()) icval += CompileThreshold;
1174 if (mileage < icval) mileage = icval;
1175 int bcval = bc->count();
1176 if (bc->carry()) bcval += CompileThreshold;
1177 if (mileage < bcval) mileage = bcval;
1178 }
1179 }
1180 return mileage;
1181 }
1183 bool MethodData::is_mature() const {
1184 return CompilationPolicy::policy()->is_mature(_method);
1185 }
1187 // Translate a bci to its corresponding data index (di).
1188 address MethodData::bci_to_dp(int bci) {
1189 ResourceMark rm;
1190 ProfileData* data = data_before(bci);
1191 ProfileData* prev = NULL;
1192 for ( ; is_valid(data); data = next_data(data)) {
1193 if (data->bci() >= bci) {
1194 if (data->bci() == bci) set_hint_di(dp_to_di(data->dp()));
1195 else if (prev != NULL) set_hint_di(dp_to_di(prev->dp()));
1196 return data->dp();
1197 }
1198 prev = data;
1199 }
1200 return (address)limit_data_position();
1201 }
1203 // Translate a bci to its corresponding data, or NULL.
1204 ProfileData* MethodData::bci_to_data(int bci) {
1205 ProfileData* data = data_before(bci);
1206 for ( ; is_valid(data); data = next_data(data)) {
1207 if (data->bci() == bci) {
1208 set_hint_di(dp_to_di(data->dp()));
1209 return data;
1210 } else if (data->bci() > bci) {
1211 break;
1212 }
1213 }
1214 return bci_to_extra_data(bci, NULL, false);
1215 }
1217 DataLayout* MethodData::next_extra(DataLayout* dp) {
1218 int nb_cells = 0;
1219 switch(dp->tag()) {
1220 case DataLayout::bit_data_tag:
1221 case DataLayout::no_tag:
1222 nb_cells = BitData::static_cell_count();
1223 break;
1224 case DataLayout::speculative_trap_data_tag:
1225 nb_cells = SpeculativeTrapData::static_cell_count();
1226 break;
1227 default:
1228 fatal(err_msg("unexpected tag %d", dp->tag()));
1229 }
1230 return (DataLayout*)((address)dp + DataLayout::compute_size_in_bytes(nb_cells));
1231 }
1233 ProfileData* MethodData::bci_to_extra_data_helper(int bci, Method* m, DataLayout*& dp) {
1234 DataLayout* end = extra_data_limit();
1236 for (;; dp = next_extra(dp)) {
1237 assert(dp < end, "moved past end of extra data");
1238 // No need for "OrderAccess::load_acquire" ops,
1239 // since the data structure is monotonic.
1240 switch(dp->tag()) {
1241 case DataLayout::no_tag:
1242 return NULL;
1243 case DataLayout::arg_info_data_tag:
1244 dp = end;
1245 return NULL; // ArgInfoData is at the end of extra data section.
1246 case DataLayout::bit_data_tag:
1247 if (m == NULL && dp->bci() == bci) {
1248 return new BitData(dp);
1249 }
1250 break;
1251 case DataLayout::speculative_trap_data_tag:
1252 if (m != NULL) {
1253 SpeculativeTrapData* data = new SpeculativeTrapData(dp);
1254 // data->method() may be null in case of a concurrent
1255 // allocation. Assume it's for the same method and use that
1256 // entry in that case.
1257 if (dp->bci() == bci) {
1258 if (data->method() == NULL) {
1259 return NULL;
1260 } else if (data->method() == m) {
1261 return data;
1262 }
1263 }
1264 }
1265 break;
1266 default:
1267 fatal(err_msg("unexpected tag %d", dp->tag()));
1268 }
1269 }
1270 return NULL;
1271 }
1274 // Translate a bci to its corresponding extra data, or NULL.
1275 ProfileData* MethodData::bci_to_extra_data(int bci, Method* m, bool create_if_missing) {
1276 // This code assumes an entry for a SpeculativeTrapData is 2 cells
1277 assert(2*DataLayout::compute_size_in_bytes(BitData::static_cell_count()) ==
1278 DataLayout::compute_size_in_bytes(SpeculativeTrapData::static_cell_count()),
1279 "code needs to be adjusted");
1281 DataLayout* dp = extra_data_base();
1282 DataLayout* end = extra_data_limit();
1284 // Allocation in the extra data space has to be atomic because not
1285 // all entries have the same size and non atomic concurrent
1286 // allocation would result in a corrupted extra data space.
1287 while (true) {
1288 ProfileData* result = bci_to_extra_data_helper(bci, m, dp);
1289 if (result != NULL) {
1290 return result;
1291 }
1293 if (create_if_missing && dp < end) {
1294 assert(dp->tag() == DataLayout::no_tag || (dp->tag() == DataLayout::speculative_trap_data_tag && m != NULL), "should be free");
1295 assert(next_extra(dp)->tag() == DataLayout::no_tag || next_extra(dp)->tag() == DataLayout::arg_info_data_tag, "should be free or arg info");
1296 u1 tag = m == NULL ? DataLayout::bit_data_tag : DataLayout::speculative_trap_data_tag;
1297 // SpeculativeTrapData is 2 slots. Make sure we have room.
1298 if (m != NULL && next_extra(dp)->tag() != DataLayout::no_tag) {
1299 return NULL;
1300 }
1301 DataLayout temp;
1302 temp.initialize(tag, bci, 0);
1303 // May have been set concurrently
1304 if (dp->header() != temp.header() && !dp->atomic_set_header(temp.header())) {
1305 // Allocation failure because of concurrent allocation. Try
1306 // again.
1307 continue;
1308 }
1309 assert(dp->tag() == tag, "sane");
1310 assert(dp->bci() == bci, "no concurrent allocation");
1311 if (tag == DataLayout::bit_data_tag) {
1312 return new BitData(dp);
1313 } else {
1314 // If being allocated concurrently, one trap may be lost
1315 SpeculativeTrapData* data = new SpeculativeTrapData(dp);
1316 data->set_method(m);
1317 return data;
1318 }
1319 }
1320 return NULL;
1321 }
1322 return NULL;
1323 }
1325 ArgInfoData *MethodData::arg_info() {
1326 DataLayout* dp = extra_data_base();
1327 DataLayout* end = extra_data_limit();
1328 for (; dp < end; dp = next_extra(dp)) {
1329 if (dp->tag() == DataLayout::arg_info_data_tag)
1330 return new ArgInfoData(dp);
1331 }
1332 return NULL;
1333 }
1335 // Printing
1337 #ifndef PRODUCT
1339 void MethodData::print_on(outputStream* st) const {
1340 assert(is_methodData(), "should be method data");
1341 st->print("method data for ");
1342 method()->print_value_on(st);
1343 st->cr();
1344 print_data_on(st);
1345 }
1347 #endif //PRODUCT
1349 void MethodData::print_value_on(outputStream* st) const {
1350 assert(is_methodData(), "should be method data");
1351 st->print("method data for ");
1352 method()->print_value_on(st);
1353 }
1355 #ifndef PRODUCT
1356 void MethodData::print_data_on(outputStream* st) const {
1357 ResourceMark rm;
1358 ProfileData* data = first_data();
1359 if (_parameters_type_data_di != -1) {
1360 parameters_type_data()->print_data_on(st);
1361 }
1362 for ( ; is_valid(data); data = next_data(data)) {
1363 st->print("%d", dp_to_di(data->dp()));
1364 st->fill_to(6);
1365 data->print_data_on(st, this);
1366 }
1367 st->print_cr("--- Extra data:");
1368 DataLayout* dp = extra_data_base();
1369 DataLayout* end = extra_data_limit();
1370 for (;; dp = next_extra(dp)) {
1371 assert(dp < end, "moved past end of extra data");
1372 // No need for "OrderAccess::load_acquire" ops,
1373 // since the data structure is monotonic.
1374 switch(dp->tag()) {
1375 case DataLayout::no_tag:
1376 continue;
1377 case DataLayout::bit_data_tag:
1378 data = new BitData(dp);
1379 break;
1380 case DataLayout::speculative_trap_data_tag:
1381 data = new SpeculativeTrapData(dp);
1382 break;
1383 case DataLayout::arg_info_data_tag:
1384 data = new ArgInfoData(dp);
1385 dp = end; // ArgInfoData is at the end of extra data section.
1386 break;
1387 default:
1388 fatal(err_msg("unexpected tag %d", dp->tag()));
1389 }
1390 st->print("%d", dp_to_di(data->dp()));
1391 st->fill_to(6);
1392 data->print_data_on(st);
1393 if (dp >= end) return;
1394 }
1395 }
1396 #endif
1398 #if INCLUDE_SERVICES
1399 // Size Statistics
1400 void MethodData::collect_statistics(KlassSizeStats *sz) const {
1401 int n = sz->count(this);
1402 sz->_method_data_bytes += n;
1403 sz->_method_all_bytes += n;
1404 sz->_rw_bytes += n;
1405 }
1406 #endif // INCLUDE_SERVICES
1408 // Verification
1410 void MethodData::verify_on(outputStream* st) {
1411 guarantee(is_methodData(), "object must be method data");
1412 // guarantee(m->is_perm(), "should be in permspace");
1413 this->verify_data_on(st);
1414 }
1416 void MethodData::verify_data_on(outputStream* st) {
1417 NEEDS_CLEANUP;
1418 // not yet implemented.
1419 }
1421 bool MethodData::profile_jsr292(methodHandle m, int bci) {
1422 if (m->is_compiled_lambda_form()) {
1423 return true;
1424 }
1426 Bytecode_invoke inv(m , bci);
1427 return inv.is_invokedynamic() || inv.is_invokehandle();
1428 }
1430 int MethodData::profile_arguments_flag() {
1431 return TypeProfileLevel % 10;
1432 }
1434 bool MethodData::profile_arguments() {
1435 return profile_arguments_flag() > no_type_profile && profile_arguments_flag() <= type_profile_all;
1436 }
1438 bool MethodData::profile_arguments_jsr292_only() {
1439 return profile_arguments_flag() == type_profile_jsr292;
1440 }
1442 bool MethodData::profile_all_arguments() {
1443 return profile_arguments_flag() == type_profile_all;
1444 }
1446 bool MethodData::profile_arguments_for_invoke(methodHandle m, int bci) {
1447 if (!profile_arguments()) {
1448 return false;
1449 }
1451 if (profile_all_arguments()) {
1452 return true;
1453 }
1455 assert(profile_arguments_jsr292_only(), "inconsistent");
1456 return profile_jsr292(m, bci);
1457 }
1459 int MethodData::profile_return_flag() {
1460 return (TypeProfileLevel % 100) / 10;
1461 }
1463 bool MethodData::profile_return() {
1464 return profile_return_flag() > no_type_profile && profile_return_flag() <= type_profile_all;
1465 }
1467 bool MethodData::profile_return_jsr292_only() {
1468 return profile_return_flag() == type_profile_jsr292;
1469 }
1471 bool MethodData::profile_all_return() {
1472 return profile_return_flag() == type_profile_all;
1473 }
1475 bool MethodData::profile_return_for_invoke(methodHandle m, int bci) {
1476 if (!profile_return()) {
1477 return false;
1478 }
1480 if (profile_all_return()) {
1481 return true;
1482 }
1484 assert(profile_return_jsr292_only(), "inconsistent");
1485 return profile_jsr292(m, bci);
1486 }
1488 int MethodData::profile_parameters_flag() {
1489 return TypeProfileLevel / 100;
1490 }
1492 bool MethodData::profile_parameters() {
1493 return profile_parameters_flag() > no_type_profile && profile_parameters_flag() <= type_profile_all;
1494 }
1496 bool MethodData::profile_parameters_jsr292_only() {
1497 return profile_parameters_flag() == type_profile_jsr292;
1498 }
1500 bool MethodData::profile_all_parameters() {
1501 return profile_parameters_flag() == type_profile_all;
1502 }
1504 bool MethodData::profile_parameters_for_method(methodHandle m) {
1505 if (!profile_parameters()) {
1506 return false;
1507 }
1509 if (profile_all_parameters()) {
1510 return true;
1511 }
1513 assert(profile_parameters_jsr292_only(), "inconsistent");
1514 return m->is_compiled_lambda_form();
1515 }
1517 void MethodData::clean_extra_data_helper(DataLayout* dp, int shift, bool reset) {
1518 if (shift == 0) {
1519 return;
1520 }
1521 if (!reset) {
1522 // Move all cells of trap entry at dp left by "shift" cells
1523 intptr_t* start = (intptr_t*)dp;
1524 intptr_t* end = (intptr_t*)next_extra(dp);
1525 for (intptr_t* ptr = start; ptr < end; ptr++) {
1526 *(ptr-shift) = *ptr;
1527 }
1528 } else {
1529 // Reset "shift" cells stopping at dp
1530 intptr_t* start = ((intptr_t*)dp) - shift;
1531 intptr_t* end = (intptr_t*)dp;
1532 for (intptr_t* ptr = start; ptr < end; ptr++) {
1533 *ptr = 0;
1534 }
1535 }
1536 }
1538 // Remove SpeculativeTrapData entries that reference an unloaded
1539 // method
1540 void MethodData::clean_extra_data(BoolObjectClosure* is_alive) {
1541 DataLayout* dp = extra_data_base();
1542 DataLayout* end = extra_data_limit();
1544 int shift = 0;
1545 for (; dp < end; dp = next_extra(dp)) {
1546 switch(dp->tag()) {
1547 case DataLayout::speculative_trap_data_tag: {
1548 SpeculativeTrapData* data = new SpeculativeTrapData(dp);
1549 Method* m = data->method();
1550 assert(m != NULL, "should have a method");
1551 if (!m->method_holder()->is_loader_alive(is_alive)) {
1552 // "shift" accumulates the number of cells for dead
1553 // SpeculativeTrapData entries that have been seen so
1554 // far. Following entries must be shifted left by that many
1555 // cells to remove the dead SpeculativeTrapData entries.
1556 shift += (int)((intptr_t*)next_extra(dp) - (intptr_t*)dp);
1557 } else {
1558 // Shift this entry left if it follows dead
1559 // SpeculativeTrapData entries
1560 clean_extra_data_helper(dp, shift);
1561 }
1562 break;
1563 }
1564 case DataLayout::bit_data_tag:
1565 // Shift this entry left if it follows dead SpeculativeTrapData
1566 // entries
1567 clean_extra_data_helper(dp, shift);
1568 continue;
1569 case DataLayout::no_tag:
1570 case DataLayout::arg_info_data_tag:
1571 // We are at end of the live trap entries. The previous "shift"
1572 // cells contain entries that are either dead or were shifted
1573 // left. They need to be reset to no_tag
1574 clean_extra_data_helper(dp, shift, true);
1575 return;
1576 default:
1577 fatal(err_msg("unexpected tag %d", dp->tag()));
1578 }
1579 }
1580 }
1582 // Verify there's no unloaded method referenced by a
1583 // SpeculativeTrapData entry
1584 void MethodData::verify_extra_data_clean(BoolObjectClosure* is_alive) {
1585 #ifdef ASSERT
1586 DataLayout* dp = extra_data_base();
1587 DataLayout* end = extra_data_limit();
1589 for (; dp < end; dp = next_extra(dp)) {
1590 switch(dp->tag()) {
1591 case DataLayout::speculative_trap_data_tag: {
1592 SpeculativeTrapData* data = new SpeculativeTrapData(dp);
1593 Method* m = data->method();
1594 assert(m != NULL && m->method_holder()->is_loader_alive(is_alive), "Method should exist");
1595 break;
1596 }
1597 case DataLayout::bit_data_tag:
1598 continue;
1599 case DataLayout::no_tag:
1600 case DataLayout::arg_info_data_tag:
1601 return;
1602 default:
1603 fatal(err_msg("unexpected tag %d", dp->tag()));
1604 }
1605 }
1606 #endif
1607 }
1609 void MethodData::clean_method_data(BoolObjectClosure* is_alive) {
1610 for (ProfileData* data = first_data();
1611 is_valid(data);
1612 data = next_data(data)) {
1613 data->clean_weak_klass_links(is_alive);
1614 }
1615 ParametersTypeData* parameters = parameters_type_data();
1616 if (parameters != NULL) {
1617 parameters->clean_weak_klass_links(is_alive);
1618 }
1620 clean_extra_data(is_alive);
1621 verify_extra_data_clean(is_alive);
1622 }