Searched defs:Visited (Results 1 - 25 of 37) sorted by relevance

12

/external/llvm/lib/Analysis/
H A DCaptureTracking.cpp80 SmallSet<Use*, Threshold> Visited; local
92 Visited.insert(U);
147 if (Visited.insert(U))
H A DInlineCost.cpp777 SmallPtrSet<Value *, 4> Visited; local
778 Visited.insert(V);
794 } while (Visited.insert(V));
H A DLint.cpp100 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 DBasicAliasAnalysis.cpp524 // Visited - Track instructions visited by pointsToConstantMemory.
525 SmallPtrSet<const Value*, 16> Visited; member in struct:__anon7274::BasicAliasAnalysis
574 assert(Visited.empty() && "Visited must be cleared after use!");
581 if (!Visited.insert(V)) {
582 Visited.clear();
596 Visited.clear();
614 Visited.clear();
623 Visited.clear();
628 Visited
[all...]
H A DMemoryDependenceAnalysis.cpp722 SmallPtrSet<BasicBlock*, 64> Visited; local
733 if (!Visited.insert(DirtyBB))
829 DenseMap<BasicBlock*, Value*> Visited; local
831 Result, Visited, true))
948 /// 'Visited'.
962 DenseMap<BasicBlock*, Value*> &Visited,
1000 isLoad, StartBB, Result, Visited,
1019 isLoad, StartBB, Result, Visited,
1034 if (!Visited.empty()) {
1037 DenseMap<BasicBlock*, Value*>::iterator VI = Visited
958 getNonLocalPointerDepFromBB(const PHITransAddr &Pointer, const AliasAnalysis::Location &Loc, bool isLoad, BasicBlock *StartBB, SmallVectorImpl<NonLocalDepResult> &Result, DenseMap<BasicBlock*, Value*> &Visited, bool SkipFirstBlock) argument
[all...]
/external/clang/include/clang/Sema/
H A DAnalysisBasedWarnings.h50 enum VisitFlag { NotVisited = 0, Visited = 1, Pending = 2 }; enumerator in enum:clang::sema::AnalysisBasedWarnings::VisitFlag
/external/llvm/include/llvm/Analysis/
H A DDominatorInternals.h116 SmallPtrSet<typename GraphT::NodeType*, 32> Visited; local
128 if (Visited.insert(VAncestor) && VInfo.Parent >= LastLinked) {
H A DIntervalIterator.h92 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!
/external/llvm/lib/CodeGen/
H A DProcessImplicitDefs.cpp96 SmallPtrSet<MachineBasicBlock*,16> Visited; local
101 DFI = df_ext_begin(Entry, Visited), E = df_ext_end(Entry, Visited);
H A DLiveVariables.cpp530 SmallPtrSet<MachineBasicBlock*,16> Visited; local
533 DFI = df_ext_begin(Entry, Visited), E = df_ext_end(Entry, Visited);
690 assert(Visited.count(&*i) != 0 && "unreachable basic block found");
/external/llvm/lib/Transforms/Scalar/
H A DLoopInstSimplify.cpp82 SmallPtrSet<BasicBlock*, 32> Visited; local
90 Visited.clear();
136 if (!Visited.insert(SuccBB))
149 if (LI->getLoopFor(ExitBB) == L && Visited.insert(ExitBB))
H A DCodeGenPrepare.cpp757 SmallPtrSet<Value*, 16> Visited; local
773 if (!Visited.insert(V)) {
H A DLoopUnswitch.cpp508 std::set<BasicBlock*> &Visited) {
509 if (!Visited.insert(BB).second) {
524 if (!isTrivialLoopExitBlockHelper(L, *SI, ExitBB, Visited))
541 std::set<BasicBlock*> Visited; local
542 Visited.insert(L->getHeader()); // Branches to header make infinite loops.
544 if (isTrivialLoopExitBlockHelper(L, BB, ExitBB, Visited))
506 isTrivialLoopExitBlockHelper(Loop *L, BasicBlock *BB, BasicBlock *&ExitBB, std::set<BasicBlock*> &Visited) argument
/external/clang/lib/Analysis/
H A DReachableCode.cpp30 llvm::BitVector Visited; member in class:__anon3103::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 DAnalysisDeclContext.cpp338 llvm::SmallPtrSet<const VarDecl*, 4> Visited; member in class:__anon3093::FindBlockDeclRefExprsVals
360 if (Visited.insert(VD))
363 if (Visited.insert(VD) && IsTrackedDecl(VD))
/external/clang/lib/Serialization/
H A DModuleManager.cpp178 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 DDepthFirstIterator.h49 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 DPostOrderIterator.h29 SetType Visited; member in class:llvm::po_iterator_storage
43 po_iterator_storage(SetType &VSet) : Visited(VSet) {}
44 po_iterator_storage(const po_iterator_storage &S) : Visited(S.Visited) {}
45 SetType &Visited; member in class:llvm::po_iterator_storage
67 if (this->Visited.insert(BB)) { // If the block is not visited...
74 this->Visited.insert(BB);
82 if (this->Visited.insert(BB)) {
121 this->Visited);
/external/llvm/lib/VMCore/
H A DGlobals.cpp242 SmallPtrSet<const GlobalValue*, 3> Visited; local
249 Visited.insert(GV);
258 if (!Visited.insert(GV))
H A DValue.cpp340 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/lib/Transforms/Utils/
H A DLocal.cpp333 SmallPtrSet<Instruction*, 4> Visited; local
341 if (!Visited.insert(I)) {
/external/llvm/utils/TableGen/
H A DDFAPacketizerEmitter.cpp452 std::map<std::set<unsigned>, State*> Visited; local
462 // Visited = {}
469 // If S' is not in Visited:
471 // Add S' to Visited
493 if ((VI = Visited.find(NewStateResources)) != Visited.end())
499 Visited[NewStateResources] = NewState;
/external/clang/lib/StaticAnalyzer/Frontend/
H A DAnalysisConsumer.cpp348 // the previously processed functions. Use external Visited set, which is
350 SmallPtrSet<CallGraphNode*,24> Visited; local
357 if (Visited.count(N))
372 Visited.insert(VN);
374 Visited.insert(N);
539 SetOfConstDecls *Visited) {
543 ActionExprEngine(D, false, Visited);
547 ActionExprEngine(D, true, Visited);
551 ActionExprEngine(D, false, Visited);
552 ActionExprEngine(D, true, Visited);
538 RunPathSensitiveChecks(Decl *D, SetOfConstDecls *Visited) argument
[all...]
/external/llvm/include/llvm/CodeGen/
H A DScheduleDAG.h657 /// Visited - a set of nodes visited during a DFS traversal.
658 BitVector Visited; member in class:llvm::ScheduleDAGTopologicalSort
667 void Shift(BitVector& Visited, int LowerBound, int UpperBound);
/external/llvm/lib/CodeGen/SelectionDAG/
H A DScheduleDAGSDNodes.cpp189 SmallPtrSet<SDNode*, 16> Visited;
197 if (User == Node || !Visited.insert(User))
294 SmallPtrSet<SDNode*, 64> Visited; local
296 Visited.insert(DAG->getRoot().getNode());
304 if (Visited.insert(NI->getOperand(i).getNode()))

Completed in 247 milliseconds

12