Lines Matching defs:first_bb
3735 basic_block first_bb)
3876 && bb2 != first_bb
3877 && dominated_by_p (CDI_DOMINATORS, bb2, first_bb))
4043 FIRST_BB is the first basic block if OPCODE is ERROR_MARK. */
4047 vec<operand_entry *> *ops, basic_block first_bb)
4125 ranges, first_bb);
4693 basic_block first_bb = gimple_bb (stmt);
4694 basic_block last_bb = first_bb;
4706 but the last bb in the first_bb .. last_bb range
4710 if (EDGE_COUNT (first_bb->succs) != 2)
4714 other_bb = single_succ (first_bb);
4724 backwards, if first_bb can be set to a predecessor. */
4725 while (single_pred_p (first_bb))
4727 basic_block pred_bb = single_pred (first_bb);
4728 if (!suitable_cond_bb (pred_bb, first_bb, &other_bb, NULL, true))
4730 if (!no_side_effect_bb (first_bb))
4732 first_bb = pred_bb;
4734 /* If first_bb is last_bb, other_bb hasn't been computed yet.
4737 if (first_bb == last_bb)
4747 FOR_EACH_EDGE (e, ei, first_bb->succs)
4749 || e->dest == first_bb)
4758 if (suitable_cond_bb (first_bb, e->dest, &other_bb,
4766 && find_edge (first_bb, single_succ (e->dest)))
4769 if (other_bb == first_bb)
4793 if (first_bb == last_bb)
4795 /* Here basic blocks first_bb through last_bb's predecessor
4798 all blocks except first_bb don't have side-effects and
4839 e2 = find_edge (first_bb, other_bb);
4963 if (bb == first_bb)
4967 any_changes = optimize_range_tests (ERROR_MARK, &ops, first_bb);
5055 if (bb == first_bb)
5090 if (bb == first_bb)