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