Searched refs:Visited (Results 1 - 25 of 63) sorted by relevance

123

/freebsd-10.0-release/contrib/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.h55 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); }
/freebsd-10.0-release/contrib/llvm/lib/Analysis/
H A DCaptureTracking.cpp85 SmallSet<Use*, Threshold> Visited; local
97 Visited.insert(U);
158 if (Visited.insert(U))
H A DMemoryDependenceAnalysis.cpp672 SmallPtrSet<BasicBlock*, 64> Visited; local
683 if (!Visited.insert(DirtyBB))
779 DenseMap<BasicBlock*, Value*> Visited; local
781 Result, Visited, true))
898 /// 'Visited'.
912 DenseMap<BasicBlock*, Value*> &Visited,
949 isLoad, StartBB, Result, Visited,
968 isLoad, StartBB, Result, Visited,
983 if (!Visited.empty()) {
986 DenseMap<BasicBlock*, Value*>::iterator VI = Visited
908 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 DLint.cpp100 SmallPtrSet<Value *, 4> &Visited) const;
591 SmallPtrSet<Value *, 4> Visited; local
592 return findValueImpl(V, OffsetOk, Visited);
597 SmallPtrSet<Value *, 4> &Visited) const {
599 if (!Visited.insert(V))
616 return findValueImpl(U, OffsetOk, Visited);
625 return findValueImpl(W, OffsetOk, Visited);
629 return findValueImpl(CI->getOperand(0), OffsetOk, Visited);
634 return findValueImpl(W, OffsetOk, Visited);
643 return findValueImpl(CE->getOperand(0), OffsetOk, Visited);
[all...]
H A DBasicAliasAnalysis.cpp525 // Visited - Track instructions visited by pointsToConstantMemory.
526 SmallPtrSet<const Value*, 16> Visited; member in struct:__anon2074::BasicAliasAnalysis
576 assert(Visited.empty() && "Visited must be cleared after use!");
583 if (!Visited.insert(V)) {
584 Visited.clear();
598 Visited.clear();
616 Visited.clear();
625 Visited.clear();
630 Visited
[all...]
/freebsd-10.0-release/contrib/llvm/lib/Transforms/ObjCARC/
H A DDependencyAnalysis.h57 SmallPtrSet<const BasicBlock *, 4> &Visited,
H A DDependencyAnalysis.cpp209 SmallPtrSet<const BasicBlock *, 4> &Visited,
231 if (Visited.insert(PredBB))
248 for (SmallPtrSet<const BasicBlock *, 4>::const_iterator I = Visited.begin(),
249 E = Visited.end(); I != E; ++I) {
256 if (Succ != StartBB && !Visited.count(Succ)) {
205 FindDependencies(DependenceKind Flavor, const Value *Arg, BasicBlock *StartBB, Instruction *StartInst, SmallPtrSet<Instruction *, 4> &DependingInsts, SmallPtrSet<const BasicBlock *, 4> &Visited, ProvenanceAnalysis &PA) argument
H A DProvenanceAnalysis.cpp76 SmallPtrSet<const Value *, 8> Visited; local
79 Visited.insert(P);
98 if (Visited.insert(Ur))
H A DObjCARCContract.cpp93 &Visited);
238 &Visited) {
247 DependingInstructions, Visited, PA);
251 DependingInstructions, Visited, PA);
253 Visited.clear();
430 SmallPtrSet<const BasicBlock *, 4> Visited; local
445 if (ContractAutorelease(F, Inst, Class, DependingInstructions, Visited))
233 ContractAutorelease(Function &F, Instruction *Autorelease, InstructionClass Class, SmallPtrSet<Instruction *, 4> &DependingInstructions, SmallPtrSet<const BasicBlock *, 4> &Visited) argument
H A DObjCARCOpts.cpp1567 SmallPtrSet<const BasicBlock *, 4> Visited; local
1581 DependingInstructions, Visited, PA);
1587 DependingInstructions, Visited, PA);
2224 SmallPtrSet<BasicBlock *, 16> Visited; local
2237 Visited.insert(EntryBB);
2247 if (Visited.insert(SuccBB)) {
2267 Visited.clear();
2282 Visited.insert(ExitBB);
2288 if (Visited.insert(BB)) {
2829 SmallPtrSet<const BasicBlock *, 4> &Visited,
2827 HasSafePathToPredecessorCall(const Value *Arg, Instruction *Retain, SmallPtrSet<Instruction *, 4> &DepInsts, SmallPtrSet<const BasicBlock *, 4> &Visited, ProvenanceAnalysis &PA) argument
2855 FindPredecessorRetainWithSafePath(const Value *Arg, BasicBlock *BB, Instruction *Autorelease, SmallPtrSet<Instruction *, 4> &DepInsts, SmallPtrSet<const BasicBlock *, 4> &Visited, ProvenanceAnalysis &PA) argument
2920 SmallPtrSet<const BasicBlock *, 4> Visited; local
[all...]
/freebsd-10.0-release/contrib/llvm/lib/Transforms/Scalar/
H A DLoopInstSimplify.cpp83 SmallPtrSet<BasicBlock*, 32> Visited; local
91 Visited.clear();
137 if (!Visited.insert(SuccBB))
150 if (LI->getLoopFor(ExitBB) == L && Visited.insert(ExitBB))
/freebsd-10.0-release/contrib/llvm/tools/clang/include/clang/Sema/
H A DAnalysisBasedWarnings.h50 enum VisitFlag { NotVisited = 0, Visited = 1, Pending = 2 }; enumerator in enum:clang::sema::AnalysisBasedWarnings::VisitFlag
/freebsd-10.0-release/contrib/llvm/tools/clang/lib/StaticAnalyzer/Frontend/
H A DAnalysisConsumer.cpp290 getInliningModeForFunction(const Decl *D, SetOfConstDecls Visited);
392 SetOfConstDecls Visited,
408 return Visited.count(D);
413 SetOfConstDecls Visited) {
417 if (Visited.count(D)) {
440 // the previously processed functions. Use external Visited set to identify
444 SetOfConstDecls Visited; local
460 if (shouldSkipFunction(D, Visited, VisitedAsTopLevel))
466 HandleCode(D, AM_Path, getInliningModeForFunction(D, Visited),
472 Visited
391 shouldSkipFunction(const Decl *D, SetOfConstDecls Visited, SetOfConstDecls VisitedAsTopLevel) argument
412 getInliningModeForFunction(const Decl *D, SetOfConstDecls Visited) argument
641 RunPathSensitiveChecks(Decl *D, ExprEngine::InliningModes IMode, SetOfConstDecls *Visited) argument
[all...]
/freebsd-10.0-release/contrib/llvm/include/llvm/Analysis/
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!
H A DDominatorInternals.h116 SmallPtrSet<typename GraphT::NodeType*, 32> Visited; local
128 if (Visited.insert(VAncestor) && VInfo.Parent >= LastLinked) {
/freebsd-10.0-release/contrib/llvm/tools/clang/lib/Analysis/
H A DReachableCode.cpp30 llvm::BitVector Visited; member in class:__anon3013::DeadCodeScan
41 : Visited(reachable.size()),
59 if (Reachable[blockID] || Visited[blockID])
61 Visited[blockID] = true;
72 if (Visited[blockID]) {
78 Visited[blockID] = true;
/freebsd-10.0-release/contrib/llvm/tools/clang/lib/Serialization/
H A DModuleManager.cpp195 assert(State->NextState == 0 && "Visited state is in list?");
348 SmallVectorImpl<bool> &Visited) {
357 if (Visited[(*IM)->Index])
359 Visited[(*IM)->Index] = true;
361 if (visitDepthFirst(**IM, Visitor, UserData, Visited))
372 SmallVector<bool, 16> Visited(size(), false);
374 if (Visited[Chain[I]->Index])
376 Visited[Chain[I]->Index] = true;
378 if (::visitDepthFirst(*Chain[I], Visitor, UserData, Visited))
344 visitDepthFirst(ModuleFile &M, bool (*Visitor)(ModuleFile &M, bool Preorder, void *UserData), void *UserData, SmallVectorImpl<bool> &Visited) argument
/freebsd-10.0-release/contrib/llvm/lib/CodeGen/
H A DScheduleDAG.cpp502 Visited.resize(DAGSize);
527 Visited.reset();
531 Shift(Visited, LowerBound, UpperBound);
554 Visited.set(SU->NodeNum);
565 if (!Visited.test(s) && Node2Index[s] < UpperBound) {
574 void ScheduleDAGTopologicalSort::Shift(BitVector& Visited, int LowerBound,
583 if (Visited.test(w)) {
585 Visited.reset(w);
625 Visited.reset();
/freebsd-10.0-release/contrib/llvm/lib/Target/R600/
H A DAMDGPUStructurizeCFG.cpp182 BBSet Visited; member in class:__anon2474::AMDGPUStructurizeCFG
298 if (Visited.count(Exit))
309 if (Visited.count(Succ))
387 if (Visited.count(*PI)) {
392 if (Visited.count(Other) && !Loops.count(Other) &&
419 if (Visited.count(Entry))
438 Visited.clear();
447 Visited.insert((*OI)->getEntry());
733 Visited.insert(Node->getEntry());
756 while (!Order.empty() && !Visited
[all...]
/freebsd-10.0-release/contrib/llvm/lib/IR/
H A DValue.cpp348 SmallPtrSet<Value *, 4> Visited;
350 Visited.insert(V);
379 } while (Visited.insert(V));
404 SmallPtrSet<const Value *, 32> &Visited) {
426 if (!Visited.insert(GEP->getOperand(0)))
428 if (!isDereferenceablePointer(GEP->getOperand(0), Visited))
465 SmallPtrSet<const Value *, 32> Visited; local
466 return ::isDereferenceablePointer(this, Visited);
403 isDereferenceablePointer(const Value *V, SmallPtrSet<const Value *, 32> &Visited) argument
H A DGlobals.cpp248 SmallPtrSet<const GlobalValue*, 3> Visited; local
255 Visited.insert(GV);
264 if (!Visited.insert(GV))
/freebsd-10.0-release/contrib/llvm/utils/TableGen/
H A DDFAPacketizerEmitter.cpp455 std::map<std::set<unsigned>, State*> Visited; local
465 // Visited = {}
472 // If S' is not in Visited:
474 // Add S' to Visited
498 if ((VI = Visited.find(NewStateResources)) != Visited.end())
504 Visited[NewStateResources] = NewState;
/freebsd-10.0-release/contrib/llvm/tools/clang/lib/Sema/
H A DSemaLookup.cpp1307 llvm::SmallPtrSet<DeclContext*, 8> Visited;
1308 Visited.insert(StartDC);
1318 if (Visited.insert(ND))
1367 if (Visited.insert(Nom))
2891 VisibleDeclsRecord &Visited) {
2896 if (Visited.visitedContext(Ctx->getPrimaryContext()))
2911 Consumer.FoundDecl(ND, Visited.checkHidden(ND), Ctx, InBaseClass);
2912 Visited.add(ND);
2920 ShadowContextRAII Shadow(Visited);
2924 QualifiedNameLookup, InBaseClass, Consumer, Visited);
2887 LookupVisibleDecls(DeclContext *Ctx, LookupResult &Result, bool QualifiedNameLookup, bool InBaseClass, VisibleDeclConsumer &Consumer, VisibleDeclsRecord &Visited) argument
3032 LookupVisibleDecls(Scope *S, LookupResult &Result, UnqualUsingDirectiveSet &UDirs, VisibleDeclConsumer &Consumer, VisibleDeclsRecord &Visited) argument
3137 VisibleDeclsRecord Visited; local
3148 VisibleDeclsRecord Visited; local
[all...]
/freebsd-10.0-release/contrib/llvm/lib/Transforms/Utils/
H A DPromoteMemoryToRegister.cpp238 /// Visited - The set of basic blocks the renamer has already visited.
240 SmallPtrSet<BasicBlock*, 16> Visited; member in struct:__anon2697::PromoteMem2Reg
566 // The renamer uses the Visited set to avoid infinite loops. Clear it now.
567 Visited.clear();
778 SmallPtrSet<DomTreeNode*, 32> Visited; local
811 if (!Visited.insert(SuccNode))
825 if (!Visited.count(*CI))
1074 if (!Visited.insert(BB)) return;

Completed in 310 milliseconds

123