Cross Reference: /openjdk7/hotspot/src/share/vm/c1/c1

Lines Matching refs:at
302       BlockPair* pair = blocks.at(i);
329     // Local instructions and Phis for expression stack values at the
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()); }
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()); }
611     BlockBegin* loop_end   = _loop_end_blocks.at(i);
713     assert(a->dominator() != NULL || a == _linear_scan_order->at(0), "dominator must be initialized");
716   while (b != NULL && !_dominator_blocks.at(b->block_id())) {
717     assert(b->dominator() != NULL || b == _linear_scan_order->at(0), "dominator must be initialized");
813   while (insert_idx > 0 && _work_list.at(insert_idx - 1)->linear_scan_number() > cur_weight) {
814     _work_list.at_put(insert_idx, _work_list.at(insert_idx - 1));
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()));
824     assert(_work_list.at(i)->linear_scan_number() > 0, "weight not set");
825     assert(i == 0 || _work_list.at(i - 1)->linear_scan_number() <= _work_list.at(i)->linear_scan_number(), "incorrect order in worklist");
914   assert(_linear_scan_order->at(0)->dominator() == NULL, "must not have dominator");
915   assert(_linear_scan_order->at(0)->number_of_preds() == 0, "must not have predecessors");
917     BlockBegin* block = _linear_scan_order->at(i);
957       BlockBegin* cur = _linear_scan_order->at(block_idx);
970       BlockBegin* cur = _linear_scan_order->at(block_idx);
1025     BlockBegin* cur = _linear_scan_order->at(i);
1069     assert(!is_block_in_loop(loop_idx, _linear_scan_order->at(block_idx)), "the first block must not be present in any loop");
1072     while (block_idx < _num_blocks && !is_block_in_loop(loop_idx, _linear_scan_order->at(block_idx))) {
1076     while (block_idx < _num_blocks && is_block_in_loop(loop_idx, _linear_scan_order->at(block_idx))) {
1081       assert(!is_block_in_loop(loop_idx, _linear_scan_order->at(block_idx)), "loop not continuous in linear-scan order");
1102     _code->at(i)->end()->state()->pin_stack_for_linear_scan();
1190         assert(hir->code()->contains(_blocks->at(i)), "should be in both lists");
1195       BlockBegin* block = _blocks->at(i);
1196       BlockList* preds = _predecessors->at(block->block_id());
1213         assert(preds->at(j) == pred_copy->at(j), "must match");