Lines Matching full:branch
62 /// constant value, convert it into an unconditional branch to the constant
65 /// Also calls RecursivelyDeleteTriviallyDeadInstructions() on any branch/switch
73 // Branch - See if we are conditional jumping on constant
75 if (BI->isUnconditional()) return false; // Can't optimize uncond branch
81 // YES. Change to unconditional branch...
86 // << "\nRemoving branch from " << T->getParent()
93 // Replace the conditional branch with an unconditional one.
99 if (Dest2 == Dest1) { // Conditional branch to same location?
100 // This branch matches something like this:
108 // Replace the conditional branch with an unconditional one.
121 // unconditional branch.
141 // Check to see if this branch is going to the same place as the default
149 // Collect branch weights into a vector.
188 // Insert the new branch.
192 // Remove entries from PHI nodes which we no longer branch to...
196 TheOnlyDest = nullptr; // Don't modify the first branch to TheOnlyDest
210 // Otherwise, we can fold this switch into a conditional branch
216 // Insert the new branch.
234 // Update make.implicit metadata to the newly-created conditional branch.
251 // Insert the new branch.
266 // have undefined behavior. Replace the unconditional branch with an
621 /// almost-empty BB ending in an unconditional branch to Succ, into Succ.
786 // simplifying the corresponding conditional branch).
793 // newly retargeted branch.
805 // newly retargeted branch.
814 /// unconditional branch, and contains no instructions other than PHI nodes,
815 /// potential side-effect free intrinsics and the branch. If possible,
816 /// eliminate BB by rewriting all the predecessors to branch to the successor
841 // folding the branch isn't profitable in that case anyway.
1355 // Follow the call by a branch to the normal destination.
1457 // jump to the normal destination branch.
