Home
last modified time | relevance | path

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

12345678910

/freebsd-14.2/contrib/llvm-project/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 DGuardUtils.cpp37 SmallPtrSet<const BasicBlock *, 2> Visited; in isGuardAsWidenableBranch() local
38 Visited.insert(DeoptBB); in isGuardAsWidenableBranch()
49 } while (Visited.insert(DeoptBB).second); in isGuardAsWidenableBranch()
121 SmallPtrSet<Value *, 4> Visited; in parseCondition() local
122 Visited.insert(Condition); in parseCondition()
127 if (Visited.insert(LHS).second) in parseCondition()
129 if (Visited.insert(RHS).second) in parseCondition()
H A DLoads.cpp40 const TargetLibraryInfo *TLI, SmallPtrSetImpl<const Value *> &Visited, in isDereferenceableAndAlignedPointer() argument
49 if (!Visited.insert(V).second) in isDereferenceableAndAlignedPointer()
75 CtxI, AC, DT, TLI, Visited, MaxDepth); in isDereferenceableAndAlignedPointer()
83 Visited, MaxDepth); in isDereferenceableAndAlignedPointer()
90 Visited, MaxDepth) && in isDereferenceableAndAlignedPointer()
93 Visited, MaxDepth); in isDereferenceableAndAlignedPointer()
117 AC, DT, TLI, Visited, MaxDepth); in isDereferenceableAndAlignedPointer()
151 TLI, Visited, MaxDepth); in isDereferenceableAndAlignedPointer()
156 Visited, MaxDepth); in isDereferenceableAndAlignedPointer()
194 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.cpp184 if (!Node.Visited) in calculateRealInlines()
190 assert(!GraphNode.Visited); in dfs()
191 GraphNode.Visited = true; in dfs()
194 if (!InlinedFunctionNode->Visited) in dfs()
H A DLint.cpp118 SmallPtrSetImpl<Value *> &Visited) const;
639 SmallPtrSet<Value *, 4> Visited; in findValue() local
640 return findValueImpl(V, OffsetOk, Visited); in findValue()
647 if (!Visited.insert(V).second) in findValueImpl()
666 return findValueImpl(U, OffsetOk, Visited); in findValueImpl()
676 return findValueImpl(W, OffsetOk, Visited); in findValueImpl()
679 return findValueImpl(CI->getOperand(0), OffsetOk, Visited); in findValueImpl()
684 return findValueImpl(W, OffsetOk, Visited); in findValueImpl()
691 return findValueImpl(CE->getOperand(0), OffsetOk, Visited); in findValueImpl()
698 return findValueImpl(W, OffsetOk, Visited); in findValueImpl()
[all …]
H A DLazyCallGraph.cpp80 SmallPtrSet<Constant *, 16> Visited; in populateSlow() local
104 Visited.insert(Callee); in populateSlow()
111 if (Visited.insert(C).second) in populateSlow()
126 if (!Visited.count(F)) in populateSlow()
192 SmallPtrSet<Constant *, 16> Visited; in LazyCallGraph() local
258 SmallPtrSet<Node *, 4> Visited; in verify() local
382 SmallPtrSet<Node *, 4> Visited; in verify() local
422 SmallPtrSet<const RefSCC *, 4> Visited; in isAncestorOf() local
424 Visited.insert(this); in isAncestorOf()
1577 SmallPtrSet<Constant *, 16> Visited; in getEdgeKind() local
[all …]
/freebsd-14.2/contrib/llvm-project/llvm/include/llvm/ADT/
H A DDepthFirstIterator.h52 SetType Visited;
58 df_iterator_storage(SetType &VSet) : Visited(VSet) {} in df_iterator_storage()
59 df_iterator_storage(const df_iterator_storage &S) : Visited(S.Visited) {} in df_iterator_storage()
61 SetType &Visited; variable
106 this->Visited.insert(Node); in df_iterator()
114 if (this->Visited.insert(Node).second) in df_iterator()
137 if (this->Visited.insert(Next).second) { in toNext()
143 this->Visited.completed(Node); in toNext()
203 return this->Visited.contains(Node); in nodeVisited()
H A DPostOrderIterator.h59 SetType Visited; variable
65 return Visited.insert(To).second; in insertEdge()
75 SetType &Visited; variable
78 po_iterator_storage(SetType &VSet) : Visited(VSet) {} in po_iterator_storage()
79 po_iterator_storage(const po_iterator_storage &S) : Visited(S.Visited) {} in po_iterator_storage()
86 return Visited.insert(To).second; in insertEdge()
H A DSCCIterator.h168 typename DenseMap<NodeRef, unsigned>::iterator Visited = in DFSVisitChildren() local
170 if (Visited == nodeVisitNumbers.end()) { in DFSVisitChildren()
176 unsigned childNum = Visited->second; in DFSVisitChildren()
262 bool Visited = false; member
357 if (!NodeInfoMap[Edge->Source].Visited && in scc_member_iterator()
360 NodeInfoMap[Edge->Source].Visited = true; in scc_member_iterator()
/freebsd-14.2/contrib/llvm-project/llvm/lib/CodeGen/
H A DScheduleDAG.cpp510 Visited.resize(DAGSize); in InitDAGTopologicalSorting()
557 Visited.reset(); in AddPred()
561 Shift(Visited, LowerBound, UpperBound); in AddPred()
580 Visited.set(SU->NodeNum); in DFS()
614 Visited.reset(); in GetSubGraph()
634 Visited.set(s); in GetSubGraph()
666 if (!VisitedBack.test(s) && Visited.test(s)) { in GetSubGraph()
688 if (Visited.test(w)) { in Shift()
690 Visited.reset(w); in Shift()
721 Visited.resize(Node2Index.size()); in AddSUnitWithoutPredecessors()
[all …]
H A DReachingDefAnalysis.cpp387 SmallPtrSet<MachineBasicBlock*, 4>Visited; in getGlobalUses() local
390 if (Visited.count(MBB) || !MBB->isLiveIn(PhysReg)) in getGlobalUses()
394 Visited.insert(MBB); in getGlobalUses()
607 SmallPtrSet<MachineInstr*, 2> Visited; in isSafeToRemove() local
608 return isSafeToRemove(MI, Visited, ToRemove, Ignore); in isSafeToRemove()
614 SmallPtrSet<MachineInstr*, 2> Visited; in isSafeToRemove() local
615 return isSafeToRemove(MI, Visited, ToRemove, Ignore); in isSafeToRemove()
619 ReachingDefAnalysis::isSafeToRemove(MachineInstr *MI, InstSet &Visited, in isSafeToRemove() argument
621 if (Visited.count(MI) || Ignore.count(MI)) in isSafeToRemove()
629 Visited.insert(MI); in isSafeToRemove()
[all …]
/freebsd-14.2/contrib/llvm-project/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()
/freebsd-14.2/contrib/llvm-project/llvm/lib/Target/PowerPC/
H A DPPCCTRLoopsVerify.cpp98 SmallSet<MachineBasicBlock *, 16> Visited; in verifyCTRBranch() local
103 Visited.insert(MBB); in verifyCTRBranch()
109 Visited.insert(MBB); in verifyCTRBranch()
153 if (!Visited.count(MBB)) { in verifyCTRBranch()
/freebsd-14.2/contrib/llvm-project/llvm/lib/Transforms/Instrumentation/
H A DBlockCoverageInference.cpp119 df_iterator_default_set<const BasicBlock *> Visited; in findDependencies() local
121 for (auto *N : inverse_depth_first_ext(BB, Visited)) in findDependencies()
123 if (F.size() != Visited.size()) { in findDependencies()
238 df_iterator_default_set<const BasicBlock *> Visited; in getReachableAvoiding() local
239 Visited.insert(&Avoid); in getReachableAvoiding()
241 auto Range = depth_first_ext(&Start, Visited); in getReachableAvoiding()
244 auto Range = inverse_depth_first_ext(&Start, Visited); in getReachableAvoiding()
H A DControlHeightReduction.cpp492 auto It = Visited.find(V); in getBaseValues()
493 if (It != Visited.end()) { in getBaseValues()
532 auto It = Visited.find(I); in checkHoistValue()
533 if (It != Visited.end()) { in checkHoistValue()
540 Visited[I] = false; in checkHoistValue()
547 Visited[I] = true; in checkHoistValue()
558 Visited)) { in checkHoistValue()
567 Visited[I] = true; in checkHoistValue()
571 Visited[I] = false; in checkHoistValue()
897 DenseMap<Instruction *, bool> Visited; in checkScopeHoistable() local
[all …]
/freebsd-14.2/contrib/llvm-project/llvm/lib/IR/
H A DType.cpp64 SmallPtrSet<Type *, 4> Visited; in isScalableTy() local
65 return STy->containsScalableVectorType(&Visited); in isScalableTy()
222 return ATy->getElementType()->isSized(Visited); in isSizedDerivedType()
225 return VTy->getElementType()->isSized(Visited); in isSizedDerivedType()
228 return TTy->getLayoutType()->isSized(Visited); in isSizedDerivedType()
230 return cast<StructType>(this)->isSized(Visited); in isSizedDerivedType()
401 SmallPtrSetImpl<Type *> *Visited) const { in containsScalableVectorType()
408 if (Visited && !Visited->insert(const_cast<StructType *>(this)).second) in containsScalableVectorType()
418 if (STy->containsScalableVectorType(Visited)) { in containsScalableVectorType()
558 if (Visited && !Visited->insert(const_cast<StructType*>(this)).second) in isSized()
[all …]
/freebsd-14.2/contrib/llvm-project/llvm/lib/Target/BPF/
H A DBPFPreserveStaticOffset.cpp457 SmallVector<Instruction *> &Visited,
462 SmallVector<Instruction *> &Visited, bool AllowPatial, in rewriteUses() argument
468 rewriteAccessChain(UI, GEPs, Visited, AllowPatial, StillUsed); in rewriteUses()
503 SmallVector<Instruction *> &Visited, in rewriteAccessChain() argument
506 Visited.push_back(Insn); in rewriteAccessChain()
507 rewriteUses(Insn, GEPs, Visited, AllowPatial, StillUsed); in rewriteAccessChain()
516 Visited.push_back(Insn); in rewriteAccessChain()
576 SmallVector<Instruction *> Visited; in rewriteAccessChain() local
578 rewriteUses(Marker, GEPs, Visited, AllowPatial, StillUsed); in rewriteAccessChain()
581 for (auto V = Visited.rbegin(); V != Visited.rend(); ++V) { in rewriteAccessChain()
/freebsd-14.2/contrib/llvm-project/llvm/lib/Transforms/Utils/
H A DBypassSlowDivision.cpp81 bool isHashLikeValue(Value *V, VisitedSetTy &Visited);
82 ValueRange getValueRange(Value *Op, VisitedSetTy &Visited);
188 bool FastDivInsertionTask::isHashLikeValue(Value *V, VisitedSetTy &Visited) { in isHashLikeValue() argument
210 if (Visited.size() >= 16) in isHashLikeValue()
214 if (!Visited.insert(I).second) in isHashLikeValue()
219 return getValueRange(V, Visited) == VALRNG_LIKELY_LONG || in isHashLikeValue()
229 VisitedSetTy &Visited) { in getValueRange() argument
251 if (isHashLikeValue(V, Visited)) in getValueRange()
H A DSampleProfileInference.cpp622 findReachable(Func.Entry, Visited); in joinIsolatedComponents()
627 if (Block.Flow > 0 && !Visited[I]) { in joinIsolatedComponents()
647 if (Visited[Src]) in findReachable()
651 Visited[Src] = true; in findReachable()
659 Visited[Dst] = true; in findReachable()
832 Visited[SrcBlock->Index] = true; in findUnknownSubgraph()
844 if (Visited[Dst]) in findUnknownSubgraph()
847 Visited[Dst] = true; in findUnknownSubgraph()
1298 Visited[Func.Entry] = true; in verifyOutput()
1303 if (!Visited[Dst]) { in verifyOutput()
[all …]
/freebsd-14.2/contrib/llvm-project/llvm/lib/Target/ARM/
H A DMVELaneInterleavingPass.cpp155 SmallPtrSetImpl<Instruction *> &Visited) { in tryInterleave() argument
182 Visited.insert(I); in tryInterleave()
204 Visited.insert(I); in tryInterleave()
415 SmallPtrSet<Instruction *, 16> Visited; in runOnFunction() local
420 !Visited.count(&I)) in runOnFunction()
421 Changed |= tryInterleave(&I, Visited); in runOnFunction()
/freebsd-14.2/contrib/llvm-project/clang/lib/StaticAnalyzer/Frontend/
H A DAnalysisConsumer.cpp244 getInliningModeForFunction(const Decl *D, const SetOfConstDecls &Visited);
390 const SetOfConstDecls &Visited, in shouldSkipFunction() argument
420 return Visited.count(D); in shouldSkipFunction()
425 const SetOfConstDecls &Visited) { in getInliningModeForFunction() argument
429 if (Visited.count(D) && isa<ObjCMethodDecl>(D)) { in getInliningModeForFunction()
454 SetOfConstDecls Visited; in HandleDeclsCallGraph() local
468 if (shouldSkipFunction(D, Visited, VisitedAsTopLevel)) in HandleDeclsCallGraph()
486 HandleCode(D, AM_Path, getInliningModeForFunction(D, Visited), in HandleDeclsCallGraph()
493 Visited.insert(isa<ObjCMethodDecl>(Callee) ? Callee in HandleDeclsCallGraph()
/freebsd-14.2/contrib/llvm-project/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()

12345678910