Home
last modified time | relevance | path

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

1234567891011

/freebsd/contrib/llvm-project/llvm/lib/Analysis/
H A DCodeMetrics.cpp29 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 DCFG.cpp41 SmallPtrSet<const BasicBlock*, 8> Visited; in FindFunctionBackedges() local
45 Visited.insert(BB); in FindFunctionBackedges()
56 if (Visited.insert(BB).second) { in FindFunctionBackedges()
175 SmallPtrSet<const BasicBlock*, 32> Visited; in isReachableImpl() local
178 if (!Visited.insert(BB).second) in isReachableImpl()
344 SmallPtrSet<const BasicBlock *, 16> Visited; in canReturn() local
346 Visited.insert(&F.front()); in canReturn()
354 if (Visited.insert(Succ).second) in canReturn()
H A DLoads.cpp73 const TargetLibraryInfo *TLI, SmallPtrSetImpl<const Value *> &Visited, in isDereferenceableAndAlignedPointer() argument
82 if (!Visited.insert(V).second) in isDereferenceableAndAlignedPointer()
108 CtxI, AC, DT, TLI, Visited, MaxDepth); in isDereferenceableAndAlignedPointer()
116 Visited, MaxDepth); in isDereferenceableAndAlignedPointer()
123 Visited, MaxDepth) && in isDereferenceableAndAlignedPointer()
126 Visited, MaxDepth); in isDereferenceableAndAlignedPointer()
165 AC, DT, TLI, Visited, MaxDepth); in isDereferenceableAndAlignedPointer()
199 TLI, Visited, MaxDepth); in isDereferenceableAndAlignedPointer()
204 Visited, MaxDepth); in isDereferenceableAndAlignedPointer()
223 SmallPtrSet<const Value *, 32> Visited; in isDereferenceableAndAlignedPointer() local
[all …]
H A DGuardUtils.cpp37 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 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()
/freebsd/contrib/llvm-project/llvm/lib/IR/
H A DType.cpp62 bool Type::isScalableTy(SmallPtrSetImpl<const Type *> &Visited) const { in isScalableTy()
64 return ATy->getElementType()->isScalableTy(Visited); in isScalableTy()
66 return STy->isScalableTy(Visited); in isScalableTy()
71 SmallPtrSet<const Type *, 4> Visited; in isScalableTy() local
72 return isScalableTy(Visited); in isScalableTy()
76 SmallPtrSetImpl<const Type *> &Visited) const { in containsNonGlobalTargetExtType()
78 return ATy->getElementType()->containsNonGlobalTargetExtType(Visited); in containsNonGlobalTargetExtType()
80 return STy->containsNonGlobalTargetExtType(Visited); in containsNonGlobalTargetExtType()
87 SmallPtrSet<const Type *, 4> Visited; in containsNonGlobalTargetExtType() local
88 return containsNonGlobalTargetExtType(Visited); in containsNonGlobalTargetExtType()
[all …]
/freebsd/contrib/llvm-project/llvm/lib/Transforms/Utils/
H A DIRNormalizer.cpp65 SmallPtrSet<const Instruction *, 32> &Visited) const;
80 SmallPtrSet<const Instruction *, 32> &Visited) const;
220 SmallPtrSet<const Instruction *, 32> Visited; in nameAsInitialInstruction() local
222 SetVector<int> OutputFootprint = getOutputFootprint(I, Visited); in nameAsInitialInstruction()
416 SmallPtrSet<const Instruction *, 32> Visited; in reorderInstructions() local
423 reorderDefinition(&I, TopologicalSort, Visited); in reorderInstructions()
433 if (Visited.contains(&I)) in reorderInstructions()
436 reorderDefinition(&I, TopologicalSort, Visited); in reorderInstructions()
459 SmallPtrSet<const Instruction *, 32> &Visited) const { in reorderDefinition()
460 if (Visited.contains(Definition)) in reorderDefinition()
[all …]
H A DBypassSlowDivision.cpp80 bool isHashLikeValue(Value *V, VisitedSetTy &Visited);
81 ValueRange getValueRange(Value *Op, VisitedSetTy &Visited);
187 bool FastDivInsertionTask::isHashLikeValue(Value *V, VisitedSetTy &Visited) { in isHashLikeValue() argument
209 if (Visited.size() >= 16) in isHashLikeValue()
213 if (!Visited.insert(I).second) in isHashLikeValue()
218 return getValueRange(V, Visited) == VALRNG_LIKELY_LONG || in isHashLikeValue()
228 VisitedSetTy &Visited) { in getValueRange() argument
250 if (isHashLikeValue(V, Visited)) in getValueRange()
H A DSampleProfileInference.cpp621 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/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
110 this->Visited.insert(Node); in df_iterator()
118 if (this->Visited.insert(Node).second) in df_iterator()
141 if (this->Visited.insert(Next).second) { in toNext()
147 this->Visited.completed(Node); in toNext()
207 return this->Visited.contains(Node); in nodeVisited()
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()
87 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
358 if (!Info.Visited && Info.IncomingMSTEdges.empty()) { in scc_member_iterator()
360 Info.Visited = true; in scc_member_iterator()
/freebsd/contrib/llvm-project/llvm/lib/CodeGen/
H A DScheduleDAG.cpp514 Visited.resize(DAGSize); in InitDAGTopologicalSorting()
561 Visited.reset(); in AddPred()
565 Shift(Visited, LowerBound, UpperBound); in AddPred()
584 Visited.set(SU->NodeNum); in DFS()
595 if (!Visited.test(s) && Node2Index[s] < UpperBound) { in DFS()
618 Visited.reset(); in GetSubGraph()
637 if (!Visited.test(s) && Node2Index[s] < UpperBound) { in GetSubGraph()
638 Visited.set(s); in GetSubGraph()
670 if (!VisitedBack.test(s) && Visited.test(s)) { in GetSubGraph()
683 void ScheduleDAGTopologicalSort::Shift(BitVector& Visited, int LowerBound, in Shift() argument
[all …]
/freebsd/contrib/llvm-project/llvm/include/llvm/Analysis/
H A DMustExecute.h289 : Visited(std::move(Other.Visited)), Explorer(Other.Explorer), in MustBeExecutedIterator()
294 std::swap(Visited, Other.Visited);
335 return Visited.count({I, ExplorationDirection::FORWARD}) || in count()
336 Visited.count({I, ExplorationDirection::BACKWARD}); in count()
360 VisitedSetTy Visited; member
H A DCFG.h161 SmallPtrSet<NodeT, 32> Visited; in containsIrreducibleCFG() local
163 Visited.insert(Node); in containsIrreducibleCFG()
166 if (!Visited.count(Succ)) in containsIrreducibleCFG()
/freebsd/contrib/llvm-project/llvm/lib/Target/PowerPC/
H A DPPCCTRLoopsVerify.cpp96 SmallSet<MachineBasicBlock *, 16> Visited; in verifyCTRBranch() local
101 Visited.insert(MBB); in verifyCTRBranch()
107 Visited.insert(MBB); in verifyCTRBranch()
151 if (!Visited.count(MBB)) { in verifyCTRBranch()
/freebsd/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.cpp490 DenseMap<Value *, std::set<Value *>> &Visited) { in getBaseValues() argument
491 auto It = Visited.find(V); in getBaseValues()
492 if (It != Visited.end()) { in getBaseValues()
502 return Visited.insert(std::make_pair(V, std::move(Result))).first->second; in getBaseValues()
506 const std::set<Value *> &OpResult = getBaseValues(Op, DT, Visited); in getBaseValues()
509 return Visited.insert(std::make_pair(V, std::move(Result))).first->second; in getBaseValues()
517 return Visited.insert(std::make_pair(V, std::move(Result))).first->second; in getBaseValues()
528 DenseMap<Instruction *, bool> &Visited) { in checkHoistValue() argument
531 auto It = Visited.find(I); in checkHoistValue()
532 if (It != Visited.end()) { in checkHoistValue()
[all …]
/freebsd/contrib/llvm-project/llvm/lib/Transforms/Scalar/
H A DInferAddressSpaces.cpp229 DenseSet<Value *> &Visited) const;
235 DenseSet<Value *> &Visited) const;
452 DenseSet<Value *> &Visited) const { in collectRewritableIntrinsicOperands()
458 PostorderStack, Visited); in collectRewritableIntrinsicOperands()
464 Visited); in collectRewritableIntrinsicOperands()
473 PostorderStack, Visited); in collectRewritableIntrinsicOperands()
478 PostorderStack, Visited); in collectRewritableIntrinsicOperands()
484 Visited); in collectRewritableIntrinsicOperands()
493 PostorderStack, Visited); in collectRewritableIntrinsicOperands()
501 PostorderStack, Visited); in collectRewritableIntrinsicOperands()
[all …]
/freebsd/contrib/llvm-project/llvm/lib/Target/BPF/
H A DBPFPreserveStaticOffset.cpp453 SmallVector<Instruction *> &Visited,
458 SmallVector<Instruction *> &Visited, bool AllowPatial, in rewriteUses() argument
464 rewriteAccessChain(UI, GEPs, Visited, AllowPatial, StillUsed); in rewriteUses()
499 SmallVector<Instruction *> &Visited, in rewriteAccessChain() argument
502 Visited.push_back(Insn); in rewriteAccessChain()
503 rewriteUses(Insn, GEPs, Visited, AllowPatial, StillUsed); in rewriteAccessChain()
512 Visited.push_back(Insn); in rewriteAccessChain()
572 SmallVector<Instruction *> Visited; in rewriteAccessChain() local
574 rewriteUses(Marker, GEPs, Visited, AllowPatial, StillUsed); in rewriteAccessChain()
577 for (auto V = Visited.rbegin(); V != Visited.rend(); ++V) { in rewriteAccessChain()
/freebsd/contrib/llvm-project/llvm/include/llvm/IR/
H A DType.h209 LLVM_ABI bool isScalableTy(SmallPtrSetImpl<const Type *> &Visited) const;
215 containsNonGlobalTargetExtType(SmallPtrSetImpl<const Type *> &Visited) const;
221 containsNonLocalTargetExtType(SmallPtrSetImpl<const Type *> &Visited) const;
308 bool isSized(SmallPtrSetImpl<Type*> *Visited = nullptr) const {
319 return isSizedDerivedType(Visited);
492 isSizedDerivedType(SmallPtrSetImpl<Type *> *Visited = nullptr) const;
/freebsd/contrib/llvm-project/llvm/lib/Target/AMDGPU/
H A DAMDGPUMemoryUtils.cpp233 SmallPtrSet<Function *, 8> Visited; in getTransitiveUsesOfLDS() local
246 if (Visited.insert(Callee).second) in getTransitiveUsesOfLDS()
305 SmallPtrSet<Function *, 8> Visited; in removeFnAttrFromReachable() local
336 if (Visited.insert(Callee).second) in removeFnAttrFromReachable()
384 SmallSet<MemoryAccess *, 8> Visited; in isClobberedInFunction() local
399 if (!Visited.insert(MA).second) in isClobberedInFunction()
/freebsd/contrib/llvm-project/llvm/lib/Target/SPIRV/
H A DSPIRVEmitIntrinsics.cpp107 Type *deduceElementTypeHelper(Value *I, std::unordered_set<Value *> &Visited,
113 std::unordered_set<Value *> &Visited,
116 std::unordered_set<Value *> &Visited,
124 std::unordered_set<Value *> &Visited,
181 std::unordered_set<Value *> &Visited,
448 std::unordered_set<Value *> Visited; in propagateElemTypeRec() local
450 propagateElemTypeRec(Op, PtrElemTy, CastElemTy, VisitedSubst, Visited, in propagateElemTypeRec()
457 std::unordered_set<Value *> &Visited, in propagateElemTypeRec() argument
459 if (!Visited.insert(Op).second) in propagateElemTypeRec()
482 std::unordered_set<Value *> Visited; in deduceElementTypeByValueDeep() local
[all …]
/freebsd/contrib/llvm-project/llvm/lib/Target/ARM/
H A DMVELaneInterleavingPass.cpp149 SmallPtrSetImpl<Instruction *> &Visited) { in tryInterleave() argument
176 Visited.insert(I); in tryInterleave()
198 Visited.insert(I); in tryInterleave()
409 SmallPtrSet<Instruction *, 16> Visited; in runOnFunction() local
414 !Visited.count(&I)) in runOnFunction()
415 Changed |= tryInterleave(&I, Visited); in runOnFunction()
/freebsd/contrib/llvm-project/clang/lib/Analysis/FlowSensitive/
H A DDataflowEnvironment.cpp912 llvm::DenseSet<QualType> Visited; in initializeFieldsWithValues() local
914 initializeFieldsWithValues(Loc, Type, Visited, 0, CreatedValuesCount); in initializeFieldsWithValues()
965 llvm::DenseSet<QualType> Visited; in createValue() local
967 Value *Val = createValueUnlessSelfReferential(Type, Visited, /*Depth=*/0, in createValue()
977 QualType Type, llvm::DenseSet<QualType> &Visited, int Depth, in createValueUnlessSelfReferential() argument
1005 createLocAndMaybeValue(PointeeType, Visited, Depth, CreatedValuesCount); in createValueUnlessSelfReferential()
1015 llvm::DenseSet<QualType> &Visited, in createLocAndMaybeValue() argument
1017 if (!Visited.insert(Ty.getCanonicalType()).second) in createLocAndMaybeValue()
1020 [&Visited, Ty] { Visited.erase(Ty.getCanonicalType()); }); in createLocAndMaybeValue()
1026 initializeFieldsWithValues(Loc, Ty, Visited, Depth, CreatedValuesCount); in createLocAndMaybeValue()
[all …]

1234567891011