| /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()
39 for (DeadBlock *DB = DeadBlocks; DB; DB = DB->Next) { in cleanup()
71 auto *D = new (Memory) DeadBlock(DeadBlocks, B); in deallocate()
|
| H A D | InterpState.h | 118 DeadBlock *DeadBlocks = nullptr; variable
|
| /freebsd/contrib/llvm-project/llvm/lib/CodeGen/ |
| H A D | UnreachableBlockElim.cpp | 114 std::vector<MachineBasicBlock*> DeadBlocks; in runOnMachineFunction() local
118 DeadBlocks.push_back(&BB); in runOnMachineFunction()
143 for (MachineBasicBlock *BB : DeadBlocks) { in runOnMachineFunction()
199 return (!DeadBlocks.empty() || ModifiedPHI); in runOnMachineFunction()
|
| /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 | 3602 llvm::all_of(DeadBlocks, [&](const BasicBlock *BB) { in updateImpl()
3608 DeadBlocks.clear(); in updateImpl()
3664 DeadBlocks.insert(ToBB); in isReachableImpl()
3710 DenseSet<const BasicBlock *> DeadBlocks; member
|
| /freebsd/contrib/llvm-project/llvm/lib/IR/ |
| H A D | SafepointIRVerifier.cpp | 71 SetVector<const BasicBlock *> DeadBlocks; member in __anond3efd71a0111::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 | 1385 if (DeadBlocks.count(DepBB)) { in AnalyzeLoadAvailability()
2820 DeadBlocks.clear(); in runImpl()
2833 if (DeadBlocks.count(BB)) in processBlock()
3218 if (DeadBlocks.count(D)) in addDeadBlock()
3224 DeadBlocks.insert(Dom.begin(), Dom.end()); in addDeadBlock()
3229 if (DeadBlocks.count(S)) in addDeadBlock()
3234 if (!DeadBlocks.count(P)) { in addDeadBlock()
3256 if (DeadBlocks.count(B)) in addDeadBlock()
3263 if (!DeadBlocks.count(P)) in addDeadBlock()
3269 DeadBlocks.insert(P = S); 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 | 1677 SmallVector<BasicBlock *, 16> DeadBlocks; in deleteDeadClonedBlocks()
1684 DeadBlocks.push_back(ClonedBB); in deleteDeadClonedBlocks()
1689 SmallSetVector<BasicBlock *, 8> DeadBlockSet(DeadBlocks.begin(), in deleteDeadClonedBlocks()
1690 DeadBlocks.end()); in deleteDeadClonedBlocks()
1695 for (BasicBlock *BB : DeadBlocks) in deleteDeadClonedBlocks()
1698 for (BasicBlock *BB : DeadBlocks) in deleteDeadClonedBlocks()
1676 SmallVector<BasicBlock *, 16> DeadBlocks; deleteDeadClonedBlocks() local
|
| /freebsd/contrib/llvm-project/llvm/include/llvm/Analysis/ |
| H A D | MemorySSAUpdater.h | 236 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 __anon463f3bdb0111::CallAnalyzer
995 if (DeadBlocks.count(L->getHeader())) in finalizeAnalysis()
1297 if (DeadBlocks.count(L->getHeader())) in finalizeAnalysis()
1303 set(InlineCostFeatureIndex::dead_blocks, DeadBlocks.size()); in finalizeAnalysis()
1529 if (DeadBlocks.count(Pred)) in visitPHI()
2672 return (DeadBlocks.count(Pred) || in findDeadBlocks()
2678 return (!DeadBlocks.count(BB) && in findDeadBlocks()
2690 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()
|