Home
last modified time | relevance | path

Searched refs:predecessor (Results 1 – 25 of 94) sorted by relevance

1234

/llvm-project-15.0.7/llvm/test/CodeGen/WebAssembly/
H A Dirreducible-cfg.mir5 # one of the predecessor is the layout predecessor of an entry, a routing block
6 # for the entry should be generated right after the layout predecessor.
48 ; Routing block for entry0, when predecessor is outside the loop
61 ; Routing block for entry1, when predecessor is inside the loop
77 ; Routing block for entry1, when predecessor is outside the loop
82 ; Routing block for entry0, when predecessor is inside the loop
/llvm-project-15.0.7/mlir/lib/Analysis/DataFlow/
H A DDenseAnalysis.cpp68 for (Operation *predecessor : predecessors->getKnownPredecessors()) in visitOperation()
69 join(after, *getLatticeFor(op, predecessor)); in visitOperation()
130 Block *predecessor = *it; in visitBlock() local
132 block, getProgramPoint<CFGEdge>(predecessor, block)) in visitBlock()
137 join(after, *getLatticeFor(block, predecessor->getTerminator())); in visitBlock()
H A DDeadCodeAnalysis.cpp62 ChangeResult PredecessorState::join(Operation *predecessor) { in join() argument
63 return knownPredecessors.insert(predecessor) ? ChangeResult::Change in join()
67 ChangeResult PredecessorState::join(Operation *predecessor, ValueRange inputs) { in join() argument
68 ChangeResult result = join(predecessor); in join()
70 ValueRange &curInputs = successorInputs[predecessor]; in join()
412 for (Operation *predecessor : callsites->getKnownPredecessors()) { in visitCallableTerminator()
413 assert(isa<CallOpInterface>(predecessor)); in visitCallableTerminator()
414 auto *predecessors = getOrCreate<PredecessorState>(predecessor); in visitCallableTerminator()
H A DSparseAnalysis.cpp114 for (Operation *predecessor : predecessors->getKnownPredecessors()) in visitOperation()
115 for (auto it : llvm::zip(predecessor->getOperands(), resultLattices)) in visitOperation()
193 Block *predecessor = *it; in visitBlock() local
198 getOrCreate<Executable>(getProgramPoint<CFGEdge>(predecessor, block)); in visitBlock()
205 dyn_cast<BranchOpInterface>(predecessor->getTerminator())) { in visitBlock()
/llvm-project-15.0.7/mlir/include/mlir/Analysis/DataFlow/
H A DDeadCodeAnalysis.h125 ValueRange getSuccessorInputs(Operation *predecessor) const { in getSuccessorInputs() argument
126 return successorInputs.lookup(predecessor); in getSuccessorInputs()
130 ChangeResult join(Operation *predecessor);
133 ChangeResult join(Operation *predecessor, ValueRange inputs);
/llvm-project-15.0.7/llvm/test/Transforms/LoopVectorize/
H A Dpr32859.ll4 ; but the IR Verifier requires for PHI one entry for each predecessor of
6 ; added 'undef' for an predecessor BB and which is not correct. We copy the real
7 ; value for another predecessor instead of bringing 'undef'.
/llvm-project-15.0.7/llvm/test/MachineVerifier/
H A Dverifier-phi-fail0.mir5 # CHECK: Bad machine code: PHI operand is not live-out from predecessor
11 # CHECK: Bad machine code: PHI operand is not live-out from predecessor
H A Dlive-ins-02.mir5 # liveins is not liveout from predecessor.
29 # CHECK: *** Bad machine code: Live in register not found to be live out from predecessor. ***
H A Dlive-ins-03.mir5 # liveins is not liveout from predecessor.
33 # CHECK: *** Bad machine code: Live in register not found to be live out from predecessor. ***
H A Dlive-ins-01.mir5 # liveins is not liveout from predecessor.
30 # CHECK: *** Bad machine code: Live in register not found to be live out from predecessor. ***
/llvm-project-15.0.7/llvm/test/CodeGen/AMDGPU/
H A Dcoalescer-removepartial-extend-undef-subrange.mir7 # predecessor path 2->3->1. But for another predecessor path 0->4->1,
9 # it will fail to find the reaching def for %2.sub1 in predecessor bb.4 and bb.0
/llvm-project-15.0.7/mlir/lib/Dialect/ControlFlow/IR/
H A DControlFlowOps.cpp336 Block *predecessor = currentBlock->getSinglePredecessor(); in matchAndRewrite() local
337 if (!predecessor) in matchAndRewrite()
342 auto predBranch = dyn_cast<CondBranchOp>(predecessor->getTerminator()); in matchAndRewrite()
793 Block *predecessor = currentBlock->getSinglePredecessor(); in simplifySwitchFromSwitchOnSameCondition() local
794 if (!predecessor) in simplifySwitchFromSwitchOnSameCondition()
800 auto predSwitch = dyn_cast<SwitchOp>(predecessor->getTerminator()); in simplifySwitchFromSwitchOnSameCondition()
844 Block *predecessor = currentBlock->getSinglePredecessor(); in simplifySwitchFromDefaultSwitchOnSameCondition() local
845 if (!predecessor) in simplifySwitchFromDefaultSwitchOnSameCondition()
851 auto predSwitch = dyn_cast<SwitchOp>(predecessor->getTerminator()); in simplifySwitchFromDefaultSwitchOnSameCondition()
/llvm-project-15.0.7/llvm/test/Transforms/EarlyCSE/
H A Dconditional.ll44 ; Check specifically for a case where we have a unique predecessor, but
45 ; not a single predecessor. We can not know the value of the condition here.
96 ; Another single predecessor test, but for dominated use
/llvm-project-15.0.7/mlir/lib/Dialect/Transform/Transforms/
H A DCheckUses.cpp43 for (Block *predecessor : getNextNodes(current)) { in getReachableImpl()
46 if (reachable.insert(predecessor).second) in getReachableImpl()
47 worklist.push_back(predecessor); in getReachableImpl()
/llvm-project-15.0.7/mlir/lib/Dialect/Bufferization/Transforms/
H A DBufferDeallocation.cpp138 bool enter(Block &current, Block *predecessor) { in enter() argument
141 edgeSet.insert(std::make_pair(predecessor, &current)); in enter()
168 void recurse(Block &block, Block *predecessor) { in recurse() argument
171 if (!enter(block, predecessor)) in recurse()
/llvm-project-15.0.7/bolt/test/X86/
H A Dsctc-bug3.test10 # Check that .Ltmp0 does not have a deleted predecessor.
/llvm-project-15.0.7/llvm/test/Transforms/GVN/
H A Dload-from-unreachable-predecessor.ll3 ; Check that an unreachable predecessor to a PHI node doesn't cause a crash.
/llvm-project-15.0.7/llvm/test/Transforms/NewGVN/
H A Dload-from-unreachable-predecessor.ll3 ; Check that an unreachable predecessor to a PHI node doesn't cause a crash.
/llvm-project-15.0.7/llvm/test/CodeGen/AArch64/
H A Dfast-isel-switch-phi.ll4 ; from the same predecessor.
/llvm-project-15.0.7/llvm/test/Analysis/MemorySSA/
H A Dforward-unreachable.ll18 ; predecessor of the block
/llvm-project-15.0.7/llvm/test/Transforms/GVN/PRE/
H A Dpre-no-cost-phi.ll3 ; when the value is already available in every predecessor,
/llvm-project-15.0.7/llvm/test/Transforms/RewriteStatepointsForGC/
H A Dphi-vector-bitcast.ll5 ; from the same predecessor.
/llvm-project-15.0.7/llvm/test/Transforms/JumpThreading/
H A Dassume-edge-dom.ll26 ; predecessor branch (although no assume dominates the cmp itself). Make sure
/llvm-project-15.0.7/llvm/test/CodeGen/Generic/
H A Dundef-phi.ll4 ; inserts an IMPLICIT_DEF instruction in the predecessor so all paths to the use
/llvm-project-15.0.7/lldb/source/Plugins/TraceExporter/docs/
H A Dhtr.rst43 - For each block, compute the number of distinct predecessor and successor blocks.
48 …uper block will continue until the next block with more than one distinct predecessor or successor.

1234