/freebsd/contrib/llvm-project/clang/lib/AST/Interp/ |
H A D | InterpState.cpp | 29 while (DeadBlocks) { in ~InterpState() 30 DeadBlock *Next = DeadBlocks->Next; in ~InterpState() 31 std::free(DeadBlocks); in ~InterpState() 32 DeadBlocks = Next; in ~InterpState() 59 auto *D = new (Memory) DeadBlock(DeadBlocks, B); in deallocate()
|
H A D | InterpState.h | 101 DeadBlock *DeadBlocks = nullptr; variable
|
/freebsd/contrib/llvm-project/llvm/lib/CodeGen/ |
H A D | UnreachableBlockElim.cpp | 110 std::vector<MachineBasicBlock*> DeadBlocks; in runOnMachineFunction() local 114 DeadBlocks.push_back(&BB); in runOnMachineFunction() 139 for (MachineBasicBlock *BB : DeadBlocks) { in runOnMachineFunction() 195 return (!DeadBlocks.empty() || ModifiedPHI); in runOnMachineFunction()
|
/freebsd/contrib/llvm-project/llvm/include/llvm/Transforms/IPO/ |
H A D | FunctionSpecialization.h | 183 DenseSet<BasicBlock *> DeadBlocks; variable 200 return Solver.isBlockExecutable(BB) && !DeadBlocks.contains(BB); in isBlockExecutable() 211 DenseSet<BasicBlock *> &DeadBlocks);
|
/freebsd/contrib/llvm-project/llvm/lib/Transforms/IPO/ |
H A D | FunctionSpecialization.cpp | 97 DenseSet<BasicBlock *> &DeadBlocks) { in canEliminateSuccessor() argument 100 [&I, BB, Succ, &DeadBlocks] (BasicBlock *Pred) { in canEliminateSuccessor() 102 (Pred == BB || Pred == Succ || DeadBlocks.contains(Pred)); in canEliminateSuccessor() 122 if (!DeadBlocks.insert(BB).second) in estimateBasicBlocks() 145 canEliminateSuccessor(BB, SuccBB, DeadBlocks)) in estimateBasicBlocks() 248 canEliminateSuccessor(I.getParent(), BB, DeadBlocks)) in estimateSwitchInst() 266 canEliminateSuccessor(I.getParent(), Succ, DeadBlocks)) in estimateBranchInst() 294 if (Inst == PN || DeadBlocks.contains(PN->getIncomingBlock(I))) in discoverTransitivelyIncomingValues() 329 if (Inst == &I || DeadBlocks.contains(I.getIncomingBlock(Idx))) in visitPHINode()
|
H A D | AttributorAttributes.cpp | 3599 llvm::all_of(DeadBlocks, [&](const BasicBlock *BB) { in updateImpl() 3605 DeadBlocks.clear(); in updateImpl() 3661 DeadBlocks.insert(ToBB); in isReachableImpl() 3707 DenseSet<const BasicBlock *> DeadBlocks; member
|
/freebsd/contrib/llvm-project/llvm/lib/IR/ |
H A D | SafepointIRVerifier.cpp | 71 SetVector<const BasicBlock *> DeadBlocks; member in __anon1bb011e20111::CFGDeadness 101 return DeadBlocks.count(BB); in isDeadBlock() 131 DeadBlocks.insert(&BB); in processFunction() 174 DeadBlocks.insert(Dom.begin(), Dom.end()); in addDeadBlock()
|
/freebsd/contrib/llvm-project/llvm/lib/Transforms/Scalar/ |
H A D | GVN.cpp | 1320 if (DeadBlocks.count(DepBB)) { in AnalyzeLoadAvailability() 2748 DeadBlocks.clear(); in runImpl() 2761 if (DeadBlocks.count(BB)) in processBlock() 3158 if (DeadBlocks.count(D)) in addDeadBlock() 3169 if (DeadBlocks.count(S)) in addDeadBlock() 3174 if (!DeadBlocks.count(P)) { in addDeadBlock() 3196 if (DeadBlocks.count(B)) in addDeadBlock() 3203 if (!DeadBlocks.count(P)) in addDeadBlock() 3209 DeadBlocks.insert(P = S); in addDeadBlock() 3215 if (!DeadBlocks.count(P)) in addDeadBlock() [all …]
|
H A D | MergeICmps.cpp | 727 SmallVector<BasicBlock *, 16> DeadBlocks; in simplify() local 732 DeadBlocks.push_back(Block.BB); in simplify() 735 DeleteDeadBlocks(DeadBlocks, &DTU); in simplify()
|
H A D | SimpleLoopUnswitch.cpp | 1663 SmallVector<BasicBlock *, 16> DeadBlocks; in deleteDeadClonedBlocks() local 1670 DeadBlocks.push_back(ClonedBB); in deleteDeadClonedBlocks() 1675 SmallSetVector<BasicBlock *, 8> DeadBlockSet(DeadBlocks.begin(), in deleteDeadClonedBlocks() 1676 DeadBlocks.end()); in deleteDeadClonedBlocks() 1681 for (BasicBlock *BB : DeadBlocks) in deleteDeadClonedBlocks() 1684 for (BasicBlock *BB : DeadBlocks) in deleteDeadClonedBlocks()
|
/freebsd/contrib/llvm-project/llvm/include/llvm/Analysis/ |
H A D | MemorySSAUpdater.h | 231 void removeBlocks(const SmallSetVector<BasicBlock *, 8> &DeadBlocks);
|
/freebsd/contrib/llvm-project/llvm/lib/Analysis/ |
H A D | InlineCost.cpp | 399 SmallPtrSet<BasicBlock *, 16> DeadBlocks; member in __anond1042ba30111::CallAnalyzer 989 if (DeadBlocks.count(L->getHeader())) in finalizeAnalysis() 1287 if (DeadBlocks.count(L->getHeader())) in finalizeAnalysis() 1293 set(InlineCostFeatureIndex::dead_blocks, DeadBlocks.size()); in finalizeAnalysis() 1519 if (DeadBlocks.count(Pred)) in visitPHI() 2666 return (DeadBlocks.count(Pred) || in findDeadBlocks() 2672 return (!DeadBlocks.count(BB) && in findDeadBlocks() 2684 if (DeadBlocks.insert(Dead).second) in findDeadBlocks()
|
H A D | MemorySSAUpdater.cpp | 1348 const SmallSetVector<BasicBlock *, 8> &DeadBlocks) { in removeBlocks() argument 1350 for (BasicBlock *BB : DeadBlocks) { in removeBlocks() 1354 if (!DeadBlocks.count(Succ)) in removeBlocks() 1366 for (BasicBlock *BB : DeadBlocks) { in removeBlocks()
|
/freebsd/contrib/llvm-project/llvm/include/llvm/Transforms/Scalar/ |
H A D | GVN.h | 225 SetVector<BasicBlock *> DeadBlocks;
|
/freebsd/contrib/llvm-project/llvm/lib/Transforms/Utils/ |
H A D | BasicBlockUtils.cpp | 134 std::vector<BasicBlock*> DeadBlocks; in EliminateUnreachableBlocks() local 137 DeadBlocks.push_back(&BB); in EliminateUnreachableBlocks() 140 DeleteDeadBlocks(DeadBlocks, DTU, KeepOneInputPHIs); in EliminateUnreachableBlocks() 142 return !DeadBlocks.empty(); in EliminateUnreachableBlocks()
|