| /external/clang/lib/Analysis/ |
| D | ReachableCode.cpp | 268 llvm::BitVector &Reachable, in scanFromBlock() argument
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()
335 llvm::BitVector &Reachable) { in scanMaybeReachableFromBlock() argument
336 return scanFromBlock(Start, Reachable, &PP, true); in scanMaybeReachableFromBlock()
346 llvm::BitVector &Reachable; member in __anon3e8b2c880111::DeadCodeScan
358 Reachable(reachable), in DeadCodeScan()
377 if (Reachable[blockID] || Visited[blockID]) in enqueue()
[all …]
|
| /external/llvm-project/llvm/unittests/ADT/ |
| D | TestGraph.h | 142 NodeSubset Reachable; in NodesReachableFrom() local
145 Reachable.AddNode(Idx); in NodesReachableFrom()
147 NodeSubset Previous(Reachable); in NodesReachableFrom()
152 Reachable = Reachable.Join(Nodes[i].second); in NodesReachableFrom()
155 if (Reachable == Previous) in NodesReachableFrom()
156 return Reachable; in NodesReachableFrom()
|
| /external/llvm-project/clang/lib/Analysis/ |
| D | ReachableCode.cpp | 310 llvm::BitVector &Reachable, in scanFromBlock() argument
320 if (!Reachable[Start->getBlockID()]) { in scanFromBlock()
322 Reachable[Start->getBlockID()] = true; in scanFromBlock()
364 if (!Reachable[blockID]) { in scanFromBlock()
365 Reachable.set(blockID); in scanFromBlock()
377 llvm::BitVector &Reachable) { in scanMaybeReachableFromBlock() argument
378 return scanFromBlock(Start, Reachable, &PP, true); in scanMaybeReachableFromBlock()
388 llvm::BitVector &Reachable; member in __anonb01988360111::DeadCodeScan
401 Reachable(reachable), in DeadCodeScan()
420 if (Reachable[blockID] || Visited[blockID]) in enqueue()
[all …]
|
| /external/llvm/unittests/ADT/ |
| D | SCCIteratorTest.cpp | 138 NodeSubset Reachable; in NodesReachableFrom() local
141 Reachable.AddNode(Idx); in NodesReachableFrom()
143 NodeSubset Previous(Reachable); in NodesReachableFrom()
148 Reachable = Reachable.Join(Nodes[i].second); in NodesReachableFrom()
151 if (Reachable == Previous) in NodesReachableFrom()
152 return Reachable; in NodesReachableFrom()
|
| /external/llvm/lib/CodeGen/ |
| D | UnreachableBlockElim.cpp | 43 SmallPtrSet<BasicBlock*, 8> Reachable; in eliminateUnreachableBlock() local
46 for (BasicBlock *BB : depth_first_ext(&F, Reachable)) in eliminateUnreachableBlock()
53 if (!Reachable.count(&*I)) { in eliminateUnreachableBlock()
133 SmallPtrSet<MachineBasicBlock*, 8> Reachable; in runOnMachineFunction() local
141 for (MachineBasicBlock *BB : depth_first_ext(&F, Reachable)) in runOnMachineFunction()
151 if (!Reachable.count(BB)) { in runOnMachineFunction()
|
| D | PrologEpilogInserter.cpp | 1012 SmallPtrSet<MachineBasicBlock*, 8> Reachable; in replaceFrameIndices() local
1015 for (auto DFI = df_ext_begin(&Fn, Reachable), DFE = df_ext_end(&Fn, Reachable); in replaceFrameIndices()
1021 assert(Reachable.count(StackPred) && in replaceFrameIndices()
1032 if (Reachable.count(&BB)) in replaceFrameIndices()
|
| /external/clang/include/clang/Analysis/Analyses/ |
| 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()
|
| D | ReachableCode.h | 62 llvm::BitVector &Reachable);
|
| /external/llvm-project/llvm/lib/Analysis/ |
| D | PhiValues.cpp | 86 ConstValueSet &Reachable = ReachableMap[RootDepthNumber]; in processPhi() local
89 Reachable.insert(ComponentPhi); in processPhi()
101 Reachable.insert(It->second.begin(), It->second.end()); in processPhi()
104 Reachable.insert(Op); in processPhi()
119 for (const Value *V : Reachable) in processPhi()
|
| /external/swiftshader/third_party/llvm-10.0/llvm/lib/Analysis/ |
| D | PhiValues.cpp | 87 ConstValueSet &Reachable = ReachableMap[RootDepthNumber]; in processPhi() local
90 Reachable.insert(ComponentPhi); in processPhi()
102 Reachable.insert(It->second.begin(), It->second.end()); in processPhi()
105 Reachable.insert(Op); in processPhi()
120 for (const Value *V : Reachable) in processPhi()
|
| /external/llvm-project/clang/include/clang/Analysis/Analyses/ |
| D | Consumed.h | 148 bool Reachable = true;
156 : Reachable(Other.Reachable), From(Other.From), VarMap(Other.VarMap), in ConsumedStateMap()
181 bool isReachable() const { return Reachable; } in isReachable()
|
| D | ReachableCode.h | 61 llvm::BitVector &Reachable);
|
| /external/llvm-project/llvm/lib/Target/WebAssembly/ |
| D | WebAssemblyFixIrreducibleControlFlow.cpp | 102 auto I = Reachable.find(From); in canReach()
103 if (I == Reachable.end()) in canReach()
133 DenseMap<MachineBasicBlock *, BlockSet> Reachable; member in __anon5335f1d20111::ReachabilityGraph
145 Reachable[MBB].insert(Succ); in calculate()
159 if (Reachable[Pred].insert(Succ).second) { in calculate()
|
| /external/swiftshader/third_party/llvm-10.0/llvm/lib/Target/WebAssembly/ |
| D | WebAssemblyFixIrreducibleControlFlow.cpp | 91 auto I = Reachable.find(From); in canReach()
92 if (I == Reachable.end()) in canReach()
122 DenseMap<MachineBasicBlock *, BlockSet> Reachable; member in __anon4d3b72c60111::ReachabilityGraph
134 Reachable[MBB].insert(Succ); in calculate()
148 if (Reachable[Pred].insert(Succ).second) { in calculate()
|
| /external/llvm-project/llvm/lib/CodeGen/ |
| D | UnreachableBlockElim.cpp | 104 df_iterator_default_set<MachineBasicBlock*> Reachable; in runOnMachineFunction() local
111 for (MachineBasicBlock *BB : depth_first_ext(&F, Reachable)) in runOnMachineFunction()
121 if (!Reachable.count(BB)) { in runOnMachineFunction()
|
| D | PrologEpilogInserter.cpp | 1146 df_iterator_default_set<MachineBasicBlock*> Reachable; in replaceFrameIndices() local
1149 for (auto DFI = df_ext_begin(&MF, Reachable), DFE = df_ext_end(&MF, Reachable); in replaceFrameIndices()
1155 assert(Reachable.count(StackPred) && in replaceFrameIndices()
1166 if (Reachable.count(&BB)) in replaceFrameIndices()
|
| /external/swiftshader/third_party/llvm-10.0/llvm/lib/CodeGen/ |
| D | UnreachableBlockElim.cpp | 104 df_iterator_default_set<MachineBasicBlock*> Reachable; in runOnMachineFunction() local
113 for (MachineBasicBlock *BB : depth_first_ext(&F, Reachable)) in runOnMachineFunction()
123 if (!Reachable.count(BB)) { in runOnMachineFunction()
|
| /external/llvm-project/clang/lib/StaticAnalyzer/Core/ |
| D | WorkList.cpp | 142 llvm::DenseSet<LocIdentifier> Reachable; member in __anoncc2ef6850311::UnexploredFirstStack
161 auto InsertInfo = Reachable.insert(LocId); in enqueue()
169 MaxReachableSize.updateMax(Reachable.size()); in enqueue()
|
| /external/grpc-grpc/src/objective-c/GRPCClient/private/ |
| D | GRPCReachabilityFlagNames.xmacro.h | 47 GRPC_XMACRO_ITEM(reachable, Reachable)
|
| /external/scapy/test/ |
| D | mock_windows.uts | 209 Reachable Time : 40500 ms
210 Base Reachable Time : 30000 ms
240 Reachable Time : 43500 ms
241 Base Reachable Time : 30000 ms
|
| /external/llvm/lib/Transforms/Utils/ |
| D | Local.cpp | 1364 SmallPtrSetImpl<BasicBlock*> &Reachable) { in markAliveBlocks() argument
1369 Reachable.insert(BB); in markAliveBlocks()
1507 if (Reachable.insert(Successor).second) in markAliveBlocks()
1551 SmallPtrSet<BasicBlock*, 16> Reachable; in removeUnreachableBlocks() local
1552 bool Changed = markAliveBlocks(F, Reachable); in removeUnreachableBlocks()
1555 if (Reachable.size() == F.size()) in removeUnreachableBlocks()
1558 assert(Reachable.size() < F.size()); in removeUnreachableBlocks()
1559 NumRemoved += F.size()-Reachable.size(); in removeUnreachableBlocks()
1564 if (Reachable.count(&*BB)) in removeUnreachableBlocks()
1568 if (Reachable.count(Successor)) in removeUnreachableBlocks()
[all …]
|
| /external/clang/lib/Sema/ |
| D | JumpDiagnostics.cpp | 696 llvm::BitVector Reachable(Scopes.size(), false); in VerifyIndirectJumps() local
702 Reachable.reset(); in VerifyIndirectJumps()
709 Reachable.set(Min); in VerifyIndirectJumps()
733 if (Reachable.test(Scope)) { in VerifyIndirectJumps()
737 Reachable.set(S); in VerifyIndirectJumps()
|
| /external/llvm-project/clang/lib/Tooling/Syntax/ |
| D | Tree.cpp | 132 auto Reachable = [](Node *From, Node *N) { in replaceChildRangeLowLevel() local
140 assert(Reachable(FirstChild, Begin) && "`Begin` is not reachable."); in replaceChildRangeLowLevel()
141 assert(Reachable(Begin, End) && "`End` is not after `Begin`."); in replaceChildRangeLowLevel()
|
| /external/llvm-project/clang/lib/Sema/ |
| D | JumpDiagnostics.cpp | 753 llvm::BitVector Reachable(Scopes.size(), false); in VerifyIndirectOrAsmJumps() local
759 Reachable.reset(); in VerifyIndirectOrAsmJumps()
766 Reachable.set(Min); in VerifyIndirectOrAsmJumps()
790 if (Reachable.test(Scope)) { in VerifyIndirectOrAsmJumps()
794 Reachable.set(S); in VerifyIndirectOrAsmJumps()
|
| /external/llvm-project/clang/include/clang/StaticAnalyzer/Core/PathSensitive/ |
| D | ProgramState.h | 368 bool scanReachableSymbols(llvm::iterator_range<region_iterator> Reachable,
373 scanReachableSymbols(llvm::iterator_range<region_iterator> Reachable) const;
855 llvm::iterator_range<region_iterator> Reachable) const { in scanReachableSymbols() argument
857 scanReachableSymbols(Reachable, cb); in scanReachableSymbols()
|