| /freebsd/contrib/llvm-project/llvm/lib/Analysis/ |
| H A D | CodeMetrics.cpp | 29 SmallPtrSetImpl<const Value *> &Visited, in appendSpeculatableOperands() argument
36 if (Visited.insert(Operand).second) in appendSpeculatableOperands()
42 static void completeEphemeralValues(SmallPtrSetImpl<const Value *> &Visited, in completeEphemeralValues() argument
55 assert(Visited.count(V) && in completeEphemeralValues()
66 appendSpeculatableOperands(V, Visited, Worklist); in completeEphemeralValues()
74 SmallPtrSet<const Value *, 32> Visited; in collectEphemeralValues() local
89 appendSpeculatableOperands(I, Visited, Worklist); in collectEphemeralValues()
92 completeEphemeralValues(Visited, Worklist, EphValues); in collectEphemeralValues()
98 SmallPtrSet<const Value *, 32> Visited; in collectEphemeralValues() local
109 appendSpeculatableOperands(I, Visited, Worklist); in collectEphemeralValues()
[all …]
|
| H A D | Loads.cpp | 40 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()
118 AC, DT, TLI, Visited, MaxDepth); in isDereferenceableAndAlignedPointer()
153 TLI, Visited, MaxDepth); in isDereferenceableAndAlignedPointer()
158 Visited, MaxDepth); in isDereferenceableAndAlignedPointer()
196 SmallPtrSet<const Value *, 32> Visited; in isDereferenceableAndAlignedPointer() local
[all …]
|
| H A D | Lint.cpp | 123 SmallPtrSetImpl<Value *> &Visited) const;
625 SmallPtrSet<Value *, 4> Visited; in findValue() local
626 return findValueImpl(V, OffsetOk, Visited); in findValue()
631 SmallPtrSetImpl<Value *> &Visited) const { in findValueImpl()
633 if (!Visited.insert(V).second) in findValueImpl()
652 return findValueImpl(U, OffsetOk, Visited); in findValueImpl()
662 return findValueImpl(W, OffsetOk, Visited); in findValueImpl()
665 return findValueImpl(CI->getOperand(0), OffsetOk, Visited); in findValueImpl()
670 return findValueImpl(W, OffsetOk, Visited); in findValueImpl()
677 return findValueImpl(CE->getOperand(0), OffsetOk, Visited); in findValueImpl()
[all …]
|
| H A D | ImportedFunctionsInliningStatistics.cpp | 183 if (!Node.Visited) in calculateRealInlines()
189 assert(!GraphNode.Visited); in dfs()
190 GraphNode.Visited = true; in dfs()
193 if (!InlinedFunctionNode->Visited) in dfs()
|
| H A D | GuardUtils.cpp | 37 SmallPtrSet<const BasicBlock *, 2> Visited; in isGuardAsWidenableBranch()
38 Visited.insert(DeoptBB); in isGuardAsWidenableBranch()
49 } while (Visited.insert(DeoptBB).second); in isGuardAsWidenableBranch()
121 SmallPtrSet<Value *, 4> Visited;
122 Visited.insert(Condition);
127 if (Visited.insert(LHS).second)
129 if (Visited.insert(RHS).second)
35 SmallPtrSet<const BasicBlock *, 2> Visited; isGuardAsWidenableBranch() local
|
| H A D | CFG.cpp | 40 SmallPtrSet<const BasicBlock*, 8> Visited; in FindFunctionBackedges() local
44 Visited.insert(BB); in FindFunctionBackedges()
55 if (Visited.insert(BB).second) { in FindFunctionBackedges()
174 SmallPtrSet<const BasicBlock*, 32> Visited; in isReachableImpl() local
177 if (!Visited.insert(BB).second) in isReachableImpl()
|
| H A D | LazyCallGraph.cpp | 80 SmallPtrSet<Constant *, 16> Visited; in populateSlow() local
104 Visited.insert(Callee); in populateSlow()
111 if (Visited.insert(C).second) in populateSlow()
118 visitReferences(Worklist, Visited, [&](Function &F) { in populateSlow()
126 if (!Visited.count(F)) in populateSlow()
192 SmallPtrSet<Constant *, 16> Visited; in LazyCallGraph() local
195 if (Visited.insert(GV.getInitializer()).second) in LazyCallGraph()
201 visitReferences(Worklist, Visited, [&](Function &F) { in LazyCallGraph()
266 SmallPtrSet<Node *, 4> Visited; in verify() local
270 if (!Visited.insert(VisitingNode).second) in verify()
[all …]
|
| /freebsd/contrib/llvm-project/llvm/include/llvm/ADT/ |
| H A D | DepthFirstIterator.h | 52 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 D | PostOrderIterator.h | 59 SetType Visited;
65 return Visited.insert(To).second; in insertEdge()
75 SetType &Visited;
78 po_iterator_storage(SetType &VSet) : Visited(VSet) {}
79 po_iterator_storage(const po_iterator_storage &S) : Visited(S.Visited) {} in po_iterator_storage()
86 return Visited.insert(To).second; in insertEdge()
60 SetType Visited; global() variable
76 SetType &Visited; global() variable
|
| H A D | SCCIterator.h | 168 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/contrib/llvm-project/llvm/lib/CodeGen/ |
| H A D | ScheduleDAG.cpp | 512 Visited.resize(DAGSize); in InitDAGTopologicalSorting()
559 Visited.reset(); in AddPred()
563 Shift(Visited, LowerBound, UpperBound); in AddPred()
582 Visited.set(SU->NodeNum); in DFS()
593 if (!Visited.test(s) && Node2Index[s] < UpperBound) { in DFS()
616 Visited.reset(); in GetSubGraph()
635 if (!Visited.test(s) && Node2Index[s] < UpperBound) { in GetSubGraph()
636 Visited.set(s); in GetSubGraph()
668 if (!VisitedBack.test(s) && Visited.test(s)) { in GetSubGraph()
681 void ScheduleDAGTopologicalSort::Shift(BitVector& Visited, int LowerBound, in Shift() argument
[all …]
|
| H A D | ReachingDefAnalysis.cpp | 387 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/contrib/llvm-project/llvm/lib/Target/SPIRV/ |
| H A D | SPIRVEmitIntrinsics.cpp | 86 Type *deduceElementTypeHelper(Value *I, std::unordered_set<Value *> &Visited,
91 std::unordered_set<Value *> &Visited,
94 std::unordered_set<Value *> &Visited,
102 std::unordered_set<Value *> &Visited,
325 std::unordered_set<Value *> Visited; in deduceElementTypeByValueDeep() local
326 return deduceElementTypeByValueDeep(ValueTy, Operand, Visited, in deduceElementTypeByValueDeep()
331 Type *ValueTy, Value *Operand, std::unordered_set<Value *> &Visited, in deduceElementTypeByValueDeep() argument
337 deduceElementTypeHelper(Operand, Visited, UnknownElemTypeI8)) in deduceElementTypeByValueDeep()
340 Ty = deduceNestedTypeHelper(dyn_cast<User>(Operand), Ty, Visited, in deduceElementTypeByValueDeep()
349 Value *Op, std::unordered_set<Value *> &Visited, bool UnknownElemTypeI8) { in deduceElementTypeByUsersDeep() argument
[all …]
|
| /freebsd/contrib/llvm-project/llvm/include/llvm/Analysis/ |
| H A D | MustExecute.h | 287 : 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 D | CFG.h | 160 SmallPtrSet<NodeT, 32> Visited; in containsIrreducibleCFG() local
162 Visited.insert(Node); in containsIrreducibleCFG()
165 if (!Visited.count(Succ)) in containsIrreducibleCFG()
|
| /freebsd/contrib/llvm-project/llvm/lib/Target/PowerPC/ |
| H A D | PPCCTRLoopsVerify.cpp | 98 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/contrib/llvm-project/llvm/lib/IR/ |
| H A D | Type.cpp | 64 SmallPtrSet<Type *, 4> Visited; in isScalableTy() local
65 return STy->containsScalableVectorType(&Visited); in isScalableTy()
220 bool Type::isSizedDerivedType(SmallPtrSetImpl<Type*> *Visited) const { in isSizedDerivedType()
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()
[all …]
|
| /freebsd/contrib/llvm-project/llvm/lib/Transforms/Instrumentation/ |
| H A D | BlockCoverageInference.cpp | 119 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 D | ControlHeightReduction.cpp | 492 DenseMap<Value *, std::set<Value *>> &Visited) { in getBaseValues() argument
493 auto It = Visited.find(V); in getBaseValues()
494 if (It != Visited.end()) { in getBaseValues()
504 return Visited.insert(std::make_pair(V, std::move(Result))).first->second; in getBaseValues()
508 const std::set<Value *> &OpResult = getBaseValues(Op, DT, Visited); in getBaseValues()
511 return Visited.insert(std::make_pair(V, std::move(Result))).first->second; in getBaseValues()
519 return Visited.insert(std::make_pair(V, std::move(Result))).first->second; in getBaseValues()
530 DenseMap<Instruction *, bool> &Visited) { in checkHoistValue() argument
533 auto It = Visited.find(I); in checkHoistValue()
534 if (It != Visited.end()) { in checkHoistValue()
[all …]
|
| /freebsd/contrib/llvm-project/clang/lib/Analysis/FlowSensitive/ |
| H A D | DataflowEnvironment.cpp | 913 llvm::DenseSet<QualType> Visited; in initializeFieldsWithValues() local
915 initializeFieldsWithValues(Loc, Type, Visited, 0, CreatedValuesCount); in initializeFieldsWithValues()
966 llvm::DenseSet<QualType> Visited; in createValue() local
968 Value *Val = createValueUnlessSelfReferential(Type, Visited, /*Depth=*/0, in createValue()
978 QualType Type, llvm::DenseSet<QualType> &Visited, int Depth, in createValueUnlessSelfReferential() argument
1006 createLocAndMaybeValue(PointeeType, Visited, Depth, CreatedValuesCount); in createValueUnlessSelfReferential()
1016 llvm::DenseSet<QualType> &Visited, in createLocAndMaybeValue() argument
1018 if (!Visited.insert(Ty.getCanonicalType()).second) in createLocAndMaybeValue()
1021 [&Visited, Ty] { Visited.erase(Ty.getCanonicalType()); }); in createLocAndMaybeValue()
1027 initializeFieldsWithValues(Loc, Ty, Visited, Depth, CreatedValuesCount); in createLocAndMaybeValue()
[all …]
|
| /freebsd/contrib/llvm-project/llvm/lib/Target/BPF/ |
| H A D | BPFPreserveStaticOffset.cpp | 458 SmallVector<Instruction *> &Visited,
463 SmallVector<Instruction *> &Visited, bool AllowPatial, in rewriteUses() argument
469 rewriteAccessChain(UI, GEPs, Visited, AllowPatial, StillUsed); in rewriteUses()
504 SmallVector<Instruction *> &Visited, in rewriteAccessChain() argument
507 Visited.push_back(Insn); in rewriteAccessChain()
508 rewriteUses(Insn, GEPs, Visited, AllowPatial, StillUsed); in rewriteAccessChain()
517 Visited.push_back(Insn); in rewriteAccessChain()
577 SmallVector<Instruction *> Visited; in rewriteAccessChain() local
579 rewriteUses(Marker, GEPs, Visited, AllowPatial, StillUsed); in rewriteAccessChain()
582 for (auto V = Visited.rbegin(); V != Visited.rend(); ++V) { in rewriteAccessChain()
|
| /freebsd/contrib/llvm-project/llvm/lib/Transforms/Utils/ |
| H A D | BypassSlowDivision.cpp | 81 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 D | SampleProfileInference.cpp | 621 auto Visited = BitVector(NumBlocks(), false); in joinIsolatedComponents() local
622 findReachable(Func.Entry, Visited); in joinIsolatedComponents()
627 if (Block.Flow > 0 && !Visited[I]) { in joinIsolatedComponents()
638 findReachable(Jump->Target, Visited); in joinIsolatedComponents()
646 void findReachable(uint64_t Src, BitVector &Visited) { in findReachable() argument
647 if (Visited[Src]) in findReachable()
651 Visited[Src] = true; in findReachable()
657 if (Jump->Flow > 0 && !Visited[Dst]) { in findReachable()
659 Visited[Dst] = true; in findReachable()
828 auto Visited = BitVector(NumBlocks(), false); in findUnknownSubgraph() local
[all …]
|
| /freebsd/contrib/llvm-project/llvm/lib/Target/ARM/ |
| H A D | MVELaneInterleavingPass.cpp | 155 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/contrib/llvm-project/clang/lib/StaticAnalyzer/Frontend/ |
| H A D | AnalysisConsumer.cpp | 244 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()
|