/external/llvm/lib/Analysis/ |
H A D | CaptureTracking.cpp | 80 SmallSet<Use*, Threshold> Visited; local 92 Visited.insert(U); 147 if (Visited.insert(U))
|
H A D | InlineCost.cpp | 749 SmallPtrSet<Value *, 4> Visited; local 750 Visited.insert(V); 766 } while (Visited.insert(V));
|
H A D | Lint.cpp | 100 SmallPtrSet<Value *, 4> &Visited) const; 557 SmallPtrSet<Value *, 4> Visited; local 558 return findValueImpl(V, OffsetOk, Visited); 563 SmallPtrSet<Value *, 4> &Visited) const { 565 if (!Visited.insert(V)) 582 return findValueImpl(U, OffsetOk, Visited); 591 return findValueImpl(W, OffsetOk, Visited); 595 return findValueImpl(CI->getOperand(0), OffsetOk, Visited); 600 return findValueImpl(W, OffsetOk, Visited); 609 return findValueImpl(CE->getOperand(0), OffsetOk, Visited); [all...] |
H A D | MemoryDependenceAnalysis.cpp | 656 SmallPtrSet<BasicBlock*, 64> Visited; local 667 if (!Visited.insert(DirtyBB)) 763 DenseMap<BasicBlock*, Value*> Visited; local 765 Result, Visited, true)) 882 /// 'Visited'. 896 DenseMap<BasicBlock*, Value*> &Visited, 934 isLoad, StartBB, Result, Visited, 953 isLoad, StartBB, Result, Visited, 968 if (!Visited.empty()) { 971 DenseMap<BasicBlock*, Value*>::iterator VI = Visited 892 getNonLocalPointerDepFromBB(const PHITransAddr &Pointer, const AliasAnalysis::Location &Loc, bool isLoad, BasicBlock *StartBB, SmallVectorImpl<NonLocalDepResult> &Result, DenseMap<BasicBlock*, Value*> &Visited, bool SkipFirstBlock) argument [all...] |
H A D | BasicAliasAnalysis.cpp | 496 // Visited - Track instructions visited by pointsToConstantMemory. 497 SmallPtrSet<const Value*, 16> Visited; member in struct:__anon8585::BasicAliasAnalysis 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(); 601 Visited [all...] |
H A D | ValueTracking.cpp | 1804 SmallPtrSet<Value *, 4> Visited; local 1811 if (!Visited.insert(P))
|
/external/clang/include/clang/Sema/ |
H A D | AnalysisBasedWarnings.h | 50 enum VisitFlag { NotVisited = 0, Visited = 1, Pending = 2 }; enumerator in enum:clang::sema::AnalysisBasedWarnings::VisitFlag
|
/external/llvm/include/llvm/Analysis/ |
H A D | DominatorInternals.h | 116 SmallPtrSet<typename GraphT::NodeType*, 32> Visited; local 128 if (Visited.insert(VAncestor) && VInfo.Parent >= LastLinked) {
|
H A D | IntervalIterator.h | 92 std::set<BasicBlock*> Visited; member in class:llvm::IntervalIterator 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!
|
H A D | ScalarEvolutionExpressions.h | 509 SmallPtrSet<const SCEV *, 8> Visited; member in class:llvm::SCEVTraversal 512 if (Visited.insert(S) && Visitor.follow(S))
|
/external/llvm/lib/Transforms/Scalar/ |
H A D | LoopInstSimplify.cpp | 82 SmallPtrSet<BasicBlock*, 32> Visited; local 90 Visited.clear(); 136 if (!Visited.insert(SuccBB)) 149 if (LI->getLoopFor(ExitBB) == L && Visited.insert(ExitBB))
|
H A D | Reassociate.cpp | 497 SmallPtrSet<Value*, 8> Visited; // For sanity checking the iteration scheme. local 519 assert(Visited.insert(Op) && "Not first visit!"); 529 assert(Visited.insert(Op) && "Not first visit!"); 541 assert(Visited.count(Op) && "In leaf map but not visited!"); 1491 SmallPtrSet<Instruction *, 8> Visited; // Detect self-referential nodes. 1498 Visited.insert(Op))
|
/external/clang/lib/Analysis/ |
H A D | ReachableCode.cpp | 30 llvm::BitVector Visited; member in class:__anon3546::DeadCodeScan 41 : Visited(reachable.size()), 59 if (Reachable[blockID] || Visited[blockID]) 61 Visited[blockID] = true; 72 if (Visited[blockID]) { 78 Visited[blockID] = true;
|
H A D | AnalysisDeclContext.cpp | 357 llvm::SmallPtrSet<const VarDecl*, 4> Visited; member in class:__anon3536::FindBlockDeclRefExprsVals 379 if (Visited.insert(VD)) 382 if (Visited.insert(VD) && IsTrackedDecl(VD))
|
/external/clang/lib/Serialization/ |
H A D | ModuleManager.cpp | 178 llvm::SmallPtrSet<ModuleFile *, 4> &Visited) { 187 if (!Visited.insert(*IM)) 190 if (visitDepthFirst(**IM, Visitor, UserData, Visited)) 201 llvm::SmallPtrSet<ModuleFile *, 4> Visited; local 203 if (!Visited.insert(Chain[I])) 206 if (::visitDepthFirst(*Chain[I], Visitor, UserData, Visited)) 174 visitDepthFirst(ModuleFile &M, bool (*Visitor)(ModuleFile &M, bool Preorder, void *UserData), void *UserData, llvm::SmallPtrSet<ModuleFile *, 4> &Visited) argument
|
/external/llvm/include/llvm/ADT/ |
H A D | DepthFirstIterator.h | 49 SetType Visited; member in class:llvm::df_iterator_storage 55 df_iterator_storage(SetType &VSet) : Visited(VSet) {} 56 df_iterator_storage(const df_iterator_storage &S) : Visited(S.Visited) {} 57 SetType &Visited; member in class:llvm::df_iterator_storage 81 this->Visited.insert(Node); 93 this->Visited.insert(Node); 115 if (Next && !this->Visited.count(Next)) { 117 this->Visited.insert(Next); 183 return this->Visited [all...] |
H A D | PostOrderIterator.h | 55 SetType Visited; member in class:llvm::po_iterator_storage 60 return Visited.insert(To); 71 SetType &Visited; member in class:llvm::po_iterator_storage 73 po_iterator_storage(SetType &VSet) : Visited(VSet) {} 74 po_iterator_storage(const po_iterator_storage &S) : Visited(S.Visited) {} 80 bool insertEdge(NodeType *From, NodeType *To) { return Visited.insert(To); }
|
/external/llvm/lib/VMCore/ |
H A D | Globals.cpp | 242 SmallPtrSet<const GlobalValue*, 3> Visited; local 249 Visited.insert(GV); 258 if (!Visited.insert(GV))
|
H A D | Value.cpp | 340 SmallPtrSet<Value *, 4> Visited; 342 Visited.insert(V); 370 } while (Visited.insert(V)); 391 SmallPtrSet<const Value *, 32> &Visited) { 413 if (!Visited.insert(GEP->getOperand(0))) 415 if (!isDereferenceablePointer(GEP->getOperand(0), Visited)) 452 SmallPtrSet<const Value *, 32> Visited; local 453 return ::isDereferenceablePointer(this, Visited); 390 isDereferenceablePointer(const Value *V, SmallPtrSet<const Value *, 32> &Visited) argument
|
/external/llvm/utils/TableGen/ |
H A D | DFAPacketizerEmitter.cpp | 446 std::map<std::set<unsigned>, State*> Visited; local 456 // Visited = {} 463 // If S' is not in Visited: 465 // Add S' to Visited 489 if ((VI = Visited.find(NewStateResources)) != Visited.end()) 495 Visited[NewStateResources] = NewState;
|
/external/llvm/lib/Transforms/Utils/ |
H A D | Local.cpp | 343 SmallPtrSet<Instruction*, 4> Visited; local 351 if (!Visited.insert(I)) {
|
/external/llvm/lib/CodeGen/ |
H A D | LiveVariables.cpp | 529 SmallPtrSet<MachineBasicBlock*,16> Visited; local 532 DFI = df_ext_begin(Entry, Visited), E = df_ext_end(Entry, Visited); 690 assert(Visited.count(&*i) != 0 && "unreachable basic block found");
|
H A D | ScheduleDAGInstrs.cpp | 612 SmallPtrSet<const SUnit*, 16> &Visited) { 617 if (!Visited.insert(SUb)) 648 iterateChainSucc (AA, MFI, SUa, I->getSUnit(), ExitSU, Depth, Visited); 662 SmallPtrSet<const SUnit*, 16> Visited; 680 ExitSU, &Depth, Visited); 610 iterateChainSucc(AliasAnalysis *AA, const MachineFrameInfo *MFI, SUnit *SUa, SUnit *SUb, SUnit *ExitSU, unsigned *Depth, SmallPtrSet<const SUnit*, 16> &Visited) argument
|
/external/clang/lib/StaticAnalyzer/Frontend/ |
H A D | AnalysisConsumer.cpp | 351 SmallPtrSet<CallGraphNode*,24> Visited) { 363 return Visited.count(N); 405 // the previously processed functions. Use external Visited set, which is 407 SmallPtrSet<CallGraphNode*,24> Visited; local 415 if (!shouldSkipFunction(*CI, Visited)) 421 if (shouldSkipFunction(N, Visited)) 436 Visited.insert(VN); 438 Visited.insert(N); 613 SetOfConstDecls *Visited) { 617 ActionExprEngine(D, false, Visited); 350 shouldSkipFunction(CallGraphNode *N, SmallPtrSet<CallGraphNode*,24> Visited) argument 612 RunPathSensitiveChecks(Decl *D, SetOfConstDecls *Visited) argument [all...] |
/external/llvm/include/llvm/CodeGen/ |
H A D | ScheduleDAG.h | 674 /// Visited - a set of nodes visited during a DFS traversal. 675 BitVector Visited; member in class:llvm::ScheduleDAGTopologicalSort 684 void Shift(BitVector& Visited, int LowerBound, int UpperBound);
|