| /external/llvm/lib/Analysis/ |
| CodeMetrics.cpp | 32 SmallPtrSet<const Value *, 32> Visited;
44 if (!Visited.insert(V).second)
|
| CFG.cpp | 33 SmallPtrSet<const BasicBlock*, 8> Visited;
37 Visited.insert(BB);
48 if (Visited.insert(BB).second) {
141 SmallSet<const BasicBlock*, 64> Visited;
144 if (!Visited.insert(BB).second)
|
| CaptureTracking.cpp | 216 SmallSet<const Use *, Threshold> Visited;
226 Visited.insert(&U);
287 if (Visited.insert(&UU).second)
|
| LazyCallGraph.cpp | 24 SmallVectorImpl<Constant *> &Worklist, SmallPtrSetImpl<Constant *> &Visited,
51 if (Visited.insert(cast<Constant>(Op)).second)
62 SmallPtrSet<Constant *, 16> Visited;
69 if (Visited.insert(C).second)
75 findCallees(Worklist, Visited, Callees, CalleeIndexMap);
113 SmallPtrSet<Constant *, 16> Visited;
116 if (Visited.insert(GV.getInitializer()).second)
121 findCallees(Worklist, Visited, EntryNodes, EntryIndexMap);
|
| VectorUtils.cpp | 452 SmallPtrSet<Value *, 16> Visited;
489 if (Visited.count(Val))
491 Visited.insert(Val);
|
| GlobalsModRef.cpp | 625 SmallPtrSet<const Value *, 8> Visited;
627 Visited.insert(V);
656 if (Visited.insert(LHS).second)
658 if (Visited.insert(RHS).second)
665 if (Visited.insert(Op).second)
711 SmallPtrSet<const Value *, 8> Visited;
713 Visited.insert(V);
773 if (Visited.insert(LHS).second)
775 if (Visited.insert(RHS).second)
782 if (Visited.insert(Op).second
[all...] |
| /external/llvm/include/llvm/Analysis/ |
| DemandedBits.h | 65 // The set of visited instructions (non-integer-typed only).
66 SmallPtrSet<Instruction*, 128> Visited;
|
| BasicAliasAnalysis.h | 115 /// Tracks phi nodes we have visited.
131 /// Tracks instructions visited by pointsToConstantMemory.
132 SmallPtrSet<const Value *, 16> Visited;
|
| IntervalIterator.h | 92 std::set<BasicBlock*> Visited;
108 : IntStack(std::move(x.IntStack)), Visited(std::move(x.Visited)),
141 // All of the intervals on the stack have been visited. Try visiting
177 if (!Visited.insert(Header).second)
206 if (Visited.count(NodeHeader)) { // Node already been visited?
226 Visited.insert(NodeHeader); // The node has now been visited!
|
| /external/llvm/lib/Transforms/ObjCARC/ |
| ProvenanceAnalysis.cpp | 77 SmallPtrSet<const Value *, 8> Visited;
80 Visited.insert(P);
98 if (Visited.insert(Ur).second)
|
| ObjCARCContract.cpp | 80 SmallPtrSetImpl<const BasicBlock *> &Visited,
89 SmallPtrSetImpl<const BasicBlock *> &Visited);
149 SmallPtrSetImpl<const BasicBlock *> &Visited) {
158 DependingInstructions, Visited, PA);
162 DependingInstructions, Visited, PA);
164 Visited.clear();
407 SmallPtrSetImpl<const BasicBlock *> &Visited,
418 return contractAutorelease(F, Inst, Class, DependingInsts, Visited);
533 SmallPtrSet<const BasicBlock *, 4> Visited;
541 if (tryToPeepholeInstruction(F, Inst, I, DependingInstructions, Visited,
[all...] |
| /external/clang/include/clang/Sema/ |
| AnalysisBasedWarnings.h | 51 enum VisitFlag { NotVisited = 0, Visited = 1, Pending = 2 };
|
| /external/llvm/include/llvm/Support/ |
| GenericDomTreeConstruction.h | 65 // First time we visited this BB?
91 // Visit the successor next, if it isn't already visited.
115 SmallPtrSet<typename GraphT::NodeType*, 32> Visited;
127 if (Visited.insert(VAncestor).second && VInfo.Parent >= LastLinked) {
|
| /external/llvm/include/llvm/ADT/ |
| SCCIterator.h | 159 typename DenseMap<NodeType *, unsigned>::iterator Visited =
161 if (Visited == nodeVisitNumbers.end()) {
167 unsigned childNum = Visited->second;
|
| DepthFirstIterator.h | 21 // This iterator stores the 'visited' set in an external set, which allows
27 // This iterator stores the 'visited' set in an external set, which allows
46 // store the visited set.
50 SetType Visited;
56 df_iterator_storage(SetType &VSet) : Visited(VSet) {}
57 df_iterator_storage(const df_iterator_storage &S) : Visited(S.Visited) {}
58 SetType &Visited;
82 this->Visited.insert(Node);
94 this->Visited.insert(Node)
[all...] |
| PostOrderIterator.h | 28 // visited nodes during the po_iterator's depth-first traversal.
30 // The default implementation simply contains a set of visited nodes, while
36 // those nodes won't be visited again. This is useful for restarting a
56 SetType Visited;
58 // Return true if edge destination should be visited.
61 return Visited.insert(To).second;
64 // Called after all children of BB have been visited.
72 SetType &Visited;
74 po_iterator_storage(SetType &VSet) : Visited(VSet) {}
75 po_iterator_storage(const po_iterator_storage &S) : Visited(S.Visited) {
[all...] |
| /external/llvm/lib/Transforms/Scalar/ |
| LoopInstSimplify.cpp | 95 SmallPtrSet<BasicBlock*, 32> Visited;
103 Visited.clear();
157 if (!Visited.insert(SuccBB).second)
170 if (LI->getLoopFor(ExitBB) == L && Visited.insert(ExitBB).second)
|
| AlignmentFromAssumptions.cpp | 314 SmallPtrSet<Instruction *, 32> Visited;
402 Visited.insert(J);
405 if (!Visited.count(K) && isValidAssumeForContext(ACall, K, DT))
|
| /external/llvm/lib/Target/PowerPC/ |
| PPCCTRLoops.cpp | 608 SmallSet<MachineBasicBlock *, 16> Visited;
613 Visited.insert(MBB);
619 Visited.insert(MBB);
665 if (!Visited.count(MBB)) {
|
| /external/llvm/lib/Target/WebAssembly/ |
| WebAssemblyCFGStackify.cpp | 176 // successors are visited in (see above). Also, we can sort the blocks in the
178 SmallPtrSet<MachineBasicBlock *, 16> Visited;
182 Visited.insert(EntryBlock);
190 if (Visited.insert(Succ).second)
|
| /external/llvm/lib/Transforms/IPO/ |
| FunctionAttrs.cpp | 409 SmallSet<Use *, 32> Visited;
419 Visited.insert(&U);
435 if (Visited.insert(&UU).second)
449 if (Visited.insert(&UU).second)
[all...] |
| /external/mesa3d/src/gallium/drivers/radeon/ |
| R600KernelParameters.cpp | 73 bool IsIndirect(Value *Val, std::set<Value*> &Visited);
139 bool R600KernelParameters::IsIndirect(Value *Val, std::set<Value*> &Visited) {
152 if (Visited.count(Val)) {
156 Visited.insert(Val);
173 if (IsIndirect(V2, Visited)) {
191 std::set<Value*> Visited;
192 P.IsIndirect = IsIndirect(P.Val, Visited);
|
| /external/clang/lib/Analysis/ |
| AnalysisDeclContext.cpp | 484 llvm::SmallPtrSet<const VarDecl*, 4> Visited;
501 if (Visited.insert(VD).second)
|
| ReachableCode.cpp | 345 llvm::BitVector Visited;
357 : Visited(reachable.size()),
377 if (Reachable[blockID] || Visited[blockID])
379 Visited[blockID] = true;
390 if (Visited[blockID]) {
396 Visited[blockID] = true;
|
| /external/clang/lib/Lex/ |
| PPMacroExpansion.cpp | 235 llvm::DenseSet<ModuleMacro*> Visited;
256 if (Visited.insert(O).second)
[all...] |
