Home | History | Annotate | Download | only in Utils

Lines Matching full:branches

53        cl::desc("Duplicate return instructions into unconditional branches"));
142 // We can only handle branches. Other control flow will be lowered to
143 // branches if possible anyway.
152 // If both branches are conditional, we don't have an "if statement". In
170 // If we found a conditional branch predecessor, make sure that it branches
1131 /// constants, thread edges corresponding to that entry to be branches to their
1281 // Don't fold i1 branches on PHIs which contain binary operators. These can
1495 /// predecessor branches to us and one of our successors, fold the block into
1560 // Check that we have two conditional branches. If there is a PHI node in
1566 // Determine if the two branches share a common destination.
1768 /// that PBI and BI are both conditional branches, and BI is in one of the
1769 /// successor blocks of PBI - PBI branches to BI.
1864 // Finally, if everything is ok, fold the branches to logical ops.
2137 // NewBB branches to the phi block, add the uncond branch and the phi entry.
2307 // Find predecessors that end with branches.
2338 // Check out all of the conditional branches going to this return
2801 // branches to us and one of our successors, fold the comparison into the
2816 // execute Successor #0 if it branches to successor #1.
2825 // execute Successor #1 if it branches to successor #0.
2840 // Scan predecessor blocks for conditional branches.
2899 // Turn uncoditional branches into unreachables and remove the dead
2900 // destination from conditional branches.
2938 // Check for and remove branches that will always cause undefined behavior.
2981 /// example, it adjusts branches to branches to eliminate the extra hop, it