| /minix/external/bsd/llvm/dist/clang/lib/Analysis/ |
| H A D | ReachableCode.cpp | 278 if (!Reachable[Start->getBlockID()]) { in scanFromBlock()
280 Reachable[Start->getBlockID()] = true; in scanFromBlock()
322 if (!Reachable[blockID]) { in scanFromBlock()
323 Reachable.set(blockID); in scanFromBlock()
336 return scanFromBlock(Start, Reachable, &PP, true); in scanMaybeReachableFromBlock()
346 llvm::BitVector &Reachable; member in __anon0736566a0111::DeadCodeScan
358 Reachable(reachable), in DeadCodeScan()
377 if (Reachable[blockID] || Visited[blockID]) in enqueue()
394 if (!Reachable[blockID]) { in isDeadCodeRoot()
453 if (Reachable[Block->getBlockID()]) in scanBackwards()
[all …]
|
| H A D | ThreadSafety.cpp | 259 bool Reachable; // Is this block reachable? member
270 : EntryContext(EmptyCtx), ExitContext(EmptyCtx), Reachable(false) in CFGBlockInfo()
1925 BlockInfo[CFGraph->getEntry().getBlockID()].Reachable = true; in runAnalysis()
2025 if (neverReturns(*PI) || !PrevBlockInfo->Reachable) in runAnalysis()
2029 CurrBlockInfo->Reachable = true; in runAnalysis()
2056 if (!CurrBlockInfo->Reachable) in runAnalysis()
2147 if (!Final->Reachable) in runAnalysis()
|
| H A D | CFG.cpp | 4344 bool Reachable = true; in print_block() local
4346 Reachable = false; in print_block()
4351 if (!Reachable) in print_block()
4383 bool Reachable = true; in print_block() local
4385 Reachable = false; in print_block()
4391 if (!Reachable) in print_block()
|
| H A D | Consumed.cpp | 1173 if (this->From && this->From == Other->From && !Other->Reachable) { in intersect()
1211 this->Reachable = false; in markUnreachable()
|
| /minix/external/bsd/llvm/dist/llvm/unittests/ADT/ |
| H A D | SCCIteratorTest.cpp | 140 NodeSubset Reachable; in NodesReachableFrom() local
143 Reachable.AddNode(Idx); in NodesReachableFrom()
145 NodeSubset Previous(Reachable); in NodesReachableFrom()
150 Reachable = Reachable.Join(Nodes[i].second); in NodesReachableFrom()
153 if (Reachable == Previous) in NodesReachableFrom()
154 return Reachable; in NodesReachableFrom()
|
| /minix/external/bsd/llvm/dist/llvm/lib/CodeGen/ |
| H A D | UnreachableBlockElim.cpp | 64 SmallPtrSet<BasicBlock*, 8> Reachable; in runOnFunction() local
67 for (BasicBlock *BB : depth_first_ext(&F, Reachable)) in runOnFunction()
74 if (!Reachable.count(I)) { in runOnFunction()
119 SmallPtrSet<MachineBasicBlock*, 8> Reachable; in runOnMachineFunction() local
127 for (MachineBasicBlock *BB : depth_first_ext(&F, Reachable)) in runOnMachineFunction()
137 if (!Reachable.count(BB)) { in runOnMachineFunction()
|
| H A D | PrologEpilogInserter.cpp | 711 SmallPtrSet<MachineBasicBlock*, 8> Reachable; in replaceFrameIndices() local
714 for (auto DFI = df_ext_begin(&Fn, Reachable), DFE = df_ext_end(&Fn, Reachable); in replaceFrameIndices()
720 assert(Reachable.count(StackPred) && in replaceFrameIndices()
731 if (Reachable.count(BB)) in replaceFrameIndices()
|
| H A D | MachineVerifier.cpp | 1720 SmallPtrSet<const MachineBasicBlock*, 8> Reachable; in verifyStackFrame() local
1725 DFI = df_ext_begin(MF, Reachable), DFE = df_ext_end(MF, Reachable); in verifyStackFrame()
1733 assert(Reachable.count(StackPred) && in verifyStackFrame()
1780 if (Reachable.count(*I) && in verifyStackFrame()
1796 if (Reachable.count(*I) && in verifyStackFrame()
|
| /minix/external/bsd/llvm/dist/clang/include/clang/Analysis/Analyses/ |
| H A D | Consumed.h | 139 bool Reachable;
145 ConsumedStateMap() : Reachable(true), From(nullptr) {} in ConsumedStateMap()
147 : Reachable(Other.Reachable), From(Other.From), VarMap(Other.VarMap), in ConsumedStateMap()
172 bool isReachable() const { return Reachable; } in isReachable()
|
| H A D | ReachableCode.h | 62 llvm::BitVector &Reachable);
|
| /minix/external/bsd/llvm/dist/llvm/lib/Transforms/Utils/ |
| H A D | Local.cpp | 1184 SmallPtrSetImpl<BasicBlock*> &Reachable) { in markAliveBlocks() argument
1188 Reachable.insert(BB); in markAliveBlocks()
1271 if (Reachable.insert(*SI).second) in markAliveBlocks()
1281 SmallPtrSet<BasicBlock*, 128> Reachable; in removeUnreachableBlocks() local
1282 bool Changed = markAliveBlocks(F.begin(), Reachable); in removeUnreachableBlocks()
1285 if (Reachable.size() == F.size()) in removeUnreachableBlocks()
1288 assert(Reachable.size() < F.size()); in removeUnreachableBlocks()
1289 NumRemoved += F.size()-Reachable.size(); in removeUnreachableBlocks()
1294 if (Reachable.count(BB)) in removeUnreachableBlocks()
1298 if (Reachable.count(*SI)) in removeUnreachableBlocks()
[all …]
|
| /minix/external/bsd/llvm/dist/clang/lib/Sema/ |
| H A D | JumpDiagnostics.cpp | 607 llvm::BitVector Reachable(Scopes.size(), false); in VerifyIndirectJumps() local
613 Reachable.reset(); in VerifyIndirectJumps()
620 Reachable.set(Min); in VerifyIndirectJumps()
644 if (Reachable.test(Scope)) { in VerifyIndirectJumps()
648 Reachable.set(S); in VerifyIndirectJumps()
|
| /minix/external/bsd/llvm/dist/llvm/test/Transforms/GVN/ |
| H A D | crash.ll | 194 ;; Reachable code.
|