Lines Matching defs:at
83 block()->dominated_blocks()->at(current_dominated_block_) : NULL;
107 Element* at(int index) { return &(elements_.at(index)); }
108 Element* at(HBasicBlock* block) { return at(block->block_id()); }
111 at(block->block_id())->set_has_check();
120 at(i)->InitializeLoop(data);
137 * semantics as performing it at every loop iteration, which could cause
145 at(i)->ResetCurrentDominatedBlock();
153 if (at(current)->has_check() || !at(current)->is_in_loop()) {
159 Element* successor = at(current->end()->SuccessorAt(i));
178 next = at(current)->NextDominatedBlock();
185 next = at(current)->NextDominatedBlock();
204 element.set_block(graph->blocks()->at(i));
206 ASSERT(at(i)->block()->block_id() == i);
218 HBasicBlock* pre_header = header->predecessors()->at(0);
314 HPhi* phi = bb->phis()->at(i);
319 bb, at(bb)->additional_limit());
322 at(bb)->additional_limit()->updated_variable->
323 UpdateAdditionalLimit(at(bb)->additional_limit());
358 CollectInductionVariableData(bb->dominated_blocks()->at(i));
362 at(bb->block_id())->additional_limit()->updated_variable->
363 UpdateAdditionalLimit(at(bb->block_id())->additional_limit());
369 HPhi* phi = bb->phis()->at(i);
405 table.EliminateRedundantBoundsChecks(graph()->blocks()->at(i));
