Lines Matching full:predecessors
293 if (predecessors()->length() == 1) {
301 for (int i = 1; i < predecessors()->length(); ++i) {
302 loop_information()->RegisterBackEdge(predecessors()->at(i));
396 // If more successors than predecessors have been seen in the loop up to
480 for (int i = 0; i < block->predecessors()->length(); ++i) {
481 AddBlock(block->predecessors()->at(i));
563 ASSERT(first->predecessors()->Contains(block));
565 ASSERT(second->predecessors()->Contains(block));
575 // Check that all join blocks have predecessors that end with an
577 if (block->predecessors()->length() >= 2) {
579 block->predecessors()->first()->last_environment()->ast_id();
580 for (int k = 0; k < block->predecessors()->length(); k++) {
581 HBasicBlock* predecessor = block->predecessors()->at(k);
588 // Check special property of first block to have no predecessors.
589 ASSERT(blocks_.at(0)->predecessors()->is_empty());
1075 ASSERT(continuation->predecessors()->length() == 0);
2433 block->AssignCommonDominator(block->predecessors()->first());
2436 for (int j = blocks_[i]->predecessors()->length() - 1; j >= 0; --j) {
2437 blocks_[i]->AssignCommonDominator(blocks_[i]->predecessors()->at(j));
6235 // even without predecessors to the join block, we set it as the exit
9357 ASSERT(phi->OperandCount() == block->predecessors()->length());
9364 for (int j = 0; j < block->predecessors()->length(); j++) {
9584 if (!current->predecessors()->is_empty()) {
9586 trace_.Add("predecessors");
9587 for (int j = 0; j < current->predecessors()->length(); ++j) {
9588 trace_.Add(" \"B%d\"", current->predecessors()->at(j)->block_id());
9592 PrintEmptyProperty("predecessors");
