Lines Matching refs:block_id

272     return (*a)->to()->block_id() - (*b)->to()->block_id();
274 return (*a)->from()->block_id() - (*b)->from()->block_id();
310 from->block_id(), to->block_id(), split->block_id());
418 int _max_block_id; // the highest block_id of a block
437 bool is_visited(BlockBegin* b) const { return _visited_blocks.at(b->block_id()); }
438 bool is_active(BlockBegin* b) const { return _active_blocks.at(b->block_id()); }
439 void set_visited(BlockBegin* b) { assert(!is_visited(b), "already set"); _visited_blocks.set_bit(b->block_id()); }
440 void set_active(BlockBegin* b) { assert(!is_active(b), "already set"); _active_blocks.set_bit(b->block_id()); }
441 void clear_active(BlockBegin* b) { assert(is_active(b), "not already"); _active_blocks.clear_bit(b->block_id()); }
444 void inc_forward_branches(BlockBegin* b) { _forward_branches.at_put(b->block_id(), _forward_branches.at(b->block_id()) + 1); }
445 int dec_forward_branches(BlockBegin* b) { _forward_branches.at_put(b->block_id(), _forward_branches.at(b->block_id()) - 1); return _forward_branches.at(b->block_id()); }
448 bool is_block_in_loop (int loop_idx, BlockBegin* b) const { return _loop_map.at(loop_idx, b->block_id()); }
449 void set_block_in_loop (int loop_idx, BlockBegin* b) { _loop_map.set_bit(loop_idx, b->block_id()); }
450 void clear_block_in_loop(int loop_idx, int block_id) { _loop_map.clear_bit(loop_idx, block_id); }
536 TRACE_LINEAR_SCAN(3, tty->print_cr("Enter count_edges for block B%d coming from B%d", cur->block_id(), parent != NULL ? parent->block_id() : -1));
594 TRACE_LINEAR_SCAN(3, tty->print_cr("Block B%d is loop header of loop %d", cur->block_id(), _num_loops));
600 TRACE_LINEAR_SCAN(3, tty->print_cr("Finished count_edges for block B%d", cur->block_id()));
615 TRACE_LINEAR_SCAN(3, tty->print_cr("Processing loop from B%d to B%d (loop %d):", loop_start->block_id(), loop_end->block_id(), loop_idx));
628 TRACE_LINEAR_SCAN(3, tty->print_cr(" processing B%d", cur->block_id()));
638 TRACE_LINEAR_SCAN(3, tty->print_cr(" pushing B%d", pred->block_id()));
659 for (int block_id = _max_block_id - 1; block_id >= 0; block_id--) {
660 clear_block_in_loop(i, block_id);
679 TRACE_LINEAR_SCAN(4, tty->print_cr("Computing loop depth for block B%d", cur->block_id()));
712 _dominator_blocks.set_bit(a->block_id());
716 while (b != NULL && !_dominator_blocks.at(b->block_id())) {
727 TRACE_LINEAR_SCAN(4, tty->print_cr("DOM: initializing dominator of B%d to B%d", cur->block_id(), parent->block_id()));
731 TRACE_LINEAR_SCAN(4, tty->print_cr("DOM: computing dominator of B%d: common dominator of B%d and B%d is B%d", cur->block_id(), parent->block_id(), cur->dominator()->block_id(), common_dominator(cur->dominator(), parent)->block_id()));
819 TRACE_LINEAR_SCAN(3, tty->print_cr("Sorted B%d into worklist. new worklist:", cur->block_id()));
820 TRACE_LINEAR_SCAN(3, for (int i = 0; i < _work_list.length(); i++) tty->print_cr("%8d B%2d weight:%6x", i, _work_list.at(i)->block_id(), _work_list.at(i)->linear_scan_number()));
831 TRACE_LINEAR_SCAN(3, tty->print_cr("appending block B%d (weight 0x%6x) to linear-scan order", cur->block_id(), cur->linear_scan_number()));
926 TRACE_LINEAR_SCAN(4, tty->print_cr("DOM: updating dominator of B%d from B%d to B%d", block->block_id(), block->dominator()->block_id(), dominator->block_id()));
959 tty->print("%4d: B%2d: ", cur->linear_scan_number(), cur->block_id());
971 tty->print("%4d: B%2d loop: %2d depth: %2d", cur->linear_scan_number(), cur->block_id(), cur->loop_index(), cur->loop_depth());
979 tty->print(" dom: B%d ", cur->dominator()->block_id());
988 tty->print("B%d ", pred->block_id());
995 tty->print("B%d ", sux->block_id());
1002 tty->print("B%d ", ex->block_id());
1176 return (*a)->block_id() - (*b)->block_id();
1196 BlockList* preds = _predecessors->at(block->block_id());
1229 BlockList* preds = _predecessors->at_grow(sux->block_id(), NULL);
1232 _predecessors->at_put(sux->block_id(), preds);
1242 BlockList* preds = _predecessors->at_grow(sux->block_id(), NULL);
1245 _predecessors->at_put(sux->block_id(), preds);