Transforms/Scalar/JumpThreading.cpp

64   cl::desc("The number of predecessors to search for a stronger "
81   /// multiple predecessors and multiple successors.  If one or more of the
82   /// predecessors of the block can be proven to always jump to one of the
393 /// in any of our predecessors.  If so, return the known list of value and pred
413   // If V is a constant, then it is known in all predecessors.
415     for (BasicBlock *Pred : predecessors(BB))
427     // of any of our predecessors.
439     for (BasicBlock *P : predecessors(BB)) {
584     // live-in value on any predecessors.
590         for (BasicBlock *P : predecessors(BB)) {
663     for (BasicBlock *Pred : predecessors(BB))
676 /// fewest predecessors.  This should reduce the in-degree of the others.
682   // Compute the successor with the minimum number of predecessors.
706 /// ProcessBlock - If there are any predecessors whose control can be threaded
718   // predecessors of our predecessor block.
866   // a PHI node in the current block.  If we can prove that any predecessors
867   // compute a predictable value based on a PHI node, thread those predecessors.
989   for (BasicBlock *PredBB : predecessors(LoadBB)) {
1018   // predecessors.  If the value is unavailable in more than one unique
1019   // predecessor, we want to insert a merge block for those common predecessors.
1031     // Otherwise, we had multiple unavailable predecessors or we had a critical
1039     // Add all the unavailable predecessors to the PredsToSplit list.
1040     for (BasicBlock *P : predecessors(LoadBB)) {
1053   // If the value isn't available in all predecessors, then there will be
1198   // predecessors and keeps track of the undefined inputs (which are represented
1254   // predecessors that will jump to it into a single predecessor.
1269   // the destination that these predecessors should get to.
1359   // predecessors can be of the set true, false, or undef.
1388   // If we inferred a value for all of the predecessors, then duplication won't
1466   // And finally, do it!  Start by factoring the predecessors if needed.
1472           << " common predecessors.\n");
1571   // NewBB instead of BB.  This eliminates predecessors from BB, which requires
1599   // Collect the frequencies of all predecessors of BB, which will be used to
1703   // And finally, do it!  Start by factoring the predecessors if needed.
1709           << " common predecessors.\n");