| /external/llvm/lib/Transforms/Utils/ |
| H A D | PromoteMemoryToRegister.cpp | 234 /// Visited - The set of basic blocks the renamer has already visited.
236 SmallPtrSet<BasicBlock*, 16> Visited; member in struct:__anon7838::PromoteMem2Reg
562 // The renamer uses the Visited set to avoid infinite loops. Clear it now.
563 Visited.clear();
770 SmallPtrSet<DomTreeNode*, 32> Visited; local
803 if (!Visited.insert(SuccNode))
817 if (!Visited.count(*CI))
1066 if (!Visited.insert(BB)) return;
|
| /external/clang/lib/StaticAnalyzer/Core/ |
| H A D | BugReporter.cpp | 1501 llvm::DenseMap<const void*,unsigned> Visited; local
1510 if (Visited.find(Node) != Visited.end())
1513 Visited[Node] = cnt++;
1535 llvm::DenseMap<const void*,unsigned>::iterator I = Visited.find(N);
1536 assert(I != Visited.end());
1570 I = Visited.find(*SI);
1572 if (I == Visited.end())
1867 llvm::DenseMap<const ExplodedNode *, unsigned> Visited; local
1871 Visited[errorNod
[all...] |
| H A D | RegionStore.cpp | 483 llvm::DenseMap<const RegionCluster*, unsigned> Visited; member in class:__anon3508::ClusterAnalysis
518 return (bool) Visited[&getCluster(R->getBaseRegion())];
548 if (unsigned &visited = Visited[&C])
|
| /external/llvm/lib/Analysis/ |
| H A D | InstructionSimplify.cpp | 709 SmallPtrSet<Value *, 4> Visited; local
710 Visited.insert(V);
726 } while (Visited.insert(V));
|
| /external/llvm/lib/CodeGen/SelectionDAG/ |
| H A D | SelectionDAGISel.cpp | 1521 SDNode *Root, SmallPtrSet<SDNode*, 16> &Visited,
1536 if (!Visited.insert(Use))
1553 if (findNonImmUse(N, Def, ImmedUse, Root, Visited, IgnoreChains))
1634 SmallPtrSet<SDNode*, 16> Visited; local
1635 return !findNonImmUse(Root, N.getNode(), U, Root, Visited, IgnoreChains);
1520 findNonImmUse(SDNode *Use, SDNode* Def, SDNode *ImmedUse, SDNode *Root, SmallPtrSet<SDNode*, 16> &Visited, bool IgnoreChains) argument
|
| H A D | DAGCombiner.cpp | 6398 SmallPtrSet<const SDNode *, 32> Visited; local
6406 if (N->hasPredecessorHelper(Use, Visited, Worklist))
8653 SmallPtrSet<SDNode *, 16> Visited; // Visited node set. local
8691 if (!Visited.insert(Chain.getNode()))
|
| H A D | SelectionDAG.cpp | 5847 SmallPtrSet<const SDNode *, 32> Visited; local
5849 return hasPredecessorHelper(N, Visited, Worklist);
5853 SmallPtrSet<const SDNode *, 32> &Visited,
5855 if (Visited.empty()) {
5860 if (Visited.count(N))
5869 if (Visited.insert(Op))
6135 SmallPtrSet<const SDNode*, 32> &Visited,
6143 if (!Visited.insert(N)) {
6151 checkForCyclesHelper(N->getOperand(i).getNode(), Visited, Checked);
6154 Visited
5852 hasPredecessorHelper(const SDNode *N, SmallPtrSet<const SDNode *, 32> &Visited, SmallVector<const SDNode *, 16> &Worklist) const argument
6134 checkForCyclesHelper(const SDNode *N, SmallPtrSet<const SDNode*, 32> &Visited, SmallPtrSet<const SDNode*, 32> &Checked) argument
[all...] |
| /external/llvm/lib/Transforms/InstCombine/ |
| H A D | InstructionCombining.cpp | 1802 SmallPtrSet<BasicBlock*, 64> &Visited,
1817 if (!Visited.insert(BB)) continue;
1916 SmallPtrSet<BasicBlock*, 64> Visited; local
1917 MadeIRChange |= AddReachableCodeToWorklist(F.begin(), Visited, *this, TD,
1924 if (Visited.count(BB)) continue;
1801 AddReachableCodeToWorklist(BasicBlock *BB, SmallPtrSet<BasicBlock*, 64> &Visited, InstCombiner &IC, const TargetData *TD, const TargetLibraryInfo *TLI) argument
|
| /external/llvm/lib/Transforms/Vectorize/ |
| H A D | BBVectorize.cpp | 1033 DenseSet<ValuePair> Visited; local
1039 Visited.insert(QTop);
1054 if (CurrentPairs.count(C->second) && !Visited.count(C->second))
|
| /external/clang/lib/Sema/ |
| H A D | SemaLookup.cpp | 1266 llvm::SmallPtrSet<DeclContext*, 8> Visited;
1267 Visited.insert(StartDC);
1277 if (Visited.insert(ND))
1326 if (Visited.insert(Nom))
2867 VisibleDeclsRecord &Visited) {
2872 if (Visited.visitedContext(Ctx->getPrimaryContext()))
2885 Consumer.FoundDecl(ND, Visited.checkHidden(ND), Ctx, InBaseClass);
2886 Visited.add(ND);
2894 ShadowContextRAII Shadow(Visited);
2898 QualifiedNameLookup, InBaseClass, Consumer, Visited);
2863 LookupVisibleDecls(DeclContext *Ctx, LookupResult &Result, bool QualifiedNameLookup, bool InBaseClass, VisibleDeclConsumer &Consumer, VisibleDeclsRecord &Visited) argument
3004 LookupVisibleDecls(Scope *S, LookupResult &Result, UnqualUsingDirectiveSet &UDirs, VisibleDeclConsumer &Consumer, VisibleDeclsRecord &Visited) argument
3109 VisibleDeclsRecord Visited; local
3120 VisibleDeclsRecord Visited; local
[all...] |
| /external/llvm/lib/Transforms/Scalar/ |
| H A D | ObjCARC.cpp | 1197 SmallPtrSet<const Value *, 8> Visited; local
1200 Visited.insert(P);
1219 if (Visited.insert(Ur))
2091 SmallPtrSet<const BasicBlock *, 4> &Visited,
2113 if (Visited.insert(PredBB))
2130 for (SmallPtrSet<const BasicBlock *, 4>::const_iterator I = Visited.begin(),
2131 E = Visited.end(); I != E; ++I) {
2138 if (Succ != StartBB && !Visited.count(Succ)) {
2415 SmallPtrSet<const BasicBlock *, 4> Visited; local
2428 DependingInstructions, Visited, P
2087 FindDependencies(DependenceKind Flavor, const Value *Arg, BasicBlock *StartBB, Instruction *StartInst, SmallPtrSet<Instruction *, 4> &DependingInstructions, SmallPtrSet<const BasicBlock *, 4> &Visited, ProvenanceAnalysis &PA) argument
3030 SmallPtrSet<BasicBlock *, 16> Visited; local
3588 SmallPtrSet<const BasicBlock *, 4> Visited; local
3902 ContractAutorelease(Function &F, Instruction *Autorelease, InstructionClass Class, SmallPtrSet<Instruction *, 4> &DependingInstructions, SmallPtrSet<const BasicBlock *, 4> &Visited) argument
4066 SmallPtrSet<const BasicBlock *, 4> Visited; local
[all...] |
| /external/clang/lib/Serialization/ |
| H A D | ASTReader.cpp | 2522 llvm::SmallPtrSet<Module *, 4> Visited; local
2556 if (!(*Sub)->IsExplicit && Visited.insert(*Sub))
2568 if (Visited.insert(Exported))
2595 if (Visited.count(Imported))
2613 Visited.insert(Imported);
|