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
497 #ifndef PRODUCT
498 void RetData::print_data_on(outputStream* st, const char* extra) const {
499 print_shared(st, "RetData", extra);
500 uint row;
501 int entries = 0;
502 for (row = 0; row < row_limit(); row++) {
503 if (bci(row) != no_bci) entries++;
504 }
505 st->print_cr("count(%u) entries(%u)", count(), entries);
506 for (row = 0; row < row_limit(); row++) {
507 if (bci(row) != no_bci) {
508 tab(st);
509 st->print_cr("bci(%d: count(%u) displacement(%d))",
510 bci(row), bci_count(row), bci_displacement(row));
511 }
512 }
513 }
514 #endif // !PRODUCT
515
516 // ==================================================================
517 // BranchData
518 //
519 // A BranchData is used to access profiling data for a two-way branch.
520 // It consists of taken and not_taken counts as well as a data displacement
521 // for the taken case.
522
523 void BranchData::post_initialize(BytecodeStream* stream, MethodData* mdo) {
524 assert(stream->bci() == bci(), "wrong pos");
525 int target = stream->dest();
526 int my_di = mdo->dp_to_di(dp());
527 int target_di = mdo->bci_to_di(target);
528 int offset = target_di - my_di;
529 set_displacement(offset);
530 }
531
532 #ifndef PRODUCT
533 void BranchData::print_data_on(outputStream* st, const char* extra) const {
534 print_shared(st, "BranchData", extra);
535 st->print_cr("taken(%u) displacement(%d)",
536 taken(), displacement());
537 tab(st);
538 st->print_cr("not taken(%u)", not_taken());
539 }
540 #endif
541
542 // ==================================================================
543 // MultiBranchData
544 //
545 // A MultiBranchData is used to access profiling information for
546 // a multi-way branch (*switch bytecodes). It consists of a series
547 // of (count, displacement) pairs, which count the number of times each
548 // case was taken and specify the data displacment for each branch target.
549
550 int MultiBranchData::compute_cell_count(BytecodeStream* stream) {
551 int cell_count = 0;
552 if (stream->code() == Bytecodes::_tableswitch) {
553 Bytecode_tableswitch sw(stream->method()(), stream->bcp());
554 cell_count = 1 + per_case_cell_count * (1 + sw.length()); // 1 for default
555 } else {
556 Bytecode_lookupswitch sw(stream->method()(), stream->bcp());
557 cell_count = 1 + per_case_cell_count * (sw.number_of_pairs() + 1); // 1 for default
558 }
559 return cell_count;
560 }
561
562 void MultiBranchData::post_initialize(BytecodeStream* stream,
563 MethodData* mdo) {
564 assert(stream->bci() == bci(), "wrong pos");
565 int target;
566 int my_di;
567 int target_di;
568 int offset;
569 if (stream->code() == Bytecodes::_tableswitch) {
570 Bytecode_tableswitch sw(stream->method()(), stream->bcp());
571 int len = sw.length();
572 assert(array_len() == per_case_cell_count * (len + 1), "wrong len");
573 for (int count = 0; count < len; count++) {
574 target = sw.dest_offset_at(count) + bci();
575 my_di = mdo->dp_to_di(dp());
576 target_di = mdo->bci_to_di(target);
577 offset = target_di - my_di;
578 set_displacement_at(count, offset);
579 }
580 target = sw.default_offset() + bci();
581 my_di = mdo->dp_to_di(dp());
582 target_di = mdo->bci_to_di(target);
583 offset = target_di - my_di;
584 set_default_displacement(offset);
585
586 } else {
587 Bytecode_lookupswitch sw(stream->method()(), stream->bcp());
588 int npairs = sw.number_of_pairs();
589 assert(array_len() == per_case_cell_count * (npairs + 1), "wrong len");
590 for (int count = 0; count < npairs; count++) {
591 LookupswitchPair pair = sw.pair_at(count);
592 target = pair.offset() + bci();
593 my_di = mdo->dp_to_di(dp());
594 target_di = mdo->bci_to_di(target);
595 offset = target_di - my_di;
596 set_displacement_at(count, offset);
597 }
598 target = sw.default_offset() + bci();
599 my_di = mdo->dp_to_di(dp());
600 target_di = mdo->bci_to_di(target);
601 offset = target_di - my_di;
602 set_default_displacement(offset);
603 }
604 }
605
606 #ifndef PRODUCT
607 void MultiBranchData::print_data_on(outputStream* st, const char* extra) const {
608 print_shared(st, "MultiBranchData", extra);
609 st->print_cr("default_count(%u) displacement(%d)",
610 default_count(), default_displacement());
611 int cases = number_of_cases();
612 for (int i = 0; i < cases; i++) {
613 tab(st);
614 st->print_cr("count(%u) displacement(%d)",
615 count_at(i), displacement_at(i));
616 }
617 }
618 #endif
619
620 #ifndef PRODUCT
621 void ArgInfoData::print_data_on(outputStream* st, const char* extra) const {
622 print_shared(st, "ArgInfoData", extra);
623 int nargs = number_of_args();
624 for (int i = 0; i < nargs; i++) {
625 st->print(" 0x%x", arg_modified(i));
626 }
627 st->cr();
628 }
629
630 #endif
631
632 int ParametersTypeData::compute_cell_count(Method* m) {
633 if (!MethodData::profile_parameters_for_method(m)) {
634 return 0;
635 }
636 int max = TypeProfileParmsLimit == -1 ? INT_MAX : TypeProfileParmsLimit;
637 int obj_args = TypeStackSlotEntries::compute_cell_count(m->signature(), !m->is_static(), max);
638 if (obj_args > 0) {
639 return obj_args + 1; // 1 cell for array len
640 }
641 return 0;
642 }
643
644 void ParametersTypeData::post_initialize(BytecodeStream* stream, MethodData* mdo) {
645 _parameters.post_initialize(mdo->method()->signature(), !mdo->method()->is_static(), true);
646 }
647
648 bool ParametersTypeData::profiling_enabled() {
649 return MethodData::profile_parameters();
650 }
651
652 #ifndef PRODUCT
653 void ParametersTypeData::print_data_on(outputStream* st, const char* extra) const {
654 st->print("parameter types", extra);
655 _parameters.print_data_on(st);
656 }
657
658 void SpeculativeTrapData::print_data_on(outputStream* st, const char* extra) const {
659 print_shared(st, "SpeculativeTrapData", extra);
660 tab(st);
661 method()->print_short_name(st);
662 st->cr();
663 }
664 #endif
665
666 // ==================================================================
667 // MethodData*
668 //
669 // A MethodData* holds information which has been collected about
670 // a method.
671
672 MethodData* MethodData::allocate(ClassLoaderData* loader_data, methodHandle method, TRAPS) {
673 int size = MethodData::compute_allocation_size_in_words(method);
674
675 return new (loader_data, size, false, MetaspaceObj::MethodDataType, THREAD)
676 MethodData(method(), size, CHECK_NULL);
677 }
678
679 int MethodData::bytecode_cell_count(Bytecodes::Code code) {
680 #if defined(COMPILER1) && !defined(COMPILER2)
681 return no_profile_data;
682 #else
683 switch (code) {
684 case Bytecodes::_checkcast:
685 case Bytecodes::_instanceof:
686 case Bytecodes::_aastore:
687 if (TypeProfileCasts) {
688 return ReceiverTypeData::static_cell_count();
689 } else {
690 return BitData::static_cell_count();
691 }
692 case Bytecodes::_invokespecial:
693 case Bytecodes::_invokestatic:
694 if (MethodData::profile_arguments() || MethodData::profile_return()) {
695 return variable_cell_count;
696 } else {
697 return CounterData::static_cell_count();
698 }
699 case Bytecodes::_goto:
700 case Bytecodes::_goto_w:
701 case Bytecodes::_jsr:
702 case Bytecodes::_jsr_w:
703 return JumpData::static_cell_count();
704 case Bytecodes::_invokevirtual:
705 case Bytecodes::_invokeinterface:
706 if (MethodData::profile_arguments() || MethodData::profile_return()) {
707 return variable_cell_count;
708 } else {
709 return VirtualCallData::static_cell_count();
710 }
711 case Bytecodes::_invokedynamic:
712 if (MethodData::profile_arguments() || MethodData::profile_return()) {
713 return variable_cell_count;
714 } else {
715 return CounterData::static_cell_count();
716 }
717 case Bytecodes::_ret:
718 return RetData::static_cell_count();
719 case Bytecodes::_ifeq:
720 case Bytecodes::_ifne:
721 case Bytecodes::_iflt:
722 case Bytecodes::_ifge:
723 case Bytecodes::_ifgt:
724 case Bytecodes::_ifle:
725 case Bytecodes::_if_icmpeq:
726 case Bytecodes::_if_icmpne:
727 case Bytecodes::_if_icmplt:
728 case Bytecodes::_if_icmpge:
729 case Bytecodes::_if_icmpgt:
730 case Bytecodes::_if_icmple:
731 case Bytecodes::_if_acmpeq:
732 case Bytecodes::_if_acmpne:
733 case Bytecodes::_ifnull:
734 case Bytecodes::_ifnonnull:
735 return BranchData::static_cell_count();
736 case Bytecodes::_lookupswitch:
737 case Bytecodes::_tableswitch:
738 return variable_cell_count;
739 }
740 return no_profile_data;
741 #endif
742 }
743
744 // Compute the size of the profiling information corresponding to
745 // the current bytecode.
746 int MethodData::compute_data_size(BytecodeStream* stream) {
747 int cell_count = bytecode_cell_count(stream->code());
748 if (cell_count == no_profile_data) {
749 return 0;
750 }
751 if (cell_count == variable_cell_count) {
752 switch (stream->code()) {
753 case Bytecodes::_lookupswitch:
754 case Bytecodes::_tableswitch:
755 cell_count = MultiBranchData::compute_cell_count(stream);
756 break;
757 case Bytecodes::_invokespecial:
758 case Bytecodes::_invokestatic:
759 case Bytecodes::_invokedynamic:
760 assert(MethodData::profile_arguments() || MethodData::profile_return(), "should be collecting args profile");
761 if (profile_arguments_for_invoke(stream->method(), stream->bci()) ||
762 profile_return_for_invoke(stream->method(), stream->bci())) {
763 cell_count = CallTypeData::compute_cell_count(stream);
764 } else {
765 cell_count = CounterData::static_cell_count();
766 }
767 break;
768 case Bytecodes::_invokevirtual:
769 case Bytecodes::_invokeinterface: {
770 assert(MethodData::profile_arguments() || MethodData::profile_return(), "should be collecting args profile");
771 if (profile_arguments_for_invoke(stream->method(), stream->bci()) ||
772 profile_return_for_invoke(stream->method(), stream->bci())) {
773 cell_count = VirtualCallTypeData::compute_cell_count(stream);
774 } else {
775 cell_count = VirtualCallData::static_cell_count();
776 }
777 break;
778 }
779 default:
780 fatal("unexpected bytecode for var length profile data");
781 }
782 }
783 // Note: cell_count might be zero, meaning that there is just
784 // a DataLayout header, with no extra cells.
785 assert(cell_count >= 0, "sanity");
786 return DataLayout::compute_size_in_bytes(cell_count);
787 }
788
789 bool MethodData::is_speculative_trap_bytecode(Bytecodes::Code code) {
790 // Bytecodes for which we may use speculation
791 switch (code) {
792 case Bytecodes::_checkcast:
793 case Bytecodes::_instanceof:
794 case Bytecodes::_aastore:
795 case Bytecodes::_invokevirtual:
796 case Bytecodes::_invokeinterface:
797 case Bytecodes::_if_acmpeq:
798 case Bytecodes::_if_acmpne:
799 case Bytecodes::_invokestatic:
800 #ifdef COMPILER2
801 return UseTypeSpeculation;
802 #endif
803 default:
804 return false;
805 }
806 return false;
807 }
808
809 int MethodData::compute_extra_data_count(int data_size, int empty_bc_count, bool needs_speculative_traps) {
810 if (ProfileTraps) {
811 // Assume that up to 3% of BCIs with no MDP will need to allocate one.
812 int extra_data_count = (uint)(empty_bc_count * 3) / 128 + 1;
813 // If the method is large, let the extra BCIs grow numerous (to ~1%).
814 int one_percent_of_data
815 = (uint)data_size / (DataLayout::header_size_in_bytes()*128);
816 if (extra_data_count < one_percent_of_data)
817 extra_data_count = one_percent_of_data;
818 if (extra_data_count > empty_bc_count)
819 extra_data_count = empty_bc_count; // no need for more
820
821 // Make sure we have a minimum number of extra data slots to
822 // allocate SpeculativeTrapData entries. We would want to have one
823 // entry per compilation that inlines this method and for which
824 // some type speculation assumption fails. So the room we need for
825 // the SpeculativeTrapData entries doesn't directly depend on the
826 // size of the method. Because it's hard to estimate, we reserve
827 // space for an arbitrary number of entries.
828 int spec_data_count = (needs_speculative_traps ? SpecTrapLimitExtraEntries : 0) *
829 (SpeculativeTrapData::static_cell_count() + DataLayout::header_size_in_cells());
830
831 return MAX2(extra_data_count, spec_data_count);
832 } else {
833 return 0;
834 }
835 }
836
837 // Compute the size of the MethodData* necessary to store
838 // profiling information about a given method. Size is in bytes.
839 int MethodData::compute_allocation_size_in_bytes(methodHandle method) {
840 int data_size = 0;
841 BytecodeStream stream(method);
842 Bytecodes::Code c;
843 int empty_bc_count = 0; // number of bytecodes lacking data
844 bool needs_speculative_traps = false;
845 while ((c = stream.next()) >= 0) {
846 int size_in_bytes = compute_data_size(&stream);
847 data_size += size_in_bytes;
848 if (size_in_bytes == 0) empty_bc_count += 1;
849 needs_speculative_traps = needs_speculative_traps || is_speculative_trap_bytecode(c);
850 }
851 int object_size = in_bytes(data_offset()) + data_size;
852
853 // Add some extra DataLayout cells (at least one) to track stray traps.
854 int extra_data_count = compute_extra_data_count(data_size, empty_bc_count, needs_speculative_traps);
855 object_size += extra_data_count * DataLayout::compute_size_in_bytes(0);
856
857 // Add a cell to record information about modified arguments.
858 int arg_size = method->size_of_parameters();
859 object_size += DataLayout::compute_size_in_bytes(arg_size+1);
860
861 // Reserve room for an area of the MDO dedicated to profiling of
862 // parameters
863 int args_cell = ParametersTypeData::compute_cell_count(method());
864 if (args_cell > 0) {
865 object_size += DataLayout::compute_size_in_bytes(args_cell);
866 }
867 return object_size;
868 }
869
870 // Compute the size of the MethodData* necessary to store
871 // profiling information about a given method. Size is in words
872 int MethodData::compute_allocation_size_in_words(methodHandle method) {
873 int byte_size = compute_allocation_size_in_bytes(method);
874 int word_size = align_size_up(byte_size, BytesPerWord) / BytesPerWord;
875 return align_object_size(word_size);
876 }
877
878 // Initialize an individual data segment. Returns the size of
879 // the segment in bytes.
880 int MethodData::initialize_data(BytecodeStream* stream,
881 int data_index) {
882 #if defined(COMPILER1) && !defined(COMPILER2)
883 return 0;
884 #else
885 int cell_count = -1;
886 int tag = DataLayout::no_tag;
887 DataLayout* data_layout = data_layout_at(data_index);
888 Bytecodes::Code c = stream->code();
889 switch (c) {
890 case Bytecodes::_checkcast:
891 case Bytecodes::_instanceof:
892 case Bytecodes::_aastore:
893 if (TypeProfileCasts) {
894 cell_count = ReceiverTypeData::static_cell_count();
895 tag = DataLayout::receiver_type_data_tag;
896 } else {
897 cell_count = BitData::static_cell_count();
898 tag = DataLayout::bit_data_tag;
899 }
900 break;
901 case Bytecodes::_invokespecial:
902 case Bytecodes::_invokestatic: {
903 int counter_data_cell_count = CounterData::static_cell_count();
904 if (profile_arguments_for_invoke(stream->method(), stream->bci()) ||
905 profile_return_for_invoke(stream->method(), stream->bci())) {
906 cell_count = CallTypeData::compute_cell_count(stream);
907 } else {
908 cell_count = counter_data_cell_count;
909 }
910 if (cell_count > counter_data_cell_count) {
911 tag = DataLayout::call_type_data_tag;
912 } else {
913 tag = DataLayout::counter_data_tag;
914 }
915 break;
916 }
917 case Bytecodes::_goto:
918 case Bytecodes::_goto_w:
919 case Bytecodes::_jsr:
920 case Bytecodes::_jsr_w:
921 cell_count = JumpData::static_cell_count();
922 tag = DataLayout::jump_data_tag;
923 break;
924 case Bytecodes::_invokevirtual:
925 case Bytecodes::_invokeinterface: {
926 int virtual_call_data_cell_count = VirtualCallData::static_cell_count();
927 if (profile_arguments_for_invoke(stream->method(), stream->bci()) ||
928 profile_return_for_invoke(stream->method(), stream->bci())) {
929 cell_count = VirtualCallTypeData::compute_cell_count(stream);
930 } else {
931 cell_count = virtual_call_data_cell_count;
932 }
933 if (cell_count > virtual_call_data_cell_count) {
934 tag = DataLayout::virtual_call_type_data_tag;
935 } else {
936 tag = DataLayout::virtual_call_data_tag;
937 }
938 break;
939 }
940 case Bytecodes::_invokedynamic: {
941 // %%% should make a type profile for any invokedynamic that takes a ref argument
942 int counter_data_cell_count = CounterData::static_cell_count();
943 if (profile_arguments_for_invoke(stream->method(), stream->bci()) ||
944 profile_return_for_invoke(stream->method(), stream->bci())) {
945 cell_count = CallTypeData::compute_cell_count(stream);
946 } else {
947 cell_count = counter_data_cell_count;
948 }
949 if (cell_count > counter_data_cell_count) {
950 tag = DataLayout::call_type_data_tag;
951 } else {
952 tag = DataLayout::counter_data_tag;
953 }
954 break;
955 }
956 case Bytecodes::_ret:
957 cell_count = RetData::static_cell_count();
958 tag = DataLayout::ret_data_tag;
959 break;
960 case Bytecodes::_ifeq:
961 case Bytecodes::_ifne:
962 case Bytecodes::_iflt:
963 case Bytecodes::_ifge:
964 case Bytecodes::_ifgt:
965 case Bytecodes::_ifle:
966 case Bytecodes::_if_icmpeq:
967 case Bytecodes::_if_icmpne:
968 case Bytecodes::_if_icmplt:
969 case Bytecodes::_if_icmpge:
970 case Bytecodes::_if_icmpgt:
971 case Bytecodes::_if_icmple:
972 case Bytecodes::_if_acmpeq:
973 case Bytecodes::_if_acmpne:
974 case Bytecodes::_ifnull:
975 case Bytecodes::_ifnonnull:
976 cell_count = BranchData::static_cell_count();
977 tag = DataLayout::branch_data_tag;
978 break;
979 case Bytecodes::_lookupswitch:
980 case Bytecodes::_tableswitch:
981 cell_count = MultiBranchData::compute_cell_count(stream);
982 tag = DataLayout::multi_branch_data_tag;
983 break;
984 }
985 assert(tag == DataLayout::multi_branch_data_tag ||
986 ((MethodData::profile_arguments() || MethodData::profile_return()) &&
987 (tag == DataLayout::call_type_data_tag ||
988 tag == DataLayout::counter_data_tag ||
989 tag == DataLayout::virtual_call_type_data_tag ||
990 tag == DataLayout::virtual_call_data_tag)) ||
991 cell_count == bytecode_cell_count(c), "cell counts must agree");
992 if (cell_count >= 0) {
993 assert(tag != DataLayout::no_tag, "bad tag");
994 assert(bytecode_has_profile(c), "agree w/ BHP");
995 data_layout->initialize(tag, stream->bci(), cell_count);
996 return DataLayout::compute_size_in_bytes(cell_count);
997 } else {
998 assert(!bytecode_has_profile(c), "agree w/ !BHP");
999 return 0;
1000 }
1001 #endif
1002 }
1003
1004 // Get the data at an arbitrary (sort of) data index.
1005 ProfileData* MethodData::data_at(int data_index) const {
1006 if (out_of_bounds(data_index)) {
1007 return NULL;
1008 }
1009 DataLayout* data_layout = data_layout_at(data_index);
1010 return data_layout->data_in();
1011 }
1012
1013 ProfileData* DataLayout::data_in() {
1014 switch (tag()) {
1015 case DataLayout::no_tag:
1016 default:
1017 ShouldNotReachHere();
1018 return NULL;
1019 case DataLayout::bit_data_tag:
1020 return new BitData(this);
1021 case DataLayout::counter_data_tag:
1022 return new CounterData(this);
1023 case DataLayout::jump_data_tag:
1024 return new JumpData(this);
1025 case DataLayout::receiver_type_data_tag:
1026 return new ReceiverTypeData(this);
1027 case DataLayout::virtual_call_data_tag:
1028 return new VirtualCallData(this);
1029 case DataLayout::ret_data_tag:
1030 return new RetData(this);
1031 case DataLayout::branch_data_tag:
1032 return new BranchData(this);
1033 case DataLayout::multi_branch_data_tag:
1034 return new MultiBranchData(this);
1035 case DataLayout::arg_info_data_tag:
1036 return new ArgInfoData(this);
1037 case DataLayout::call_type_data_tag:
1038 return new CallTypeData(this);
1039 case DataLayout::virtual_call_type_data_tag:
1040 return new VirtualCallTypeData(this);
1041 case DataLayout::parameters_type_data_tag:
1042 return new ParametersTypeData(this);
1043 };
1044 }
1045
1046 // Iteration over data.
1047 ProfileData* MethodData::next_data(ProfileData* current) const {
1048 int current_index = dp_to_di(current->dp());
1049 int next_index = current_index + current->size_in_bytes();
1050 ProfileData* next = data_at(next_index);
1051 return next;
1052 }
1053
1054 // Give each of the data entries a chance to perform specific
1055 // data initialization.
1056 void MethodData::post_initialize(BytecodeStream* stream) {
1057 ResourceMark rm;
1058 ProfileData* data;
1059 for (data = first_data(); is_valid(data); data = next_data(data)) {
1060 stream->set_start(data->bci());
1061 stream->next();
1062 data->post_initialize(stream, this);
1063 }
1064 if (_parameters_type_data_di != -1) {
1065 parameters_type_data()->post_initialize(NULL, this);
1066 }
1067 }
1068
1069 // Initialize the MethodData* corresponding to a given method.
1070 MethodData::MethodData(methodHandle method, int size, TRAPS)
1071 : _extra_data_lock(Monitor::leaf, "MDO extra data lock") {
1072 No_Safepoint_Verifier no_safepoint; // init function atomic wrt GC
1073 ResourceMark rm;
1074 // Set the method back-pointer.
1075 _method = method();
1076
1077 init();
1078 set_creation_mileage(mileage_of(method()));
1079
1080 // Go through the bytecodes and allocate and initialize the
1081 // corresponding data cells.
1082 int data_size = 0;
1083 int empty_bc_count = 0; // number of bytecodes lacking data
1084 _data[0] = 0; // apparently not set below.
1085 BytecodeStream stream(method);
1086 Bytecodes::Code c;
1087 bool needs_speculative_traps = false;
1088 while ((c = stream.next()) >= 0) {
1089 int size_in_bytes = initialize_data(&stream, data_size);
1090 data_size += size_in_bytes;
1091 if (size_in_bytes == 0) empty_bc_count += 1;
1092 needs_speculative_traps = needs_speculative_traps || is_speculative_trap_bytecode(c);
1093 }
1094 _data_size = data_size;
1095 int object_size = in_bytes(data_offset()) + data_size;
1096
1097 // Add some extra DataLayout cells (at least one) to track stray traps.
1098 int extra_data_count = compute_extra_data_count(data_size, empty_bc_count, needs_speculative_traps);
1099 int extra_size = extra_data_count * DataLayout::compute_size_in_bytes(0);
1100
1101 // Let's zero the space for the extra data
1102 Copy::zero_to_bytes(((address)_data) + data_size, extra_size);
1103
1104 // Add a cell to record information about modified arguments.
1105 // Set up _args_modified array after traps cells so that
1106 // the code for traps cells works.
1107 DataLayout *dp = data_layout_at(data_size + extra_size);
1108
1109 int arg_size = method->size_of_parameters();
1110 dp->initialize(DataLayout::arg_info_data_tag, 0, arg_size+1);
1111
1112 int arg_data_size = DataLayout::compute_size_in_bytes(arg_size+1);
1113 object_size += extra_size + arg_data_size;
1114
1115 int parms_cell = ParametersTypeData::compute_cell_count(method());
1116 // If we are profiling parameters, we reserver an area near the end
1117 // of the MDO after the slots for bytecodes (because there's no bci
1118 // for method entry so they don't fit with the framework for the
1119 // profiling of bytecodes). We store the offset within the MDO of
1120 // this area (or -1 if no parameter is profiled)
1121 if (parms_cell > 0) {
1122 object_size += DataLayout::compute_size_in_bytes(parms_cell);
1123 _parameters_type_data_di = data_size + extra_size + arg_data_size;
1124 DataLayout *dp = data_layout_at(data_size + extra_size + arg_data_size);
1125 dp->initialize(DataLayout::parameters_type_data_tag, 0, parms_cell);
1126 } else {
1127 _parameters_type_data_di = -1;
1128 }
1129
1130 // Set an initial hint. Don't use set_hint_di() because
1131 // first_di() may be out of bounds if data_size is 0.
1132 // In that situation, _hint_di is never used, but at
1133 // least well-defined.
1134 _hint_di = first_di();
1135
1136 post_initialize(&stream);
1137
1138 set_size(object_size);
1139 }
1140
1141 void MethodData::init() {
1142 _invocation_counter.init();
1143 _backedge_counter.init();
1144 _invocation_counter_start = 0;
1145 _backedge_counter_start = 0;
1146 _num_loops = 0;
1147 _num_blocks = 0;
1148 _highest_comp_level = 0;
1149 _highest_osr_comp_level = 0;
1150 _would_profile = true;
1151
1152 #if INCLUDE_RTM_OPT
1153 _rtm_state = NoRTM; // No RTM lock eliding by default
1154 if (UseRTMLocking &&
1155 !CompilerOracle::has_option_string(_method, "NoRTMLockEliding")) {
1156 if (CompilerOracle::has_option_string(_method, "UseRTMLockEliding") || !UseRTMDeopt) {
1157 // Generate RTM lock eliding code without abort ratio calculation code.
1158 _rtm_state = UseRTM;
1159 } else if (UseRTMDeopt) {
1160 // Generate RTM lock eliding code and include abort ratio calculation
1161 // code if UseRTMDeopt is on.
1162 _rtm_state = ProfileRTM;
1163 }
1164 }
1165 #endif
1166
1167 // Initialize flags and trap history.
1168 _nof_decompiles = 0;
1169 _nof_overflow_recompiles = 0;
1170 _nof_overflow_traps = 0;
1171 clear_escape_info();
1172 assert(sizeof(_trap_hist) % sizeof(HeapWord) == 0, "align");
1173 Copy::zero_to_words((HeapWord*) &_trap_hist,
1174 sizeof(_trap_hist) / sizeof(HeapWord));
1175 }
1176
1177 // Get a measure of how much mileage the method has on it.
1178 int MethodData::mileage_of(Method* method) {
1179 int mileage = 0;
1180 if (TieredCompilation) {
1181 mileage = MAX2(method->invocation_count(), method->backedge_count());
1182 } else {
1183 int iic = method->interpreter_invocation_count();
1184 if (mileage < iic) mileage = iic;
1185 MethodCounters* mcs = method->method_counters();
1186 if (mcs != NULL) {
1187 InvocationCounter* ic = mcs->invocation_counter();
1188 InvocationCounter* bc = mcs->backedge_counter();
1189 int icval = ic->count();
1190 if (ic->carry()) icval += CompileThreshold;
1191 if (mileage < icval) mileage = icval;
1192 int bcval = bc->count();
1193 if (bc->carry()) bcval += CompileThreshold;
1194 if (mileage < bcval) mileage = bcval;
1195 }
1196 }
1197 return mileage;
1198 }
1199
1200 bool MethodData::is_mature() const {
1201 return CompilationPolicy::policy()->is_mature(_method);
1202 }
1203
1204 // Translate a bci to its corresponding data index (di).
1205 address MethodData::bci_to_dp(int bci) {
1206 ResourceMark rm;
1207 ProfileData* data = data_before(bci);
1208 ProfileData* prev = NULL;
1209 for ( ; is_valid(data); data = next_data(data)) {
1210 if (data->bci() >= bci) {
1211 if (data->bci() == bci) set_hint_di(dp_to_di(data->dp()));
1212 else if (prev != NULL) set_hint_di(dp_to_di(prev->dp()));
1213 return data->dp();
1214 }
1215 prev = data;
1216 }
1217 return (address)limit_data_position();
1218 }
1219
1220 // Translate a bci to its corresponding data, or NULL.
1221 ProfileData* MethodData::bci_to_data(int bci) {
1222 ProfileData* data = data_before(bci);
1223 for ( ; is_valid(data); data = next_data(data)) {
1224 if (data->bci() == bci) {
1225 set_hint_di(dp_to_di(data->dp()));
1226 return data;
1227 } else if (data->bci() > bci) {
1228 break;
1229 }
1230 }
1231 return bci_to_extra_data(bci, NULL, false);
1232 }
1233
1234 DataLayout* MethodData::next_extra(DataLayout* dp) {
1235 int nb_cells = 0;
1236 switch(dp->tag()) {
1237 case DataLayout::bit_data_tag:
1238 case DataLayout::no_tag:
1239 nb_cells = BitData::static_cell_count();
1240 break;
1241 case DataLayout::speculative_trap_data_tag:
1242 nb_cells = SpeculativeTrapData::static_cell_count();
1243 break;
1244 default:
1245 fatal(err_msg("unexpected tag %d", dp->tag()));
1246 }
1247 return (DataLayout*)((address)dp + DataLayout::compute_size_in_bytes(nb_cells));
1248 }
1249
1250 ProfileData* MethodData::bci_to_extra_data_helper(int bci, Method* m, DataLayout*& dp, bool concurrent) {
1251 DataLayout* end = extra_data_limit();
1252
1253 for (;; dp = next_extra(dp)) {
1254 assert(dp < end, "moved past end of extra data");
1255 // No need for "OrderAccess::load_acquire" ops,
1256 // since the data structure is monotonic.
1257 switch(dp->tag()) {
1258 case DataLayout::no_tag:
1259 return NULL;
1260 case DataLayout::arg_info_data_tag:
1261 dp = end;
1262 return NULL; // ArgInfoData is at the end of extra data section.
1263 case DataLayout::bit_data_tag:
1264 if (m == NULL && dp->bci() == bci) {
1265 return new BitData(dp);
1266 }
1267 break;
1268 case DataLayout::speculative_trap_data_tag:
1269 if (m != NULL) {
1270 SpeculativeTrapData* data = new SpeculativeTrapData(dp);
1271 // data->method() may be null in case of a concurrent
1272 // allocation. Maybe it's for the same method. Try to use that
1273 // entry in that case.
1274 if (dp->bci() == bci) {
1275 if (data->method() == NULL) {
1276 assert(concurrent, "impossible because no concurrent allocation");
1277 return NULL;
1278 } else if (data->method() == m) {
1279 return data;
1280 }
1281 }
1282 }
1283 break;
1284 default:
1285 fatal(err_msg("unexpected tag %d", dp->tag()));
1286 }
1287 }
1288 return NULL;
1289 }
1290
1291
1292 // Translate a bci to its corresponding extra data, or NULL.
1293 ProfileData* MethodData::bci_to_extra_data(int bci, Method* m, bool create_if_missing) {
1294 // This code assumes an entry for a SpeculativeTrapData is 2 cells
1295 assert(2*DataLayout::compute_size_in_bytes(BitData::static_cell_count()) ==
1296 DataLayout::compute_size_in_bytes(SpeculativeTrapData::static_cell_count()),
1297 "code needs to be adjusted");
1298
1299 DataLayout* dp = extra_data_base();
1300 DataLayout* end = extra_data_limit();
1301
1302 // Allocation in the extra data space has to be atomic because not
1303 // all entries have the same size and non atomic concurrent
1304 // allocation would result in a corrupted extra data space.
1305 ProfileData* result = bci_to_extra_data_helper(bci, m, dp, true);
1306 if (result != NULL) {
1307 return result;
1308 }
1309
1310 if (create_if_missing && dp < end) {
1311 MutexLocker ml(&_extra_data_lock);
1312 // Check again now that we have the lock. Another thread may
1313 // have added extra data entries.
1314 ProfileData* result = bci_to_extra_data_helper(bci, m, dp, false);
1315 if (result != NULL || dp >= end) {
1316 return result;
1317 }
1318
1319 assert(dp->tag() == DataLayout::no_tag || (dp->tag() == DataLayout::speculative_trap_data_tag && m != NULL), "should be free");
1320 assert(next_extra(dp)->tag() == DataLayout::no_tag || next_extra(dp)->tag() == DataLayout::arg_info_data_tag, "should be free or arg info");
1321 u1 tag = m == NULL ? DataLayout::bit_data_tag : DataLayout::speculative_trap_data_tag;
1322 // SpeculativeTrapData is 2 slots. Make sure we have room.
1323 if (m != NULL && next_extra(dp)->tag() != DataLayout::no_tag) {
1324 return NULL;
1325 }
1326 DataLayout temp;
1327 temp.initialize(tag, bci, 0);
1328
1329 dp->set_header(temp.header());
1330 assert(dp->tag() == tag, "sane");
1331 assert(dp->bci() == bci, "no concurrent allocation");
1332 if (tag == DataLayout::bit_data_tag) {
1333 return new BitData(dp);
1334 } else {
1335 SpeculativeTrapData* data = new SpeculativeTrapData(dp);
1336 data->set_method(m);
1337 return data;
1338 }
1339 }
1340 return NULL;
1341 }
1342
1343 ArgInfoData *MethodData::arg_info() {
1344 DataLayout* dp = extra_data_base();
1345 DataLayout* end = extra_data_limit();
1346 for (; dp < end; dp = next_extra(dp)) {
1347 if (dp->tag() == DataLayout::arg_info_data_tag)
1348 return new ArgInfoData(dp);
1349 }
1350 return NULL;
1351 }
1352
1353 // Printing
1354
1355 #ifndef PRODUCT
1356
1357 void MethodData::print_on(outputStream* st) const {
1358 assert(is_methodData(), "should be method data");
1359 st->print("method data for ");
1360 method()->print_value_on(st);
1361 st->cr();
1362 print_data_on(st);
1363 }
1364
1365 #endif //PRODUCT
1366
1367 void MethodData::print_value_on(outputStream* st) const {
1368 assert(is_methodData(), "should be method data");
1369 st->print("method data for ");
1370 method()->print_value_on(st);
1371 }
1372
1373 #ifndef PRODUCT
1374 void MethodData::print_data_on(outputStream* st) const {
1375 ResourceMark rm;
1376 ProfileData* data = first_data();
1377 if (_parameters_type_data_di != -1) {
1378 parameters_type_data()->print_data_on(st);
1379 }
1380 for ( ; is_valid(data); data = next_data(data)) {
1381 st->print("%d", dp_to_di(data->dp()));
1382 st->fill_to(6);
1383 data->print_data_on(st, this);
1384 }
1385 st->print_cr("--- Extra data:");
1386 DataLayout* dp = extra_data_base();
1387 DataLayout* end = extra_data_limit();
1388 for (;; dp = next_extra(dp)) {
1389 assert(dp < end, "moved past end of extra data");
1390 // No need for "OrderAccess::load_acquire" ops,
1391 // since the data structure is monotonic.
1392 switch(dp->tag()) {
1393 case DataLayout::no_tag:
1394 continue;
1395 case DataLayout::bit_data_tag:
1396 data = new BitData(dp);
1397 break;
1398 case DataLayout::speculative_trap_data_tag:
1399 data = new SpeculativeTrapData(dp);
1400 break;
1401 case DataLayout::arg_info_data_tag:
1402 data = new ArgInfoData(dp);
1403 dp = end; // ArgInfoData is at the end of extra data section.
1404 break;
1405 default:
1406 fatal(err_msg("unexpected tag %d", dp->tag()));
1407 }
1408 st->print("%d", dp_to_di(data->dp()));
1409 st->fill_to(6);
1410 data->print_data_on(st);
1411 if (dp >= end) return;
1412 }
1413 }
1414 #endif
1415
1416 #if INCLUDE_SERVICES
1417 // Size Statistics
1418 void MethodData::collect_statistics(KlassSizeStats *sz) const {
1419 int n = sz->count(this);
1420 sz->_method_data_bytes += n;
1421 sz->_method_all_bytes += n;
1422 sz->_rw_bytes += n;
1423 }
1424 #endif // INCLUDE_SERVICES
1425
1426 // Verification
1427
1428 void MethodData::verify_on(outputStream* st) {
1429 guarantee(is_methodData(), "object must be method data");
1430 // guarantee(m->is_perm(), "should be in permspace");
1431 this->verify_data_on(st);
1432 }
1433
1434 void MethodData::verify_data_on(outputStream* st) {
1435 NEEDS_CLEANUP;
1436 // not yet implemented.
1437 }
1438
1439 bool MethodData::profile_jsr292(methodHandle m, int bci) {
1440 if (m->is_compiled_lambda_form()) {
1441 return true;
1442 }
1443
1444 Bytecode_invoke inv(m , bci);
1445 return inv.is_invokedynamic() || inv.is_invokehandle();
1446 }
1447
1448 int MethodData::profile_arguments_flag() {
1449 return TypeProfileLevel % 10;
1450 }
1451
1452 bool MethodData::profile_arguments() {
1453 return profile_arguments_flag() > no_type_profile && profile_arguments_flag() <= type_profile_all;
1454 }
1455
1456 bool MethodData::profile_arguments_jsr292_only() {
1457 return profile_arguments_flag() == type_profile_jsr292;
1458 }
1459
1460 bool MethodData::profile_all_arguments() {
1461 return profile_arguments_flag() == type_profile_all;
1462 }
1463
1464 bool MethodData::profile_arguments_for_invoke(methodHandle m, int bci) {
1465 if (!profile_arguments()) {
1466 return false;
1467 }
1468
1469 if (profile_all_arguments()) {
1470 return true;
1471 }
1472
1473 assert(profile_arguments_jsr292_only(), "inconsistent");
1474 return profile_jsr292(m, bci);
1475 }
1476
1477 int MethodData::profile_return_flag() {
1478 return (TypeProfileLevel % 100) / 10;
1479 }
1480
1481 bool MethodData::profile_return() {
1482 return profile_return_flag() > no_type_profile && profile_return_flag() <= type_profile_all;
1483 }
1484
1485 bool MethodData::profile_return_jsr292_only() {
1486 return profile_return_flag() == type_profile_jsr292;
1487 }
1488
1489 bool MethodData::profile_all_return() {
1490 return profile_return_flag() == type_profile_all;
1491 }
1492
1493 bool MethodData::profile_return_for_invoke(methodHandle m, int bci) {
1494 if (!profile_return()) {
1495 return false;
1496 }
1497
1498 if (profile_all_return()) {
1499 return true;
1500 }
1501
1502 assert(profile_return_jsr292_only(), "inconsistent");
1503 return profile_jsr292(m, bci);
1504 }
1505
1506 int MethodData::profile_parameters_flag() {
1507 return TypeProfileLevel / 100;
1508 }
1509
1510 bool MethodData::profile_parameters() {
1511 return profile_parameters_flag() > no_type_profile && profile_parameters_flag() <= type_profile_all;
1512 }
1513
1514 bool MethodData::profile_parameters_jsr292_only() {
1515 return profile_parameters_flag() == type_profile_jsr292;
1516 }
1517
1518 bool MethodData::profile_all_parameters() {
1519 return profile_parameters_flag() == type_profile_all;
1520 }
1521
1522 bool MethodData::profile_parameters_for_method(methodHandle m) {
1523 if (!profile_parameters()) {
1524 return false;
1525 }
1526
1527 if (profile_all_parameters()) {
1528 return true;
1529 }
1530
1531 assert(profile_parameters_jsr292_only(), "inconsistent");
1532 return m->is_compiled_lambda_form();
1533 }
1534
1535 void MethodData::clean_extra_data_helper(DataLayout* dp, int shift, bool reset) {
1536 if (shift == 0) {
1537 return;
1538 }
1539 if (!reset) {
1540 // Move all cells of trap entry at dp left by "shift" cells
1541 intptr_t* start = (intptr_t*)dp;
1542 intptr_t* end = (intptr_t*)next_extra(dp);
1543 for (intptr_t* ptr = start; ptr < end; ptr++) {
1544 *(ptr-shift) = *ptr;
1545 }
1546 } else {
1547 // Reset "shift" cells stopping at dp
1548 intptr_t* start = ((intptr_t*)dp) - shift;
1549 intptr_t* end = (intptr_t*)dp;
1550 for (intptr_t* ptr = start; ptr < end; ptr++) {
1551 *ptr = 0;
1552 }
1553 }
1554 }
1555
1556 // Remove SpeculativeTrapData entries that reference an unloaded
1557 // method
1558 void MethodData::clean_extra_data(BoolObjectClosure* is_alive) {
1559 DataLayout* dp = extra_data_base();
1560 DataLayout* end = extra_data_limit();
1561
1562 int shift = 0;
1563 for (; dp < end; dp = next_extra(dp)) {
1564 switch(dp->tag()) {
1565 case DataLayout::speculative_trap_data_tag: {
1566 SpeculativeTrapData* data = new SpeculativeTrapData(dp);
1567 Method* m = data->method();
1568 assert(m != NULL, "should have a method");
1569 if (!m->method_holder()->is_loader_alive(is_alive)) {
1570 // "shift" accumulates the number of cells for dead
1571 // SpeculativeTrapData entries that have been seen so
1572 // far. Following entries must be shifted left by that many
1573 // cells to remove the dead SpeculativeTrapData entries.
1574 shift += (int)((intptr_t*)next_extra(dp) - (intptr_t*)dp);
1575 } else {
1576 // Shift this entry left if it follows dead
1577 // SpeculativeTrapData entries
1578 clean_extra_data_helper(dp, shift);
1579 }
1580 break;
1581 }
1582 case DataLayout::bit_data_tag:
1583 // Shift this entry left if it follows dead SpeculativeTrapData
1584 // entries
1585 clean_extra_data_helper(dp, shift);
1586 continue;
1587 case DataLayout::no_tag:
1588 case DataLayout::arg_info_data_tag:
1589 // We are at end of the live trap entries. The previous "shift"
1590 // cells contain entries that are either dead or were shifted
1591 // left. They need to be reset to no_tag
1592 clean_extra_data_helper(dp, shift, true);
1593 return;
1594 default:
1595 fatal(err_msg("unexpected tag %d", dp->tag()));
1596 }
1597 }
1598 }
1599
1600 // Verify there's no unloaded method referenced by a
1601 // SpeculativeTrapData entry
1602 void MethodData::verify_extra_data_clean(BoolObjectClosure* is_alive) {
1603 #ifdef ASSERT
1604 DataLayout* dp = extra_data_base();
1605 DataLayout* end = extra_data_limit();
1606
1607 for (; dp < end; dp = next_extra(dp)) {
1608 switch(dp->tag()) {
1609 case DataLayout::speculative_trap_data_tag: {
1610 SpeculativeTrapData* data = new SpeculativeTrapData(dp);
1611 Method* m = data->method();
1612 assert(m != NULL && m->method_holder()->is_loader_alive(is_alive), "Method should exist");
1613 break;
1614 }
1615 case DataLayout::bit_data_tag:
1616 continue;
1617 case DataLayout::no_tag:
1618 case DataLayout::arg_info_data_tag:
1619 return;
1620 default:
1621 fatal(err_msg("unexpected tag %d", dp->tag()));
1622 }
1623 }
1624 #endif
1625 }
1626
1627 void MethodData::clean_method_data(BoolObjectClosure* is_alive) {
1628 for (ProfileData* data = first_data();
1629 is_valid(data);
1630 data = next_data(data)) {
1631 data->clean_weak_klass_links(is_alive);
1632 }
1633 ParametersTypeData* parameters = parameters_type_data();
1634 if (parameters != NULL) {
1635 parameters->clean_weak_klass_links(is_alive);
1636 }
1637
1638 clean_extra_data(is_alive);
1639 verify_extra_data_clean(is_alive);
1640 }