Lines Matching defs:at
83 block()->dominated_blocks()->at(current_dominated_block_) : NULL;
108 Element* at(int index) const { return &(elements_.at(index)); }
109 Element* at(HBasicBlock* block) const { return at(block->block_id()); }
112 at(block->block_id())->set_has_check();
121 at(i)->InitializeLoop(data);
138 * semantics as performing it at every loop iteration, which could cause
146 at(i)->ResetCurrentDominatedBlock();
154 if (at(current)->has_check() || !at(current)->is_in_loop()) {
160 Element* successor = at(current->end()->SuccessorAt(i));
179 next = at(current)->NextDominatedBlock();
186 next = at(current)->NextDominatedBlock();
205 element.set_block(graph->blocks()->at(i));
207 ASSERT(at(i)->block()->block_id() == i);
219 HBasicBlock* pre_header = header->predecessors()->at(0);
308 HPhi* phi = bb->phis()->at(i);
313 bb, at(bb)->additional_limit());
316 at(bb)->additional_limit()->updated_variable->
317 UpdateAdditionalLimit(at(bb)->additional_limit());
351 CollectInductionVariableData(bb->dominated_blocks()->at(i));
355 at(bb->block_id())->additional_limit()->updated_variable->
356 UpdateAdditionalLimit(at(bb->block_id())->additional_limit());
362 HPhi* phi = bb->phis()->at(i);
398 table.EliminateRedundantBoundsChecks(graph()->blocks()->at(i));
