| /external/llvm/include/llvm/ADT/ |
| D | DepthFirstIterator.h | 50 SetType Visited;
56 df_iterator_storage(SetType &VSet) : Visited(VSet) {} in df_iterator_storage()
57 df_iterator_storage(const df_iterator_storage &S) : Visited(S.Visited) {} in df_iterator_storage()
58 SetType &Visited; variable
82 this->Visited.insert(Node); in df_iterator()
94 this->Visited.insert(Node); in df_iterator()
116 if (Next && this->Visited.insert(Next).second) { in toNext()
184 return this->Visited.count(Node) != 0; in nodeVisited()
|
| D | PostOrderIterator.h | 56 SetType Visited; variable
61 return Visited.insert(To).second; in insertEdge()
72 SetType &Visited; variable
74 po_iterator_storage(SetType &VSet) : Visited(VSet) {} in po_iterator_storage()
75 po_iterator_storage(const po_iterator_storage &S) : Visited(S.Visited) {} in po_iterator_storage()
81 return Visited.insert(To).second; in insertEdge()
|
| D | SCCIterator.h | 159 typename DenseMap<NodeType *, unsigned>::iterator Visited = in DFSVisitChildren() local
161 if (Visited == nodeVisitNumbers.end()) { in DFSVisitChildren()
167 unsigned childNum = Visited->second; in DFSVisitChildren()
|
| /external/clang/lib/StaticAnalyzer/Frontend/ |
| D | AnalysisConsumer.cpp | 311 getInliningModeForFunction(const Decl *D, const SetOfConstDecls &Visited);
421 const SetOfConstDecls &Visited, in shouldSkipFunction() argument
437 return Visited.count(D); in shouldSkipFunction()
442 const SetOfConstDecls &Visited) { in getInliningModeForFunction() argument
446 if (Visited.count(D)) { in getInliningModeForFunction()
473 SetOfConstDecls Visited; in HandleDeclsCallGraph() local
489 if (shouldSkipFunction(D, Visited, VisitedAsTopLevel)) in HandleDeclsCallGraph()
495 HandleCode(D, AM_Path, getInliningModeForFunction(D, Visited), in HandleDeclsCallGraph()
501 Visited.insert(*I); in HandleDeclsCallGraph()
680 SetOfConstDecls *Visited) { in RunPathSensitiveChecks() argument
[all …]
|
| /external/llvm/include/llvm/Analysis/ |
| D | IntervalIterator.h | 92 std::set<BasicBlock*> Visited; variable
108 : IntStack(std::move(x.IntStack)), Visited(std::move(x.Visited)), in IntervalIterator()
177 if (!Visited.insert(Header).second) in ProcessInterval()
206 if (Visited.count(NodeHeader)) { // Node already been visited? in ProcessNode()
226 Visited.insert(NodeHeader); // The node has now been visited! in ProcessNode()
|
| /external/llvm/lib/Transforms/ObjCARC/ |
| D | ObjCARCContract.cpp | 80 SmallPtrSetImpl<const BasicBlock *> &Visited,
89 SmallPtrSetImpl<const BasicBlock *> &Visited);
149 SmallPtrSetImpl<const BasicBlock *> &Visited) { in contractAutorelease() argument
158 DependingInstructions, Visited, PA); in contractAutorelease()
162 DependingInstructions, Visited, PA); in contractAutorelease()
164 Visited.clear(); in contractAutorelease()
407 SmallPtrSetImpl<const BasicBlock *> &Visited, in tryToPeepholeInstruction() argument
418 return contractAutorelease(F, Inst, Class, DependingInsts, Visited); in tryToPeepholeInstruction()
533 SmallPtrSet<const BasicBlock *, 4> Visited; in runOnFunction() local
541 if (tryToPeepholeInstruction(F, Inst, I, DependingInstructions, Visited, in runOnFunction()
|
| D | DependencyAnalysis.cpp | 227 SmallPtrSetImpl<const BasicBlock *> &Visited, in FindDependencies() argument
249 if (Visited.insert(PredBB).second) in FindDependencies()
266 for (const BasicBlock *BB : Visited) { in FindDependencies()
272 if (Succ != StartBB && !Visited.count(Succ)) { in FindDependencies()
|
| D | ObjCARCOpts.cpp | 88 SmallPtrSet<const Value *, 4> Visited; in AreAnyUnderlyingObjectsAnAlloca() local
98 if (!Visited.insert(P).second) in AreAnyUnderlyingObjectsAnAlloca()
870 SmallPtrSet<const BasicBlock *, 4> Visited; in OptimizeIndividualCalls() local
884 DependingInstructions, Visited, PA); in OptimizeIndividualCalls()
890 DependingInstructions, Visited, PA); in OptimizeIndividualCalls()
1370 SmallPtrSet<BasicBlock *, 16> Visited; in ComputePostOrders() local
1383 Visited.insert(EntryBB); in ComputePostOrders()
1393 if (Visited.insert(SuccBB).second) { in ComputePostOrders()
1413 Visited.clear(); in ComputePostOrders()
1427 Visited.insert(&ExitBB); in ComputePostOrders()
[all …]
|
| D | ProvenanceAnalysis.cpp | 77 SmallPtrSet<const Value *, 8> Visited; in IsStoredObjCPointer() local
80 Visited.insert(P); in IsStoredObjCPointer()
98 if (Visited.insert(Ur).second) in IsStoredObjCPointer()
|
| /external/llvm/lib/Analysis/ |
| D | CFG.cpp | 33 SmallPtrSet<const BasicBlock*, 8> Visited; in FindFunctionBackedges() local
37 Visited.insert(BB); in FindFunctionBackedges()
48 if (Visited.insert(BB).second) { in FindFunctionBackedges()
141 SmallSet<const BasicBlock*, 64> Visited; in isPotentiallyReachableFromMany() local
144 if (!Visited.insert(BB).second) in isPotentiallyReachableFromMany()
|
| D | Lint.cpp | 104 SmallPtrSetImpl<Value *> &Visited) const;
620 SmallPtrSet<Value *, 4> Visited; in findValue() local
621 return findValueImpl(V, OffsetOk, Visited); in findValue()
626 SmallPtrSetImpl<Value *> &Visited) const { in findValueImpl()
628 if (!Visited.insert(V).second) in findValueImpl()
647 return findValueImpl(U, OffsetOk, Visited); in findValueImpl()
656 return findValueImpl(W, OffsetOk, Visited); in findValueImpl()
659 return findValueImpl(CI->getOperand(0), OffsetOk, Visited); in findValueImpl()
664 return findValueImpl(W, OffsetOk, Visited); in findValueImpl()
671 return findValueImpl(CE->getOperand(0), OffsetOk, Visited); in findValueImpl()
[all …]
|
| D | MemoryDependenceAnalysis.cpp | 859 SmallPtrSet<BasicBlock*, 64> Visited; in getNonLocalCallDependency() local
870 if (!Visited.insert(DirtyBB).second) in getNonLocalCallDependency()
993 DenseMap<BasicBlock*, Value*> Visited; in getNonLocalPointerDependency() local
995 Result, Visited, true)) in getNonLocalPointerDependency()
1125 DenseMap<BasicBlock *, Value *> &Visited, bool SkipFirstBlock) { in getNonLocalPointerDepFromBB() argument
1161 isLoad, StartBB, Result, Visited, in getNonLocalPointerDepFromBB()
1181 isLoad, StartBB, Result, Visited, in getNonLocalPointerDepFromBB()
1196 if (!Visited.empty()) { in getNonLocalPointerDepFromBB()
1199 DenseMap<BasicBlock*, Value*>::iterator VI = Visited.find(I->getBB()); in getNonLocalPointerDepFromBB()
1200 if (VI == Visited.end() || VI->second == Pointer.getAddr()) in getNonLocalPointerDepFromBB()
[all …]
|
| D | GlobalsModRef.cpp | 625 SmallPtrSet<const Value *, 8> Visited; in isNonEscapingGlobalNoAliasWithLoad() local
627 Visited.insert(V); in isNonEscapingGlobalNoAliasWithLoad()
656 if (Visited.insert(LHS).second) in isNonEscapingGlobalNoAliasWithLoad()
658 if (Visited.insert(RHS).second) in isNonEscapingGlobalNoAliasWithLoad()
665 if (Visited.insert(Op).second) in isNonEscapingGlobalNoAliasWithLoad()
711 SmallPtrSet<const Value *, 8> Visited; in isNonEscapingGlobalNoAlias() local
713 Visited.insert(V); in isNonEscapingGlobalNoAlias()
773 if (Visited.insert(LHS).second) in isNonEscapingGlobalNoAlias()
775 if (Visited.insert(RHS).second) in isNonEscapingGlobalNoAlias()
782 if (Visited.insert(Op).second) in isNonEscapingGlobalNoAlias()
|
| D | LazyCallGraph.cpp | 24 SmallVectorImpl<Constant *> &Worklist, SmallPtrSetImpl<Constant *> &Visited, in findCallees() argument
51 if (Visited.insert(cast<Constant>(Op)).second) in findCallees()
62 SmallPtrSet<Constant *, 16> Visited; in Node() local
69 if (Visited.insert(C).second) in Node()
75 findCallees(Worklist, Visited, Callees, CalleeIndexMap); in Node()
113 SmallPtrSet<Constant *, 16> Visited; in LazyCallGraph() local
116 if (Visited.insert(GV.getInitializer()).second) in LazyCallGraph()
121 findCallees(Worklist, Visited, EntryNodes, EntryIndexMap); in LazyCallGraph()
|
| D | CaptureTracking.cpp | 216 SmallSet<const Use *, Threshold> Visited; in PointerMayBeCaptured() local
226 Visited.insert(&U); in PointerMayBeCaptured()
287 if (Visited.insert(&UU).second) in PointerMayBeCaptured()
|
| D | DemandedBits.cpp | 269 Visited.clear(); in performAnalysis()
320 Visited.insert(UserI); in performAnalysis()
356 } else if (!Visited.count(I)) { in performAnalysis()
376 return !Visited.count(I) && AliveBits.find(I) == AliveBits.end() && in isInstructionDead()
|
| /external/llvm/lib/Transforms/Scalar/ |
| D | LoopInstSimplify.cpp | 95 SmallPtrSet<BasicBlock*, 32> Visited; in runOnLoop() local
103 Visited.clear(); in runOnLoop()
157 if (!Visited.insert(SuccBB).second) in runOnLoop()
170 if (LI->getLoopFor(ExitBB) == L && Visited.insert(ExitBB).second) in runOnLoop()
|
| D | StructurizeCFG.cpp | 176 BBSet Visited; member in __anon73e07c5e0111::StructurizeCFG
353 if (Visited.count(Exit)) in analyzeLoops()
362 if (Visited.count(Succ)) in analyzeLoops()
442 if (Visited.count(*PI)) { in gatherPredicates()
447 if (Visited.count(Other) && !Loops.count(Other) && in gatherPredicates()
474 if (Visited.count(Entry)) in gatherPredicates()
492 Visited.clear(); in collectInfos()
505 Visited.insert((*OI)->getEntry()); in collectInfos()
783 Visited.insert(Node->getEntry()); in wireFlow()
806 while (!Order.empty() && !Visited.count(LoopEnd) && in wireFlow()
[all …]
|
| D | LoopRerollPass.cpp | 1061 SmallInstructionSet Visited; in validate() local
1062 auto BaseIt = nextInstr(0, Uses, Visited); in validate()
1063 auto RootIt = nextInstr(Iter, Uses, Visited); in validate()
1073 Visited.insert(BaseInst); in validate()
1074 BaseIt = nextInstr(0, Uses, Visited); in validate()
1079 Visited.insert(RootInst); in validate()
1080 RootIt = nextInstr(Iter, Uses, Visited); in validate()
1102 TryIt = nextInstr(Iter, Uses, Visited, &TryIt); in validate()
1245 Visited.insert(BaseInst); in validate()
1246 Visited.insert(RootInst); in validate()
[all …]
|
| /external/llvm/lib/CodeGen/ |
| D | ScheduleDAG.cpp | 501 Visited.resize(DAGSize); in InitDAGTopologicalSorting()
526 Visited.reset(); in AddPred()
530 Shift(Visited, LowerBound, UpperBound); in AddPred()
553 Visited.set(SU->NodeNum); in DFS()
564 if (!Visited.test(s) && Node2Index[s] < UpperBound) { in DFS()
573 void ScheduleDAGTopologicalSort::Shift(BitVector& Visited, int LowerBound, in Shift() argument
582 if (Visited.test(w)) { in Shift()
584 Visited.reset(w); in Shift()
624 Visited.reset(); in IsReachable()
|
| /external/mesa3d/src/gallium/drivers/radeon/ |
| D | R600KernelParameters.cpp | 73 bool IsIndirect(Value *Val, std::set<Value*> &Visited);
139 bool R600KernelParameters::IsIndirect(Value *Val, std::set<Value*> &Visited) { in IsIndirect() argument
152 if (Visited.count(Val)) { in IsIndirect()
156 Visited.insert(Val); in IsIndirect()
173 if (IsIndirect(V2, Visited)) { in IsIndirect()
191 std::set<Value*> Visited; in AddParam() local
192 P.IsIndirect = IsIndirect(P.Val, Visited); in AddParam()
|
| /external/clang/lib/Sema/ |
| D | SemaLookup.cpp | 1755 llvm::SmallPtrSet<DeclContext*, 8> Visited; in LookupQualifiedNameInUsingDirectives() local
1756 Visited.insert(StartDC); in LookupQualifiedNameInUsingDirectives()
1766 if (Visited.insert(ND).second) in LookupQualifiedNameInUsingDirectives()
1814 if (Visited.insert(Nom).second) in LookupQualifiedNameInUsingDirectives()
3352 VisibleDeclsRecord &Visited) { in LookupVisibleDecls() argument
3357 if (Visited.visitedContext(Ctx->getPrimaryContext())) in LookupVisibleDecls()
3380 Consumer.FoundDecl(ND, Visited.checkHidden(ND), Ctx, InBaseClass); in LookupVisibleDecls()
3381 Visited.add(ND); in LookupVisibleDecls()
3397 Consumer.FoundDecl(ND, Visited.checkHidden(ND), Ctx, InBaseClass); in LookupVisibleDecls()
3398 Visited.add(ND); in LookupVisibleDecls()
[all …]
|
| /external/clang/lib/Analysis/ |
| D | ThreadSafetyTIL.cpp | 169 if (Visited) return ID; in topologicalSort()
170 Visited = true; in topologicalSort()
194 if (!Visited) return ID; in topologicalFinalSort()
195 Visited = false; in topologicalFinalSort()
|
| D | ReachableCode.cpp | 345 llvm::BitVector Visited; member in __anon8f94d3a60111::DeadCodeScan
357 : Visited(reachable.size()), in DeadCodeScan()
377 if (Reachable[blockID] || Visited[blockID]) in enqueue()
379 Visited[blockID] = true; in enqueue()
390 if (Visited[blockID]) { in isDeadCodeRoot()
396 Visited[blockID] = true; in isDeadCodeRoot()
|
| /external/llvm/lib/IR/ |
| D | Type.cpp | 155 bool Type::isSizedDerivedType(SmallPtrSetImpl<Type*> *Visited) const { in isSizedDerivedType()
157 return ATy->getElementType()->isSized(Visited); in isSizedDerivedType()
160 return VTy->getElementType()->isSized(Visited); in isSizedDerivedType()
162 return cast<StructType>(this)->isSized(Visited); in isSizedDerivedType()
554 bool StructType::isSized(SmallPtrSetImpl<Type*> *Visited) const { in isSized()
560 if (Visited && !Visited->insert(const_cast<StructType*>(this)).second) in isSized()
567 if (!(*I)->isSized(Visited)) in isSized()
|