| /freebsd-10-stable/contrib/llvm/tools/clang/lib/Analysis/ |
| D | ReachableCode.cpp | 31 llvm::BitVector &Reachable; member in __anon76bcaf710111::DeadCodeScan
42 Reachable(reachable) {} in DeadCodeScan()
59 if (Reachable[blockID] || Visited[blockID]) in enqueue()
76 if (!Reachable[blockID]) { in isDeadCodeRoot()
133 if (Reachable[Block->getBlockID()]) in scanBackwards()
151 count += clang::reachable_code::ScanReachableFromBlock(Block, Reachable); in scanBackwards()
157 count += clang::reachable_code::ScanReachableFromBlock(Block, Reachable); in scanBackwards()
174 if (Reachable[block->getBlockID()]) in scanBackwards()
177 count += clang::reachable_code::ScanReachableFromBlock(block, Reachable); in scanBackwards()
261 llvm::BitVector &Reachable) { in ScanReachableFromBlock() argument
[all …]
|
| D | ThreadSafety.cpp | 930 bool Reachable; // Is this block reachable? member
941 : EntryContext(EmptyCtx), ExitContext(EmptyCtx), Reachable(false) in CFGBlockInfo()
2366 BlockInfo[CFGraph->getEntry().getBlockID()].Reachable = true; in runAnalysis()
2472 if (neverReturns(*PI) || !PrevBlockInfo->Reachable) in runAnalysis()
2476 CurrBlockInfo->Reachable = true; in runAnalysis()
2503 if (!CurrBlockInfo->Reachable) in runAnalysis()
2596 if (!Final->Reachable) in runAnalysis()
|
| D | Consumed.cpp | 1221 if (this->From && this->From == Other->From && !Other->Reachable) { in intersect()
1263 this->Reachable = false; in markUnreachable()
|
| /freebsd-10-stable/contrib/llvm/lib/CodeGen/ |
| D | UnreachableBlockElim.cpp | 64 SmallPtrSet<BasicBlock*, 8> Reachable; in runOnFunction() local
68 df_ext_begin(&F, Reachable), E = df_ext_end(&F, Reachable); I != E; ++I) in runOnFunction()
75 if (!Reachable.count(I)) { in runOnFunction()
120 SmallPtrSet<MachineBasicBlock*, 8> Reachable; in runOnMachineFunction() local
129 I = df_ext_begin(&F, Reachable), E = df_ext_end(&F, Reachable); in runOnMachineFunction()
140 if (!Reachable.count(BB)) { in runOnMachineFunction()
|
| D | PrologEpilogInserter.cpp | 656 SmallPtrSet<MachineBasicBlock*, 8> Reachable; in replaceFrameIndices() local
660 DFI = df_ext_begin(&Fn, Reachable), DFE = df_ext_end(&Fn, Reachable); in replaceFrameIndices()
666 assert(Reachable.count(StackPred) && in replaceFrameIndices()
677 if (Reachable.count(BB)) in replaceFrameIndices()
|
| D | MachineVerifier.cpp | 1655 SmallPtrSet<const MachineBasicBlock*, 8> Reachable; in verifyStackFrame() local
1660 DFI = df_ext_begin(MF, Reachable), DFE = df_ext_end(MF, Reachable); in verifyStackFrame()
1668 assert(Reachable.count(StackPred) && in verifyStackFrame()
1716 if (Reachable.count(*I) && in verifyStackFrame()
1732 if (Reachable.count(*I) && in verifyStackFrame()
|
| /freebsd-10-stable/contrib/llvm/tools/clang/include/clang/Analysis/Analyses/ |
| D | Consumed.h | 139 bool Reachable;
145 ConsumedStateMap() : Reachable(true), From(NULL) {} in ConsumedStateMap()
147 : Reachable(Other.Reachable), From(Other.From), VarMap(Other.VarMap), in ConsumedStateMap()
172 bool isReachable() const { return Reachable; } in isReachable()
|
| D | ReachableCode.h | 50 llvm::BitVector &Reachable);
|
| /freebsd-10-stable/contrib/llvm/lib/Transforms/Utils/ |
| D | Local.cpp | 1167 SmallPtrSet<BasicBlock*, 128> &Reachable) { in markAliveBlocks() argument
1171 Reachable.insert(BB); in markAliveBlocks()
1234 if (Reachable.insert(*SI)) in markAliveBlocks()
1244 SmallPtrSet<BasicBlock*, 128> Reachable; in removeUnreachableBlocks() local
1245 bool Changed = markAliveBlocks(F.begin(), Reachable); in removeUnreachableBlocks()
1248 if (Reachable.size() == F.size()) in removeUnreachableBlocks()
1251 assert(Reachable.size() < F.size()); in removeUnreachableBlocks()
1252 NumRemoved += F.size()-Reachable.size(); in removeUnreachableBlocks()
1257 if (Reachable.count(BB)) in removeUnreachableBlocks()
1261 if (Reachable.count(*SI)) in removeUnreachableBlocks()
[all …]
|
| /freebsd-10-stable/contrib/llvm/tools/clang/lib/Sema/ |
| 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()
|