| /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 | 50 SmallSet<Use*, Threshold> Visited;
61 Visited.insert(U);
124 if (Visited.insert(U))
|
| MemoryDependenceAnalysis.cpp | 634 SmallPtrSet<BasicBlock*, 64> Visited;
645 if (!Visited.insert(DirtyBB))
741 DenseMap<BasicBlock*, Value*> Visited;
743 Result, Visited, true))
[all...] |
| Lint.cpp | 99 SmallPtrSet<Value *, 4> &Visited) const;
554 SmallPtrSet<Value *, 4> Visited;
555 return findValueImpl(V, OffsetOk, Visited);
560 SmallPtrSet<Value *, 4> &Visited) const {
562 if (!Visited.insert(V))
579 return findValueImpl(U, OffsetOk, Visited);
588 return findValueImpl(W, OffsetOk, Visited);
592 return findValueImpl(CI->getOperand(0), OffsetOk, Visited);
597 return findValueImpl(W, OffsetOk, Visited);
606 return findValueImpl(CE->getOperand(0), OffsetOk, Visited);
[all...] |
| BasicAliasAnalysis.cpp | 523 // Visited - Track instructions visited by pointsToConstantMemory.
524 SmallPtrSet<const Value*, 16> Visited;
573 assert(Visited.empty() && "Visited must be cleared after use!");
580 if (!Visited.insert(V)) {
581 Visited.clear();
595 Visited.clear();
613 Visited.clear();
622 Visited.clear()
[all...] |
| BranchProbabilityInfo.cpp | 88 SmallPtrSet<BasicBlock *, 8> Visited;
102 Visited.insert(BB);
106 if (Visited.count(BB))
|
| /external/clang/include/clang/Sema/ |
| AnalysisBasedWarnings.h | 50 enum VisitFlag { NotVisited = 0, Visited = 1, Pending = 2 };
|
| /external/llvm/lib/Transforms/Scalar/ |
| LoopInstSimplify.cpp | 78 SmallPtrSet<BasicBlock*, 32> Visited;
86 Visited.clear();
132 if (!Visited.insert(SuccBB))
145 if (LI->getLoopFor(ExitBB) == L && Visited.insert(ExitBB))
|
| ObjCARC.cpp | [all...] |
| LoopUnswitch.cpp | 298 std::set<BasicBlock*> &Visited) {
299 if (!Visited.insert(BB).second) {
300 // Already visited. Without more analysis, this could indicate an infinte loop.
313 if (!isTrivialLoopExitBlockHelper(L, *SI, ExitBB, Visited))
330 std::set<BasicBlock*> Visited;
331 Visited.insert(L->getHeader()); // Branches to header make infinite loops.
333 if (isTrivialLoopExitBlockHelper(L, BB, ExitBB, Visited))
[all...] |
| /external/clang/lib/Serialization/ |
| ModuleManager.cpp | 143 // stack (if it hasn't already been marked as visited).
156 // stack (if it hasn't already been marked as visited).
164 // queue to be visited.
177 llvm::SmallPtrSet<Module *, 4> &Visited) {
186 if (!Visited.insert(*IM))
189 if (visitDepthFirst(**IM, Visitor, UserData, Visited))
200 llvm::SmallPtrSet<Module *, 4> Visited;
202 if (!Visited.insert(Chain[I]))
205 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;
|
| AnalysisContext.cpp | 311 llvm::DenseMap<const VarDecl*, unsigned> Visited;
333 unsigned &flag = Visited[VD];
343 unsigned &flag = Visited[VD];
|
| /external/webkit/Source/WebKit/android/nav/ |
| CachedHistory.h | 31 #define NAVIGATION_VISIT_DEPTH 8 // the number of nodes last visited -- used to detect ping-ponging (number should be tuned)
38 // It uses blind pointers for comparison in the previously visited nodes.
60 struct Visited {
|
| /external/llvm/lib/CodeGen/ |
| ScheduleDAG.cpp | 473 Visited.resize(DAGSize);
498 Visited.reset();
502 Shift(Visited, LowerBound, UpperBound);
525 Visited.set(SU->NodeNum);
533 if (!Visited.test(s) && Node2Index[s] < UpperBound) {
542 void ScheduleDAGTopologicalSort::Shift(BitVector& Visited, int LowerBound,
551 if (Visited.test(w)) {
553 Visited.reset(w);
592 Visited.reset();
|
| ProcessImplicitDefs.cpp | 95 SmallPtrSet<MachineBasicBlock*,16> Visited;
100 DFI = df_ext_begin(Entry, Visited), E = df_ext_end(Entry, Visited);
|
| ExecutionDepsFix.cpp | 481 SmallPtrSet<MachineBasicBlock*, 16> Visited;
483 DFI = df_ext_begin(Entry, Visited), DFE = df_ext_end(Entry, Visited);
|
| /external/clang/lib/Sema/ |
| SemaLookup.cpp | 93 llvm::SmallPtrSet<DeclContext*, 8> visited; member in class:__anon4441::UnqualUsingDirectiveSet
125 // A given context is only every visited once, so it is important
126 // that contexts be visited from the inside out in order to get
129 if (!visited.insert(DC))
140 if (!visited.insert(NS))
157 if (visited.insert(NS)) {
[all...] |
| /external/llvm/lib/VMCore/ |
| Globals.cpp | 242 SmallPtrSet<const GlobalValue*, 3> Visited;
249 Visited.insert(GV);
258 if (!Visited.insert(GV))
|
| Value.cpp | 317 SmallPtrSet<Value *, 4> Visited;
320 Visited.insert(V);
336 } while (Visited.insert(V));
|
| /external/clang/lib/StaticAnalyzer/Core/ |
| BugReporter.cpp | [all...] |
| /external/llvm/lib/Transforms/Utils/ |
| PromoteMemoryToRegister.cpp | 232 /// Visited - The set of basic blocks the renamer has already visited.
234 SmallPtrSet<BasicBlock*, 16> Visited;
559 // The renamer uses the Visited set to avoid infinite loops. Clear it now.
560 Visited.clear();
767 SmallPtrSet<DomTreeNode*, 32> Visited;
800 if (!Visited.insert(SuccNode))
814 if (!Visited.count(*CI))
[all...] |
