Home
last modified time | relevance | path

Searched refs:Visited (Results 1 – 25 of 244) sorted by relevance

12345678910

/llvm-project-15.0.7/llvm/lib/Analysis/
H A DCodeMetrics.cpp28 SmallPtrSetImpl<const Value *> &Visited, in appendSpeculatableOperands() argument
35 if (Visited.insert(Operand).second) in appendSpeculatableOperands()
41 static void completeEphemeralValues(SmallPtrSetImpl<const Value *> &Visited, in completeEphemeralValues() argument
54 assert(Visited.count(V) && in completeEphemeralValues()
65 appendSpeculatableOperands(V, Visited, Worklist); in completeEphemeralValues()
73 SmallPtrSet<const Value *, 32> Visited; in collectEphemeralValues() local
88 appendSpeculatableOperands(I, Visited, Worklist); in collectEphemeralValues()
91 completeEphemeralValues(Visited, Worklist, EphValues); in collectEphemeralValues()
97 SmallPtrSet<const Value *, 32> Visited; in collectEphemeralValues() local
108 appendSpeculatableOperands(I, Visited, Worklist); in collectEphemeralValues()
[all …]
H A DLoads.cpp42 const TargetLibraryInfo *TLI, SmallPtrSetImpl<const Value *> &Visited, in isDereferenceableAndAlignedPointer() argument
51 if (!Visited.insert(V).second) in isDereferenceableAndAlignedPointer()
60 Size, DL, CtxI, DT, TLI, Visited, in isDereferenceableAndAlignedPointer()
63 Size, DL, CtxI, DT, TLI, Visited, in isDereferenceableAndAlignedPointer()
72 Visited, MaxDepth); in isDereferenceableAndAlignedPointer()
136 CtxI, DT, TLI, Visited, MaxDepth); in isDereferenceableAndAlignedPointer()
143 TLI, Visited, MaxDepth); in isDereferenceableAndAlignedPointer()
148 Visited, MaxDepth); in isDereferenceableAndAlignedPointer()
153 DT, TLI, Visited, MaxDepth); in isDereferenceableAndAlignedPointer()
200 SmallPtrSet<const Value *, 32> Visited; in isDereferenceableAndAlignedPointer() local
[all …]
H A DCFG.cpp40 SmallPtrSet<const BasicBlock*, 8> Visited; in FindFunctionBackedges() local
44 Visited.insert(BB); in FindFunctionBackedges()
55 if (Visited.insert(BB).second) { in FindFunctionBackedges()
161 SmallPtrSet<const BasicBlock*, 32> Visited; in isPotentiallyReachableFromMany() local
164 if (!Visited.insert(BB).second) in isPotentiallyReachableFromMany()
H A DImportedFunctionsInliningStatistics.cpp182 if (!Node.Visited) in calculateRealInlines()
188 assert(!GraphNode.Visited); in dfs()
189 GraphNode.Visited = true; in dfs()
192 if (!InlinedFunctionNode->Visited) in dfs()
H A DLazyCallGraph.cpp85 SmallPtrSet<Constant *, 16> Visited; in populateSlow() local
109 Visited.insert(Callee); in populateSlow()
116 if (Visited.insert(C).second) in populateSlow()
131 if (!Visited.count(F)) in populateSlow()
197 SmallPtrSet<Constant *, 16> Visited; in LazyCallGraph() local
264 SmallPtrSet<Node *, 4> Visited; in verify() local
390 SmallPtrSet<Node *, 4> Visited; in verify() local
430 SmallPtrSet<const RefSCC *, 4> Visited; in isAncestorOf() local
432 Visited.insert(this); in isAncestorOf()
1568 SmallPtrSet<Constant *, 16> Visited; in getEdgeKind() local
[all …]
H A DLint.cpp120 SmallPtrSetImpl<Value *> &Visited) const;
637 SmallPtrSet<Value *, 4> Visited; in findValue() local
638 return findValueImpl(V, OffsetOk, Visited); in findValue()
645 if (!Visited.insert(V).second) in findValueImpl()
663 return findValueImpl(U, OffsetOk, Visited); in findValueImpl()
673 return findValueImpl(W, OffsetOk, Visited); in findValueImpl()
676 return findValueImpl(CI->getOperand(0), OffsetOk, Visited); in findValueImpl()
681 return findValueImpl(W, OffsetOk, Visited); in findValueImpl()
688 return findValueImpl(CE->getOperand(0), OffsetOk, Visited); in findValueImpl()
695 return findValueImpl(W, OffsetOk, Visited); in findValueImpl()
[all …]
/llvm-project-15.0.7/llvm/include/llvm/ADT/
H A DDepthFirstIterator.h53 SetType Visited;
59 df_iterator_storage(SetType &VSet) : Visited(VSet) {} in df_iterator_storage()
60 df_iterator_storage(const df_iterator_storage &S) : Visited(S.Visited) {} in df_iterator_storage()
62 SetType &Visited; variable
107 this->Visited.insert(Node); in df_iterator()
115 if (this->Visited.insert(Node).second) in df_iterator()
138 if (this->Visited.insert(Next).second) { in toNext()
144 this->Visited.completed(Node); in toNext()
204 return this->Visited.contains(Node); in nodeVisited()
H A DSCCIterator.h167 typename DenseMap<NodeRef, unsigned>::iterator Visited = in DFSVisitChildren() local
169 if (Visited == nodeVisitNumbers.end()) { in DFSVisitChildren()
175 unsigned childNum = Visited->second; in DFSVisitChildren()
261 bool Visited = true; member
348 NodeInfoMap[Edge->Target].Visited = false; in scc_member_iterator()
354 if (NodeInfoMap[Edge->Source].Visited) { in scc_member_iterator()
356 NodeInfoMap[Edge->Source].Visited = false; in scc_member_iterator()
365 if (MSTEdges.count(&Edge) && !NodeInfoMap[Edge.Target].Visited) { in scc_member_iterator()
366 NodeInfoMap[Edge.Target].Visited = true; in scc_member_iterator()
H A DPostOrderIterator.h60 SetType Visited; variable
66 return Visited.insert(To).second; in insertEdge()
76 SetType &Visited; variable
79 po_iterator_storage(SetType &VSet) : Visited(VSet) {} in po_iterator_storage()
80 po_iterator_storage(const po_iterator_storage &S) : Visited(S.Visited) {} in po_iterator_storage()
86 return Visited.insert(To).second; in insertEdge()
/llvm-project-15.0.7/llvm/lib/IR/
H A DReplaceConstant.cpp37 ValueMap<ConstantExpr *, Instruction *> Visited; in convertConstantExprsToInstructions() local
62 if (!Visited.count(CE)) { in convertConstantExprsToInstructions()
69 Visited[CE] = NI; in convertConstantExprsToInstructions()
77 NI = Visited[CE]; in convertConstantExprsToInstructions()
92 for (auto Item : Visited) in convertConstantExprsToInstructions()
/llvm-project-15.0.7/llvm/lib/CodeGen/
H A DScheduleDAG.cpp509 Visited.resize(DAGSize); in InitDAGTopologicalSorting()
556 Visited.reset(); in AddPred()
560 Shift(Visited, LowerBound, UpperBound); in AddPred()
579 Visited.set(SU->NodeNum); in DFS()
613 Visited.reset(); in GetSubGraph()
633 Visited.set(s); in GetSubGraph()
665 if (!VisitedBack.test(s) && Visited.test(s)) { in GetSubGraph()
687 if (Visited.test(w)) { in Shift()
689 Visited.reset(w); in Shift()
720 Visited.resize(Node2Index.size()); in AddSUnitWithoutPredecessors()
[all …]
H A DReachingDefAnalysis.cpp388 SmallPtrSet<MachineBasicBlock*, 4>Visited; in getGlobalUses() local
391 if (Visited.count(MBB) || !MBB->isLiveIn(PhysReg)) in getGlobalUses()
395 Visited.insert(MBB); in getGlobalUses()
608 SmallPtrSet<MachineInstr*, 2> Visited; in isSafeToRemove() local
609 return isSafeToRemove(MI, Visited, ToRemove, Ignore); in isSafeToRemove()
615 SmallPtrSet<MachineInstr*, 2> Visited; in isSafeToRemove() local
616 return isSafeToRemove(MI, Visited, ToRemove, Ignore); in isSafeToRemove()
620 ReachingDefAnalysis::isSafeToRemove(MachineInstr *MI, InstSet &Visited, in isSafeToRemove() argument
622 if (Visited.count(MI) || Ignore.count(MI)) in isSafeToRemove()
630 Visited.insert(MI); in isSafeToRemove()
[all …]
/llvm-project-15.0.7/clang/lib/Analysis/FlowSensitive/
H A DDataflowEnvironment.cpp426 llvm::DenseSet<QualType> Visited; in createValue() local
438 QualType Type, llvm::DenseSet<QualType> &Visited, int Depth, in createValueUnlessSelfReferential() argument
462 if (Visited.insert(PointeeType.getCanonicalType()).second) { in createValueUnlessSelfReferential()
464 PointeeType, Visited, Depth, CreatedValuesCount); in createValueUnlessSelfReferential()
465 Visited.erase(PointeeType.getCanonicalType()); in createValueUnlessSelfReferential()
479 if (Visited.insert(PointeeType.getCanonicalType()).second) { in createValueUnlessSelfReferential()
481 PointeeType, Visited, Depth, CreatedValuesCount); in createValueUnlessSelfReferential()
482 Visited.erase(PointeeType.getCanonicalType()); in createValueUnlessSelfReferential()
500 if (Visited.contains(FieldType.getCanonicalType())) in createValueUnlessSelfReferential()
503 Visited.insert(FieldType.getCanonicalType()); in createValueUnlessSelfReferential()
[all …]
/llvm-project-15.0.7/llvm/include/llvm/Analysis/
H A DIntervalIterator.h90 std::set<BasicBlock *> Visited; variable
108 : IntStack(std::move(x.IntStack)), Visited(std::move(x.Visited)), in IntervalIterator()
177 if (!Visited.insert(Header).second) in ProcessInterval()
205 if (Visited.count(NodeHeader)) { // Node already been visited? in ProcessNode()
225 Visited.insert(NodeHeader); // The node has now been visited! in ProcessNode()
H A DMustExecute.h287 : Visited(std::move(Other.Visited)), Explorer(Other.Explorer), in MustBeExecutedIterator()
292 std::swap(Visited, Other.Visited);
333 return Visited.count({I, ExplorationDirection::FORWARD}) || in count()
334 Visited.count({I, ExplorationDirection::BACKWARD}); in count()
358 VisitedSetTy Visited; member
H A DCFG.h148 SmallPtrSet<NodeT, 32> Visited; in containsIrreducibleCFG() local
150 Visited.insert(Node); in containsIrreducibleCFG()
153 if (!Visited.count(Succ)) in containsIrreducibleCFG()
/llvm-project-15.0.7/llvm/lib/Target/PowerPC/
H A DPPCCTRLoopsVerify.cpp100 SmallSet<MachineBasicBlock *, 16> Visited; in verifyCTRBranch() local
105 Visited.insert(MBB); in verifyCTRBranch()
111 Visited.insert(MBB); in verifyCTRBranch()
155 if (!Visited.count(MBB)) { in verifyCTRBranch()
/llvm-project-15.0.7/llvm/lib/Transforms/Instrumentation/
H A DControlHeightReduction.cpp476 auto It = Visited.find(V); in getBaseValues()
477 if (It != Visited.end()) { in getBaseValues()
516 auto It = Visited.find(I); in checkHoistValue()
517 if (It != Visited.end()) { in checkHoistValue()
524 Visited[I] = false; in checkHoistValue()
531 Visited[I] = true; in checkHoistValue()
542 Visited)) { in checkHoistValue()
551 Visited[I] = true; in checkHoistValue()
555 Visited[I] = false; in checkHoistValue()
889 DenseMap<Instruction *, bool> Visited; in checkScopeHoistable() local
[all …]
/llvm-project-15.0.7/llvm/lib/Transforms/Utils/
H A DSampleProfileInference.cpp610 findReachable(Func.Entry, Visited); in joinIsolatedComponents()
615 if (Block.Flow > 0 && !Visited[I]) { in joinIsolatedComponents()
635 if (Visited[Src]) in findReachable()
639 Visited[Src] = true; in findReachable()
647 Visited[Dst] = true; in findReachable()
821 Visited[SrcBlock->Index] = true; in findUnknownSubgraph()
833 if (Visited[Dst]) in findUnknownSubgraph()
836 Visited[Dst] = true; in findUnknownSubgraph()
1215 Visited[Func.Entry] = true; in verifyWeights()
1220 if (!Visited[Dst]) { in verifyWeights()
[all …]
H A DBypassSlowDivision.cpp83 bool isHashLikeValue(Value *V, VisitedSetTy &Visited);
84 ValueRange getValueRange(Value *Op, VisitedSetTy &Visited);
190 bool FastDivInsertionTask::isHashLikeValue(Value *V, VisitedSetTy &Visited) { in isHashLikeValue() argument
212 if (Visited.size() >= 16) in isHashLikeValue()
216 if (!Visited.insert(I).second) in isHashLikeValue()
221 return getValueRange(V, Visited) == VALRNG_LIKELY_LONG || in isHashLikeValue()
231 VisitedSetTy &Visited) { in getValueRange() argument
253 if (isHashLikeValue(V, Visited)) in getValueRange()
/llvm-project-15.0.7/llvm/lib/Target/AMDGPU/Utils/
H A DAMDGPUMemoryUtils.cpp71 SmallPtrSet<const User *, 8> Visited; in shouldLowerLDSToStruct() local
78 Visited.insert(V); in shouldLowerLDSToStruct()
175 SmallSet<MemoryAccess *, 8> Visited; in isClobberedInFunction() local
190 if (!Visited.insert(MA).second) in isClobberedInFunction()
/llvm-project-15.0.7/llvm/lib/Transforms/Scalar/
H A DGuardWidening.cpp172 SmallPtrSet<const Instruction *, 8> Visited; in isAvailableAt() local
173 return isAvailableAt(V, InsertPos, Visited); in isAvailableAt()
177 SmallPtrSetImpl<const Instruction *> &Visited) const;
236 SmallPtrSet<const Value *, 8> Visited; in parseRangeChecks() local
237 return parseRangeChecks(CheckCond, Checks, Visited); in parseRangeChecks()
241 SmallPtrSetImpl<const Value *> &Visited);
466 SmallPtrSetImpl<const Instruction *> &Visited) const { in isAvailableAt()
468 if (!Inst || DT.dominates(Inst, Loc) || Visited.count(Inst)) in isAvailableAt()
475 Visited.insert(Inst); in isAvailableAt()
579 SmallPtrSetImpl<const Value *> &Visited) { in parseRangeChecks() argument
[all …]
/llvm-project-15.0.7/clang/lib/StaticAnalyzer/Frontend/
H A DAnalysisConsumer.cpp245 getInliningModeForFunction(const Decl *D, const SetOfConstDecls &Visited);
391 const SetOfConstDecls &Visited, in shouldSkipFunction() argument
421 return Visited.count(D); in shouldSkipFunction()
426 const SetOfConstDecls &Visited) { in getInliningModeForFunction() argument
430 if (Visited.count(D) && isa<ObjCMethodDecl>(D)) { in getInliningModeForFunction()
455 SetOfConstDecls Visited; in HandleDeclsCallGraph() local
469 if (shouldSkipFunction(D, Visited, VisitedAsTopLevel)) in HandleDeclsCallGraph()
487 HandleCode(D, AM_Path, getInliningModeForFunction(D, Visited), in HandleDeclsCallGraph()
494 Visited.insert(isa<ObjCMethodDecl>(Callee) ? Callee in HandleDeclsCallGraph()
/llvm-project-15.0.7/llvm/lib/Transforms/ObjCARC/
H A DDependencyAnalysis.cpp212 SmallPtrSet<const BasicBlock *, 4> Visited; in findDependencies() local
230 if (Visited.insert(PredBB).second) in findDependencies()
247 for (const BasicBlock *BB : Visited) { in findDependencies()
251 if (Succ != StartBB && !Visited.count(Succ)) in findDependencies()
/llvm-project-15.0.7/clang-tools-extra/clang-tidy/modernize/
H A DUseNullptrCheck.cpp114 : CastLoc(CastLoc), SM(SM), Visited(false), CastFound(false), in MacroArgUsageVisitor()
120 bool VisitedPreviously = Visited; in TraverseStmt()
130 if (Visited && !CastFound) { in TraverseStmt()
139 Visited = false; in TraverseStmt()
147 Visited = true; in VisitStmt()
173 bool Visited; member in clang::tidy::modernize::__anon6c2656c60111::MacroArgUsageVisitor

12345678910