1 /*
2 * Copyright (c) 1998, 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 */
24
25 #include "precompiled.hpp"
26 #include "ci/ciMethod.hpp"
27 #include "ci/ciMethodBlocks.hpp"
28 #include "ci/ciStreams.hpp"
29 #include "compiler/methodLiveness.hpp"
30 #include "interpreter/bytecode.hpp"
31 #include "interpreter/bytecodes.hpp"
32 #include "memory/allocation.inline.hpp"
33 #include "utilities/bitMap.inline.hpp"
34
35 // The MethodLiveness class performs a simple liveness analysis on a method
36 // in order to decide which locals are live (that is, will be used again) at
37 // a particular bytecode index (bci).
38 //
39 // The algorithm goes:
40 //
41 // 1. Break the method into a set of basic blocks. For each basic block we
42 // also keep track of its set of predecessors through normal control flow
43 // and predecessors through exceptional control flow.
44 //
45 // 2. For each basic block, compute two sets, gen (the set of values used before
46 // they are defined) and kill (the set of values defined before they are used)
47 // in the basic block. A basic block "needs" the locals in its gen set to
48 // perform its computation. A basic block "provides" values for the locals in
49 // its kill set, allowing a need from a successor to be ignored.
50 //
51 // 3. Liveness information (the set of locals which are needed) is pushed backwards through
52 // the program, from blocks to their predecessors. We compute and store liveness
53 // information for the normal/exceptional exit paths for each basic block. When
54 // this process reaches a fixed point, we are done.
55 //
56 // 4. When we are asked about the liveness at a particular bci with a basic block, we
57 // compute gen/kill sets which represent execution from that bci to the exit of
58 // its blocks. We then compose this range gen/kill information with the normal
59 // and exceptional exit information for the block to produce liveness information
60 // at that bci.
61 //
62 // The algorithm is approximate in many respects. Notably:
63 //
64 // 1. We do not do the analysis necessary to match jsr's with the appropriate ret.
65 // Instead we make the conservative assumption that any ret can return to any
66 // jsr return site.
67 // 2. Instead of computing the effects of exceptions at every instruction, we
68 // summarize the effects of all exceptional continuations from the block as
69 // a single set (_exception_exit), losing some information but simplifying the
70 // analysis.
71
72
73 //--------------------------------------------------------------------------
74 // The BitCounter class is used for counting the number of bits set in
75 // some BitMap. It is only used when collecting liveness statistics.
76
77 #ifndef PRODUCT
78
79 class BitCounter: public BitMapClosure {
80 private:
81 int _count;
82 public:
83 BitCounter() : _count(0) {}
84
85 // Callback when bit in map is set
86 virtual bool do_bit(size_t offset) {
87 _count++;
88 return true;
89 }
90
91 int count() {
92 return _count;
93 }
94 };
95
96
97 //--------------------------------------------------------------------------
98
99
100 // Counts
101 long MethodLiveness::_total_bytes = 0;
102 int MethodLiveness::_total_methods = 0;
103
104 long MethodLiveness::_total_blocks = 0;
105 int MethodLiveness::_max_method_blocks = 0;
106
107 long MethodLiveness::_total_edges = 0;
108 int MethodLiveness::_max_block_edges = 0;
109
110 long MethodLiveness::_total_exc_edges = 0;
111 int MethodLiveness::_max_block_exc_edges = 0;
112
113 long MethodLiveness::_total_method_locals = 0;
114 int MethodLiveness::_max_method_locals = 0;
115
116 long MethodLiveness::_total_locals_queried = 0;
117 long MethodLiveness::_total_live_locals_queried = 0;
118
119 long MethodLiveness::_total_visits = 0;
120
121 #endif
122
123 // Timers
124 elapsedTimer MethodLiveness::_time_build_graph;
125 elapsedTimer MethodLiveness::_time_gen_kill;
126 elapsedTimer MethodLiveness::_time_flow;
127 elapsedTimer MethodLiveness::_time_query;
128 elapsedTimer MethodLiveness::_time_total;
129
130 MethodLiveness::MethodLiveness(Arena* arena, ciMethod* method)
131 #ifdef COMPILER1
132 : _bci_block_start((uintptr_t*)arena->Amalloc((method->code_size() >> LogBitsPerByte) + 1), method->code_size())
133 #endif
134 {
135 _arena = arena;
136 _method = method;
137 _bit_map_size_bits = method->max_locals();
138 _bit_map_size_words = (_bit_map_size_bits / sizeof(unsigned int)) + 1;
139
140 #ifdef COMPILER1
141 _bci_block_start.clear();
142 #endif
143 }
144
145 void MethodLiveness::compute_liveness() {
146 #ifndef PRODUCT
147 if (TraceLivenessGen) {
148 tty->print_cr("################################################################");
149 tty->print("# Computing liveness information for ");
150 method()->print_short_name();
151 }
152
153 if (TimeLivenessAnalysis) _time_total.start();
154 #endif
155
156 {
157 TraceTime buildGraph(NULL, &_time_build_graph, TimeLivenessAnalysis);
158 init_basic_blocks();
159 }
160 {
161 TraceTime genKill(NULL, &_time_gen_kill, TimeLivenessAnalysis);
162 init_gen_kill();
163 }
164 {
165 TraceTime flow(NULL, &_time_flow, TimeLivenessAnalysis);
166 propagate_liveness();
167 }
168
169 #ifndef PRODUCT
170 if (TimeLivenessAnalysis) _time_total.stop();
171
172 if (TimeLivenessAnalysis) {
173 // Collect statistics
174 _total_bytes += method()->code_size();
175 _total_methods++;
176
177 int num_blocks = _block_count;
178 _total_blocks += num_blocks;
179 _max_method_blocks = MAX2(num_blocks,_max_method_blocks);
180
181 for (int i=0; i<num_blocks; i++) {
182 BasicBlock *block = _block_list[i];
183
184 int numEdges = block->_normal_predecessors->length();
185 int numExcEdges = block->_exception_predecessors->length();
186
187 _total_edges += numEdges;
188 _total_exc_edges += numExcEdges;
189 _max_block_edges = MAX2(numEdges,_max_block_edges);
190 _max_block_exc_edges = MAX2(numExcEdges,_max_block_exc_edges);
191 }
192
193 int numLocals = _bit_map_size_bits;
194 _total_method_locals += numLocals;
195 _max_method_locals = MAX2(numLocals,_max_method_locals);
196 }
197 #endif
198 }
199
200
201 void MethodLiveness::init_basic_blocks() {
202 bool bailout = false;
203
204 int method_len = method()->code_size();
205 ciMethodBlocks *mblocks = method()->get_method_blocks();
206
207 // Create an array to store the bci->BasicBlock mapping.
208 _block_map = new (arena()) GrowableArray<BasicBlock*>(arena(), method_len, method_len, NULL);
209
210 _block_count = mblocks->num_blocks();
211 _block_list = (BasicBlock **) arena()->Amalloc(sizeof(BasicBlock *) * _block_count);
212
213 // Used for patching up jsr/ret control flow.
214 GrowableArray<BasicBlock*>* jsr_exit_list = new GrowableArray<BasicBlock*>(5);
215 GrowableArray<BasicBlock*>* ret_list = new GrowableArray<BasicBlock*>(5);
216
217 // generate our block list from ciMethodBlocks
218 for (int blk = 0; blk < _block_count; blk++) {
219 ciBlock *cib = mblocks->block(blk);
220 int start_bci = cib->start_bci();
221 _block_list[blk] = new (arena()) BasicBlock(this, start_bci, cib->limit_bci());
222 _block_map->at_put(start_bci, _block_list[blk]);
223 #ifdef COMPILER1
224 // mark all bcis where a new basic block starts
225 _bci_block_start.set_bit(start_bci);
226 #endif // COMPILER1
227 }
228 // fill in the predecessors of blocks
229 ciBytecodeStream bytes(method());
230
231 for (int blk = 0; blk < _block_count; blk++) {
232 BasicBlock *current_block = _block_list[blk];
233 int bci = mblocks->block(blk)->control_bci();
234
235 if (bci == ciBlock::fall_through_bci) {
236 int limit = current_block->limit_bci();
237 if (limit < method_len) {
238 BasicBlock *next = _block_map->at(limit);
239 assert( next != NULL, "must be a block immediately following this one.");
240 next->add_normal_predecessor(current_block);
241 }
242 continue;
243 }
244 bytes.reset_to_bci(bci);
245 Bytecodes::Code code = bytes.next();
246 BasicBlock *dest;
247
248 // Now we need to interpret the instruction's effect
249 // on control flow.
250 assert (current_block != NULL, "we must have a current block");
251 switch (code) {
252 case Bytecodes::_ifeq:
253 case Bytecodes::_ifne:
254 case Bytecodes::_iflt:
255 case Bytecodes::_ifge:
256 case Bytecodes::_ifgt:
257 case Bytecodes::_ifle:
258 case Bytecodes::_if_icmpeq:
259 case Bytecodes::_if_icmpne:
260 case Bytecodes::_if_icmplt:
261 case Bytecodes::_if_icmpge:
262 case Bytecodes::_if_icmpgt:
263 case Bytecodes::_if_icmple:
264 case Bytecodes::_if_acmpeq:
265 case Bytecodes::_if_acmpne:
266 case Bytecodes::_ifnull:
267 case Bytecodes::_ifnonnull:
268 // Two way branch. Set predecessors at each destination.
269 dest = _block_map->at(bytes.next_bci());
270 assert(dest != NULL, "must be a block immediately following this one.");
271 dest->add_normal_predecessor(current_block);
272
273 dest = _block_map->at(bytes.get_dest());
274 assert(dest != NULL, "branch desination must start a block.");
275 dest->add_normal_predecessor(current_block);
276 break;
277 case Bytecodes::_goto:
278 dest = _block_map->at(bytes.get_dest());
279 assert(dest != NULL, "branch desination must start a block.");
280 dest->add_normal_predecessor(current_block);
281 break;
282 case Bytecodes::_goto_w:
283 dest = _block_map->at(bytes.get_far_dest());
284 assert(dest != NULL, "branch desination must start a block.");
285 dest->add_normal_predecessor(current_block);
286 break;
287 case Bytecodes::_tableswitch:
288 {
289 Bytecode_tableswitch tableswitch(&bytes);
290
291 int len = tableswitch.length();
292
293 dest = _block_map->at(bci + tableswitch.default_offset());
294 assert(dest != NULL, "branch desination must start a block.");
295 dest->add_normal_predecessor(current_block);
296 while (--len >= 0) {
297 dest = _block_map->at(bci + tableswitch.dest_offset_at(len));
298 assert(dest != NULL, "branch desination must start a block.");
299 dest->add_normal_predecessor(current_block);
300 }
301 break;
302 }
303
304 case Bytecodes::_lookupswitch:
305 {
306 Bytecode_lookupswitch lookupswitch(&bytes);
307
308 int npairs = lookupswitch.number_of_pairs();
309
310 dest = _block_map->at(bci + lookupswitch.default_offset());
311 assert(dest != NULL, "branch desination must start a block.");
312 dest->add_normal_predecessor(current_block);
313 while(--npairs >= 0) {
314 LookupswitchPair pair = lookupswitch.pair_at(npairs);
315 dest = _block_map->at( bci + pair.offset());
316 assert(dest != NULL, "branch desination must start a block.");
317 dest->add_normal_predecessor(current_block);
318 }
319 break;
320 }
321
322 case Bytecodes::_jsr:
323 {
324 assert(bytes.is_wide()==false, "sanity check");
325 dest = _block_map->at(bytes.get_dest());
326 assert(dest != NULL, "branch desination must start a block.");
327 dest->add_normal_predecessor(current_block);
328 BasicBlock *jsrExit = _block_map->at(current_block->limit_bci());
329 assert(jsrExit != NULL, "jsr return bci must start a block.");
330 jsr_exit_list->append(jsrExit);
331 break;
332 }
333 case Bytecodes::_jsr_w:
334 {
335 dest = _block_map->at(bytes.get_far_dest());
336 assert(dest != NULL, "branch desination must start a block.");
337 dest->add_normal_predecessor(current_block);
338 BasicBlock *jsrExit = _block_map->at(current_block->limit_bci());
339 assert(jsrExit != NULL, "jsr return bci must start a block.");
340 jsr_exit_list->append(jsrExit);
341 break;
342 }
343
344 case Bytecodes::_wide:
345 assert(false, "wide opcodes should not be seen here");
346 break;
347 case Bytecodes::_athrow:
348 case Bytecodes::_ireturn:
349 case Bytecodes::_lreturn:
350 case Bytecodes::_freturn:
351 case Bytecodes::_dreturn:
352 case Bytecodes::_areturn:
353 case Bytecodes::_vreturn:
354 case Bytecodes::_return:
355 // These opcodes are not the normal predecessors of any other opcodes.
356 break;
357 case Bytecodes::_ret:
358 // We will patch up jsr/rets in a subsequent pass.
359 ret_list->append(current_block);
360 break;
361 case Bytecodes::_breakpoint:
362 // Bail out of there are breakpoints in here.
363 bailout = true;
364 break;
365 default:
366 // Do nothing.
367 break;
368 }
369 }
370 // Patch up the jsr/ret's. We conservatively assume that any ret
371 // can return to any jsr site.
372 int ret_list_len = ret_list->length();
373 int jsr_exit_list_len = jsr_exit_list->length();
374 if (ret_list_len > 0 && jsr_exit_list_len > 0) {
375 for (int i = jsr_exit_list_len - 1; i >= 0; i--) {
376 BasicBlock *jsrExit = jsr_exit_list->at(i);
377 for (int i = ret_list_len - 1; i >= 0; i--) {
378 jsrExit->add_normal_predecessor(ret_list->at(i));
379 }
380 }
381 }
382
383 // Compute exception edges.
384 for (int b=_block_count-1; b >= 0; b--) {
385 BasicBlock *block = _block_list[b];
386 int block_start = block->start_bci();
387 int block_limit = block->limit_bci();
388 ciExceptionHandlerStream handlers(method());
389 for (; !handlers.is_done(); handlers.next()) {
390 ciExceptionHandler* handler = handlers.handler();
391 int start = handler->start();
392 int limit = handler->limit();
393 int handler_bci = handler->handler_bci();
394
395 int intersect_start = MAX2(block_start, start);
396 int intersect_limit = MIN2(block_limit, limit);
397 if (intersect_start < intersect_limit) {
398 // The catch range has a nonempty intersection with this
399 // basic block. That means this basic block can be an
400 // exceptional predecessor.
401 _block_map->at(handler_bci)->add_exception_predecessor(block);
402
403 if (handler->is_catch_all()) {
404 // This is a catch-all block.
405 if (intersect_start == block_start && intersect_limit == block_limit) {
406 // The basic block is entirely contained in this catch-all block.
407 // Skip the rest of the exception handlers -- they can never be
408 // reached in execution.
409 break;
410 }
411 }
412 }
413 }
414 }
415 }
416
417 void MethodLiveness::init_gen_kill() {
418 for (int i=_block_count-1; i >= 0; i--) {
419 _block_list[i]->compute_gen_kill(method());
420 }
421 }
422
423 void MethodLiveness::propagate_liveness() {
424 int num_blocks = _block_count;
425 BasicBlock *block;
426
427 // We start our work list off with all blocks in it.
428 // Alternately, we could start off the work list with the list of all
429 // blocks which could exit the method directly, along with one block
430 // from any infinite loop. If this matters, it can be changed. It
431 // may not be clear from looking at the code, but the order of the
432 // workList will be the opposite of the creation order of the basic
433 // blocks, which should be decent for quick convergence (with the
434 // possible exception of exception handlers, which are all created
435 // early).
436 _work_list = NULL;
437 for (int i = 0; i < num_blocks; i++) {
438 block = _block_list[i];
439 block->set_next(_work_list);
440 block->set_on_work_list(true);
441 _work_list = block;
442 }
443
444
445 while ((block = work_list_get()) != NULL) {
446 block->propagate(this);
447 NOT_PRODUCT(_total_visits++;)
448 }
449 }
450
451 void MethodLiveness::work_list_add(BasicBlock *block) {
452 if (!block->on_work_list()) {
453 block->set_next(_work_list);
454 block->set_on_work_list(true);
455 _work_list = block;
456 }
457 }
458
459 MethodLiveness::BasicBlock *MethodLiveness::work_list_get() {
460 BasicBlock *block = _work_list;
461 if (block != NULL) {
462 block->set_on_work_list(false);
463 _work_list = block->next();
464 }
465 return block;
466 }
467
468
469 MethodLivenessResult MethodLiveness::get_liveness_at(int entry_bci) {
470 int bci = entry_bci;
471 bool is_entry = false;
472 if (entry_bci == InvocationEntryBci) {
473 is_entry = true;
474 bci = 0;
475 }
476
477 MethodLivenessResult answer((BitMap::bm_word_t*)NULL,0);
478
479 if (_block_count > 0) {
480 if (TimeLivenessAnalysis) _time_total.start();
481 if (TimeLivenessAnalysis) _time_query.start();
482
483 assert( 0 <= bci && bci < method()->code_size(), "bci out of range" );
484 BasicBlock *block = _block_map->at(bci);
485 // We may not be at the block start, so search backwards to find the block
486 // containing bci.
487 int t = bci;
488 while (block == NULL && t > 0) {
489 block = _block_map->at(--t);
490 }
491 assert( block != NULL, "invalid bytecode index; must be instruction index" );
492 assert(bci >= block->start_bci() && bci < block->limit_bci(), "block must contain bci.");
493
494 answer = block->get_liveness_at(method(), bci);
495
496 if (is_entry && method()->is_synchronized() && !method()->is_static()) {
497 // Synchronized methods use the receiver once on entry.
498 answer.at_put(0, true);
499 }
500
501 #ifndef PRODUCT
502 if (TraceLivenessQuery) {
503 tty->print("Liveness query of ");
504 method()->print_short_name();
505 tty->print(" @ %d : result is ", bci);
506 answer.print_on(tty);
507 }
508
509 if (TimeLivenessAnalysis) _time_query.stop();
510 if (TimeLivenessAnalysis) _time_total.stop();
511 #endif
512 }
513
514 #ifndef PRODUCT
515 if (TimeLivenessAnalysis) {
516 // Collect statistics.
517 _total_locals_queried += _bit_map_size_bits;
518 BitCounter counter;
519 answer.iterate(&counter);
520 _total_live_locals_queried += counter.count();
521 }
522 #endif
523
524 return answer;
525 }
526
527
528 #ifndef PRODUCT
529
530 void MethodLiveness::print_times() {
531 tty->print_cr ("Accumulated liveness analysis times/statistics:");
532 tty->print_cr ("-----------------------------------------------");
533 tty->print_cr (" Total : %3.3f sec.", _time_total.seconds());
534 tty->print_cr (" Build graph : %3.3f sec. (%2.2f%%)", _time_build_graph.seconds(),
535 _time_build_graph.seconds() * 100 / _time_total.seconds());
536 tty->print_cr (" Gen / Kill : %3.3f sec. (%2.2f%%)", _time_gen_kill.seconds(),
537 _time_gen_kill.seconds() * 100 / _time_total.seconds());
538 tty->print_cr (" Dataflow : %3.3f sec. (%2.2f%%)", _time_flow.seconds(),
539 _time_flow.seconds() * 100 / _time_total.seconds());
540 tty->print_cr (" Query : %3.3f sec. (%2.2f%%)", _time_query.seconds(),
541 _time_query.seconds() * 100 / _time_total.seconds());
542 tty->print_cr (" #bytes : %8ld (%3.0f bytes per sec)",
543 _total_bytes,
544 _total_bytes / _time_total.seconds());
545 tty->print_cr (" #methods : %8d (%3.0f methods per sec)",
546 _total_methods,
547 _total_methods / _time_total.seconds());
548 tty->print_cr (" avg locals : %3.3f max locals : %3d",
549 (float)_total_method_locals / _total_methods,
550 _max_method_locals);
551 tty->print_cr (" avg blocks : %3.3f max blocks : %3d",
552 (float)_total_blocks / _total_methods,
553 _max_method_blocks);
554 tty->print_cr (" avg bytes : %3.3f",
555 (float)_total_bytes / _total_methods);
556 tty->print_cr (" #blocks : %8ld",
557 _total_blocks);
558 tty->print_cr (" avg normal predecessors : %3.3f max normal predecessors : %3d",
559 (float)_total_edges / _total_blocks,
560 _max_block_edges);
561 tty->print_cr (" avg exception predecessors : %3.3f max exception predecessors : %3d",
562 (float)_total_exc_edges / _total_blocks,
563 _max_block_exc_edges);
564 tty->print_cr (" avg visits : %3.3f",
565 (float)_total_visits / _total_blocks);
566 tty->print_cr (" #locals queried : %8ld #live : %8ld %%live : %2.2f%%",
567 _total_locals_queried,
568 _total_live_locals_queried,
569 100.0 * _total_live_locals_queried / _total_locals_queried);
570 }
571
572 #endif
573
574
575 MethodLiveness::BasicBlock::BasicBlock(MethodLiveness *analyzer, int start, int limit) :
576 _gen((uintptr_t*)analyzer->arena()->Amalloc(BytesPerWord * analyzer->bit_map_size_words()),
577 analyzer->bit_map_size_bits()),
578 _kill((uintptr_t*)analyzer->arena()->Amalloc(BytesPerWord * analyzer->bit_map_size_words()),
579 analyzer->bit_map_size_bits()),
580 _entry((uintptr_t*)analyzer->arena()->Amalloc(BytesPerWord * analyzer->bit_map_size_words()),
581 analyzer->bit_map_size_bits()),
582 _normal_exit((uintptr_t*)analyzer->arena()->Amalloc(BytesPerWord * analyzer->bit_map_size_words()),
583 analyzer->bit_map_size_bits()),
584 _exception_exit((uintptr_t*)analyzer->arena()->Amalloc(BytesPerWord * analyzer->bit_map_size_words()),
585 analyzer->bit_map_size_bits()),
586 _last_bci(-1) {
587 _analyzer = analyzer;
588 _start_bci = start;
589 _limit_bci = limit;
590 _normal_predecessors =
591 new (analyzer->arena()) GrowableArray<MethodLiveness::BasicBlock*>(analyzer->arena(), 5, 0, NULL);
592 _exception_predecessors =
593 new (analyzer->arena()) GrowableArray<MethodLiveness::BasicBlock*>(analyzer->arena(), 5, 0, NULL);
594 _normal_exit.clear();
595 _exception_exit.clear();
596 _entry.clear();
597
598 // this initialization is not strictly necessary.
599 // _gen and _kill are cleared at the beginning of compute_gen_kill_range()
600 _gen.clear();
601 _kill.clear();
602 }
603
604
605
606 MethodLiveness::BasicBlock *MethodLiveness::BasicBlock::split(int split_bci) {
607 int start = _start_bci;
608 int limit = _limit_bci;
609
610 if (TraceLivenessGen) {
611 tty->print_cr(" ** Splitting block (%d,%d) at %d", start, limit, split_bci);
612 }
613
614 GrowableArray<BasicBlock*>* save_predecessors = _normal_predecessors;
615
616 assert (start < split_bci && split_bci < limit, "improper split");
617
618 // Make a new block to cover the first half of the range.
619 BasicBlock *first_half = new (_analyzer->arena()) BasicBlock(_analyzer, start, split_bci);
620
621 // Assign correct values to the second half (this)
622 _normal_predecessors = first_half->_normal_predecessors;
623 _start_bci = split_bci;
624 add_normal_predecessor(first_half);
625
626 // Assign correct predecessors to the new first half
627 first_half->_normal_predecessors = save_predecessors;
628
629 return first_half;
630 }
631
632 void MethodLiveness::BasicBlock::compute_gen_kill(ciMethod* method) {
633 ciBytecodeStream bytes(method);
634 bytes.reset_to_bci(start_bci());
635 bytes.set_max_bci(limit_bci());
636 compute_gen_kill_range(&bytes);
637
638 }
639
640 void MethodLiveness::BasicBlock::compute_gen_kill_range(ciBytecodeStream *bytes) {
641 _gen.clear();
642 _kill.clear();
643
644 while (bytes->next() != ciBytecodeStream::EOBC()) {
645 compute_gen_kill_single(bytes);
646 }
647 }
648
649 void MethodLiveness::BasicBlock::compute_gen_kill_single(ciBytecodeStream *instruction) {
650 int localNum;
651
652 // We prohibit _gen and _kill from having locals in common. If we
653 // know that one is definitely going to be applied before the other,
654 // we could save some computation time by relaxing this prohibition.
655
656 switch (instruction->cur_bc()) {
657 case Bytecodes::_nop:
658 case Bytecodes::_goto:
659 case Bytecodes::_goto_w:
660 case Bytecodes::_aconst_null:
661 case Bytecodes::_new:
662 case Bytecodes::_vnew:
663 case Bytecodes::_iconst_m1:
664 case Bytecodes::_iconst_0:
665 case Bytecodes::_iconst_1:
666 case Bytecodes::_iconst_2:
667 case Bytecodes::_iconst_3:
668 case Bytecodes::_iconst_4:
669 case Bytecodes::_iconst_5:
670 case Bytecodes::_fconst_0:
671 case Bytecodes::_fconst_1:
672 case Bytecodes::_fconst_2:
673 case Bytecodes::_bipush:
674 case Bytecodes::_sipush:
675 case Bytecodes::_lconst_0:
676 case Bytecodes::_lconst_1:
677 case Bytecodes::_dconst_0:
678 case Bytecodes::_dconst_1:
679 case Bytecodes::_ldc2_w:
680 case Bytecodes::_ldc:
681 case Bytecodes::_ldc_w:
682 case Bytecodes::_iaload:
683 case Bytecodes::_faload:
684 case Bytecodes::_baload:
685 case Bytecodes::_caload:
686 case Bytecodes::_saload:
687 case Bytecodes::_laload:
688 case Bytecodes::_daload:
689 case Bytecodes::_vaload:
690 case Bytecodes::_aaload:
691 case Bytecodes::_iastore:
692 case Bytecodes::_fastore:
693 case Bytecodes::_bastore:
694 case Bytecodes::_castore:
695 case Bytecodes::_sastore:
696 case Bytecodes::_lastore:
697 case Bytecodes::_dastore:
698 case Bytecodes::_vastore:
699 case Bytecodes::_aastore:
700 case Bytecodes::_pop:
701 case Bytecodes::_pop2:
702 case Bytecodes::_dup:
703 case Bytecodes::_dup_x1:
704 case Bytecodes::_dup_x2:
705 case Bytecodes::_dup2:
706 case Bytecodes::_dup2_x1:
707 case Bytecodes::_dup2_x2:
708 case Bytecodes::_swap:
709 case Bytecodes::_iadd:
710 case Bytecodes::_fadd:
711 case Bytecodes::_isub:
712 case Bytecodes::_fsub:
713 case Bytecodes::_imul:
714 case Bytecodes::_fmul:
715 case Bytecodes::_idiv:
716 case Bytecodes::_fdiv:
717 case Bytecodes::_irem:
718 case Bytecodes::_frem:
719 case Bytecodes::_ishl:
720 case Bytecodes::_ishr:
721 case Bytecodes::_iushr:
722 case Bytecodes::_iand:
723 case Bytecodes::_ior:
724 case Bytecodes::_ixor:
725 case Bytecodes::_l2f:
726 case Bytecodes::_l2i:
727 case Bytecodes::_d2f:
728 case Bytecodes::_d2i:
729 case Bytecodes::_fcmpl:
730 case Bytecodes::_fcmpg:
731 case Bytecodes::_ladd:
732 case Bytecodes::_dadd:
733 case Bytecodes::_lsub:
734 case Bytecodes::_dsub:
735 case Bytecodes::_lmul:
736 case Bytecodes::_dmul:
737 case Bytecodes::_ldiv:
738 case Bytecodes::_ddiv:
739 case Bytecodes::_lrem:
740 case Bytecodes::_drem:
741 case Bytecodes::_land:
742 case Bytecodes::_lor:
743 case Bytecodes::_lxor:
744 case Bytecodes::_ineg:
745 case Bytecodes::_fneg:
746 case Bytecodes::_i2f:
747 case Bytecodes::_f2i:
748 case Bytecodes::_i2c:
749 case Bytecodes::_i2s:
750 case Bytecodes::_i2b:
751 case Bytecodes::_lneg:
752 case Bytecodes::_dneg:
753 case Bytecodes::_l2d:
754 case Bytecodes::_d2l:
755 case Bytecodes::_lshl:
756 case Bytecodes::_lshr:
757 case Bytecodes::_lushr:
758 case Bytecodes::_i2l:
759 case Bytecodes::_i2d:
760 case Bytecodes::_f2l:
761 case Bytecodes::_f2d:
762 case Bytecodes::_lcmp:
763 case Bytecodes::_dcmpl:
764 case Bytecodes::_dcmpg:
765 case Bytecodes::_ifeq:
766 case Bytecodes::_ifne:
767 case Bytecodes::_iflt:
768 case Bytecodes::_ifge:
769 case Bytecodes::_ifgt:
770 case Bytecodes::_ifle:
771 case Bytecodes::_tableswitch:
772 case Bytecodes::_ireturn:
773 case Bytecodes::_freturn:
774 case Bytecodes::_if_icmpeq:
775 case Bytecodes::_if_icmpne:
776 case Bytecodes::_if_icmplt:
777 case Bytecodes::_if_icmpge:
778 case Bytecodes::_if_icmpgt:
779 case Bytecodes::_if_icmple:
780 case Bytecodes::_lreturn:
781 case Bytecodes::_dreturn:
782 case Bytecodes::_if_acmpeq:
783 case Bytecodes::_if_acmpne:
784 case Bytecodes::_jsr:
785 case Bytecodes::_jsr_w:
786 case Bytecodes::_getstatic:
787 case Bytecodes::_putstatic:
788 case Bytecodes::_getfield:
789 case Bytecodes::_vgetfield:
790 case Bytecodes::_putfield:
791 case Bytecodes::_invokevirtual:
792 case Bytecodes::_invokedirect:
793 case Bytecodes::_invokespecial:
794 case Bytecodes::_invokestatic:
795 case Bytecodes::_invokeinterface:
796 case Bytecodes::_invokedynamic:
797 case Bytecodes::_newarray:
798 case Bytecodes::_anewarray:
799 case Bytecodes::_checkcast:
800 case Bytecodes::_arraylength:
801 case Bytecodes::_instanceof:
802 case Bytecodes::_athrow:
803 case Bytecodes::_areturn:
804 case Bytecodes::_vreturn:
805 case Bytecodes::_monitorenter:
806 case Bytecodes::_monitorexit:
807 case Bytecodes::_ifnull:
808 case Bytecodes::_ifnonnull:
809 case Bytecodes::_multianewarray:
810 case Bytecodes::_lookupswitch:
811 case Bytecodes::_vbox:
812 case Bytecodes::_vunbox:
813 // These bytecodes have no effect on the method's locals.
814 break;
815
816 case Bytecodes::_return:
817 if (instruction->method()->intrinsic_id() == vmIntrinsics::_Object_init) {
818 // return from Object.init implicitly registers a finalizer
819 // for the receiver if needed, so keep it alive.
820 load_one(0);
821 }
822 break;
823
824
825 case Bytecodes::_lload:
826 case Bytecodes::_dload:
827 load_two(instruction->get_index());
828 break;
829
830 case Bytecodes::_lload_0:
831 case Bytecodes::_dload_0:
832 load_two(0);
833 break;
834
835 case Bytecodes::_lload_1:
836 case Bytecodes::_dload_1:
837 load_two(1);
838 break;
839
840 case Bytecodes::_lload_2:
841 case Bytecodes::_dload_2:
842 load_two(2);
843 break;
844
845 case Bytecodes::_lload_3:
846 case Bytecodes::_dload_3:
847 load_two(3);
848 break;
849
850 case Bytecodes::_iload:
851 case Bytecodes::_iinc:
852 case Bytecodes::_fload:
853 case Bytecodes::_aload:
854 case Bytecodes::_vload:
855 case Bytecodes::_ret:
856 load_one(instruction->get_index());
857 break;
858
859 case Bytecodes::_iload_0:
860 case Bytecodes::_fload_0:
861 case Bytecodes::_aload_0:
862 load_one(0);
863 break;
864
865 case Bytecodes::_iload_1:
866 case Bytecodes::_fload_1:
867 case Bytecodes::_aload_1:
868 load_one(1);
869 break;
870
871 case Bytecodes::_iload_2:
872 case Bytecodes::_fload_2:
873 case Bytecodes::_aload_2:
874 load_one(2);
875 break;
876
877 case Bytecodes::_iload_3:
878 case Bytecodes::_fload_3:
879 case Bytecodes::_aload_3:
880 load_one(3);
881 break;
882
883 case Bytecodes::_lstore:
884 case Bytecodes::_dstore:
885 store_two(localNum = instruction->get_index());
886 break;
887
888 case Bytecodes::_lstore_0:
889 case Bytecodes::_dstore_0:
890 store_two(0);
891 break;
892
893 case Bytecodes::_lstore_1:
894 case Bytecodes::_dstore_1:
895 store_two(1);
896 break;
897
898 case Bytecodes::_lstore_2:
899 case Bytecodes::_dstore_2:
900 store_two(2);
901 break;
902
903 case Bytecodes::_lstore_3:
904 case Bytecodes::_dstore_3:
905 store_two(3);
906 break;
907
908 case Bytecodes::_istore:
909 case Bytecodes::_fstore:
910 case Bytecodes::_astore:
911 case Bytecodes::_vstore:
912 store_one(instruction->get_index());
913 break;
914
915 case Bytecodes::_istore_0:
916 case Bytecodes::_fstore_0:
917 case Bytecodes::_astore_0:
918 store_one(0);
919 break;
920
921 case Bytecodes::_istore_1:
922 case Bytecodes::_fstore_1:
923 case Bytecodes::_astore_1:
924 store_one(1);
925 break;
926
927 case Bytecodes::_istore_2:
928 case Bytecodes::_fstore_2:
929 case Bytecodes::_astore_2:
930 store_one(2);
931 break;
932
933 case Bytecodes::_istore_3:
934 case Bytecodes::_fstore_3:
935 case Bytecodes::_astore_3:
936 store_one(3);
937 break;
938
939 case Bytecodes::_wide:
940 fatal("Iterator should skip this bytecode");
941 break;
942
943 default:
944 tty->print("unexpected opcode: %d\n", instruction->cur_bc());
945 ShouldNotReachHere();
946 break;
947 }
948 }
949
950 void MethodLiveness::BasicBlock::load_two(int local) {
951 load_one(local);
952 load_one(local+1);
953 }
954
955 void MethodLiveness::BasicBlock::load_one(int local) {
956 if (!_kill.at(local)) {
957 _gen.at_put(local, true);
958 }
959 }
960
961 void MethodLiveness::BasicBlock::store_two(int local) {
962 store_one(local);
963 store_one(local+1);
964 }
965
966 void MethodLiveness::BasicBlock::store_one(int local) {
967 if (!_gen.at(local)) {
968 _kill.at_put(local, true);
969 }
970 }
971
972 void MethodLiveness::BasicBlock::propagate(MethodLiveness *ml) {
973 // These set operations could be combined for efficiency if the
974 // performance of this analysis becomes an issue.
975 _entry.set_union(_normal_exit);
976 _entry.set_difference(_kill);
977 _entry.set_union(_gen);
978
979 // Note that we merge information from our exceptional successors
980 // just once, rather than at individual bytecodes.
981 _entry.set_union(_exception_exit);
982
983 if (TraceLivenessGen) {
984 tty->print_cr(" ** Visiting block at %d **", start_bci());
985 print_on(tty);
986 }
987
988 int i;
989 for (i=_normal_predecessors->length()-1; i>=0; i--) {
990 BasicBlock *block = _normal_predecessors->at(i);
991 if (block->merge_normal(_entry)) {
992 ml->work_list_add(block);
993 }
994 }
995 for (i=_exception_predecessors->length()-1; i>=0; i--) {
996 BasicBlock *block = _exception_predecessors->at(i);
997 if (block->merge_exception(_entry)) {
998 ml->work_list_add(block);
999 }
1000 }
1001 }
1002
1003 bool MethodLiveness::BasicBlock::merge_normal(BitMap other) {
1004 return _normal_exit.set_union_with_result(other);
1005 }
1006
1007 bool MethodLiveness::BasicBlock::merge_exception(BitMap other) {
1008 return _exception_exit.set_union_with_result(other);
1009 }
1010
1011 MethodLivenessResult MethodLiveness::BasicBlock::get_liveness_at(ciMethod* method, int bci) {
1012 MethodLivenessResult answer(NEW_RESOURCE_ARRAY(BitMap::bm_word_t, _analyzer->bit_map_size_words()),
1013 _analyzer->bit_map_size_bits());
1014 answer.set_is_valid();
1015
1016 #ifndef ASSERT
1017 if (bci == start_bci()) {
1018 answer.set_from(_entry);
1019 return answer;
1020 }
1021 #endif
1022
1023 #ifdef ASSERT
1024 ResourceMark rm;
1025 BitMap g(_gen.size()); g.set_from(_gen);
1026 BitMap k(_kill.size()); k.set_from(_kill);
1027 #endif
1028 if (_last_bci != bci || trueInDebug) {
1029 ciBytecodeStream bytes(method);
1030 bytes.reset_to_bci(bci);
1031 bytes.set_max_bci(limit_bci());
1032 compute_gen_kill_range(&bytes);
1033 assert(_last_bci != bci ||
1034 (g.is_same(_gen) && k.is_same(_kill)), "cached computation is incorrect");
1035 _last_bci = bci;
1036 }
1037
1038 answer.clear();
1039 answer.set_union(_normal_exit);
1040 answer.set_difference(_kill);
1041 answer.set_union(_gen);
1042 answer.set_union(_exception_exit);
1043
1044 #ifdef ASSERT
1045 if (bci == start_bci()) {
1046 assert(answer.is_same(_entry), "optimized answer must be accurate");
1047 }
1048 #endif
1049
1050 return answer;
1051 }
1052
1053 #ifndef PRODUCT
1054
1055 void MethodLiveness::BasicBlock::print_on(outputStream *os) const {
1056 os->print_cr("===================================================================");
1057 os->print_cr(" Block start: %4d, limit: %4d", _start_bci, _limit_bci);
1058 os->print (" Normal predecessors (%2d) @", _normal_predecessors->length());
1059 int i;
1060 for (i=0; i < _normal_predecessors->length(); i++) {
1061 os->print(" %4d", _normal_predecessors->at(i)->start_bci());
1062 }
1063 os->cr();
1064 os->print (" Exceptional predecessors (%2d) @", _exception_predecessors->length());
1065 for (i=0; i < _exception_predecessors->length(); i++) {
1066 os->print(" %4d", _exception_predecessors->at(i)->start_bci());
1067 }
1068 os->cr();
1069 os->print (" Normal Exit : ");
1070 _normal_exit.print_on(os);
1071 os->print (" Gen : ");
1072 _gen.print_on(os);
1073 os->print (" Kill : ");
1074 _kill.print_on(os);
1075 os->print (" Exception Exit: ");
1076 _exception_exit.print_on(os);
1077 os->print (" Entry : ");
1078 _entry.print_on(os);
1079 }
1080
1081 #endif // PRODUCT