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