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