Lines Matching refs:block
34 * This class is a table with one element for eack basic block.
54 HBasicBlock* block() { return block_; }
55 void set_block(HBasicBlock* block) { block_ = block; }
71 HLoopInformation* loop = data->phi()->block()->current_loop();
72 is_start_ = (block() == loop->loop_header());
73 is_proper_exit_ = (block() == data->induction_exit_target());
74 is_in_loop_ = loop->IsNestedInThisLoop(block()->current_loop());
82 return current_dominated_block_ < block()->dominated_blocks()->length() ?
83 block()->dominated_blocks()->at(current_dominated_block_) : NULL;
108 Element* at(HBasicBlock* block) { return at(block->block_id()); }
110 void AddCheckAt(HBasicBlock* block) {
111 at(block->block_id())->set_has_check();
122 loop_header_ = data->phi()->block()->current_loop()->loop_header();
154 // We found a check or we reached a dominated block out of the loop,
155 // therefore this block is safe and we can backtrack.
181 // If we have no next block we need to backtrack the tree traversal.
206 ASSERT(at(i)->block()->block_id() == i);
217 data->phi()->block()->current_loop()->loop_header();
221 HBasicBlock* limit_block = data->limit()->block();
234 if (check->check()->length()->block() != pre_header &&
235 !check->check()->length()->block()->Dominates(pre_header)) {
245 AddCheckAt(current_check->check()->block());
274 current_check->check()->block()->graph()->isolate()->counters()->
293 limit->block() != pre_header &&
294 !limit->block()->Dominates(pre_header)) {
306 hoisted_check->block()->graph()->isolate()->counters()->
344 check->block()->graph()->isolate()->counters()->
