| /external/llvm/lib/Analysis/ |
| D | LazyCallGraph.cpp | 158 DFSStack(std::move(G.DFSStack)), in LazyCallGraph()
172 DFSStack = std::move(G.DFSStack); in operator =()
519 SmallVector<std::pair<Node *, call_edge_iterator>, 16> DFSStack; in switchInternalEdgeToRef() local
545 assert(DFSStack.empty() && in switchInternalEdgeToRef()
560 DFSStack.push_back({RootN, RootN->call_begin()}); in switchInternalEdgeToRef()
564 std::tie(N, I) = DFSStack.pop_back_val(); in switchInternalEdgeToRef()
571 DFSStack.push_back({N, I}); in switchInternalEdgeToRef()
593 while (!DFSStack.empty()) in switchInternalEdgeToRef()
594 OldSCC.Nodes.push_back(DFSStack.pop_back_val().first); in switchInternalEdgeToRef()
651 } while (!DFSStack.empty()); in switchInternalEdgeToRef()
[all …]
|
| /external/swiftshader/third_party/llvm-10.0/llvm/lib/Transforms/Scalar/ |
| D | SpeculateAroundPHIs.cpp | 54 SmallVector<std::pair<Instruction *, User::value_op_iterator>, 16> DFSStack; in isSafeToSpeculatePHIUsers() local
93 DFSStack.push_back({UI, UI->value_op_begin()}); in isSafeToSpeculatePHIUsers()
96 std::tie(UI, OpIt) = DFSStack.pop_back_val(); in isSafeToSpeculatePHIUsers()
141 for (auto &StackPair : DFSStack) { in isSafeToSpeculatePHIUsers()
154 DFSStack.push_back({UI, OpIt}); in isSafeToSpeculatePHIUsers()
164 } while (!DFSStack.empty()); in isSafeToSpeculatePHIUsers()
346 SmallVector<std::pair<Instruction *, User::value_op_iterator>, 16> DFSStack; in visitPHIUsersAndDepsInPostOrder() local
356 DFSStack.push_back({UI, UI->value_op_begin()}); in visitPHIUsersAndDepsInPostOrder()
359 std::tie(UI, OpIt) = DFSStack.pop_back_val(); in visitPHIUsersAndDepsInPostOrder()
373 DFSStack.push_back({UI, OpIt}); in visitPHIUsersAndDepsInPostOrder()
[all …]
|
| D | NewGVN.cpp | 3727 std::pair<int, int> dfs_back() const { return DFSStack.back(); } in dfs_back()
3731 DFSStack.emplace_back(DFSIn, DFSOut); in push_back()
3734 bool empty() const { return DFSStack.empty(); } in empty()
3739 return DFSIn >= DFSStack.back().first && DFSOut <= DFSStack.back().second; in isInScope()
3745 assert(ValueStack.size() == DFSStack.size() && in popUntilDFSScope()
3748 !DFSStack.empty() && in popUntilDFSScope()
3749 !(DFSIn >= DFSStack.back().first && DFSOut <= DFSStack.back().second)) { in popUntilDFSScope()
3750 DFSStack.pop_back(); in popUntilDFSScope()
3757 SmallVector<std::pair<int, int>, 8> DFSStack; member in __anonf8afa1f81611::ValueDFSStack
|
| /external/swiftshader/third_party/llvm-10.0/llvm/lib/Analysis/ |
| D | LazyCallGraph.cpp | 737 SmallVector<std::pair<Node *, EdgeSequence::call_iterator>, 16> DFSStack; in switchInternalEdgeToRef() local
763 assert(DFSStack.empty() && in switchInternalEdgeToRef()
778 DFSStack.push_back({RootN, (*RootN)->call_begin()}); in switchInternalEdgeToRef()
782 std::tie(N, I) = DFSStack.pop_back_val(); in switchInternalEdgeToRef()
789 DFSStack.push_back({N, I}); in switchInternalEdgeToRef()
811 while (!DFSStack.empty()) in switchInternalEdgeToRef()
812 OldSCC.Nodes.push_back(DFSStack.pop_back_val().first); in switchInternalEdgeToRef()
868 } while (!DFSStack.empty()); in switchInternalEdgeToRef()
1192 SmallVector<std::pair<Node *, EdgeSequence::iterator>, 4> DFSStack; in removeInternalRefEdge() local
1195 assert(DFSStack.empty() && in removeInternalRefEdge()
[all …]
|
| /external/swiftshader/third_party/llvm-10.0/llvm/lib/CodeGen/ |
| D | ScheduleDAGInstrs.cpp | 1410 std::vector<std::pair<const SUnit *, SUnit::const_pred_iterator>> DFSStack; member in __anon3f88b6a00311::SchedDAGReverseDFS
1413 bool isComplete() const { return DFSStack.empty(); } in isComplete()
1416 DFSStack.push_back(std::make_pair(SU, SU->Preds.begin())); in follow()
1418 void advance() { ++DFSStack.back().second; } in advance()
1421 DFSStack.pop_back(); in backtrack()
1422 return DFSStack.empty() ? nullptr : std::prev(DFSStack.back().second); in backtrack()
1425 const SUnit *getCurr() const { return DFSStack.back().first; } in getCurr()
1427 SUnit::const_pred_iterator getPred() const { return DFSStack.back().second; } in getPred()
|
| /external/llvm/lib/CodeGen/ |
| D | ScheduleDAGInstrs.cpp | 1595 std::vector<std::pair<const SUnit*, SUnit::const_pred_iterator> > DFSStack; member in __anond079283e0311::SchedDAGReverseDFS
1597 bool isComplete() const { return DFSStack.empty(); } in isComplete()
1600 DFSStack.push_back(std::make_pair(SU, SU->Preds.begin())); in follow()
1602 void advance() { ++DFSStack.back().second; } in advance()
1605 DFSStack.pop_back(); in backtrack()
1606 return DFSStack.empty() ? nullptr : std::prev(DFSStack.back().second); in backtrack()
1609 const SUnit *getCurr() const { return DFSStack.back().first; } in getCurr()
1611 SUnit::const_pred_iterator getPred() const { return DFSStack.back().second; } in getPred()
|
| /external/llvm/include/llvm/Analysis/ |
| D | LazyCallGraph.h | 867 SmallVector<std::pair<Node *, edge_iterator>, 4> DFSStack; variable
|
| /external/tensorflow/tensorflow/compiler/xla/service/ |
| D | hlo_instruction.cc | 2757 using DFSStack = absl::InlinedVector<std::pair<int, HloInstruction*>, 16>; typedef
2764 void PrintCycle(const HloInstruction* child, DFSStack* dfs_stack) { in PrintCycle()
3530 inline bool PushDFSChild(Visitor* visitor, DFSStack* dfs_stack, in PushDFSChild()
3564 DFSStack dfs_stack; in PostOrderDFS()
|