/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-7.0/llvm/lib/Transforms/Scalar/ |
D | SpeculateAroundPHIs.cpp | 55 SmallVector<std::pair<Instruction *, User::value_op_iterator>, 16> DFSStack; in isSafeToSpeculatePHIUsers() local 86 DFSStack.push_back({UI, UI->value_op_begin()}); in isSafeToSpeculatePHIUsers() 89 std::tie(UI, OpIt) = DFSStack.pop_back_val(); in isSafeToSpeculatePHIUsers() 134 for (auto &StackPair : DFSStack) { in isSafeToSpeculatePHIUsers() 147 DFSStack.push_back({UI, OpIt}); in isSafeToSpeculatePHIUsers() 157 } while (!DFSStack.empty()); in isSafeToSpeculatePHIUsers() 339 SmallVector<std::pair<Instruction *, User::value_op_iterator>, 16> DFSStack; in visitPHIUsersAndDepsInPostOrder() local 349 DFSStack.push_back({UI, UI->value_op_begin()}); in visitPHIUsersAndDepsInPostOrder() 352 std::tie(UI, OpIt) = DFSStack.pop_back_val(); in visitPHIUsersAndDepsInPostOrder() 366 DFSStack.push_back({UI, OpIt}); in visitPHIUsersAndDepsInPostOrder() [all …]
|
D | NewGVN.cpp | 3783 std::pair<int, int> dfs_back() const { return DFSStack.back(); } in dfs_back() 3787 DFSStack.emplace_back(DFSIn, DFSOut); in push_back() 3790 bool empty() const { return DFSStack.empty(); } in empty() 3795 return DFSIn >= DFSStack.back().first && DFSOut <= DFSStack.back().second; in isInScope() 3801 assert(ValueStack.size() == DFSStack.size() && in popUntilDFSScope() 3804 !DFSStack.empty() && in popUntilDFSScope() 3805 !(DFSIn >= DFSStack.back().first && DFSOut <= DFSStack.back().second)) { in popUntilDFSScope() 3806 DFSStack.pop_back(); in popUntilDFSScope() 3813 SmallVector<std::pair<int, int>, 8> DFSStack; member in __anonc9d17a0b1611::ValueDFSStack
|
/external/swiftshader/third_party/llvm-7.0/llvm/lib/Analysis/ |
D | LazyCallGraph.cpp | 724 SmallVector<std::pair<Node *, EdgeSequence::call_iterator>, 16> DFSStack; in switchInternalEdgeToRef() local 750 assert(DFSStack.empty() && in switchInternalEdgeToRef() 765 DFSStack.push_back({RootN, (*RootN)->call_begin()}); in switchInternalEdgeToRef() 769 std::tie(N, I) = DFSStack.pop_back_val(); in switchInternalEdgeToRef() 776 DFSStack.push_back({N, I}); in switchInternalEdgeToRef() 798 while (!DFSStack.empty()) in switchInternalEdgeToRef() 799 OldSCC.Nodes.push_back(DFSStack.pop_back_val().first); in switchInternalEdgeToRef() 855 } while (!DFSStack.empty()); in switchInternalEdgeToRef() 1179 SmallVector<std::pair<Node *, EdgeSequence::iterator>, 4> DFSStack; in removeInternalRefEdge() local 1182 assert(DFSStack.empty() && in removeInternalRefEdge() [all …]
|
/external/v8/src/compiler/ |
D | control-equivalence.h | 81 typedef ZoneStack<DFSStackEntry> DFSStack; in NON_EXPORTED_BASE() typedef 165 void DFSPush(DFSStack& stack, Node* node, Node* from, DFSDirection dir); in NON_EXPORTED_BASE() 168 void DFSPop(DFSStack& stack, Node* node); in NON_EXPORTED_BASE()
|
D | control-equivalence.cc | 188 void ControlEquivalence::DFSPush(DFSStack& stack, Node* node, Node* from, in DFSPush() 199 void ControlEquivalence::DFSPop(DFSStack& stack, Node* node) { in DFSPop()
|
/external/swiftshader/third_party/llvm-7.0/llvm/lib/CodeGen/ |
D | ScheduleDAGInstrs.cpp | 1322 std::vector<std::pair<const SUnit *, SUnit::const_pred_iterator>> DFSStack; member in __anon34e591130311::SchedDAGReverseDFS 1325 bool isComplete() const { return DFSStack.empty(); } in isComplete() 1328 DFSStack.push_back(std::make_pair(SU, SU->Preds.begin())); in follow() 1330 void advance() { ++DFSStack.back().second; } in advance() 1333 DFSStack.pop_back(); in backtrack() 1334 return DFSStack.empty() ? nullptr : std::prev(DFSStack.back().second); in backtrack() 1337 const SUnit *getCurr() const { return DFSStack.back().first; } in getCurr() 1339 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 __anonae11e2bb0311::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 | 2682 using DFSStack = absl::InlinedVector<std::pair<int, HloInstruction*>, 16>; typedef 2687 inline bool PushDFSChild(Visitor* visitor, DFSStack* dfs_stack, in PushDFSChild() 2721 DFSStack dfs_stack; in PostOrderDFS()
|