Lines Matching full:predecessors
241 if (predecessors()->length() == 1) {
249 for (int i = 1; i < predecessors()->length(); ++i) {
250 loop_information()->RegisterBackEdge(predecessors()->at(i));
344 // If more successors than predecessors have been seen in the loop up to
428 for (int i = 0; i < block->predecessors()->length(); ++i) {
429 AddBlock(block->predecessors()->at(i));
508 ASSERT(first->predecessors()->Contains(block));
510 ASSERT(second->predecessors()->Contains(block));
520 // Check that all join blocks have predecessors that end with an
522 if (block->predecessors()->length() >= 2) {
523 int id = block->predecessors()->first()->last_environment()->ast_id();
524 for (int k = 0; k < block->predecessors()->length(); k++) {
525 HBasicBlock* predecessor = block->predecessors()->at(k);
532 // Check special property of first block to have no predecessors.
533 ASSERT(blocks_.at(0)->predecessors()->is_empty());
814 block->AssignCommonDominator(block->predecessors()->first());
817 for (int j = blocks_[i]->predecessors()->length() - 1; j >= 0; --j) {
818 blocks_[i]->AssignCommonDominator(blocks_[i]->predecessors()->at(j));
1024 if (block->predecessors()->length() == 1) {
1025 HBasicBlock* pred = block->predecessors()->first();
1541 HBasicBlock* pre_header = loop_header->predecessors()->at(0);
1646 for (int i = 0; i < dominated->predecessors()->length(); ++i) {
1647 HBasicBlock* block = dominated->predecessors()->at(i);
2010 next = use_value->block()->predecessors()->at(use_index)->end();
5145 // even without predecessors to the join block, we set it as the exit
7690 ASSERT(phi->OperandCount() == block->predecessors()->length());
7697 for (int j = 0; j < block->predecessors()->length(); j++) {
7903 if (!current->predecessors()->is_empty()) {
7905 trace_.Add("predecessors");
7906 for (int j = 0; j < current->predecessors()->length(); ++j) {
7907 trace_.Add(" \"B%d\"", current->predecessors()->at(j)->block_id());
7911 PrintEmptyProperty("predecessors");
