Wed, 22 Jan 2014 17:42:23 -0800
Merge
1 /*
2 * Copyright (c) 2000, 2013, Oracle and/or its affiliates. All rights reserved.
3 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
4 *
5 * This code is free software; you can redistribute it and/or modify it
6 * under the terms of the GNU General Public License version 2 only, as
7 * published by the Free Software Foundation.
8 *
9 * This code is distributed in the hope that it will be useful, but WITHOUT
10 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
11 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
12 * version 2 for more details (a copy is included in the LICENSE file that
13 * accompanied this code).
14 *
15 * You should have received a copy of the GNU General Public License version
16 * 2 along with this work; if not, write to the Free Software Foundation,
17 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
18 *
19 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
20 * or visit www.oracle.com if you need additional information or have any
21 * questions.
22 *
23 */
25 #include "precompiled.hpp"
26 #include "classfile/systemDictionary.hpp"
27 #include "interpreter/bytecode.hpp"
28 #include "interpreter/bytecodeStream.hpp"
29 #include "interpreter/linkResolver.hpp"
30 #include "memory/heapInspection.hpp"
31 #include "oops/methodData.hpp"
32 #include "prims/jvmtiRedefineClasses.hpp"
33 #include "runtime/compilationPolicy.hpp"
34 #include "runtime/deoptimization.hpp"
35 #include "runtime/handles.inline.hpp"
37 // ==================================================================
38 // DataLayout
39 //
40 // Overlay for generic profiling data.
42 // Some types of data layouts need a length field.
43 bool DataLayout::needs_array_len(u1 tag) {
44 return (tag == multi_branch_data_tag) || (tag == arg_info_data_tag) || (tag == parameters_type_data_tag);
45 }
47 // Perform generic initialization of the data. More specific
48 // initialization occurs in overrides of ProfileData::post_initialize.
49 void DataLayout::initialize(u1 tag, u2 bci, int cell_count) {
50 _header._bits = (intptr_t)0;
51 _header._struct._tag = tag;
52 _header._struct._bci = bci;
53 for (int i = 0; i < cell_count; i++) {
54 set_cell_at(i, (intptr_t)0);
55 }
56 if (needs_array_len(tag)) {
57 set_cell_at(ArrayData::array_len_off_set, cell_count - 1); // -1 for header.
58 }
59 if (tag == call_type_data_tag) {
60 CallTypeData::initialize(this, cell_count);
61 } else if (tag == virtual_call_type_data_tag) {
62 VirtualCallTypeData::initialize(this, cell_count);
63 }
64 }
66 void DataLayout::clean_weak_klass_links(BoolObjectClosure* cl) {
67 ResourceMark m;
68 data_in()->clean_weak_klass_links(cl);
69 }
72 // ==================================================================
73 // ProfileData
74 //
75 // A ProfileData object is created to refer to a section of profiling
76 // data in a structured way.
78 // Constructor for invalid ProfileData.
79 ProfileData::ProfileData() {
80 _data = NULL;
81 }
83 #ifndef PRODUCT
84 void ProfileData::print_shared(outputStream* st, const char* name) const {
85 st->print("bci: %d", bci());
86 st->fill_to(tab_width_one);
87 st->print("%s", name);
88 tab(st);
89 int trap = trap_state();
90 if (trap != 0) {
91 char buf[100];
92 st->print("trap(%s) ", Deoptimization::format_trap_state(buf, sizeof(buf), trap));
93 }
94 int flags = data()->flags();
95 if (flags != 0)
96 st->print("flags(%d) ", flags);
97 }
99 void ProfileData::tab(outputStream* st, bool first) const {
100 st->fill_to(first ? tab_width_one : tab_width_two);
101 }
102 #endif // !PRODUCT
104 // ==================================================================
105 // BitData
106 //
107 // A BitData corresponds to a one-bit flag. This is used to indicate
108 // whether a checkcast bytecode has seen a null value.
111 #ifndef PRODUCT
112 void BitData::print_data_on(outputStream* st) const {
113 print_shared(st, "BitData");
114 }
115 #endif // !PRODUCT
117 // ==================================================================
118 // CounterData
119 //
120 // A CounterData corresponds to a simple counter.
122 #ifndef PRODUCT
123 void CounterData::print_data_on(outputStream* st) const {
124 print_shared(st, "CounterData");
125 st->print_cr("count(%u)", count());
126 }
127 #endif // !PRODUCT
129 // ==================================================================
130 // JumpData
131 //
132 // A JumpData is used to access profiling information for a direct
133 // branch. It is a counter, used for counting the number of branches,
134 // plus a data displacement, used for realigning the data pointer to
135 // the corresponding target bci.
137 void JumpData::post_initialize(BytecodeStream* stream, MethodData* mdo) {
138 assert(stream->bci() == bci(), "wrong pos");
139 int target;
140 Bytecodes::Code c = stream->code();
141 if (c == Bytecodes::_goto_w || c == Bytecodes::_jsr_w) {
142 target = stream->dest_w();
143 } else {
144 target = stream->dest();
145 }
146 int my_di = mdo->dp_to_di(dp());
147 int target_di = mdo->bci_to_di(target);
148 int offset = target_di - my_di;
149 set_displacement(offset);
150 }
152 #ifndef PRODUCT
153 void JumpData::print_data_on(outputStream* st) const {
154 print_shared(st, "JumpData");
155 st->print_cr("taken(%u) displacement(%d)", taken(), displacement());
156 }
157 #endif // !PRODUCT
159 int TypeStackSlotEntries::compute_cell_count(Symbol* signature, bool include_receiver, int max) {
160 // Parameter profiling include the receiver
161 int args_count = include_receiver ? 1 : 0;
162 ResourceMark rm;
163 SignatureStream ss(signature);
164 args_count += ss.reference_parameter_count();
165 args_count = MIN2(args_count, max);
166 return args_count * per_arg_cell_count;
167 }
169 int TypeEntriesAtCall::compute_cell_count(BytecodeStream* stream) {
170 assert(Bytecodes::is_invoke(stream->code()), "should be invoke");
171 assert(TypeStackSlotEntries::per_arg_count() > ReturnTypeEntry::static_cell_count(), "code to test for arguments/results broken");
172 Bytecode_invoke inv(stream->method(), stream->bci());
173 int args_cell = 0;
174 if (arguments_profiling_enabled()) {
175 args_cell = TypeStackSlotEntries::compute_cell_count(inv.signature(), false, TypeProfileArgsLimit);
176 }
177 int ret_cell = 0;
178 if (return_profiling_enabled() && (inv.result_type() == T_OBJECT || inv.result_type() == T_ARRAY)) {
179 ret_cell = ReturnTypeEntry::static_cell_count();
180 }
181 int header_cell = 0;
182 if (args_cell + ret_cell > 0) {
183 header_cell = header_cell_count();
184 }
186 return header_cell + args_cell + ret_cell;
187 }
189 class ArgumentOffsetComputer : public SignatureInfo {
190 private:
191 int _max;
192 GrowableArray<int> _offsets;
194 void set(int size, BasicType type) { _size += size; }
195 void do_object(int begin, int end) {
196 if (_offsets.length() < _max) {
197 _offsets.push(_size);
198 }
199 SignatureInfo::do_object(begin, end);
200 }
201 void do_array (int begin, int end) {
202 if (_offsets.length() < _max) {
203 _offsets.push(_size);
204 }
205 SignatureInfo::do_array(begin, end);
206 }
208 public:
209 ArgumentOffsetComputer(Symbol* signature, int max)
210 : SignatureInfo(signature), _max(max), _offsets(Thread::current(), max) {
211 }
213 int total() { lazy_iterate_parameters(); return _size; }
215 int off_at(int i) const { return _offsets.at(i); }
216 };
218 void TypeStackSlotEntries::post_initialize(Symbol* signature, bool has_receiver, bool include_receiver) {
219 ResourceMark rm;
220 int start = 0;
221 // Parameter profiling include the receiver
222 if (include_receiver && has_receiver) {
223 set_stack_slot(0, 0);
224 set_type(0, type_none());
225 start += 1;
226 }
227 ArgumentOffsetComputer aos(signature, _number_of_entries-start);
228 aos.total();
229 for (int i = start; i < _number_of_entries; i++) {
230 set_stack_slot(i, aos.off_at(i-start) + (has_receiver ? 1 : 0));
231 set_type(i, type_none());
232 }
233 }
235 void CallTypeData::post_initialize(BytecodeStream* stream, MethodData* mdo) {
236 assert(Bytecodes::is_invoke(stream->code()), "should be invoke");
237 Bytecode_invoke inv(stream->method(), stream->bci());
239 SignatureStream ss(inv.signature());
240 if (has_arguments()) {
241 #ifdef ASSERT
242 ResourceMark rm;
243 int count = MIN2(ss.reference_parameter_count(), (int)TypeProfileArgsLimit);
244 assert(count > 0, "room for args type but none found?");
245 check_number_of_arguments(count);
246 #endif
247 _args.post_initialize(inv.signature(), inv.has_receiver(), false);
248 }
250 if (has_return()) {
251 assert(inv.result_type() == T_OBJECT || inv.result_type() == T_ARRAY, "room for a ret type but doesn't return obj?");
252 _ret.post_initialize();
253 }
254 }
256 void VirtualCallTypeData::post_initialize(BytecodeStream* stream, MethodData* mdo) {
257 assert(Bytecodes::is_invoke(stream->code()), "should be invoke");
258 Bytecode_invoke inv(stream->method(), stream->bci());
260 if (has_arguments()) {
261 #ifdef ASSERT
262 ResourceMark rm;
263 SignatureStream ss(inv.signature());
264 int count = MIN2(ss.reference_parameter_count(), (int)TypeProfileArgsLimit);
265 assert(count > 0, "room for args type but none found?");
266 check_number_of_arguments(count);
267 #endif
268 _args.post_initialize(inv.signature(), inv.has_receiver(), false);
269 }
271 if (has_return()) {
272 assert(inv.result_type() == T_OBJECT || inv.result_type() == T_ARRAY, "room for a ret type but doesn't return obj?");
273 _ret.post_initialize();
274 }
275 }
277 bool TypeEntries::is_loader_alive(BoolObjectClosure* is_alive_cl, intptr_t p) {
278 Klass* k = (Klass*)klass_part(p);
279 return k != NULL && k->is_loader_alive(is_alive_cl);
280 }
282 void TypeStackSlotEntries::clean_weak_klass_links(BoolObjectClosure* is_alive_cl) {
283 for (int i = 0; i < _number_of_entries; i++) {
284 intptr_t p = type(i);
285 if (!is_loader_alive(is_alive_cl, p)) {
286 set_type(i, with_status((Klass*)NULL, p));
287 }
288 }
289 }
291 void ReturnTypeEntry::clean_weak_klass_links(BoolObjectClosure* is_alive_cl) {
292 intptr_t p = type();
293 if (!is_loader_alive(is_alive_cl, p)) {
294 set_type(with_status((Klass*)NULL, p));
295 }
296 }
298 bool TypeEntriesAtCall::return_profiling_enabled() {
299 return MethodData::profile_return();
300 }
302 bool TypeEntriesAtCall::arguments_profiling_enabled() {
303 return MethodData::profile_arguments();
304 }
306 #ifndef PRODUCT
307 void TypeEntries::print_klass(outputStream* st, intptr_t k) {
308 if (is_type_none(k)) {
309 st->print("none");
310 } else if (is_type_unknown(k)) {
311 st->print("unknown");
312 } else {
313 valid_klass(k)->print_value_on(st);
314 }
315 if (was_null_seen(k)) {
316 st->print(" (null seen)");
317 }
318 }
320 void TypeStackSlotEntries::print_data_on(outputStream* st) const {
321 for (int i = 0; i < _number_of_entries; i++) {
322 _pd->tab(st);
323 st->print("%d: stack(%u) ", i, stack_slot(i));
324 print_klass(st, type(i));
325 st->cr();
326 }
327 }
329 void ReturnTypeEntry::print_data_on(outputStream* st) const {
330 _pd->tab(st);
331 print_klass(st, type());
332 st->cr();
333 }
335 void CallTypeData::print_data_on(outputStream* st) const {
336 CounterData::print_data_on(st);
337 if (has_arguments()) {
338 tab(st, true);
339 st->print("argument types");
340 _args.print_data_on(st);
341 }
342 if (has_return()) {
343 tab(st, true);
344 st->print("return type");
345 _ret.print_data_on(st);
346 }
347 }
349 void VirtualCallTypeData::print_data_on(outputStream* st) const {
350 VirtualCallData::print_data_on(st);
351 if (has_arguments()) {
352 tab(st, true);
353 st->print("argument types");
354 _args.print_data_on(st);
355 }
356 if (has_return()) {
357 tab(st, true);
358 st->print("return type");
359 _ret.print_data_on(st);
360 }
361 }
362 #endif
364 // ==================================================================
365 // ReceiverTypeData
366 //
367 // A ReceiverTypeData is used to access profiling information about a
368 // dynamic type check. It consists of a counter which counts the total times
369 // that the check is reached, and a series of (Klass*, count) pairs
370 // which are used to store a type profile for the receiver of the check.
372 void ReceiverTypeData::clean_weak_klass_links(BoolObjectClosure* is_alive_cl) {
373 for (uint row = 0; row < row_limit(); row++) {
374 Klass* p = receiver(row);
375 if (p != NULL && !p->is_loader_alive(is_alive_cl)) {
376 clear_row(row);
377 }
378 }
379 }
381 #ifndef PRODUCT
382 void ReceiverTypeData::print_receiver_data_on(outputStream* st) const {
383 uint row;
384 int entries = 0;
385 for (row = 0; row < row_limit(); row++) {
386 if (receiver(row) != NULL) entries++;
387 }
388 st->print_cr("count(%u) entries(%u)", count(), entries);
389 int total = count();
390 for (row = 0; row < row_limit(); row++) {
391 if (receiver(row) != NULL) {
392 total += receiver_count(row);
393 }
394 }
395 for (row = 0; row < row_limit(); row++) {
396 if (receiver(row) != NULL) {
397 tab(st);
398 receiver(row)->print_value_on(st);
399 st->print_cr("(%u %4.2f)", receiver_count(row), (float) receiver_count(row) / (float) total);
400 }
401 }
402 }
403 void ReceiverTypeData::print_data_on(outputStream* st) const {
404 print_shared(st, "ReceiverTypeData");
405 print_receiver_data_on(st);
406 }
407 void VirtualCallData::print_data_on(outputStream* st) const {
408 print_shared(st, "VirtualCallData");
409 print_receiver_data_on(st);
410 }
411 #endif // !PRODUCT
413 // ==================================================================
414 // RetData
415 //
416 // A RetData is used to access profiling information for a ret bytecode.
417 // It is composed of a count of the number of times that the ret has
418 // been executed, followed by a series of triples of the form
419 // (bci, count, di) which count the number of times that some bci was the
420 // target of the ret and cache a corresponding displacement.
422 void RetData::post_initialize(BytecodeStream* stream, MethodData* mdo) {
423 for (uint row = 0; row < row_limit(); row++) {
424 set_bci_displacement(row, -1);
425 set_bci(row, no_bci);
426 }
427 // release so other threads see a consistent state. bci is used as
428 // a valid flag for bci_displacement.
429 OrderAccess::release();
430 }
432 // This routine needs to atomically update the RetData structure, so the
433 // caller needs to hold the RetData_lock before it gets here. Since taking
434 // the lock can block (and allow GC) and since RetData is a ProfileData is a
435 // wrapper around a derived oop, taking the lock in _this_ method will
436 // basically cause the 'this' pointer's _data field to contain junk after the
437 // lock. We require the caller to take the lock before making the ProfileData
438 // structure. Currently the only caller is InterpreterRuntime::update_mdp_for_ret
439 address RetData::fixup_ret(int return_bci, MethodData* h_mdo) {
440 // First find the mdp which corresponds to the return bci.
441 address mdp = h_mdo->bci_to_dp(return_bci);
443 // Now check to see if any of the cache slots are open.
444 for (uint row = 0; row < row_limit(); row++) {
445 if (bci(row) == no_bci) {
446 set_bci_displacement(row, mdp - dp());
447 set_bci_count(row, DataLayout::counter_increment);
448 // Barrier to ensure displacement is written before the bci; allows
449 // the interpreter to read displacement without fear of race condition.
450 release_set_bci(row, return_bci);
451 break;
452 }
453 }
454 return mdp;
455 }
457 #ifdef CC_INTERP
458 DataLayout* RetData::advance(MethodData *md, int bci) {
459 return (DataLayout*) md->bci_to_dp(bci);
460 }
461 #endif // CC_INTERP
463 #ifndef PRODUCT
464 void RetData::print_data_on(outputStream* st) const {
465 print_shared(st, "RetData");
466 uint row;
467 int entries = 0;
468 for (row = 0; row < row_limit(); row++) {
469 if (bci(row) != no_bci) entries++;
470 }
471 st->print_cr("count(%u) entries(%u)", count(), entries);
472 for (row = 0; row < row_limit(); row++) {
473 if (bci(row) != no_bci) {
474 tab(st);
475 st->print_cr("bci(%d: count(%u) displacement(%d))",
476 bci(row), bci_count(row), bci_displacement(row));
477 }
478 }
479 }
480 #endif // !PRODUCT
482 // ==================================================================
483 // BranchData
484 //
485 // A BranchData is used to access profiling data for a two-way branch.
486 // It consists of taken and not_taken counts as well as a data displacement
487 // for the taken case.
489 void BranchData::post_initialize(BytecodeStream* stream, MethodData* mdo) {
490 assert(stream->bci() == bci(), "wrong pos");
491 int target = stream->dest();
492 int my_di = mdo->dp_to_di(dp());
493 int target_di = mdo->bci_to_di(target);
494 int offset = target_di - my_di;
495 set_displacement(offset);
496 }
498 #ifndef PRODUCT
499 void BranchData::print_data_on(outputStream* st) const {
500 print_shared(st, "BranchData");
501 st->print_cr("taken(%u) displacement(%d)",
502 taken(), displacement());
503 tab(st);
504 st->print_cr("not taken(%u)", not_taken());
505 }
506 #endif
508 // ==================================================================
509 // MultiBranchData
510 //
511 // A MultiBranchData is used to access profiling information for
512 // a multi-way branch (*switch bytecodes). It consists of a series
513 // of (count, displacement) pairs, which count the number of times each
514 // case was taken and specify the data displacment for each branch target.
516 int MultiBranchData::compute_cell_count(BytecodeStream* stream) {
517 int cell_count = 0;
518 if (stream->code() == Bytecodes::_tableswitch) {
519 Bytecode_tableswitch sw(stream->method()(), stream->bcp());
520 cell_count = 1 + per_case_cell_count * (1 + sw.length()); // 1 for default
521 } else {
522 Bytecode_lookupswitch sw(stream->method()(), stream->bcp());
523 cell_count = 1 + per_case_cell_count * (sw.number_of_pairs() + 1); // 1 for default
524 }
525 return cell_count;
526 }
528 void MultiBranchData::post_initialize(BytecodeStream* stream,
529 MethodData* mdo) {
530 assert(stream->bci() == bci(), "wrong pos");
531 int target;
532 int my_di;
533 int target_di;
534 int offset;
535 if (stream->code() == Bytecodes::_tableswitch) {
536 Bytecode_tableswitch sw(stream->method()(), stream->bcp());
537 int len = sw.length();
538 assert(array_len() == per_case_cell_count * (len + 1), "wrong len");
539 for (int count = 0; count < len; count++) {
540 target = sw.dest_offset_at(count) + bci();
541 my_di = mdo->dp_to_di(dp());
542 target_di = mdo->bci_to_di(target);
543 offset = target_di - my_di;
544 set_displacement_at(count, offset);
545 }
546 target = sw.default_offset() + bci();
547 my_di = mdo->dp_to_di(dp());
548 target_di = mdo->bci_to_di(target);
549 offset = target_di - my_di;
550 set_default_displacement(offset);
552 } else {
553 Bytecode_lookupswitch sw(stream->method()(), stream->bcp());
554 int npairs = sw.number_of_pairs();
555 assert(array_len() == per_case_cell_count * (npairs + 1), "wrong len");
556 for (int count = 0; count < npairs; count++) {
557 LookupswitchPair pair = sw.pair_at(count);
558 target = pair.offset() + bci();
559 my_di = mdo->dp_to_di(dp());
560 target_di = mdo->bci_to_di(target);
561 offset = target_di - my_di;
562 set_displacement_at(count, offset);
563 }
564 target = sw.default_offset() + bci();
565 my_di = mdo->dp_to_di(dp());
566 target_di = mdo->bci_to_di(target);
567 offset = target_di - my_di;
568 set_default_displacement(offset);
569 }
570 }
572 #ifndef PRODUCT
573 void MultiBranchData::print_data_on(outputStream* st) const {
574 print_shared(st, "MultiBranchData");
575 st->print_cr("default_count(%u) displacement(%d)",
576 default_count(), default_displacement());
577 int cases = number_of_cases();
578 for (int i = 0; i < cases; i++) {
579 tab(st);
580 st->print_cr("count(%u) displacement(%d)",
581 count_at(i), displacement_at(i));
582 }
583 }
584 #endif
586 #ifndef PRODUCT
587 void ArgInfoData::print_data_on(outputStream* st) const {
588 print_shared(st, "ArgInfoData");
589 int nargs = number_of_args();
590 for (int i = 0; i < nargs; i++) {
591 st->print(" 0x%x", arg_modified(i));
592 }
593 st->cr();
594 }
596 #endif
598 int ParametersTypeData::compute_cell_count(Method* m) {
599 if (!MethodData::profile_parameters_for_method(m)) {
600 return 0;
601 }
602 int max = TypeProfileParmsLimit == -1 ? INT_MAX : TypeProfileParmsLimit;
603 int obj_args = TypeStackSlotEntries::compute_cell_count(m->signature(), !m->is_static(), max);
604 if (obj_args > 0) {
605 return obj_args + 1; // 1 cell for array len
606 }
607 return 0;
608 }
610 void ParametersTypeData::post_initialize(BytecodeStream* stream, MethodData* mdo) {
611 _parameters.post_initialize(mdo->method()->signature(), !mdo->method()->is_static(), true);
612 }
614 bool ParametersTypeData::profiling_enabled() {
615 return MethodData::profile_parameters();
616 }
618 #ifndef PRODUCT
619 void ParametersTypeData::print_data_on(outputStream* st) const {
620 st->print("parameter types");
621 _parameters.print_data_on(st);
622 }
623 #endif
625 // ==================================================================
626 // MethodData*
627 //
628 // A MethodData* holds information which has been collected about
629 // a method.
631 MethodData* MethodData::allocate(ClassLoaderData* loader_data, methodHandle method, TRAPS) {
632 int size = MethodData::compute_allocation_size_in_words(method);
634 return new (loader_data, size, false, MetaspaceObj::MethodDataType, THREAD)
635 MethodData(method(), size, CHECK_NULL);
636 }
638 int MethodData::bytecode_cell_count(Bytecodes::Code code) {
639 #if defined(COMPILER1) && !defined(COMPILER2)
640 return no_profile_data;
641 #else
642 switch (code) {
643 case Bytecodes::_checkcast:
644 case Bytecodes::_instanceof:
645 case Bytecodes::_aastore:
646 if (TypeProfileCasts) {
647 return ReceiverTypeData::static_cell_count();
648 } else {
649 return BitData::static_cell_count();
650 }
651 case Bytecodes::_invokespecial:
652 case Bytecodes::_invokestatic:
653 if (MethodData::profile_arguments() || MethodData::profile_return()) {
654 return variable_cell_count;
655 } else {
656 return CounterData::static_cell_count();
657 }
658 case Bytecodes::_goto:
659 case Bytecodes::_goto_w:
660 case Bytecodes::_jsr:
661 case Bytecodes::_jsr_w:
662 return JumpData::static_cell_count();
663 case Bytecodes::_invokevirtual:
664 case Bytecodes::_invokeinterface:
665 if (MethodData::profile_arguments() || MethodData::profile_return()) {
666 return variable_cell_count;
667 } else {
668 return VirtualCallData::static_cell_count();
669 }
670 case Bytecodes::_invokedynamic:
671 if (MethodData::profile_arguments() || MethodData::profile_return()) {
672 return variable_cell_count;
673 } else {
674 return CounterData::static_cell_count();
675 }
676 case Bytecodes::_ret:
677 return RetData::static_cell_count();
678 case Bytecodes::_ifeq:
679 case Bytecodes::_ifne:
680 case Bytecodes::_iflt:
681 case Bytecodes::_ifge:
682 case Bytecodes::_ifgt:
683 case Bytecodes::_ifle:
684 case Bytecodes::_if_icmpeq:
685 case Bytecodes::_if_icmpne:
686 case Bytecodes::_if_icmplt:
687 case Bytecodes::_if_icmpge:
688 case Bytecodes::_if_icmpgt:
689 case Bytecodes::_if_icmple:
690 case Bytecodes::_if_acmpeq:
691 case Bytecodes::_if_acmpne:
692 case Bytecodes::_ifnull:
693 case Bytecodes::_ifnonnull:
694 return BranchData::static_cell_count();
695 case Bytecodes::_lookupswitch:
696 case Bytecodes::_tableswitch:
697 return variable_cell_count;
698 }
699 return no_profile_data;
700 #endif
701 }
703 // Compute the size of the profiling information corresponding to
704 // the current bytecode.
705 int MethodData::compute_data_size(BytecodeStream* stream) {
706 int cell_count = bytecode_cell_count(stream->code());
707 if (cell_count == no_profile_data) {
708 return 0;
709 }
710 if (cell_count == variable_cell_count) {
711 switch (stream->code()) {
712 case Bytecodes::_lookupswitch:
713 case Bytecodes::_tableswitch:
714 cell_count = MultiBranchData::compute_cell_count(stream);
715 break;
716 case Bytecodes::_invokespecial:
717 case Bytecodes::_invokestatic:
718 case Bytecodes::_invokedynamic:
719 assert(MethodData::profile_arguments() || MethodData::profile_return(), "should be collecting args profile");
720 if (profile_arguments_for_invoke(stream->method(), stream->bci()) ||
721 profile_return_for_invoke(stream->method(), stream->bci())) {
722 cell_count = CallTypeData::compute_cell_count(stream);
723 } else {
724 cell_count = CounterData::static_cell_count();
725 }
726 break;
727 case Bytecodes::_invokevirtual:
728 case Bytecodes::_invokeinterface: {
729 assert(MethodData::profile_arguments() || MethodData::profile_return(), "should be collecting args profile");
730 if (profile_arguments_for_invoke(stream->method(), stream->bci()) ||
731 profile_return_for_invoke(stream->method(), stream->bci())) {
732 cell_count = VirtualCallTypeData::compute_cell_count(stream);
733 } else {
734 cell_count = VirtualCallData::static_cell_count();
735 }
736 break;
737 }
738 default:
739 fatal("unexpected bytecode for var length profile data");
740 }
741 }
742 // Note: cell_count might be zero, meaning that there is just
743 // a DataLayout header, with no extra cells.
744 assert(cell_count >= 0, "sanity");
745 return DataLayout::compute_size_in_bytes(cell_count);
746 }
748 int MethodData::compute_extra_data_count(int data_size, int empty_bc_count) {
749 if (ProfileTraps) {
750 // Assume that up to 3% of BCIs with no MDP will need to allocate one.
751 int extra_data_count = (uint)(empty_bc_count * 3) / 128 + 1;
752 // If the method is large, let the extra BCIs grow numerous (to ~1%).
753 int one_percent_of_data
754 = (uint)data_size / (DataLayout::header_size_in_bytes()*128);
755 if (extra_data_count < one_percent_of_data)
756 extra_data_count = one_percent_of_data;
757 if (extra_data_count > empty_bc_count)
758 extra_data_count = empty_bc_count; // no need for more
759 return extra_data_count;
760 } else {
761 return 0;
762 }
763 }
765 // Compute the size of the MethodData* necessary to store
766 // profiling information about a given method. Size is in bytes.
767 int MethodData::compute_allocation_size_in_bytes(methodHandle method) {
768 int data_size = 0;
769 BytecodeStream stream(method);
770 Bytecodes::Code c;
771 int empty_bc_count = 0; // number of bytecodes lacking data
772 while ((c = stream.next()) >= 0) {
773 int size_in_bytes = compute_data_size(&stream);
774 data_size += size_in_bytes;
775 if (size_in_bytes == 0) empty_bc_count += 1;
776 }
777 int object_size = in_bytes(data_offset()) + data_size;
779 // Add some extra DataLayout cells (at least one) to track stray traps.
780 int extra_data_count = compute_extra_data_count(data_size, empty_bc_count);
781 object_size += extra_data_count * DataLayout::compute_size_in_bytes(0);
783 // Add a cell to record information about modified arguments.
784 int arg_size = method->size_of_parameters();
785 object_size += DataLayout::compute_size_in_bytes(arg_size+1);
787 // Reserve room for an area of the MDO dedicated to profiling of
788 // parameters
789 int args_cell = ParametersTypeData::compute_cell_count(method());
790 if (args_cell > 0) {
791 object_size += DataLayout::compute_size_in_bytes(args_cell);
792 }
793 return object_size;
794 }
796 // Compute the size of the MethodData* necessary to store
797 // profiling information about a given method. Size is in words
798 int MethodData::compute_allocation_size_in_words(methodHandle method) {
799 int byte_size = compute_allocation_size_in_bytes(method);
800 int word_size = align_size_up(byte_size, BytesPerWord) / BytesPerWord;
801 return align_object_size(word_size);
802 }
804 // Initialize an individual data segment. Returns the size of
805 // the segment in bytes.
806 int MethodData::initialize_data(BytecodeStream* stream,
807 int data_index) {
808 #if defined(COMPILER1) && !defined(COMPILER2)
809 return 0;
810 #else
811 int cell_count = -1;
812 int tag = DataLayout::no_tag;
813 DataLayout* data_layout = data_layout_at(data_index);
814 Bytecodes::Code c = stream->code();
815 switch (c) {
816 case Bytecodes::_checkcast:
817 case Bytecodes::_instanceof:
818 case Bytecodes::_aastore:
819 if (TypeProfileCasts) {
820 cell_count = ReceiverTypeData::static_cell_count();
821 tag = DataLayout::receiver_type_data_tag;
822 } else {
823 cell_count = BitData::static_cell_count();
824 tag = DataLayout::bit_data_tag;
825 }
826 break;
827 case Bytecodes::_invokespecial:
828 case Bytecodes::_invokestatic: {
829 int counter_data_cell_count = CounterData::static_cell_count();
830 if (profile_arguments_for_invoke(stream->method(), stream->bci()) ||
831 profile_return_for_invoke(stream->method(), stream->bci())) {
832 cell_count = CallTypeData::compute_cell_count(stream);
833 } else {
834 cell_count = counter_data_cell_count;
835 }
836 if (cell_count > counter_data_cell_count) {
837 tag = DataLayout::call_type_data_tag;
838 } else {
839 tag = DataLayout::counter_data_tag;
840 }
841 break;
842 }
843 case Bytecodes::_goto:
844 case Bytecodes::_goto_w:
845 case Bytecodes::_jsr:
846 case Bytecodes::_jsr_w:
847 cell_count = JumpData::static_cell_count();
848 tag = DataLayout::jump_data_tag;
849 break;
850 case Bytecodes::_invokevirtual:
851 case Bytecodes::_invokeinterface: {
852 int virtual_call_data_cell_count = VirtualCallData::static_cell_count();
853 if (profile_arguments_for_invoke(stream->method(), stream->bci()) ||
854 profile_return_for_invoke(stream->method(), stream->bci())) {
855 cell_count = VirtualCallTypeData::compute_cell_count(stream);
856 } else {
857 cell_count = virtual_call_data_cell_count;
858 }
859 if (cell_count > virtual_call_data_cell_count) {
860 tag = DataLayout::virtual_call_type_data_tag;
861 } else {
862 tag = DataLayout::virtual_call_data_tag;
863 }
864 break;
865 }
866 case Bytecodes::_invokedynamic: {
867 // %%% should make a type profile for any invokedynamic that takes a ref argument
868 int counter_data_cell_count = CounterData::static_cell_count();
869 if (profile_arguments_for_invoke(stream->method(), stream->bci()) ||
870 profile_return_for_invoke(stream->method(), stream->bci())) {
871 cell_count = CallTypeData::compute_cell_count(stream);
872 } else {
873 cell_count = counter_data_cell_count;
874 }
875 if (cell_count > counter_data_cell_count) {
876 tag = DataLayout::call_type_data_tag;
877 } else {
878 tag = DataLayout::counter_data_tag;
879 }
880 break;
881 }
882 case Bytecodes::_ret:
883 cell_count = RetData::static_cell_count();
884 tag = DataLayout::ret_data_tag;
885 break;
886 case Bytecodes::_ifeq:
887 case Bytecodes::_ifne:
888 case Bytecodes::_iflt:
889 case Bytecodes::_ifge:
890 case Bytecodes::_ifgt:
891 case Bytecodes::_ifle:
892 case Bytecodes::_if_icmpeq:
893 case Bytecodes::_if_icmpne:
894 case Bytecodes::_if_icmplt:
895 case Bytecodes::_if_icmpge:
896 case Bytecodes::_if_icmpgt:
897 case Bytecodes::_if_icmple:
898 case Bytecodes::_if_acmpeq:
899 case Bytecodes::_if_acmpne:
900 case Bytecodes::_ifnull:
901 case Bytecodes::_ifnonnull:
902 cell_count = BranchData::static_cell_count();
903 tag = DataLayout::branch_data_tag;
904 break;
905 case Bytecodes::_lookupswitch:
906 case Bytecodes::_tableswitch:
907 cell_count = MultiBranchData::compute_cell_count(stream);
908 tag = DataLayout::multi_branch_data_tag;
909 break;
910 }
911 assert(tag == DataLayout::multi_branch_data_tag ||
912 ((MethodData::profile_arguments() || MethodData::profile_return()) &&
913 (tag == DataLayout::call_type_data_tag ||
914 tag == DataLayout::counter_data_tag ||
915 tag == DataLayout::virtual_call_type_data_tag ||
916 tag == DataLayout::virtual_call_data_tag)) ||
917 cell_count == bytecode_cell_count(c), "cell counts must agree");
918 if (cell_count >= 0) {
919 assert(tag != DataLayout::no_tag, "bad tag");
920 assert(bytecode_has_profile(c), "agree w/ BHP");
921 data_layout->initialize(tag, stream->bci(), cell_count);
922 return DataLayout::compute_size_in_bytes(cell_count);
923 } else {
924 assert(!bytecode_has_profile(c), "agree w/ !BHP");
925 return 0;
926 }
927 #endif
928 }
930 // Get the data at an arbitrary (sort of) data index.
931 ProfileData* MethodData::data_at(int data_index) const {
932 if (out_of_bounds(data_index)) {
933 return NULL;
934 }
935 DataLayout* data_layout = data_layout_at(data_index);
936 return data_layout->data_in();
937 }
939 ProfileData* DataLayout::data_in() {
940 switch (tag()) {
941 case DataLayout::no_tag:
942 default:
943 ShouldNotReachHere();
944 return NULL;
945 case DataLayout::bit_data_tag:
946 return new BitData(this);
947 case DataLayout::counter_data_tag:
948 return new CounterData(this);
949 case DataLayout::jump_data_tag:
950 return new JumpData(this);
951 case DataLayout::receiver_type_data_tag:
952 return new ReceiverTypeData(this);
953 case DataLayout::virtual_call_data_tag:
954 return new VirtualCallData(this);
955 case DataLayout::ret_data_tag:
956 return new RetData(this);
957 case DataLayout::branch_data_tag:
958 return new BranchData(this);
959 case DataLayout::multi_branch_data_tag:
960 return new MultiBranchData(this);
961 case DataLayout::arg_info_data_tag:
962 return new ArgInfoData(this);
963 case DataLayout::call_type_data_tag:
964 return new CallTypeData(this);
965 case DataLayout::virtual_call_type_data_tag:
966 return new VirtualCallTypeData(this);
967 case DataLayout::parameters_type_data_tag:
968 return new ParametersTypeData(this);
969 };
970 }
972 // Iteration over data.
973 ProfileData* MethodData::next_data(ProfileData* current) const {
974 int current_index = dp_to_di(current->dp());
975 int next_index = current_index + current->size_in_bytes();
976 ProfileData* next = data_at(next_index);
977 return next;
978 }
980 // Give each of the data entries a chance to perform specific
981 // data initialization.
982 void MethodData::post_initialize(BytecodeStream* stream) {
983 ResourceMark rm;
984 ProfileData* data;
985 for (data = first_data(); is_valid(data); data = next_data(data)) {
986 stream->set_start(data->bci());
987 stream->next();
988 data->post_initialize(stream, this);
989 }
990 if (_parameters_type_data_di != -1) {
991 parameters_type_data()->post_initialize(NULL, this);
992 }
993 }
995 // Initialize the MethodData* corresponding to a given method.
996 MethodData::MethodData(methodHandle method, int size, TRAPS) {
997 No_Safepoint_Verifier no_safepoint; // init function atomic wrt GC
998 ResourceMark rm;
999 // Set the method back-pointer.
1000 _method = method();
1002 init();
1003 set_creation_mileage(mileage_of(method()));
1005 // Go through the bytecodes and allocate and initialize the
1006 // corresponding data cells.
1007 int data_size = 0;
1008 int empty_bc_count = 0; // number of bytecodes lacking data
1009 _data[0] = 0; // apparently not set below.
1010 BytecodeStream stream(method);
1011 Bytecodes::Code c;
1012 while ((c = stream.next()) >= 0) {
1013 int size_in_bytes = initialize_data(&stream, data_size);
1014 data_size += size_in_bytes;
1015 if (size_in_bytes == 0) empty_bc_count += 1;
1016 }
1017 _data_size = data_size;
1018 int object_size = in_bytes(data_offset()) + data_size;
1020 // Add some extra DataLayout cells (at least one) to track stray traps.
1021 int extra_data_count = compute_extra_data_count(data_size, empty_bc_count);
1022 int extra_size = extra_data_count * DataLayout::compute_size_in_bytes(0);
1024 // Add a cell to record information about modified arguments.
1025 // Set up _args_modified array after traps cells so that
1026 // the code for traps cells works.
1027 DataLayout *dp = data_layout_at(data_size + extra_size);
1029 int arg_size = method->size_of_parameters();
1030 dp->initialize(DataLayout::arg_info_data_tag, 0, arg_size+1);
1032 int arg_data_size = DataLayout::compute_size_in_bytes(arg_size+1);
1033 object_size += extra_size + arg_data_size;
1035 int args_cell = ParametersTypeData::compute_cell_count(method());
1036 // If we are profiling parameters, we reserver an area near the end
1037 // of the MDO after the slots for bytecodes (because there's no bci
1038 // for method entry so they don't fit with the framework for the
1039 // profiling of bytecodes). We store the offset within the MDO of
1040 // this area (or -1 if no parameter is profiled)
1041 if (args_cell > 0) {
1042 object_size += DataLayout::compute_size_in_bytes(args_cell);
1043 _parameters_type_data_di = data_size + extra_size + arg_data_size;
1044 DataLayout *dp = data_layout_at(data_size + extra_size + arg_data_size);
1045 dp->initialize(DataLayout::parameters_type_data_tag, 0, args_cell);
1046 } else {
1047 _parameters_type_data_di = -1;
1048 }
1050 // Set an initial hint. Don't use set_hint_di() because
1051 // first_di() may be out of bounds if data_size is 0.
1052 // In that situation, _hint_di is never used, but at
1053 // least well-defined.
1054 _hint_di = first_di();
1056 post_initialize(&stream);
1058 set_size(object_size);
1059 }
1061 void MethodData::init() {
1062 _invocation_counter.init();
1063 _backedge_counter.init();
1064 _invocation_counter_start = 0;
1065 _backedge_counter_start = 0;
1066 _num_loops = 0;
1067 _num_blocks = 0;
1068 _highest_comp_level = 0;
1069 _highest_osr_comp_level = 0;
1070 _would_profile = true;
1072 // Initialize flags and trap history.
1073 _nof_decompiles = 0;
1074 _nof_overflow_recompiles = 0;
1075 _nof_overflow_traps = 0;
1076 clear_escape_info();
1077 assert(sizeof(_trap_hist) % sizeof(HeapWord) == 0, "align");
1078 Copy::zero_to_words((HeapWord*) &_trap_hist,
1079 sizeof(_trap_hist) / sizeof(HeapWord));
1080 }
1082 // Get a measure of how much mileage the method has on it.
1083 int MethodData::mileage_of(Method* method) {
1084 int mileage = 0;
1085 if (TieredCompilation) {
1086 mileage = MAX2(method->invocation_count(), method->backedge_count());
1087 } else {
1088 int iic = method->interpreter_invocation_count();
1089 if (mileage < iic) mileage = iic;
1090 MethodCounters* mcs = method->method_counters();
1091 if (mcs != NULL) {
1092 InvocationCounter* ic = mcs->invocation_counter();
1093 InvocationCounter* bc = mcs->backedge_counter();
1094 int icval = ic->count();
1095 if (ic->carry()) icval += CompileThreshold;
1096 if (mileage < icval) mileage = icval;
1097 int bcval = bc->count();
1098 if (bc->carry()) bcval += CompileThreshold;
1099 if (mileage < bcval) mileage = bcval;
1100 }
1101 }
1102 return mileage;
1103 }
1105 bool MethodData::is_mature() const {
1106 return CompilationPolicy::policy()->is_mature(_method);
1107 }
1109 // Translate a bci to its corresponding data index (di).
1110 address MethodData::bci_to_dp(int bci) {
1111 ResourceMark rm;
1112 ProfileData* data = data_before(bci);
1113 ProfileData* prev = NULL;
1114 for ( ; is_valid(data); data = next_data(data)) {
1115 if (data->bci() >= bci) {
1116 if (data->bci() == bci) set_hint_di(dp_to_di(data->dp()));
1117 else if (prev != NULL) set_hint_di(dp_to_di(prev->dp()));
1118 return data->dp();
1119 }
1120 prev = data;
1121 }
1122 return (address)limit_data_position();
1123 }
1125 // Translate a bci to its corresponding data, or NULL.
1126 ProfileData* MethodData::bci_to_data(int bci) {
1127 ProfileData* data = data_before(bci);
1128 for ( ; is_valid(data); data = next_data(data)) {
1129 if (data->bci() == bci) {
1130 set_hint_di(dp_to_di(data->dp()));
1131 return data;
1132 } else if (data->bci() > bci) {
1133 break;
1134 }
1135 }
1136 return bci_to_extra_data(bci, false);
1137 }
1139 // Translate a bci to its corresponding extra data, or NULL.
1140 ProfileData* MethodData::bci_to_extra_data(int bci, bool create_if_missing) {
1141 DataLayout* dp = extra_data_base();
1142 DataLayout* end = extra_data_limit();
1143 DataLayout* avail = NULL;
1144 for (; dp < end; dp = next_extra(dp)) {
1145 // No need for "OrderAccess::load_acquire" ops,
1146 // since the data structure is monotonic.
1147 if (dp->tag() == DataLayout::no_tag) break;
1148 if (dp->tag() == DataLayout::arg_info_data_tag) {
1149 dp = end; // ArgInfoData is at the end of extra data section.
1150 break;
1151 }
1152 if (dp->bci() == bci) {
1153 assert(dp->tag() == DataLayout::bit_data_tag, "sane");
1154 return new BitData(dp);
1155 }
1156 }
1157 if (create_if_missing && dp < end) {
1158 // Allocate this one. There is no mutual exclusion,
1159 // so two threads could allocate different BCIs to the
1160 // same data layout. This means these extra data
1161 // records, like most other MDO contents, must not be
1162 // trusted too much.
1163 DataLayout temp;
1164 temp.initialize(DataLayout::bit_data_tag, bci, 0);
1165 dp->release_set_header(temp.header());
1166 assert(dp->tag() == DataLayout::bit_data_tag, "sane");
1167 //NO: assert(dp->bci() == bci, "no concurrent allocation");
1168 return new BitData(dp);
1169 }
1170 return NULL;
1171 }
1173 ArgInfoData *MethodData::arg_info() {
1174 DataLayout* dp = extra_data_base();
1175 DataLayout* end = extra_data_limit();
1176 for (; dp < end; dp = next_extra(dp)) {
1177 if (dp->tag() == DataLayout::arg_info_data_tag)
1178 return new ArgInfoData(dp);
1179 }
1180 return NULL;
1181 }
1183 // Printing
1185 #ifndef PRODUCT
1187 void MethodData::print_on(outputStream* st) const {
1188 assert(is_methodData(), "should be method data");
1189 st->print("method data for ");
1190 method()->print_value_on(st);
1191 st->cr();
1192 print_data_on(st);
1193 }
1195 #endif //PRODUCT
1197 void MethodData::print_value_on(outputStream* st) const {
1198 assert(is_methodData(), "should be method data");
1199 st->print("method data for ");
1200 method()->print_value_on(st);
1201 }
1203 #ifndef PRODUCT
1204 void MethodData::print_data_on(outputStream* st) const {
1205 ResourceMark rm;
1206 ProfileData* data = first_data();
1207 if (_parameters_type_data_di != -1) {
1208 parameters_type_data()->print_data_on(st);
1209 }
1210 for ( ; is_valid(data); data = next_data(data)) {
1211 st->print("%d", dp_to_di(data->dp()));
1212 st->fill_to(6);
1213 data->print_data_on(st);
1214 }
1215 st->print_cr("--- Extra data:");
1216 DataLayout* dp = extra_data_base();
1217 DataLayout* end = extra_data_limit();
1218 for (; dp < end; dp = next_extra(dp)) {
1219 // No need for "OrderAccess::load_acquire" ops,
1220 // since the data structure is monotonic.
1221 if (dp->tag() == DataLayout::no_tag) continue;
1222 if (dp->tag() == DataLayout::bit_data_tag) {
1223 data = new BitData(dp);
1224 } else {
1225 assert(dp->tag() == DataLayout::arg_info_data_tag, "must be BitData or ArgInfo");
1226 data = new ArgInfoData(dp);
1227 dp = end; // ArgInfoData is at the end of extra data section.
1228 }
1229 st->print("%d", dp_to_di(data->dp()));
1230 st->fill_to(6);
1231 data->print_data_on(st);
1232 }
1233 }
1234 #endif
1236 #if INCLUDE_SERVICES
1237 // Size Statistics
1238 void MethodData::collect_statistics(KlassSizeStats *sz) const {
1239 int n = sz->count(this);
1240 sz->_method_data_bytes += n;
1241 sz->_method_all_bytes += n;
1242 sz->_rw_bytes += n;
1243 }
1244 #endif // INCLUDE_SERVICES
1246 // Verification
1248 void MethodData::verify_on(outputStream* st) {
1249 guarantee(is_methodData(), "object must be method data");
1250 // guarantee(m->is_perm(), "should be in permspace");
1251 this->verify_data_on(st);
1252 }
1254 void MethodData::verify_data_on(outputStream* st) {
1255 NEEDS_CLEANUP;
1256 // not yet implemented.
1257 }
1259 bool MethodData::profile_jsr292(methodHandle m, int bci) {
1260 if (m->is_compiled_lambda_form()) {
1261 return true;
1262 }
1264 Bytecode_invoke inv(m , bci);
1265 return inv.is_invokedynamic() || inv.is_invokehandle();
1266 }
1268 int MethodData::profile_arguments_flag() {
1269 return TypeProfileLevel % 10;
1270 }
1272 bool MethodData::profile_arguments() {
1273 return profile_arguments_flag() > no_type_profile && profile_arguments_flag() <= type_profile_all;
1274 }
1276 bool MethodData::profile_arguments_jsr292_only() {
1277 return profile_arguments_flag() == type_profile_jsr292;
1278 }
1280 bool MethodData::profile_all_arguments() {
1281 return profile_arguments_flag() == type_profile_all;
1282 }
1284 bool MethodData::profile_arguments_for_invoke(methodHandle m, int bci) {
1285 if (!profile_arguments()) {
1286 return false;
1287 }
1289 if (profile_all_arguments()) {
1290 return true;
1291 }
1293 assert(profile_arguments_jsr292_only(), "inconsistent");
1294 return profile_jsr292(m, bci);
1295 }
1297 int MethodData::profile_return_flag() {
1298 return (TypeProfileLevel % 100) / 10;
1299 }
1301 bool MethodData::profile_return() {
1302 return profile_return_flag() > no_type_profile && profile_return_flag() <= type_profile_all;
1303 }
1305 bool MethodData::profile_return_jsr292_only() {
1306 return profile_return_flag() == type_profile_jsr292;
1307 }
1309 bool MethodData::profile_all_return() {
1310 return profile_return_flag() == type_profile_all;
1311 }
1313 bool MethodData::profile_return_for_invoke(methodHandle m, int bci) {
1314 if (!profile_return()) {
1315 return false;
1316 }
1318 if (profile_all_return()) {
1319 return true;
1320 }
1322 assert(profile_return_jsr292_only(), "inconsistent");
1323 return profile_jsr292(m, bci);
1324 }
1326 int MethodData::profile_parameters_flag() {
1327 return TypeProfileLevel / 100;
1328 }
1330 bool MethodData::profile_parameters() {
1331 return profile_parameters_flag() > no_type_profile && profile_parameters_flag() <= type_profile_all;
1332 }
1334 bool MethodData::profile_parameters_jsr292_only() {
1335 return profile_parameters_flag() == type_profile_jsr292;
1336 }
1338 bool MethodData::profile_all_parameters() {
1339 return profile_parameters_flag() == type_profile_all;
1340 }
1342 bool MethodData::profile_parameters_for_method(methodHandle m) {
1343 if (!profile_parameters()) {
1344 return false;
1345 }
1347 if (profile_all_parameters()) {
1348 return true;
1349 }
1351 assert(profile_parameters_jsr292_only(), "inconsistent");
1352 return m->is_compiled_lambda_form();
1353 }