1 /*
2 * Copyright (c) 2000, 2013, Oracle and/or its affiliates. All rights reserved.
3 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
4 *
5 * This code is free software; you can redistribute it and/or modify it
6 * under the terms of the GNU General Public License version 2 only, as
7 * published by the Free Software Foundation.
8 *
9 * This code is distributed in the hope that it will be useful, but WITHOUT
10 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
11 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
12 * version 2 for more details (a copy is included in the LICENSE file that
13 * accompanied this code).
14 *
15 * You should have received a copy of the GNU General Public License version
16 * 2 along with this work; if not, write to the Free Software Foundation,
17 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
18 *
19 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
20 * or visit www.oracle.com if you need additional information or have any
21 * questions.
22 *
23 */
24
25 #include "precompiled.hpp"
26 #include "classfile/systemDictionary.hpp"
27 #include "interpreter/bytecode.hpp"
28 #include "interpreter/bytecodeStream.hpp"
29 #include "interpreter/linkResolver.hpp"
30 #include "memory/heapInspection.hpp"
31 #include "oops/methodData.hpp"
32 #include "prims/jvmtiRedefineClasses.hpp"
33 #include "runtime/compilationPolicy.hpp"
34 #include "runtime/deoptimization.hpp"
35 #include "runtime/handles.inline.hpp"
36
37 // ==================================================================
38 // DataLayout
39 //
40 // Overlay for generic profiling data.
41
42 // Some types of data layouts need a length field.
43 bool DataLayout::needs_array_len(u1 tag) {
44 return (tag == multi_branch_data_tag) || (tag == arg_info_data_tag);
45 }
46
47 // Perform generic initialization of the data. More specific
48 // initialization occurs in overrides of ProfileData::post_initialize.
49 void DataLayout::initialize(u1 tag, u2 bci, int cell_count) {
50 _header._bits = (intptr_t)0;
51 _header._struct._tag = tag;
52 _header._struct._bci = bci;
53 for (int i = 0; i < cell_count; i++) {
54 set_cell_at(i, (intptr_t)0);
55 }
56 if (needs_array_len(tag)) {
57 set_cell_at(ArrayData::array_len_off_set, cell_count - 1); // -1 for header.
58 }
59 }
60
61 void DataLayout::clean_weak_klass_links(BoolObjectClosure* cl) {
62 ResourceMark m;
63 data_in()->clean_weak_klass_links(cl);
64 }
65
66
67 // ==================================================================
68 // ProfileData
69 //
70 // A ProfileData object is created to refer to a section of profiling
71 // data in a structured way.
72
73 // Constructor for invalid ProfileData.
74 ProfileData::ProfileData() {
75 _data = NULL;
76 }
77
78 #ifndef PRODUCT
79 void ProfileData::print_shared(outputStream* st, const char* name) {
80 st->print("bci: %d", bci());
81 st->fill_to(tab_width_one);
82 st->print("%s", name);
83 tab(st);
84 int trap = trap_state();
85 if (trap != 0) {
86 char buf[100];
87 st->print("trap(%s) ", Deoptimization::format_trap_state(buf, sizeof(buf), trap));
88 }
89 int flags = data()->flags();
90 if (flags != 0)
91 st->print("flags(%d) ", flags);
92 }
93
94 void ProfileData::tab(outputStream* st) {
95 st->fill_to(tab_width_two);
96 }
97 #endif // !PRODUCT
98
99 // ==================================================================
100 // BitData
101 //
102 // A BitData corresponds to a one-bit flag. This is used to indicate
103 // whether a checkcast bytecode has seen a null value.
104
105
106 #ifndef PRODUCT
107 void BitData::print_data_on(outputStream* st) {
108 print_shared(st, "BitData");
109 }
110 #endif // !PRODUCT
111
112 // ==================================================================
113 // CounterData
114 //
115 // A CounterData corresponds to a simple counter.
116
117 #ifndef PRODUCT
118 void CounterData::print_data_on(outputStream* st) {
119 print_shared(st, "CounterData");
120 st->print_cr("count(%u)", count());
121 }
122 #endif // !PRODUCT
123
124 // ==================================================================
125 // JumpData
126 //
127 // A JumpData is used to access profiling information for a direct
128 // branch. It is a counter, used for counting the number of branches,
129 // plus a data displacement, used for realigning the data pointer to
130 // the corresponding target bci.
131
132 void JumpData::post_initialize(BytecodeStream* stream, MethodData* mdo) {
133 assert(stream->bci() == bci(), "wrong pos");
134 int target;
135 Bytecodes::Code c = stream->code();
136 if (c == Bytecodes::_goto_w || c == Bytecodes::_jsr_w) {
137 target = stream->dest_w();
138 } else {
139 target = stream->dest();
140 }
141 int my_di = mdo->dp_to_di(dp());
142 int target_di = mdo->bci_to_di(target);
143 int offset = target_di - my_di;
144 set_displacement(offset);
145 }
146
147 #ifndef PRODUCT
148 void JumpData::print_data_on(outputStream* st) {
149 print_shared(st, "JumpData");
150 st->print_cr("taken(%u) displacement(%d)", taken(), displacement());
151 }
152 #endif // !PRODUCT
153
154 // ==================================================================
155 // ReceiverTypeData
156 //
157 // A ReceiverTypeData is used to access profiling information about a
158 // dynamic type check. It consists of a counter which counts the total times
159 // that the check is reached, and a series of (Klass*, count) pairs
160 // which are used to store a type profile for the receiver of the check.
161
162 void ReceiverTypeData::clean_weak_klass_links(BoolObjectClosure* is_alive_cl) {
163 for (uint row = 0; row < row_limit(); row++) {
164 Klass* p = receiver(row);
165 if (p != NULL && !p->is_loader_alive(is_alive_cl)) {
166 clear_row(row);
167 }
168 }
169 }
170
171 #ifndef PRODUCT
172 void ReceiverTypeData::print_receiver_data_on(outputStream* st) {
173 uint row;
174 int entries = 0;
175 for (row = 0; row < row_limit(); row++) {
176 if (receiver(row) != NULL) entries++;
177 }
178 st->print_cr("count(%u) entries(%u)", count(), entries);
179 int total = count();
180 for (row = 0; row < row_limit(); row++) {
181 if (receiver(row) != NULL) {
182 total += receiver_count(row);
183 }
184 }
185 for (row = 0; row < row_limit(); row++) {
186 if (receiver(row) != NULL) {
187 tab(st);
188 receiver(row)->print_value_on(st);
189 st->print_cr("(%u %4.2f)", receiver_count(row), (float) receiver_count(row) / (float) total);
190 }
191 }
192 }
193 void ReceiverTypeData::print_data_on(outputStream* st) {
194 print_shared(st, "ReceiverTypeData");
195 print_receiver_data_on(st);
196 }
197 void VirtualCallData::print_data_on(outputStream* st) {
198 print_shared(st, "VirtualCallData");
199 print_receiver_data_on(st);
200 }
201 #endif // !PRODUCT
202
203 // ==================================================================
204 // RetData
205 //
206 // A RetData is used to access profiling information for a ret bytecode.
207 // It is composed of a count of the number of times that the ret has
208 // been executed, followed by a series of triples of the form
209 // (bci, count, di) which count the number of times that some bci was the
210 // target of the ret and cache a corresponding displacement.
211
212 void RetData::post_initialize(BytecodeStream* stream, MethodData* mdo) {
213 for (uint row = 0; row < row_limit(); row++) {
214 set_bci_displacement(row, -1);
215 set_bci(row, no_bci);
216 }
217 // release so other threads see a consistent state. bci is used as
218 // a valid flag for bci_displacement.
219 OrderAccess::release();
220 }
221
222 // This routine needs to atomically update the RetData structure, so the
223 // caller needs to hold the RetData_lock before it gets here. Since taking
224 // the lock can block (and allow GC) and since RetData is a ProfileData is a
225 // wrapper around a derived oop, taking the lock in _this_ method will
226 // basically cause the 'this' pointer's _data field to contain junk after the
227 // lock. We require the caller to take the lock before making the ProfileData
228 // structure. Currently the only caller is InterpreterRuntime::update_mdp_for_ret
229 address RetData::fixup_ret(int return_bci, MethodData* h_mdo) {
230 // First find the mdp which corresponds to the return bci.
231 address mdp = h_mdo->bci_to_dp(return_bci);
232
233 // Now check to see if any of the cache slots are open.
234 for (uint row = 0; row < row_limit(); row++) {
235 if (bci(row) == no_bci) {
236 set_bci_displacement(row, mdp - dp());
237 set_bci_count(row, DataLayout::counter_increment);
238 // Barrier to ensure displacement is written before the bci; allows
239 // the interpreter to read displacement without fear of race condition.
240 release_set_bci(row, return_bci);
241 break;
242 }
243 }
244 return mdp;
245 }
246
247 #ifdef CC_INTERP
248 DataLayout* RetData::advance(MethodData *md, int bci) {
249 return (DataLayout*) md->bci_to_dp(bci);
250 }
251 #endif // CC_INTERP
252
253 #ifndef PRODUCT
254 void RetData::print_data_on(outputStream* st) {
255 print_shared(st, "RetData");
256 uint row;
257 int entries = 0;
258 for (row = 0; row < row_limit(); row++) {
259 if (bci(row) != no_bci) entries++;
260 }
261 st->print_cr("count(%u) entries(%u)", count(), entries);
262 for (row = 0; row < row_limit(); row++) {
263 if (bci(row) != no_bci) {
264 tab(st);
265 st->print_cr("bci(%d: count(%u) displacement(%d))",
266 bci(row), bci_count(row), bci_displacement(row));
267 }
268 }
269 }
270 #endif // !PRODUCT
271
272 // ==================================================================
273 // BranchData
274 //
275 // A BranchData is used to access profiling data for a two-way branch.
276 // It consists of taken and not_taken counts as well as a data displacement
277 // for the taken case.
278
279 void BranchData::post_initialize(BytecodeStream* stream, MethodData* mdo) {
280 assert(stream->bci() == bci(), "wrong pos");
281 int target = stream->dest();
282 int my_di = mdo->dp_to_di(dp());
283 int target_di = mdo->bci_to_di(target);
284 int offset = target_di - my_di;
285 set_displacement(offset);
286 }
287
288 #ifndef PRODUCT
289 void BranchData::print_data_on(outputStream* st) {
290 print_shared(st, "BranchData");
291 st->print_cr("taken(%u) displacement(%d)",
292 taken(), displacement());
293 tab(st);
294 st->print_cr("not taken(%u)", not_taken());
295 }
296 #endif
297
298 // ==================================================================
299 // MultiBranchData
300 //
301 // A MultiBranchData is used to access profiling information for
302 // a multi-way branch (*switch bytecodes). It consists of a series
303 // of (count, displacement) pairs, which count the number of times each
304 // case was taken and specify the data displacment for each branch target.
305
306 int MultiBranchData::compute_cell_count(BytecodeStream* stream) {
307 int cell_count = 0;
308 if (stream->code() == Bytecodes::_tableswitch) {
309 Bytecode_tableswitch sw(stream->method()(), stream->bcp());
310 cell_count = 1 + per_case_cell_count * (1 + sw.length()); // 1 for default
311 } else {
312 Bytecode_lookupswitch sw(stream->method()(), stream->bcp());
313 cell_count = 1 + per_case_cell_count * (sw.number_of_pairs() + 1); // 1 for default
314 }
315 return cell_count;
316 }
317
318 void MultiBranchData::post_initialize(BytecodeStream* stream,
319 MethodData* mdo) {
320 assert(stream->bci() == bci(), "wrong pos");
321 int target;
322 int my_di;
323 int target_di;
324 int offset;
325 if (stream->code() == Bytecodes::_tableswitch) {
326 Bytecode_tableswitch sw(stream->method()(), stream->bcp());
327 int len = sw.length();
328 assert(array_len() == per_case_cell_count * (len + 1), "wrong len");
329 for (int count = 0; count < len; count++) {
330 target = sw.dest_offset_at(count) + bci();
331 my_di = mdo->dp_to_di(dp());
332 target_di = mdo->bci_to_di(target);
333 offset = target_di - my_di;
334 set_displacement_at(count, offset);
335 }
336 target = sw.default_offset() + bci();
337 my_di = mdo->dp_to_di(dp());
338 target_di = mdo->bci_to_di(target);
339 offset = target_di - my_di;
340 set_default_displacement(offset);
341
342 } else {
343 Bytecode_lookupswitch sw(stream->method()(), stream->bcp());
344 int npairs = sw.number_of_pairs();
345 assert(array_len() == per_case_cell_count * (npairs + 1), "wrong len");
346 for (int count = 0; count < npairs; count++) {
347 LookupswitchPair pair = sw.pair_at(count);
348 target = pair.offset() + bci();
349 my_di = mdo->dp_to_di(dp());
350 target_di = mdo->bci_to_di(target);
351 offset = target_di - my_di;
352 set_displacement_at(count, offset);
353 }
354 target = sw.default_offset() + bci();
355 my_di = mdo->dp_to_di(dp());
356 target_di = mdo->bci_to_di(target);
357 offset = target_di - my_di;
358 set_default_displacement(offset);
359 }
360 }
361
362 #ifndef PRODUCT
363 void MultiBranchData::print_data_on(outputStream* st) {
364 print_shared(st, "MultiBranchData");
365 st->print_cr("default_count(%u) displacement(%d)",
366 default_count(), default_displacement());
367 int cases = number_of_cases();
368 for (int i = 0; i < cases; i++) {
369 tab(st);
370 st->print_cr("count(%u) displacement(%d)",
371 count_at(i), displacement_at(i));
372 }
373 }
374 #endif
375
376 #ifndef PRODUCT
377 void ArgInfoData::print_data_on(outputStream* st) {
378 print_shared(st, "ArgInfoData");
379 int nargs = number_of_args();
380 for (int i = 0; i < nargs; i++) {
381 st->print(" 0x%x", arg_modified(i));
382 }
383 st->cr();
384 }
385
386 #endif
387 // ==================================================================
388 // MethodData*
389 //
390 // A MethodData* holds information which has been collected about
391 // a method.
392
393 MethodData* MethodData::allocate(ClassLoaderData* loader_data, methodHandle method, TRAPS) {
394 int size = MethodData::compute_allocation_size_in_words(method);
395
396 return new (loader_data, size, false, MetaspaceObj::MethodDataType, THREAD)
397 MethodData(method(), size, CHECK_NULL);
398 }
399
400 int MethodData::bytecode_cell_count(Bytecodes::Code code) {
401 #if defined(COMPILER1) && !defined(COMPILER2)
402 return no_profile_data;
403 #else
404 switch (code) {
405 case Bytecodes::_checkcast:
406 case Bytecodes::_instanceof:
407 case Bytecodes::_aastore:
408 if (TypeProfileCasts) {
409 return ReceiverTypeData::static_cell_count();
410 } else {
411 return BitData::static_cell_count();
412 }
413 case Bytecodes::_invokespecial:
414 case Bytecodes::_invokestatic:
415 return CounterData::static_cell_count();
416 case Bytecodes::_goto:
417 case Bytecodes::_goto_w:
418 case Bytecodes::_jsr:
419 case Bytecodes::_jsr_w:
420 return JumpData::static_cell_count();
421 case Bytecodes::_invokevirtual:
422 case Bytecodes::_invokeinterface:
423 return VirtualCallData::static_cell_count();
424 case Bytecodes::_invokedynamic:
425 return CounterData::static_cell_count();
426 case Bytecodes::_ret:
427 return RetData::static_cell_count();
428 case Bytecodes::_ifeq:
429 case Bytecodes::_ifne:
430 case Bytecodes::_iflt:
431 case Bytecodes::_ifge:
432 case Bytecodes::_ifgt:
433 case Bytecodes::_ifle:
434 case Bytecodes::_if_icmpeq:
435 case Bytecodes::_if_icmpne:
436 case Bytecodes::_if_icmplt:
437 case Bytecodes::_if_icmpge:
438 case Bytecodes::_if_icmpgt:
439 case Bytecodes::_if_icmple:
440 case Bytecodes::_if_acmpeq:
441 case Bytecodes::_if_acmpne:
442 case Bytecodes::_ifnull:
443 case Bytecodes::_ifnonnull:
444 return BranchData::static_cell_count();
445 case Bytecodes::_lookupswitch:
446 case Bytecodes::_tableswitch:
447 return variable_cell_count;
448 }
449 return no_profile_data;
450 #endif
451 }
452
453 // Compute the size of the profiling information corresponding to
454 // the current bytecode.
455 int MethodData::compute_data_size(BytecodeStream* stream) {
456 int cell_count = bytecode_cell_count(stream->code());
457 if (cell_count == no_profile_data) {
458 return 0;
459 }
460 if (cell_count == variable_cell_count) {
461 cell_count = MultiBranchData::compute_cell_count(stream);
462 }
463 // Note: cell_count might be zero, meaning that there is just
464 // a DataLayout header, with no extra cells.
465 assert(cell_count >= 0, "sanity");
466 return DataLayout::compute_size_in_bytes(cell_count);
467 }
468
469 int MethodData::compute_extra_data_count(int data_size, int empty_bc_count) {
470 if (ProfileTraps) {
471 // Assume that up to 3% of BCIs with no MDP will need to allocate one.
472 int extra_data_count = (uint)(empty_bc_count * 3) / 128 + 1;
473 // If the method is large, let the extra BCIs grow numerous (to ~1%).
474 int one_percent_of_data
475 = (uint)data_size / (DataLayout::header_size_in_bytes()*128);
476 if (extra_data_count < one_percent_of_data)
477 extra_data_count = one_percent_of_data;
478 if (extra_data_count > empty_bc_count)
479 extra_data_count = empty_bc_count; // no need for more
480 return extra_data_count;
481 } else {
482 return 0;
483 }
484 }
485
486 // Compute the size of the MethodData* necessary to store
487 // profiling information about a given method. Size is in bytes.
488 int MethodData::compute_allocation_size_in_bytes(methodHandle method) {
489 int data_size = 0;
490 BytecodeStream stream(method);
491 Bytecodes::Code c;
492 int empty_bc_count = 0; // number of bytecodes lacking data
493 while ((c = stream.next()) >= 0) {
494 int size_in_bytes = compute_data_size(&stream);
495 data_size += size_in_bytes;
496 if (size_in_bytes == 0) empty_bc_count += 1;
497 }
498 int object_size = in_bytes(data_offset()) + data_size;
499
500 // Add some extra DataLayout cells (at least one) to track stray traps.
501 int extra_data_count = compute_extra_data_count(data_size, empty_bc_count);
502 object_size += extra_data_count * DataLayout::compute_size_in_bytes(0);
503
504 // Add a cell to record information about modified arguments.
505 int arg_size = method->size_of_parameters();
506 object_size += DataLayout::compute_size_in_bytes(arg_size+1);
507 return object_size;
508 }
509
510 // Compute the size of the MethodData* necessary to store
511 // profiling information about a given method. Size is in words
512 int MethodData::compute_allocation_size_in_words(methodHandle method) {
513 int byte_size = compute_allocation_size_in_bytes(method);
514 int word_size = align_size_up(byte_size, BytesPerWord) / BytesPerWord;
515 return align_object_size(word_size);
516 }
517
518 // Initialize an individual data segment. Returns the size of
519 // the segment in bytes.
520 int MethodData::initialize_data(BytecodeStream* stream,
521 int data_index) {
522 #if defined(COMPILER1) && !defined(COMPILER2)
523 return 0;
524 #else
525 int cell_count = -1;
526 int tag = DataLayout::no_tag;
527 DataLayout* data_layout = data_layout_at(data_index);
528 Bytecodes::Code c = stream->code();
529 switch (c) {
530 case Bytecodes::_checkcast:
531 case Bytecodes::_instanceof:
532 case Bytecodes::_aastore:
533 if (TypeProfileCasts) {
534 cell_count = ReceiverTypeData::static_cell_count();
535 tag = DataLayout::receiver_type_data_tag;
536 } else {
537 cell_count = BitData::static_cell_count();
538 tag = DataLayout::bit_data_tag;
539 }
540 break;
541 case Bytecodes::_invokespecial:
542 case Bytecodes::_invokestatic:
543 cell_count = CounterData::static_cell_count();
544 tag = DataLayout::counter_data_tag;
545 break;
546 case Bytecodes::_goto:
547 case Bytecodes::_goto_w:
548 case Bytecodes::_jsr:
549 case Bytecodes::_jsr_w:
550 cell_count = JumpData::static_cell_count();
551 tag = DataLayout::jump_data_tag;
552 break;
553 case Bytecodes::_invokevirtual:
554 case Bytecodes::_invokeinterface:
555 cell_count = VirtualCallData::static_cell_count();
556 tag = DataLayout::virtual_call_data_tag;
557 break;
558 case Bytecodes::_invokedynamic:
559 // %%% should make a type profile for any invokedynamic that takes a ref argument
560 cell_count = CounterData::static_cell_count();
561 tag = DataLayout::counter_data_tag;
562 break;
563 case Bytecodes::_ret:
564 cell_count = RetData::static_cell_count();
565 tag = DataLayout::ret_data_tag;
566 break;
567 case Bytecodes::_ifeq:
568 case Bytecodes::_ifne:
569 case Bytecodes::_iflt:
570 case Bytecodes::_ifge:
571 case Bytecodes::_ifgt:
572 case Bytecodes::_ifle:
573 case Bytecodes::_if_icmpeq:
574 case Bytecodes::_if_icmpne:
575 case Bytecodes::_if_icmplt:
576 case Bytecodes::_if_icmpge:
577 case Bytecodes::_if_icmpgt:
578 case Bytecodes::_if_icmple:
579 case Bytecodes::_if_acmpeq:
580 case Bytecodes::_if_acmpne:
581 case Bytecodes::_ifnull:
582 case Bytecodes::_ifnonnull:
583 cell_count = BranchData::static_cell_count();
584 tag = DataLayout::branch_data_tag;
585 break;
586 case Bytecodes::_lookupswitch:
587 case Bytecodes::_tableswitch:
588 cell_count = MultiBranchData::compute_cell_count(stream);
589 tag = DataLayout::multi_branch_data_tag;
590 break;
591 }
592 assert(tag == DataLayout::multi_branch_data_tag ||
593 cell_count == bytecode_cell_count(c), "cell counts must agree");
594 if (cell_count >= 0) {
595 assert(tag != DataLayout::no_tag, "bad tag");
596 assert(bytecode_has_profile(c), "agree w/ BHP");
597 data_layout->initialize(tag, stream->bci(), cell_count);
598 return DataLayout::compute_size_in_bytes(cell_count);
599 } else {
600 assert(!bytecode_has_profile(c), "agree w/ !BHP");
601 return 0;
602 }
603 #endif
604 }
605
606 // Get the data at an arbitrary (sort of) data index.
607 ProfileData* MethodData::data_at(int data_index) const {
608 if (out_of_bounds(data_index)) {
609 return NULL;
610 }
611 DataLayout* data_layout = data_layout_at(data_index);
612 return data_layout->data_in();
613 }
614
615 ProfileData* DataLayout::data_in() {
616 switch (tag()) {
617 case DataLayout::no_tag:
618 default:
619 ShouldNotReachHere();
620 return NULL;
621 case DataLayout::bit_data_tag:
622 return new BitData(this);
623 case DataLayout::counter_data_tag:
624 return new CounterData(this);
625 case DataLayout::jump_data_tag:
626 return new JumpData(this);
627 case DataLayout::receiver_type_data_tag:
628 return new ReceiverTypeData(this);
629 case DataLayout::virtual_call_data_tag:
630 return new VirtualCallData(this);
631 case DataLayout::ret_data_tag:
632 return new RetData(this);
633 case DataLayout::branch_data_tag:
634 return new BranchData(this);
635 case DataLayout::multi_branch_data_tag:
636 return new MultiBranchData(this);
637 case DataLayout::arg_info_data_tag:
638 return new ArgInfoData(this);
639 };
640 }
641
642 // Iteration over data.
643 ProfileData* MethodData::next_data(ProfileData* current) const {
644 int current_index = dp_to_di(current->dp());
645 int next_index = current_index + current->size_in_bytes();
646 ProfileData* next = data_at(next_index);
647 return next;
648 }
649
650 // Give each of the data entries a chance to perform specific
651 // data initialization.
652 void MethodData::post_initialize(BytecodeStream* stream) {
653 ResourceMark rm;
654 ProfileData* data;
655 for (data = first_data(); is_valid(data); data = next_data(data)) {
656 stream->set_start(data->bci());
657 stream->next();
658 data->post_initialize(stream, this);
659 }
660 }
661
662 // Initialize the MethodData* corresponding to a given method.
663 MethodData::MethodData(methodHandle method, int size, TRAPS) {
664 No_Safepoint_Verifier no_safepoint; // init function atomic wrt GC
665 ResourceMark rm;
666 // Set the method back-pointer.
667 _method = method();
668
669 init();
670 set_creation_mileage(mileage_of(method()));
671
672 // Go through the bytecodes and allocate and initialize the
673 // corresponding data cells.
674 int data_size = 0;
675 int empty_bc_count = 0; // number of bytecodes lacking data
676 _data[0] = 0; // apparently not set below.
677 BytecodeStream stream(method);
678 Bytecodes::Code c;
679 while ((c = stream.next()) >= 0) {
680 int size_in_bytes = initialize_data(&stream, data_size);
681 data_size += size_in_bytes;
682 if (size_in_bytes == 0) empty_bc_count += 1;
683 }
684 _data_size = data_size;
685 int object_size = in_bytes(data_offset()) + data_size;
686
687 // Add some extra DataLayout cells (at least one) to track stray traps.
688 int extra_data_count = compute_extra_data_count(data_size, empty_bc_count);
689 int extra_size = extra_data_count * DataLayout::compute_size_in_bytes(0);
690
691 // Add a cell to record information about modified arguments.
692 // Set up _args_modified array after traps cells so that
693 // the code for traps cells works.
694 DataLayout *dp = data_layout_at(data_size + extra_size);
695
696 int arg_size = method->size_of_parameters();
697 dp->initialize(DataLayout::arg_info_data_tag, 0, arg_size+1);
698
699 object_size += extra_size + DataLayout::compute_size_in_bytes(arg_size+1);
700
701 // Set an initial hint. Don't use set_hint_di() because
702 // first_di() may be out of bounds if data_size is 0.
703 // In that situation, _hint_di is never used, but at
704 // least well-defined.
705 _hint_di = first_di();
706
707 post_initialize(&stream);
708
709 set_size(object_size);
710 }
711
712 void MethodData::init() {
713 _invocation_counter.init();
714 _backedge_counter.init();
715 _invocation_counter_start = 0;
716 _backedge_counter_start = 0;
717 _num_loops = 0;
718 _num_blocks = 0;
719 _highest_comp_level = 0;
720 _highest_osr_comp_level = 0;
721 _would_profile = true;
722
723 // Initialize flags and trap history.
724 _nof_decompiles = 0;
725 _nof_overflow_recompiles = 0;
726 _nof_overflow_traps = 0;
727 clear_escape_info();
728 assert(sizeof(_trap_hist) % sizeof(HeapWord) == 0, "align");
729 Copy::zero_to_words((HeapWord*) &_trap_hist,
730 sizeof(_trap_hist) / sizeof(HeapWord));
731 }
732
733 // Get a measure of how much mileage the method has on it.
734 int MethodData::mileage_of(Method* method) {
735 int mileage = 0;
736 if (TieredCompilation) {
737 mileage = MAX2(method->invocation_count(), method->backedge_count());
738 } else {
739 int iic = method->interpreter_invocation_count();
740 if (mileage < iic) mileage = iic;
741 MethodCounters* mcs = method->method_counters();
742 if (mcs != NULL) {
743 InvocationCounter* ic = mcs->invocation_counter();
744 InvocationCounter* bc = mcs->backedge_counter();
745 int icval = ic->count();
746 if (ic->carry()) icval += CompileThreshold;
747 if (mileage < icval) mileage = icval;
748 int bcval = bc->count();
749 if (bc->carry()) bcval += CompileThreshold;
750 if (mileage < bcval) mileage = bcval;
751 }
752 }
753 return mileage;
754 }
755
756 bool MethodData::is_mature() const {
757 return CompilationPolicy::policy()->is_mature(_method);
758 }
759
760 // Translate a bci to its corresponding data index (di).
761 address MethodData::bci_to_dp(int bci) {
762 ResourceMark rm;
763 ProfileData* data = data_before(bci);
764 ProfileData* prev = NULL;
765 for ( ; is_valid(data); data = next_data(data)) {
766 if (data->bci() >= bci) {
767 if (data->bci() == bci) set_hint_di(dp_to_di(data->dp()));
768 else if (prev != NULL) set_hint_di(dp_to_di(prev->dp()));
769 return data->dp();
770 }
771 prev = data;
772 }
773 return (address)limit_data_position();
774 }
775
776 // Translate a bci to its corresponding data, or NULL.
777 ProfileData* MethodData::bci_to_data(int bci) {
778 ProfileData* data = data_before(bci);
779 for ( ; is_valid(data); data = next_data(data)) {
780 if (data->bci() == bci) {
781 set_hint_di(dp_to_di(data->dp()));
782 return data;
783 } else if (data->bci() > bci) {
784 break;
785 }
786 }
787 return bci_to_extra_data(bci, false);
788 }
789
790 // Translate a bci to its corresponding extra data, or NULL.
791 ProfileData* MethodData::bci_to_extra_data(int bci, bool create_if_missing) {
792 DataLayout* dp = extra_data_base();
793 DataLayout* end = extra_data_limit();
794 DataLayout* avail = NULL;
795 for (; dp < end; dp = next_extra(dp)) {
796 // No need for "OrderAccess::load_acquire" ops,
797 // since the data structure is monotonic.
798 if (dp->tag() == DataLayout::no_tag) break;
799 if (dp->tag() == DataLayout::arg_info_data_tag) {
800 dp = end; // ArgInfoData is at the end of extra data section.
801 break;
802 }
803 if (dp->bci() == bci) {
804 assert(dp->tag() == DataLayout::bit_data_tag, "sane");
805 return new BitData(dp);
806 }
807 }
808 if (create_if_missing && dp < end) {
809 // Allocate this one. There is no mutual exclusion,
810 // so two threads could allocate different BCIs to the
811 // same data layout. This means these extra data
812 // records, like most other MDO contents, must not be
813 // trusted too much.
814 DataLayout temp;
815 temp.initialize(DataLayout::bit_data_tag, bci, 0);
816 dp->release_set_header(temp.header());
817 assert(dp->tag() == DataLayout::bit_data_tag, "sane");
818 //NO: assert(dp->bci() == bci, "no concurrent allocation");
819 return new BitData(dp);
820 }
821 return NULL;
822 }
823
824 ArgInfoData *MethodData::arg_info() {
825 DataLayout* dp = extra_data_base();
826 DataLayout* end = extra_data_limit();
827 for (; dp < end; dp = next_extra(dp)) {
828 if (dp->tag() == DataLayout::arg_info_data_tag)
829 return new ArgInfoData(dp);
830 }
831 return NULL;
832 }
833
834 // Printing
835
836 #ifndef PRODUCT
837
838 void MethodData::print_on(outputStream* st) const {
839 assert(is_methodData(), "should be method data");
840 st->print("method data for ");
841 method()->print_value_on(st);
842 st->cr();
843 print_data_on(st);
844 }
845
846 #endif //PRODUCT
847
848 void MethodData::print_value_on(outputStream* st) const {
849 assert(is_methodData(), "should be method data");
850 st->print("method data for ");
851 method()->print_value_on(st);
852 }
853
854 #ifndef PRODUCT
855 void MethodData::print_data_on(outputStream* st) const {
856 ResourceMark rm;
857 ProfileData* data = first_data();
858 for ( ; is_valid(data); data = next_data(data)) {
859 st->print("%d", dp_to_di(data->dp()));
860 st->fill_to(6);
861 data->print_data_on(st);
862 }
863 st->print_cr("--- Extra data:");
864 DataLayout* dp = extra_data_base();
865 DataLayout* end = extra_data_limit();
866 for (; dp < end; dp = next_extra(dp)) {
867 // No need for "OrderAccess::load_acquire" ops,
868 // since the data structure is monotonic.
869 if (dp->tag() == DataLayout::no_tag) continue;
870 if (dp->tag() == DataLayout::bit_data_tag) {
871 data = new BitData(dp);
872 } else {
873 assert(dp->tag() == DataLayout::arg_info_data_tag, "must be BitData or ArgInfo");
874 data = new ArgInfoData(dp);
875 dp = end; // ArgInfoData is at the end of extra data section.
876 }
877 st->print("%d", dp_to_di(data->dp()));
878 st->fill_to(6);
879 data->print_data_on(st);
880 }
881 }
882 #endif
883
884 #if INCLUDE_SERVICES
885 // Size Statistics
886 void MethodData::collect_statistics(KlassSizeStats *sz) const {
887 int n = sz->count(this);
888 sz->_method_data_bytes += n;
889 sz->_method_all_bytes += n;
890 sz->_rw_bytes += n;
891 }
892 #endif // INCLUDE_SERVICES
893
894 // Verification
895
896 void MethodData::verify_on(outputStream* st) {
897 guarantee(is_methodData(), "object must be method data");
898 // guarantee(m->is_perm(), "should be in permspace");
899 this->verify_data_on(st);
900 }
901
902 void MethodData::verify_data_on(outputStream* st) {
903 NEEDS_CLEANUP;
904 // not yet implemented.
905 }