| /external/llvm/include/llvm/ADT/ |
| 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
45 // store the visited set.
49 SetType Visited;
55 df_iterator_storage(SetType &VSet) : Visited(VSet) {}
56 df_iterator_storage(const df_iterator_storage &S) : Visited(S.Visited) {}
57 SetType &Visited;
81 this->Visited.insert(Node);
93 this->Visited.insert(Node)
[all...] |
| PostOrderIterator.h | 29 SetType Visited;
43 po_iterator_storage(SetType &VSet) : Visited(VSet) {}
44 po_iterator_storage(const po_iterator_storage &S) : Visited(S.Visited) {}
45 SetType &Visited;
67 if (this->Visited.insert(BB)) { // If the block is not visited...
74 this->Visited.insert(BB);
82 if (this->Visited.insert(BB)) {
121 this->Visited);
[all...] |
| /external/llvm/lib/Analysis/ |
| CaptureTracking.cpp | 80 SmallSet<Use*, Threshold> Visited;
92 Visited.insert(U);
147 if (Visited.insert(U))
|
| MemoryDependenceAnalysis.cpp | 722 SmallPtrSet<BasicBlock*, 64> Visited;
733 if (!Visited.insert(DirtyBB))
[all...] |
| Lint.cpp | 100 SmallPtrSet<Value *, 4> &Visited) const;
557 SmallPtrSet<Value *, 4> Visited;
558 return findValueImpl(V, OffsetOk, Visited);
563 SmallPtrSet<Value *, 4> &Visited) const {
565 if (!Visited.insert(V))
582 return findValueImpl(U, OffsetOk, Visited);
591 return findValueImpl(W, OffsetOk, Visited);
595 return findValueImpl(CI->getOperand(0), OffsetOk, Visited);
600 return findValueImpl(W, OffsetOk, Visited);
609 return findValueImpl(CE->getOperand(0), OffsetOk, Visited);
[all...] |
| BasicAliasAnalysis.cpp | 524 // Visited - Track instructions visited by pointsToConstantMemory.
525 SmallPtrSet<const Value*, 16> Visited;
574 assert(Visited.empty() && "Visited must be cleared after use!");
581 if (!Visited.insert(V)) {
582 Visited.clear();
596 Visited.clear();
614 Visited.clear();
623 Visited.clear()
[all...] |
| /external/clang/include/clang/Sema/ |
| AnalysisBasedWarnings.h | 50 enum VisitFlag { NotVisited = 0, Visited = 1, Pending = 2 };
|
| /external/llvm/lib/Transforms/Scalar/ |
| LoopInstSimplify.cpp | 82 SmallPtrSet<BasicBlock*, 32> Visited;
90 Visited.clear();
136 if (!Visited.insert(SuccBB))
149 if (LI->getLoopFor(ExitBB) == L && Visited.insert(ExitBB))
|
| ObjCARC.cpp | [all...] |
| /external/clang/lib/Serialization/ |
| ModuleManager.cpp | 144 // stack (if it hasn't already been marked as visited).
157 // stack (if it hasn't already been marked as visited).
165 // queue to be visited.
178 llvm::SmallPtrSet<ModuleFile *, 4> &Visited) {
187 if (!Visited.insert(*IM))
190 if (visitDepthFirst(**IM, Visitor, UserData, Visited))
201 llvm::SmallPtrSet<ModuleFile *, 4> Visited;
203 if (!Visited.insert(Chain[I]))
206 if (::visitDepthFirst(*Chain[I], Visitor, UserData, Visited))
|
| /external/llvm/include/llvm/Analysis/ |
| IntervalIterator.h | 92 std::set<BasicBlock*> Visited;
134 // All of the intervals on the stack have been visited. Try visiting
168 if (Visited.count(Header)) return false;
171 Visited.insert(Header); // The header has now been visited!
197 if (Visited.count(NodeHeader)) { // Node already been visited?
217 Visited.insert(NodeHeader); // The node has now been visited!
|
| DominatorInternals.h | 66 // First time we visited this BB?
92 // Visit the successor next, if it isn't already visited.
116 SmallPtrSet<typename GraphT::NodeType*, 32> Visited;
128 if (Visited.insert(VAncestor) && VInfo.Parent >= LastLinked) {
|
| /external/clang/lib/Analysis/ |
| ReachableCode.cpp | 30 llvm::BitVector Visited;
41 : Visited(reachable.size()),
59 if (Reachable[blockID] || Visited[blockID])
61 Visited[blockID] = true;
72 if (Visited[blockID]) {
78 Visited[blockID] = true;
|
| AnalysisDeclContext.cpp | 338 llvm::SmallPtrSet<const VarDecl*, 4> Visited;
360 if (Visited.insert(VD))
363 if (Visited.insert(VD) && IsTrackedDecl(VD))
|
| /external/llvm/lib/VMCore/ |
| Value.cpp | 340 SmallPtrSet<Value *, 4> Visited;
342 Visited.insert(V);
370 } while (Visited.insert(V));
391 SmallPtrSet<const Value *, 32> &Visited) {
413 if (!Visited.insert(GEP->getOperand(0)))
415 if (!isDereferenceablePointer(GEP->getOperand(0), Visited))
452 SmallPtrSet<const Value *, 32> Visited;
453 return ::isDereferenceablePointer(this, Visited);
|
| Globals.cpp | 242 SmallPtrSet<const GlobalValue*, 3> Visited;
249 Visited.insert(GV);
258 if (!Visited.insert(GV))
|
| /external/clang/lib/StaticAnalyzer/Frontend/ |
| AnalysisConsumer.cpp | 232 /// use it to define the order in which the functions should be visited.
348 // the previously processed functions. Use external Visited set, which is
350 SmallPtrSet<CallGraphNode*,24> Visited;
357 if (Visited.count(N))
367 // Add the visited callees to the global visited set.
372 Visited.insert(VN);
374 Visited.insert(N);
539 SetOfConstDecls *Visited) {
543 ActionExprEngine(D, false, Visited);
[all...] |
| /external/llvm/lib/CodeGen/ |
| ScheduleDAG.cpp | 443 Visited.resize(DAGSize);
468 Visited.reset();
472 Shift(Visited, LowerBound, UpperBound);
495 Visited.set(SU->NodeNum);
503 if (!Visited.test(s) && Node2Index[s] < UpperBound) {
512 void ScheduleDAGTopologicalSort::Shift(BitVector& Visited, int LowerBound,
521 if (Visited.test(w)) {
523 Visited.reset(w);
562 Visited.reset();
|
| ProcessImplicitDefs.cpp | 96 SmallPtrSet<MachineBasicBlock*,16> Visited;
101 DFI = df_ext_begin(Entry, Visited), E = df_ext_end(Entry, Visited);
|
| /external/llvm/utils/TableGen/ |
| DFAPacketizerEmitter.cpp | 452 std::map<std::set<unsigned>, State*> Visited;
462 // Visited = {}
469 // If S' is not in Visited:
471 // Add S' to Visited
493 if ((VI = Visited.find(NewStateResources)) != Visited.end())
499 Visited[NewStateResources] = NewState;
|
| /external/clang/lib/Sema/ |
| SemaLookup.cpp | 95 llvm::SmallPtrSet<DeclContext*, 8> visited; member in class:__anon4878::UnqualUsingDirectiveSet
129 // A given context is only every visited once, so it is important
130 // that contexts be visited from the inside out in order to get
133 if (!visited.insert(DC))
144 if (!visited.insert(NS))
161 if (visited.insert(NS)) {
[all...] |
| /external/clang/lib/StaticAnalyzer/Core/ |
| BugReporter.cpp | [all...] |
| /external/llvm/lib/Transforms/Utils/ |
| PromoteMemoryToRegister.cpp | 234 /// Visited - The set of basic blocks the renamer has already visited.
236 SmallPtrSet<BasicBlock*, 16> Visited;
562 // The renamer uses the Visited set to avoid infinite loops. Clear it now.
563 Visited.clear();
770 SmallPtrSet<DomTreeNode*, 32> Visited;
803 if (!Visited.insert(SuccNode))
817 if (!Visited.count(*CI))
[all...] |
| BasicBlockUtils.cpp | 612 SmallPtrSet<const BasicBlock*, 8> Visited;
616 Visited.insert(BB);
627 if (Visited.insert(BB)) {
|
| /external/llvm/lib/CodeGen/SelectionDAG/ |
| ScheduleDAGSDNodes.cpp | 189 SmallPtrSet<SDNode*, 16> Visited;
197 if (User == Node || !Visited.insert(User))
294 SmallPtrSet<SDNode*, 64> Visited;
296 Visited.insert(DAG->getRoot().getNode());
304 if (Visited.insert(NI->getOperand(i).getNode()))
|
