Searched refs:predecessors (Results 76 - 85 of 85) sorted by relevance
1234
| /freebsd-13-stable/contrib/llvm-project/llvm/lib/Transforms/Scalar/ |
| H A D | LICM.cpp | 610 // branches which cover all of the predecessors of the block.
613 for (BasicBlock *PredBB : predecessors(BB))
615 // If we have less predecessor blocks than predecessors then the phi will
624 // Which blocks are predecessors via this branch depends on if the
1376 // replacing for the number and blocks of the predecessors.
1472 // Split predecessors of the loop exit to make instructions in the loop are
1509 "Expect all predecessors are in the loop");
1583 // Split predecessors of the PHI so that we can make users trivially
|
| /freebsd-13-stable/contrib/llvm-project/llvm/lib/Target/ARM/ |
| H A D | ARMFrameLowering.cpp | 2348 for (MachineBasicBlock *PredBB : CurMBB->predecessors()) {
|
| /freebsd-13-stable/contrib/llvm-project/llvm/lib/Analysis/ |
| H A D | InlineCost.cpp | 2045 llvm::all_of(predecessors(BB),
|
| H A D | MemorySSA.cpp | 1896 // If Pred has no unreachable predecessors, get last def looking at
1910 // If Pred has unreachable predecessors, but has at least a Def, the
1914 // If Pred has unreachable predecessors and no Defs, incoming access
1992 assert(find(predecessors(&B), Phi->getIncomingBlock(I)) !=
|
| H A D | ScalarEvolution.cpp | 9504 // as there are predecessors that can be found that have unique successors
9940 for (const BasicBlock *IncBB : predecessors(LBB)) {
9970 for (const BasicBlock *IncBB : predecessors(LBB)) {
|
| /freebsd-13-stable/contrib/llvm-project/llvm/lib/IR/ |
| H A D | Verifier.cpp | 28 // * The entry node to a function must not have predecessors
2375 "Entry block to function must not have predecessors!", Entry);
2524 // Check to make sure that the predecessors and PHI node entries are
2527 "PHI node entries do not match predecessors!", &PN,
3743 for (BasicBlock *PredBB : predecessors(BB)) {
3768 for (BasicBlock *PredBB : predecessors(BB)) {
|
| /freebsd-13-stable/contrib/llvm-project/llvm/lib/CodeGen/ |
| H A D | RegisterCoalescer.cpp | 1091 // MBB has two predecessors: one contains A = B so no copy will be inserted
1095 for (MachineBasicBlock *Pred : MBB.predecessors()) {
1128 // If no reverse copy is found in predecessors, nothing to do.
2172 // predecessors have a live out value. It doesn't cause real interference,
2994 // predecessors, so the instruction should simply go away once its value
3186 // PHIElimination to guarantee that all PHI predecessors have a value.
|
| H A D | CodeGenPrepare.cpp | 833 // If BB and DestBB contain any common predecessors, then the phi nodes in BB
895 // Otherwise, we have multiple predecessors of BB. Update the PHIs in DestBB
2260 // If we eliminated all predecessors of the block, delete the block now.
3596 /// Fill the placeholders with values from predecessors and simplify them.
3617 // Fill the Phi node with values from predecessors.
3618 for (auto *B : predecessors(PHI->getParent())) {
|
| /freebsd-13-stable/contrib/llvm-project/llvm/lib/Target/Hexagon/ |
| H A D | HexagonInstrInfo.cpp | 166 for (MachineBasicBlock *PB : BB->predecessors()) {
181 // Check the predecessors for the LOOP instruction.
|
| /freebsd-13-stable/contrib/llvm-project/llvm/lib/Transforms/InstCombine/ |
| H A D | InstCombineCompares.cpp | 1466 for (BasicBlock *Predecessor : predecessors(Phi->getParent())) {
|
Completed in 690 milliseconds
1234