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

12345

/freebsd-11.0-release/contrib/llvm/include/llvm/ADT/
H A DDepthFirstIterator.h50 SetType Visited; member in class:llvm::df_iterator_storage
56 df_iterator_storage(SetType &VSet) : Visited(VSet) {}
57 df_iterator_storage(const df_iterator_storage &S) : Visited(S.Visited) {}
58 SetType &Visited; member in class:llvm::df_iterator_storage
82 this->Visited.insert(Node);
94 this->Visited.insert(Node);
116 if (Next && this->Visited.insert(Next).second) {
184 return this->Visited.count(Node) != 0;
H A DPostOrderIterator.h56 SetType Visited; member in class:llvm::po_iterator_storage
61 return Visited.insert(To).second;
72 SetType &Visited; member in class:llvm::po_iterator_storage
74 po_iterator_storage(SetType &VSet) : Visited(VSet) {}
75 po_iterator_storage(const po_iterator_storage &S) : Visited(S.Visited) {}
81 return Visited.insert(To).second;
H A DSCCIterator.h159 typename DenseMap<NodeType *, unsigned>::iterator Visited = local
161 if (Visited == nodeVisitNumbers.end()) {
167 unsigned childNum = Visited->second;
/freebsd-11.0-release/contrib/llvm/tools/clang/include/clang/Sema/
H A DAnalysisBasedWarnings.h51 enum VisitFlag { NotVisited = 0, Visited = 1, Pending = 2 }; enumerator in enum:clang::sema::AnalysisBasedWarnings::VisitFlag
/freebsd-11.0-release/contrib/llvm/include/llvm/Analysis/
H A DDemandedBits.h66 SmallPtrSet<Instruction*, 128> Visited; member in struct:llvm::DemandedBits
H A DIntervalIterator.h92 std::set<BasicBlock*> Visited; member in class:llvm::IntervalIterator
108 : IntStack(std::move(x.IntStack)), Visited(std::move(x.Visited)),
177 if (!Visited.insert(Header).second)
206 if (Visited.count(NodeHeader)) { // Node already been visited?
226 Visited.insert(NodeHeader); // The node has now been visited!
/freebsd-11.0-release/contrib/llvm/lib/Transforms/Scalar/
H A DLoopInstSimplify.cpp95 SmallPtrSet<BasicBlock*, 32> Visited; local
103 Visited.clear();
157 if (!Visited.insert(SuccBB).second)
170 if (LI->getLoopFor(ExitBB) == L && Visited.insert(ExitBB).second)
H A DStructurizeCFG.cpp176 BBSet Visited; member in class:__anon3266::StructurizeCFG
353 if (Visited.count(Exit))
362 if (Visited.count(Succ))
442 if (Visited.count(*PI)) {
447 if (Visited.count(Other) && !Loops.count(Other) &&
474 if (Visited.count(Entry))
492 Visited.clear();
505 Visited.insert((*OI)->getEntry());
783 Visited.insert(Node->getEntry());
806 while (!Order.empty() && !Visited
[all...]
/freebsd-11.0-release/contrib/llvm/lib/Transforms/ObjCARC/
H A DObjCARCContract.cpp80 SmallPtrSetImpl<const BasicBlock *> &Visited,
89 SmallPtrSetImpl<const BasicBlock *> &Visited);
149 SmallPtrSetImpl<const BasicBlock *> &Visited) {
158 DependingInstructions, Visited, PA);
162 DependingInstructions, Visited, PA);
164 Visited.clear();
407 SmallPtrSetImpl<const BasicBlock *> &Visited,
418 return contractAutorelease(F, Inst, Class, DependingInsts, Visited);
533 SmallPtrSet<const BasicBlock *, 4> Visited; local
541 if (tryToPeepholeInstruction(F, Inst, I, DependingInstructions, Visited,
146 contractAutorelease( Function &F, Instruction *Autorelease, ARCInstKind Class, SmallPtrSetImpl<Instruction *> &DependingInstructions, SmallPtrSetImpl<const BasicBlock *> &Visited) argument
404 tryToPeepholeInstruction( Function &F, Instruction *Inst, inst_iterator &Iter, SmallPtrSetImpl<Instruction *> &DependingInsts, SmallPtrSetImpl<const BasicBlock *> &Visited, bool &TailOkForStoreStrongs) argument
[all...]
H A DProvenanceAnalysis.cpp77 SmallPtrSet<const Value *, 8> Visited; local
80 Visited.insert(P);
98 if (Visited.insert(Ur).second)
H A DDependencyAnalysis.cpp227 SmallPtrSetImpl<const BasicBlock *> &Visited,
249 if (Visited.insert(PredBB).second)
266 for (const BasicBlock *BB : Visited) {
272 if (Succ != StartBB && !Visited.count(Succ)) {
223 FindDependencies(DependenceKind Flavor, const Value *Arg, BasicBlock *StartBB, Instruction *StartInst, SmallPtrSetImpl<Instruction *> &DependingInsts, SmallPtrSetImpl<const BasicBlock *> &Visited, ProvenanceAnalysis &PA) argument
H A DDependencyAnalysis.h57 SmallPtrSetImpl<const BasicBlock *> &Visited,
H A DObjCARCOpts.cpp88 SmallPtrSet<const Value *, 4> Visited; local
98 if (!Visited.insert(P).second)
870 SmallPtrSet<const BasicBlock *, 4> Visited; local
884 DependingInstructions, Visited, PA);
890 DependingInstructions, Visited, PA);
1370 SmallPtrSet<BasicBlock *, 16> Visited; local
1383 Visited.insert(EntryBB);
1393 if (Visited.insert(SuccBB).second) {
1413 Visited.clear();
1427 Visited
1996 HasSafePathToPredecessorCall(const Value *Arg, Instruction *Retain, SmallPtrSetImpl<Instruction *> &DepInsts, SmallPtrSetImpl<const BasicBlock *> &Visited, ProvenanceAnalysis &PA) argument
2020 FindPredecessorRetainWithSafePath(const Value *Arg, BasicBlock *BB, Instruction *Autorelease, SmallPtrSetImpl<Instruction *> &DepInsts, SmallPtrSetImpl<const BasicBlock *> &Visited, ProvenanceAnalysis &PA) argument
2082 SmallPtrSet<const BasicBlock *, 4> Visited; local
[all...]
/freebsd-11.0-release/contrib/llvm/tools/clang/lib/StaticAnalyzer/Frontend/
H A DAnalysisConsumer.cpp311 getInliningModeForFunction(const Decl *D, const SetOfConstDecls &Visited);
421 const SetOfConstDecls &Visited,
437 return Visited.count(D);
442 const SetOfConstDecls &Visited) {
446 if (Visited.count(D)) {
469 // the previously processed functions. Use external Visited set to identify
473 SetOfConstDecls Visited; local
489 if (shouldSkipFunction(D, Visited, VisitedAsTopLevel))
495 HandleCode(D, AM_Path, getInliningModeForFunction(D, Visited),
502 Visited
420 shouldSkipFunction(const Decl *D, const SetOfConstDecls &Visited, const SetOfConstDecls &VisitedAsTopLevel) argument
441 getInliningModeForFunction(const Decl *D, const SetOfConstDecls &Visited) argument
679 RunPathSensitiveChecks(Decl *D, ExprEngine::InliningModes IMode, SetOfConstDecls *Visited) argument
[all...]
/freebsd-11.0-release/contrib/llvm/lib/Analysis/
H A DCFG.cpp33 SmallPtrSet<const BasicBlock*, 8> Visited;
37 Visited.insert(BB);
48 if (Visited.insert(BB).second) {
141 SmallSet<const BasicBlock*, 64> Visited; local
144 if (!Visited.insert(BB).second)
H A DMemoryDependenceAnalysis.cpp857 SmallPtrSet<BasicBlock*, 64> Visited; local
868 if (!Visited.insert(DirtyBB).second)
991 DenseMap<BasicBlock*, Value*> Visited; local
993 Result, Visited, true))
1110 /// 'Visited'.
1123 DenseMap<BasicBlock *, Value *> &Visited, bool SkipFirstBlock) {
1159 isLoad, StartBB, Result, Visited,
1179 isLoad, StartBB, Result, Visited,
1194 if (!Visited.empty()) {
1197 DenseMap<BasicBlock*, Value*>::iterator VI = Visited
1119 getNonLocalPointerDepFromBB( Instruction *QueryInst, const PHITransAddr &Pointer, const MemoryLocation &Loc, bool isLoad, BasicBlock *StartBB, SmallVectorImpl<NonLocalDepResult> &Result, DenseMap<BasicBlock *, Value *> &Visited, bool SkipFirstBlock) argument
[all...]
H A DLint.cpp104 SmallPtrSetImpl<Value *> &Visited) const;
620 SmallPtrSet<Value *, 4> Visited; local
621 return findValueImpl(V, OffsetOk, Visited);
626 SmallPtrSetImpl<Value *> &Visited) const {
628 if (!Visited.insert(V).second)
647 return findValueImpl(U, OffsetOk, Visited);
656 return findValueImpl(W, OffsetOk, Visited);
659 return findValueImpl(CI->getOperand(0), OffsetOk, Visited);
664 return findValueImpl(W, OffsetOk, Visited);
671 return findValueImpl(CE->getOperand(0), OffsetOk, Visited);
[all...]
H A DCodeMetrics.cpp32 SmallPtrSet<const Value *, 32> Visited; local
44 if (!Visited.insert(V).second)
H A DDemandedBits.cpp262 Visited.clear();
294 // To save memory, we don't add I to the Visited set here. Instead, we
313 Visited.insert(UserI);
349 } else if (!Visited.count(I)) {
369 return !Visited.count(I) && AliveBits.find(I) == AliveBits.end() &&
H A DCaptureTracking.cpp216 SmallSet<const Use *, Threshold> Visited; local
226 Visited.insert(&U);
287 if (Visited.insert(&UU).second)
H A DGlobalsModRef.cpp595 SmallPtrSet<const Value *, 8> Visited; local
597 Visited.insert(V);
626 if (Visited.insert(LHS).second)
628 if (Visited.insert(RHS).second)
635 if (Visited.insert(Op).second)
681 SmallPtrSet<const Value *, 8> Visited; local
683 Visited.insert(V);
743 if (Visited.insert(LHS).second)
745 if (Visited.insert(RHS).second)
752 if (Visited
[all...]
/freebsd-11.0-release/contrib/llvm/tools/clang/lib/Analysis/
H A DThreadSafetyTIL.cpp169 if (Visited) return ID;
170 Visited = true;
192 // Visited is assumed to have been set by the topologicalSort. This pass
193 // assumes !Visited means that we've visited this node before.
194 if (!Visited) return ID;
195 Visited = false;
H A DReachableCode.cpp345 llvm::BitVector Visited; member in class:__anon3722::DeadCodeScan
357 : Visited(reachable.size()),
377 if (Reachable[blockID] || Visited[blockID])
379 Visited[blockID] = true;
390 if (Visited[blockID]) {
396 Visited[blockID] = true;
/freebsd-11.0-release/contrib/llvm/lib/CodeGen/
H A DScheduleDAG.cpp501 Visited.resize(DAGSize);
526 Visited.reset();
530 Shift(Visited, LowerBound, UpperBound);
553 Visited.set(SU->NodeNum);
564 if (!Visited.test(s) && Node2Index[s] < UpperBound) {
573 void ScheduleDAGTopologicalSort::Shift(BitVector& Visited, int LowerBound,
582 if (Visited.test(w)) {
584 Visited.reset(w);
624 Visited.reset();
/freebsd-11.0-release/contrib/llvm/tools/clang/lib/Sema/
H A DSemaLookup.cpp1762 llvm::SmallPtrSet<DeclContext*, 8> Visited;
1763 Visited.insert(StartDC);
1773 if (Visited.insert(ND).second)
1821 if (Visited.insert(Nom).second)
3359 VisibleDeclsRecord &Visited) {
3364 if (Visited.visitedContext(Ctx->getPrimaryContext()))
3387 Consumer.FoundDecl(ND, Visited.checkHidden(ND), Ctx, InBaseClass);
3388 Visited.add(ND);
3404 Consumer.FoundDecl(ND, Visited.checkHidden(ND), Ctx, InBaseClass);
3405 Visited
[all...]

Completed in 131 milliseconds

12345