Lines Matching full:predecessor
187 /// ExistPred, an existing predecessor of Succ.
467 // predecessors unless there is only one predecessor.
552 /// predecessor block, check to see if that predecessor is also a value
561 if (!PredVal) return false; // Not a value comparison in predecessor.
777 // See if the predecessor is a comparison with the same value.
805 // If there are no predecessor weights but there are successor weights,
866 // Scale the cases from predecessor by ValidTotalSuccWeight.
894 // predecessor. Figure out where they will all go now.
1124 /// check whether BBEnd has only two predecessors and the other predecessor
1132 // Check that BBEnd has two predecessors and the other predecessor ends with
1136 if (PI == PE) // Only one predecessor.
1317 /// hoisted into the predecessor block. 0 otherwise.
1618 // Skip if the predecessor's terminator is an indirect branch.
1746 // instructions in the predecessor blocks can be promoted as well. If
1926 /// in its predecessor block. If yes, the instruction will be removed.
1944 /// predecessor branches to us and one of our successors, fold the block into
1945 /// the predecessor and use logical operations to pick the right destination.
1954 // BB has a single predecessor and BB's successor is also its predecessor's
1956 // predecessor.
1993 // were also live in the predecessor, so that we don't unnecessarily create
2070 // by the terminator of the predecessor. This means that those values
2086 // Walk up to four levels back up the use-def chain of the predecessor's
2126 // If we have a bonus inst, clone it into the predecessor block.
2135 // Clone Cond into the predecessor basic block, and or/and the
2261 /// predecessor of another block, this function tries to simplify it. We know
2269 // predecessor that ends on a branch of the same condition, make
2293 // predecessor, compute the PHI'd conditional value for all of the preds.
2294 // Any predecessor where the condition is not computable we keep symbolic.
2457 // one fewer predecessor.
2612 // The pattern we're looking for is where our only predecessor is a switch on
3231 assert(Idx >= 0 && "PHI has no entry for predecessor?");
3787 // If we only have one predecessor, and if it is a branch on this value,
3788 // see if that predecessor totally determines the outcome of this switch.
3886 // If this basic block is ONLY a compare and a branch, and if a predecessor
3888 // predecessor and use logical operations to update the incoming value
3901 // If we only have one predecessor, and if it is a branch on this value,
3902 // see if that predecessor totally determines the outcome of this
3931 // If this basic block is ONLY a compare and a branch, and if a predecessor
3933 // predecessor and use logical operations to pick the right destination.
3971 // Scan predecessor blocks for conditional branches.
4056 // or that just have themself as a predecessor. These are unreachable.
4075 // Merge basic blocks into their predecessor if there is only one distinct
4076 // pred, and if there is only one distinct successor of the predecessor, and
