| /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/Analysis/ |
| CaptureTracking.cpp | 85 SmallSet<Use*, Threshold> Visited;
97 Visited.insert(U);
152 if (Visited.insert(U))
|
| MemoryDependenceAnalysis.cpp | 672 SmallPtrSet<BasicBlock*, 64> Visited;
683 if (!Visited.insert(DirtyBB))
779 DenseMap<BasicBlock*, Value*> Visited;
781 Result, Visited, true))
[all...] |
| Lint.cpp | 100 SmallPtrSet<Value *, 4> &Visited) const;
591 SmallPtrSet<Value *, 4> Visited;
592 return findValueImpl(V, OffsetOk, Visited);
597 SmallPtrSet<Value *, 4> &Visited) const {
599 if (!Visited.insert(V))
616 return findValueImpl(U, OffsetOk, Visited);
625 return findValueImpl(W, OffsetOk, Visited);
629 return findValueImpl(CI->getOperand(0), OffsetOk, Visited);
634 return findValueImpl(W, OffsetOk, Visited);
643 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...] |
| /external/clang/include/clang/Sema/ |
| AnalysisBasedWarnings.h | 50 enum VisitFlag { NotVisited = 0, Visited = 1, Pending = 2 };
|
| /external/llvm/lib/Transforms/ObjCARC/ |
| DependencyAnalysis.h | 57 SmallPtrSet<const BasicBlock *, 4> &Visited,
|
| DependencyAnalysis.cpp | 208 SmallPtrSet<const BasicBlock *, 4> &Visited,
230 if (Visited.insert(PredBB))
245 // visited. If not, insert a sentinal indicating that most optimizations are
247 for (SmallPtrSet<const BasicBlock *, 4>::const_iterator I = Visited.begin(),
248 E = Visited.end(); I != E; ++I) {
255 if (Succ != StartBB && !Visited.count(Succ)) {
|
| ProvenanceAnalysis.cpp | 76 SmallPtrSet<const Value *, 8> Visited;
79 Visited.insert(P);
98 if (Visited.insert(Ur))
|
| ObjCARCContract.cpp | 88 &Visited);
182 &Visited) {
191 DependingInstructions, Visited, PA);
195 DependingInstructions, Visited, PA);
197 Visited.clear();
373 SmallPtrSet<const BasicBlock *, 4> Visited;
389 if (ContractAutorelease(F, Inst, Class, DependingInstructions, Visited))
|
| ObjCARCOpts.cpp | 226 DEBUG(dbgs() << "DoesRetainableObjPtrEscape: Already visited node."
[all...] |
| /external/llvm/lib/Transforms/Scalar/ |
| LoopInstSimplify.cpp | 83 SmallPtrSet<BasicBlock*, 32> Visited;
91 Visited.clear();
137 if (!Visited.insert(SuccBB))
150 if (LI->getLoopFor(ExitBB) == L && Visited.insert(ExitBB))
|
| /external/clang/lib/Serialization/ |
| ModuleManager.cpp | 182 assert(State->NextState == 0 && "Visited state is in list?");
235 // stack (if it hasn't already been marked as visited).
243 // queue to be visited.
266 // index that is *not* in that set as 'visited'.
290 // behavior, we mark all of the reachable modules as having been visited.
294 // stack (if it hasn't already been marked as visited).
322 SmallVectorImpl<bool> &Visited) {
331 if (Visited[(*IM)->Index])
333 Visited[(*IM)->Index] = true;
335 if (visitDepthFirst(**IM, Visitor, UserData, Visited))
[all...] |
| /external/clang/lib/StaticAnalyzer/Frontend/ |
| AnalysisConsumer.cpp | 289 getInliningModeForFunction(const Decl *D, SetOfConstDecls Visited);
292 /// use it to define the order in which the functions should be visited.
391 SetOfConstDecls Visited,
406 // Otherwise, if we visited the function before, do not reanalyze it.
407 return Visited.count(D);
412 SetOfConstDecls Visited) {
420 if (Visited.count(D)) {
443 // the previously processed functions. Use external Visited set to identify
447 SetOfConstDecls Visited;
463 if (shouldSkipFunction(D, Visited, VisitedAsTopLevel)
[all...] |
| /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;
|
| /external/llvm/lib/CodeGen/ |
| ScheduleDAG.cpp | 502 Visited.resize(DAGSize);
527 Visited.reset();
531 Shift(Visited, LowerBound, UpperBound);
554 Visited.set(SU->NodeNum);
565 if (!Visited.test(s) && Node2Index[s] < UpperBound) {
574 void ScheduleDAGTopologicalSort::Shift(BitVector& Visited, int LowerBound,
583 if (Visited.test(w)) {
585 Visited.reset(w);
625 Visited.reset();
|
| /external/llvm/lib/Target/R600/ |
| AMDGPUStructurizeCFG.cpp | 180 BBSet Visited;
296 if (Visited.count(Exit))
307 if (Visited.count(Succ))
385 if (Visited.count(*PI)) {
390 if (Visited.count(Other) && !Loops.count(Other) &&
417 if (Visited.count(Entry))
435 // Reset the visited nodes
436 Visited.clear();
445 Visited.insert((*OI)->getEntry());
731 Visited.insert(Node->getEntry())
[all...] |
| /external/llvm/lib/IR/ |
| Value.cpp | 347 SmallPtrSet<Value *, 4> Visited;
349 Visited.insert(V);
377 } while (Visited.insert(V));
398 SmallPtrSet<const Value *, 32> &Visited) {
420 if (!Visited.insert(GEP->getOperand(0)))
422 if (!isDereferenceablePointer(GEP->getOperand(0), Visited))
459 SmallPtrSet<const Value *, 32> Visited;
460 return ::isDereferenceablePointer(this, Visited);
|
| Globals.cpp | 248 SmallPtrSet<const GlobalValue*, 3> Visited;
255 Visited.insert(GV);
264 if (!Visited.insert(GV))
|
| /external/llvm/utils/TableGen/ |
| DFAPacketizerEmitter.cpp | 455 std::map<std::set<unsigned>, State*> Visited;
465 // Visited = {}
472 // If S' is not in Visited:
474 // Add S' to Visited
498 if ((VI = Visited.find(NewStateResources)) != Visited.end())
504 Visited[NewStateResources] = NewState;
|
| /external/clang/lib/Sema/ |
| SemaLookup.cpp | 95 llvm::SmallPtrSet<DeclContext*, 8> visited; member in class:__anon5879::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/llvm/lib/Transforms/Utils/ |
| PromoteMemoryToRegister.cpp | 238 /// Visited - The set of basic blocks the renamer has already visited.
240 SmallPtrSet<BasicBlock*, 16> Visited;
566 // The renamer uses the Visited set to avoid infinite loops. Clear it now.
567 Visited.clear();
778 SmallPtrSet<DomTreeNode*, 32> Visited;
811 if (!Visited.insert(SuccNode))
825 if (!Visited.count(*CI))
[all...] |
