| /third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Analysis/ |
| D | CodeMetrics.cpp | 29 SmallPtrSetImpl<const Value *> &Visited, in appendSpeculatableOperands() argument
36 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 …]
|
| D | Loads.cpp | 55 SmallPtrSetImpl<const Value *> &Visited) { in isDereferenceableAndAlignedPointer() argument
57 if (!Visited.insert(V).second) in isDereferenceableAndAlignedPointer()
66 Size, DL, CtxI, DT, Visited); in isDereferenceableAndAlignedPointer()
102 CtxI, DT, Visited); in isDereferenceableAndAlignedPointer()
108 RelocateInst->getDerivedPtr(), Alignment, Size, DL, CtxI, DT, Visited); in isDereferenceableAndAlignedPointer()
112 Size, DL, CtxI, DT, Visited); in isDereferenceableAndAlignedPointer()
117 DT, Visited); in isDereferenceableAndAlignedPointer()
133 SmallPtrSet<const Value *, 32> Visited; in isDereferenceableAndAlignedPointer() local
135 Visited); in isDereferenceableAndAlignedPointer()
|
| D | Lint.cpp | 126 SmallPtrSetImpl<Value *> &Visited) const;
658 SmallPtrSet<Value *, 4> Visited; in findValue() local
659 return findValueImpl(V, OffsetOk, Visited); in findValue()
664 SmallPtrSetImpl<Value *> &Visited) const { in findValueImpl()
666 if (!Visited.insert(V).second) in findValueImpl()
684 return findValueImpl(U, OffsetOk, Visited); in findValueImpl()
693 return findValueImpl(W, OffsetOk, Visited); in findValueImpl()
696 return findValueImpl(CI->getOperand(0), OffsetOk, Visited); in findValueImpl()
701 return findValueImpl(W, OffsetOk, Visited); in findValueImpl()
708 return findValueImpl(CE->getOperand(0), OffsetOk, Visited); in findValueImpl()
[all …]
|
| D | CFG.cpp | 33 SmallPtrSet<const BasicBlock*, 8> Visited; in FindFunctionBackedges() local
37 Visited.insert(BB); in FindFunctionBackedges()
48 if (Visited.insert(BB).second) { in FindFunctionBackedges()
160 SmallPtrSet<const BasicBlock*, 32> Visited; in isPotentiallyReachableFromMany() local
163 if (!Visited.insert(BB).second) in isPotentiallyReachableFromMany()
|
| D | MemoryDependenceAnalysis.cpp | 829 SmallPtrSet<BasicBlock *, 32> Visited; in getNonLocalCallDependency() local
840 if (!Visited.insert(DirtyBB).second) in getNonLocalCallDependency()
964 DenseMap<BasicBlock *, Value *> Visited; in getNonLocalPointerDependency() local
966 Result, Visited, true)) in getNonLocalPointerDependency()
1097 DenseMap<BasicBlock *, Value *> &Visited, bool SkipFirstBlock) { in getNonLocalPointerDepFromBB() argument
1146 StartBB, Result, Visited, SkipFirstBlock); in getNonLocalPointerDepFromBB()
1165 Visited, SkipFirstBlock); in getNonLocalPointerDepFromBB()
1179 if (!Visited.empty()) { in getNonLocalPointerDepFromBB()
1182 Visited.find(Entry.getBB()); in getNonLocalPointerDepFromBB()
1183 if (VI == Visited.end() || VI->second == Pointer.getAddr()) in getNonLocalPointerDepFromBB()
[all …]
|
| D | ModuleSummaryAnalysis.cpp | 91 SmallPtrSet<const User *, 8> &Visited) { in findRefEdges() argument
99 if (!Visited.insert(U).second) in findRefEdges()
263 SmallPtrSet<const User *, 8> Visited; in computeFunctionSummary() local
267 findRefEdges(Index, &F, RefEdges, Visited); in computeFunctionSummary()
284 Visited.insert(&I); in computeFunctionSummary()
288 Visited.insert(&I); in computeFunctionSummary()
302 findRefEdges(Index, U, RefEdges, Visited); in computeFunctionSummary()
306 findRefEdges(Index, &I, RefEdges, Visited); in computeFunctionSummary()
409 AddRefEdges(NonVolatileLoads, LoadRefEdges, Visited); in computeFunctionSummary()
576 SmallPtrSet<const User *, 8> Visited; in computeVariableSummary() local
[all …]
|
| D | GlobalsModRef.cpp | 637 SmallPtrSet<const Value *, 8> Visited; in isNonEscapingGlobalNoAliasWithLoad() local
639 Visited.insert(V); in isNonEscapingGlobalNoAliasWithLoad()
668 if (Visited.insert(LHS).second) in isNonEscapingGlobalNoAliasWithLoad()
670 if (Visited.insert(RHS).second) in isNonEscapingGlobalNoAliasWithLoad()
677 if (Visited.insert(Op).second) in isNonEscapingGlobalNoAliasWithLoad()
723 SmallPtrSet<const Value *, 8> Visited; in isNonEscapingGlobalNoAlias() local
725 Visited.insert(V); in isNonEscapingGlobalNoAlias()
785 if (Visited.insert(LHS).second) in isNonEscapingGlobalNoAlias()
787 if (Visited.insert(RHS).second) in isNonEscapingGlobalNoAlias()
794 if (Visited.insert(Op).second) in isNonEscapingGlobalNoAlias()
|
| /third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/include/llvm/Analysis/ |
| D | MustExecute.h | 284 : Visited(Other.Visited), Explorer(Other.Explorer), in MustBeExecutedIterator()
288 : Visited(std::move(Other.Visited)), Explorer(Other.Explorer), in MustBeExecutedIterator()
293 std::swap(Visited, Other.Visited);
331 bool count(const Instruction *I) const { return Visited.count(I); } in count()
350 VisitedSetTy Visited; member
|
| D | IntervalIterator.h | 91 std::set<BasicBlock *> Visited; variable
109 : IntStack(std::move(x.IntStack)), Visited(std::move(x.Visited)), in IntervalIterator()
178 if (!Visited.insert(Header).second) in ProcessInterval()
206 if (Visited.count(NodeHeader)) { // Node already been visited? in ProcessNode()
226 Visited.insert(NodeHeader); // The node has now been visited! in ProcessNode()
|
| D | CFG.h | 157 SmallPtrSet<NodeT, 32> Visited; in containsIrreducibleCFG() local
159 Visited.insert(Node); in containsIrreducibleCFG()
162 if (!Visited.count(Succ)) in containsIrreducibleCFG()
|
| /third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/include/llvm/ADT/ |
| 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
102 this->Visited.insert(Node); in df_iterator()
110 if (this->Visited.insert(Node).second) in df_iterator()
133 if (this->Visited.insert(Next).second) { in toNext()
139 this->Visited.completed(Node); in toNext()
201 return this->Visited.count(Node) != 0; in nodeVisited()
|
| D | PostOrderIterator.h | 58 SetType Visited; variable
64 return Visited.insert(To).second; in insertEdge()
74 SetType &Visited; variable
77 po_iterator_storage(SetType &VSet) : Visited(VSet) {} in po_iterator_storage()
78 po_iterator_storage(const po_iterator_storage &S) : Visited(S.Visited) {} in po_iterator_storage()
84 return Visited.insert(To).second; in insertEdge()
|
| D | BreadthFirstIterator.h | 35 SetType Visited;
67 this->Visited.insert(Node); in bf_iterator()
89 if (this->Visited.insert(Next).second) in toNext()
|
| /third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/CodeGen/ |
| D | ScheduleDAG.cpp | 509 Visited.resize(DAGSize); in InitDAGTopologicalSorting()
556 Visited.reset(); in AddPred()
560 Shift(Visited, LowerBound, UpperBound); in AddPred()
579 Visited.set(SU->NodeNum); in DFS()
591 if (!Visited.test(s) && Node2Index[s] < UpperBound) { in DFS()
614 Visited.reset(); in GetSubGraph()
633 if (!Visited.test(s) && Node2Index[s] < UpperBound) { in GetSubGraph()
634 Visited.set(s); in GetSubGraph()
666 if (!VisitedBack.test(s) && Visited.test(s)) { in GetSubGraph()
679 void ScheduleDAGTopologicalSort::Shift(BitVector& Visited, int LowerBound, in Shift() argument
[all …]
|
| /third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Transforms/Utils/ |
| D | BypassSlowDivision.cpp | 83 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.find(I) != Visited.end()) in isHashLikeValue()
218 Visited.insert(I); in isHashLikeValue()
222 return getValueRange(V, Visited) == VALRNG_LIKELY_LONG || in isHashLikeValue()
232 VisitedSetTy &Visited) { in getValueRange() argument
254 if (isHashLikeValue(V, Visited)) in getValueRange()
|
| D | ImportedFunctionsInliningStatistics.cpp | 170 if (!Node.Visited) in calculateRealInlines()
176 assert(!GraphNode.Visited); in dfs()
177 GraphNode.Visited = true; in dfs()
180 if (!InlinedFunctionNode->Visited) in dfs()
|
| /third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Transforms/Instrumentation/ |
| D | ControlHeightReduction.cpp | 519 DenseMap<Value *, std::set<Value *>> &Visited) { in getBaseValues() argument
520 if (Visited.count(V)) { in getBaseValues()
521 return Visited[V]; in getBaseValues()
529 Visited.insert(std::make_pair(V, Result)); in getBaseValues()
534 std::set<Value *> OpResult = getBaseValues(Op, DT, Visited); in getBaseValues()
537 Visited.insert(std::make_pair(V, Result)); in getBaseValues()
542 Visited.insert(std::make_pair(V, Result)); in getBaseValues()
548 Visited.insert(std::make_pair(V, Result)); in getBaseValues()
560 DenseMap<Instruction *, bool> &Visited) { in checkHoistValue() argument
563 if (Visited.count(I)) { in checkHoistValue()
[all …]
|
| /third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Transforms/Scalar/ |
| D | GuardWidening.cpp | 169 SmallPtrSet<const Instruction *, 8> Visited; in isAvailableAt() local
170 return isAvailableAt(V, InsertPos, Visited); in isAvailableAt()
174 SmallPtrSetImpl<const Instruction *> &Visited) const;
233 SmallPtrSet<const Value *, 8> Visited; in parseRangeChecks() local
234 return parseRangeChecks(CheckCond, Checks, Visited); in parseRangeChecks()
238 SmallPtrSetImpl<const Value *> &Visited);
464 SmallPtrSetImpl<const Instruction *> &Visited) const { in isAvailableAt()
466 if (!Inst || DT.dominates(Inst, Loc) || Visited.count(Inst)) in isAvailableAt()
473 Visited.insert(Inst); in isAvailableAt()
481 [&](Value *Op) { return isAvailableAt(Op, Loc, Visited); }); in isAvailableAt()
[all …]
|
| D | StructurizeCFG.cpp | 198 BBSet Visited; member in __anon63970e0e0111::StructurizeCFG
390 if (Visited.count(Exit)) in analyzeLoops()
399 if (Visited.count(Succ)) in analyzeLoops()
471 if (Visited.count(P)) { in gatherPredicates()
476 if (Visited.count(Other) && !Loops.count(Other) && in gatherPredicates()
500 if (Visited.count(Entry)) in gatherPredicates()
518 Visited.clear(); in collectInfos()
530 Visited.insert(RN->getEntry()); in collectInfos()
808 Visited.insert(Node->getEntry()); in wireFlow()
830 while (!Order.empty() && !Visited.count(LoopEnd) && in wireFlow()
[all …]
|
| D | InferAddressSpaces.cpp | 186 DenseSet<Value *> &Visited) const;
193 DenseSet<Value *> &Visited) const;
285 DenseSet<Value *> &Visited) const { in collectRewritableIntrinsicOperands()
290 PostorderStack, Visited); in collectRewritableIntrinsicOperands()
297 PostorderStack, Visited); in collectRewritableIntrinsicOperands()
309 DenseSet<Value *> &Visited) const { in appendsFlatAddressExpressionToPostorderStack()
316 if (isAddressExpression(*CE) && Visited.insert(CE).second) in appendsFlatAddressExpressionToPostorderStack()
324 if (Visited.insert(V).second) { in appendsFlatAddressExpressionToPostorderStack()
330 if (isAddressExpression(*CE) && Visited.insert(CE).second) in appendsFlatAddressExpressionToPostorderStack()
346 DenseSet<Value *> Visited; in collectFlatAddressExpressions() local
[all …]
|
| D | BDCE.cpp | 45 SmallPtrSet<Instruction *, 16> Visited; in clearAssumptionsOfUsers() local
53 Visited.insert(J); in clearAssumptionsOfUsers()
82 if (K && Visited.insert(K).second && K->getType()->isIntOrIntVectorTy() && in clearAssumptionsOfUsers()
|
| /third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Transforms/ObjCARC/ |
| D | ObjCARCContract.cpp | 86 SmallPtrSetImpl<const BasicBlock *> &Visited,
96 SmallPtrSetImpl<const BasicBlock *> &Visited);
159 SmallPtrSetImpl<const BasicBlock *> &Visited) { in contractAutorelease() argument
168 DependingInstructions, Visited, PA); in contractAutorelease()
172 DependingInstructions, Visited, PA); in contractAutorelease()
174 Visited.clear(); in contractAutorelease()
450 SmallPtrSetImpl<const BasicBlock *> &Visited, bool &TailOkForStoreStrongs, in tryToPeepholeInstruction() argument
461 return contractAutorelease(F, Inst, Class, DependingInsts, Visited); in tryToPeepholeInstruction()
581 SmallPtrSet<const BasicBlock *, 4> Visited; in runOnFunction() local
607 if (tryToPeepholeInstruction(F, Inst, I, DependingInstructions, Visited, in runOnFunction()
|
| D | DependencyAnalysis.cpp | 223 SmallPtrSetImpl<const BasicBlock *> &Visited, in FindDependencies() argument
245 if (Visited.insert(PredBB).second) in FindDependencies()
262 for (const BasicBlock *BB : Visited) { in FindDependencies()
266 if (Succ != StartBB && !Visited.count(Succ)) { in FindDependencies()
|
| /third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Target/PowerPC/ |
| D | PPCCTRLoops.cpp | 131 SmallSet<MachineBasicBlock *, 16> Visited; in verifyCTRBranch() local
136 Visited.insert(MBB); in verifyCTRBranch()
142 Visited.insert(MBB); in verifyCTRBranch()
188 if (!Visited.count(MBB)) { in verifyCTRBranch()
|
| /third_party/rust/crates/cxx/syntax/ |
| D | toposort.rs | 7 Visited, enumerator
31 Mark::Visited => return Ok(()), in visit()
48 marks.insert(strct, Mark::Visited); in visit()
|