| /external/llvm/include/llvm/ADT/ |
| D | DepthFirstIterator.h | 49 SetType Visited;
55 df_iterator_storage(SetType &VSet) : Visited(VSet) {} in df_iterator_storage()
56 df_iterator_storage(const df_iterator_storage &S) : Visited(S.Visited) {} in df_iterator_storage()
57 SetType &Visited; variable
81 this->Visited.insert(Node); in df_iterator()
93 this->Visited.insert(Node); in df_iterator()
115 if (Next && !this->Visited.count(Next)) { in toNext()
117 this->Visited.insert(Next); in toNext()
183 return this->Visited.count(Node) != 0; in nodeVisited()
|
| D | PostOrderIterator.h | 29 SetType Visited;
43 po_iterator_storage(SetType &VSet) : Visited(VSet) {} in po_iterator_storage()
44 po_iterator_storage(const po_iterator_storage &S) : Visited(S.Visited) {} in po_iterator_storage()
45 SetType &Visited; variable
67 if (this->Visited.insert(BB)) { // If the block is not visited... in traverseChild()
74 this->Visited.insert(BB); in po_iterator()
82 if (this->Visited.insert(BB)) { in po_iterator()
121 this->Visited);
|
| /external/clang/lib/Serialization/ |
| D | ModuleManager.cpp | 178 llvm::SmallPtrSet<ModuleFile *, 4> &Visited) { in visitDepthFirst() argument
187 if (!Visited.insert(*IM)) in visitDepthFirst()
190 if (visitDepthFirst(**IM, Visitor, UserData, Visited)) in visitDepthFirst()
201 llvm::SmallPtrSet<ModuleFile *, 4> Visited; in visitDepthFirst() local
203 if (!Visited.insert(Chain[I])) in visitDepthFirst()
206 if (::visitDepthFirst(*Chain[I], Visitor, UserData, Visited)) in visitDepthFirst()
|
| /external/llvm/include/llvm/Analysis/ |
| D | IntervalIterator.h | 92 std::set<BasicBlock*> Visited; variable
168 if (Visited.count(Header)) return false; in ProcessInterval()
171 Visited.insert(Header); // The header has now been visited! in ProcessInterval()
197 if (Visited.count(NodeHeader)) { // Node already been visited? in ProcessNode()
217 Visited.insert(NodeHeader); // The node has now been visited! in ProcessNode()
|
| D | DominatorInternals.h | 116 SmallPtrSet<typename GraphT::NodeType*, 32> Visited; in Eval() local
128 if (Visited.insert(VAncestor) && VInfo.Parent >= LastLinked) { in Eval()
|
| /external/llvm/lib/Analysis/ |
| D | Lint.cpp | 100 SmallPtrSet<Value *, 4> &Visited) const;
557 SmallPtrSet<Value *, 4> Visited; in findValue() local
558 return findValueImpl(V, OffsetOk, Visited); in findValue()
563 SmallPtrSet<Value *, 4> &Visited) const { in findValueImpl()
565 if (!Visited.insert(V)) in findValueImpl()
582 return findValueImpl(U, OffsetOk, Visited); in findValueImpl()
591 return findValueImpl(W, OffsetOk, Visited); in findValueImpl()
595 return findValueImpl(CI->getOperand(0), OffsetOk, Visited); in findValueImpl()
600 return findValueImpl(W, OffsetOk, Visited); in findValueImpl()
609 return findValueImpl(CE->getOperand(0), OffsetOk, Visited); in findValueImpl()
[all …]
|
| D | CaptureTracking.cpp | 80 SmallSet<Use*, Threshold> Visited; in PointerMayBeCaptured() local
92 Visited.insert(U); in PointerMayBeCaptured()
147 if (Visited.insert(U)) in PointerMayBeCaptured()
|
| D | MemoryDependenceAnalysis.cpp | 722 SmallPtrSet<BasicBlock*, 64> Visited; in getNonLocalCallDependency() local
733 if (!Visited.insert(DirtyBB)) in getNonLocalCallDependency()
829 DenseMap<BasicBlock*, Value*> Visited; in getNonLocalPointerDependency() local
831 Result, Visited, true)) in getNonLocalPointerDependency()
962 DenseMap<BasicBlock*, Value*> &Visited, in getNonLocalPointerDepFromBB() argument
1000 isLoad, StartBB, Result, Visited, in getNonLocalPointerDepFromBB()
1019 isLoad, StartBB, Result, Visited, in getNonLocalPointerDepFromBB()
1034 if (!Visited.empty()) { in getNonLocalPointerDepFromBB()
1037 DenseMap<BasicBlock*, Value*>::iterator VI = Visited.find(I->getBB()); in getNonLocalPointerDepFromBB()
1038 if (VI == Visited.end() || VI->second == Pointer.getAddr()) in getNonLocalPointerDepFromBB()
[all …]
|
| D | BasicAliasAnalysis.cpp | 525 SmallPtrSet<const Value*, 16> Visited; member
574 assert(Visited.empty() && "Visited must be cleared after use!"); in pointsToConstantMemory()
581 if (!Visited.insert(V)) { in pointsToConstantMemory()
582 Visited.clear(); in pointsToConstantMemory()
596 Visited.clear(); in pointsToConstantMemory()
614 Visited.clear(); in pointsToConstantMemory()
623 Visited.clear(); in pointsToConstantMemory()
628 Visited.clear(); in pointsToConstantMemory()
|
| /external/llvm/lib/Transforms/Scalar/ |
| D | LoopInstSimplify.cpp | 82 SmallPtrSet<BasicBlock*, 32> Visited; in runOnLoop() local
90 Visited.clear(); in runOnLoop()
136 if (!Visited.insert(SuccBB)) in runOnLoop()
149 if (LI->getLoopFor(ExitBB) == L && Visited.insert(ExitBB)) in runOnLoop()
|
| D | ObjCARC.cpp | 1197 SmallPtrSet<const Value *, 8> Visited; in isStoredObjCPointer() local
1200 Visited.insert(P); in isStoredObjCPointer()
1219 if (Visited.insert(Ur)) in isStoredObjCPointer()
2091 SmallPtrSet<const BasicBlock *, 4> &Visited, in FindDependencies() argument
2113 if (Visited.insert(PredBB)) in FindDependencies()
2130 for (SmallPtrSet<const BasicBlock *, 4>::const_iterator I = Visited.begin(), in FindDependencies()
2131 E = Visited.end(); I != E; ++I) { in FindDependencies()
2138 if (Succ != StartBB && !Visited.count(Succ)) { in FindDependencies()
2415 SmallPtrSet<const BasicBlock *, 4> Visited; in OptimizeIndividualCalls() local
2428 DependingInstructions, Visited, PA); in OptimizeIndividualCalls()
[all …]
|
| D | LoopUnswitch.cpp | 508 std::set<BasicBlock*> &Visited) { in isTrivialLoopExitBlockHelper() argument
509 if (!Visited.insert(BB).second) { in isTrivialLoopExitBlockHelper()
524 if (!isTrivialLoopExitBlockHelper(L, *SI, ExitBB, Visited)) in isTrivialLoopExitBlockHelper()
541 std::set<BasicBlock*> Visited; in isTrivialLoopExitBlock() local
542 Visited.insert(L->getHeader()); // Branches to header make infinite loops. in isTrivialLoopExitBlock()
544 if (isTrivialLoopExitBlockHelper(L, BB, ExitBB, Visited)) in isTrivialLoopExitBlock()
|
| /external/clang/lib/Analysis/ |
| D | ReachableCode.cpp | 30 llvm::BitVector Visited; member in __anone93000450111::DeadCodeScan
41 : Visited(reachable.size()), in DeadCodeScan()
59 if (Reachable[blockID] || Visited[blockID]) in enqueue()
61 Visited[blockID] = true; in enqueue()
72 if (Visited[blockID]) { in isDeadCodeRoot()
78 Visited[blockID] = true; in isDeadCodeRoot()
|
| D | AnalysisDeclContext.cpp | 338 llvm::SmallPtrSet<const VarDecl*, 4> Visited; member in __anon01aae4f40111::FindBlockDeclRefExprsVals
360 if (Visited.insert(VD)) in VisitDeclRefExpr()
363 if (Visited.insert(VD) && IsTrackedDecl(VD)) in VisitDeclRefExpr()
|
| /external/llvm/lib/CodeGen/ |
| D | ScheduleDAG.cpp | 443 Visited.resize(DAGSize); in InitDAGTopologicalSorting()
468 Visited.reset(); in AddPred()
472 Shift(Visited, LowerBound, UpperBound); in AddPred()
495 Visited.set(SU->NodeNum); in DFS()
503 if (!Visited.test(s) && Node2Index[s] < UpperBound) { in DFS()
512 void ScheduleDAGTopologicalSort::Shift(BitVector& Visited, int LowerBound, in Shift() argument
521 if (Visited.test(w)) { in Shift()
523 Visited.reset(w); in Shift()
562 Visited.reset(); in IsReachable()
|
| D | ProcessImplicitDefs.cpp | 96 SmallPtrSet<MachineBasicBlock*,16> Visited; in runOnMachineFunction() local
101 DFI = df_ext_begin(Entry, Visited), E = df_ext_end(Entry, Visited); in runOnMachineFunction()
|
| /external/clang/lib/Sema/ |
| D | SemaLookup.cpp | 1266 llvm::SmallPtrSet<DeclContext*, 8> Visited; in LookupQualifiedNameInUsingDirectives() local
1267 Visited.insert(StartDC); in LookupQualifiedNameInUsingDirectives()
1277 if (Visited.insert(ND)) in LookupQualifiedNameInUsingDirectives()
1326 if (Visited.insert(Nom)) in LookupQualifiedNameInUsingDirectives()
2867 VisibleDeclsRecord &Visited) { in LookupVisibleDecls() argument
2872 if (Visited.visitedContext(Ctx->getPrimaryContext())) in LookupVisibleDecls()
2885 Consumer.FoundDecl(ND, Visited.checkHidden(ND), Ctx, InBaseClass); in LookupVisibleDecls()
2886 Visited.add(ND); in LookupVisibleDecls()
2894 ShadowContextRAII Shadow(Visited); in LookupVisibleDecls()
2898 QualifiedNameLookup, InBaseClass, Consumer, Visited); in LookupVisibleDecls()
[all …]
|
| /external/llvm/lib/VMCore/ |
| D | Value.cpp | 340 SmallPtrSet<Value *, 4> Visited; in stripPointerCastsAndOffsets() local
342 Visited.insert(V); in stripPointerCastsAndOffsets()
370 } while (Visited.insert(V)); in stripPointerCastsAndOffsets()
391 SmallPtrSet<const Value *, 32> &Visited) { in isDereferenceablePointer() argument
413 if (!Visited.insert(GEP->getOperand(0))) in isDereferenceablePointer()
415 if (!isDereferenceablePointer(GEP->getOperand(0), Visited)) in isDereferenceablePointer()
452 SmallPtrSet<const Value *, 32> Visited; in isDereferenceablePointer() local
453 return ::isDereferenceablePointer(this, Visited); in isDereferenceablePointer()
|
| D | Globals.cpp | 242 SmallPtrSet<const GlobalValue*, 3> Visited; in resolveAliasedGlobal() local
249 Visited.insert(GV); in resolveAliasedGlobal()
258 if (!Visited.insert(GV)) in resolveAliasedGlobal()
|
| /external/clang/lib/StaticAnalyzer/Frontend/ |
| D | AnalysisConsumer.cpp | 350 SmallPtrSet<CallGraphNode*,24> Visited; in HandleDeclsGallGraph() local
357 if (Visited.count(N)) in HandleDeclsGallGraph()
372 Visited.insert(VN); in HandleDeclsGallGraph()
374 Visited.insert(N); in HandleDeclsGallGraph()
539 SetOfConstDecls *Visited) { in RunPathSensitiveChecks() argument
543 ActionExprEngine(D, false, Visited); in RunPathSensitiveChecks()
547 ActionExprEngine(D, true, Visited); in RunPathSensitiveChecks()
551 ActionExprEngine(D, false, Visited); in RunPathSensitiveChecks()
552 ActionExprEngine(D, true, Visited); in RunPathSensitiveChecks()
|
| /external/llvm/utils/TableGen/ |
| D | DFAPacketizerEmitter.cpp | 452 std::map<std::set<unsigned>, State*> Visited; in run() local
493 if ((VI = Visited.find(NewStateResources)) != Visited.end()) in run()
499 Visited[NewStateResources] = NewState; in run()
|
| /external/clang/include/clang/Sema/ |
| D | AnalysisBasedWarnings.h | 50 enum VisitFlag { NotVisited = 0, Visited = 1, Pending = 2 }; enumerator
|
| /external/llvm/lib/Transforms/Utils/ |
| D | PromoteMemoryToRegister.cpp | 236 SmallPtrSet<BasicBlock*, 16> Visited; member
563 Visited.clear(); in run()
770 SmallPtrSet<DomTreeNode*, 32> Visited; in DetermineInsertionPoint() local
803 if (!Visited.insert(SuccNode)) in DetermineInsertionPoint()
817 if (!Visited.count(*CI)) in DetermineInsertionPoint()
1066 if (!Visited.insert(BB)) return; in RenamePass()
|
| /external/clang/lib/StaticAnalyzer/Core/ |
| D | BugReporter.cpp | 1501 llvm::DenseMap<const void*,unsigned> Visited; in MakeReportGraph() local
1510 if (Visited.find(Node) != Visited.end()) in MakeReportGraph()
1513 Visited[Node] = cnt++; in MakeReportGraph()
1535 llvm::DenseMap<const void*,unsigned>::iterator I = Visited.find(N); in MakeReportGraph()
1536 assert(I != Visited.end()); in MakeReportGraph()
1570 I = Visited.find(*SI); in MakeReportGraph()
1572 if (I == Visited.end()) in MakeReportGraph()
1867 llvm::DenseMap<const ExplodedNode *, unsigned> Visited; in FindReportInEquivalenceClass() local
1871 Visited[errorNode] = 1; in FindReportInEquivalenceClass()
1894 unsigned &mark = Visited[Succ]; in FindReportInEquivalenceClass()
|
| /external/llvm/lib/CodeGen/SelectionDAG/ |
| D | ScheduleDAGSDNodes.cpp | 189 SmallPtrSet<SDNode*, 16> Visited; in ClusterNeighboringLoads() local
197 if (User == Node || !Visited.insert(User)) in ClusterNeighboringLoads()
294 SmallPtrSet<SDNode*, 64> Visited; in BuildSchedUnits() local
296 Visited.insert(DAG->getRoot().getNode()); in BuildSchedUnits()
304 if (Visited.insert(NI->getOperand(i).getNode())) in BuildSchedUnits()
|