| /external/llvm/lib/Analysis/ |
| CaptureTracking.cpp | 80 SmallSet<Use*, Threshold> Visited;
92 Visited.insert(U);
147 if (Visited.insert(U))
|
| 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 | 496 // Visited - Track instructions visited by pointsToConstantMemory.
497 SmallPtrSet<const Value*, 16> Visited;
547 assert(Visited.empty() && "Visited must be cleared after use!");
554 if (!Visited.insert(V)) {
555 Visited.clear();
569 Visited.clear();
587 Visited.clear();
596 Visited.clear()
[all...] |
| InlineCost.cpp | 749 SmallPtrSet<Value *, 4> Visited;
750 Visited.insert(V);
766 } while (Visited.insert(V));
[all...] |
| MemoryDependenceAnalysis.cpp | 656 SmallPtrSet<BasicBlock*, 64> Visited;
667 if (!Visited.insert(DirtyBB))
763 DenseMap<BasicBlock*, Value*> Visited;
765 Result, Visited, true))
[all...] |
| InstructionSimplify.cpp | 709 SmallPtrSet<Value *, 4> Visited;
710 Visited.insert(V);
726 } while (Visited.insert(V));
[all...] |
| ValueTracking.cpp | [all...] |
| /external/clang/include/clang/Sema/ |
| AnalysisBasedWarnings.h | 50 enum VisitFlag { NotVisited = 0, Visited = 1, Pending = 2 };
|
| /external/llvm/include/llvm/Analysis/ |
| 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) {
|
| 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!
|
| ScalarEvolutionExpressions.h | 509 SmallPtrSet<const SCEV *, 8> Visited;
512 if (Visited.insert(S) && Visitor.follow(S))
|
| /external/llvm/lib/VMCore/ |
| Globals.cpp | 242 SmallPtrSet<const GlobalValue*, 3> Visited;
249 Visited.insert(GV);
258 if (!Visited.insert(GV))
|
| 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);
|
| /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 | 357 llvm::SmallPtrSet<const VarDecl*, 4> Visited;
379 if (Visited.insert(VD))
382 if (Visited.insert(VD) && IsTrackedDecl(VD))
|
| /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/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 | 27 // visited nodes during the po_iterator's depth-first traversal.
29 // The default implementation simply contains a set of visited nodes, while
35 // those nodes won't be visited again. This is useful for restarting a
55 SetType Visited;
57 // Return true if edge destination should be visited.
60 return Visited.insert(To);
63 // Called after all children of BB have been visited.
71 SetType &Visited;
73 po_iterator_storage(SetType &VSet) : Visited(VSet) {}
74 po_iterator_storage(const po_iterator_storage &S) : Visited(S.Visited) {
[all...] |
| /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))
|
| Reassociate.cpp | 497 SmallPtrSet<Value*, 8> Visited; // For sanity checking the iteration scheme.
519 assert(Visited.insert(Op) && "Not first visit!");
529 assert(Visited.insert(Op) && "Not first visit!");
541 assert(Visited.count(Op) && "In leaf map but not visited!");
[all...] |
| /external/llvm/utils/TableGen/ |
| DFAPacketizerEmitter.cpp | 446 std::map<std::set<unsigned>, State*> Visited;
456 // Visited = {}
463 // If S' is not in Visited:
465 // Add S' to Visited
489 if ((VI = Visited.find(NewStateResources)) != Visited.end())
495 Visited[NewStateResources] = NewState;
|
| /external/llvm/lib/CodeGen/ |
| LiveVariables.cpp | 529 SmallPtrSet<MachineBasicBlock*,16> Visited;
532 DFI = df_ext_begin(Entry, Visited), E = df_ext_end(Entry, Visited);
690 assert(Visited.count(&*i) != 0 && "unreachable basic block found");
|
| /external/llvm/lib/Transforms/Utils/ |
| Local.cpp | 343 SmallPtrSet<Instruction*, 4> Visited;
351 if (!Visited.insert(I)) {
[all...] |
| /external/clang/lib/StaticAnalyzer/Frontend/ |
| AnalysisConsumer.cpp | 268 /// use it to define the order in which the functions should be visited.
351 SmallPtrSet<CallGraphNode*,24> Visited) {
362 // Otherwise, if we visited the function before, do not reanalyze it.
363 return Visited.count(N);
405 // the previously processed functions. Use external Visited set, which is
407 SmallPtrSet<CallGraphNode*,24> Visited;
415 if (!shouldSkipFunction(*CI, Visited))
421 if (shouldSkipFunction(N, Visited))
431 // Add the visited callees to the global visited set
[all...] |
| /external/llvm/include/llvm/CodeGen/ |
| ScheduleDAG.h | 674 /// Visited - a set of nodes visited during a DFS traversal.
675 BitVector Visited;
684 void Shift(BitVector& Visited, int LowerBound, int UpperBound);
|
