Home
last modified time | relevance | path

Searched refs:post_order (Results 1 – 25 of 52) sorted by relevance

123

/external/tensorflow/tensorflow/core/grappler/utils/
Dtraversal_test.cc29 std::vector<string>* post_order, in MkCallbacks() argument
32 [post_order](const NodeDef* n) { post_order->push_back(n->name()); }, in MkCallbacks()
53 std::vector<string> post_order; in TEST() local
59 MkCallbacks(&pre_order, &post_order, &back_edges)); in TEST()
65 EXPECT_EQ(post_order, expected_post); in TEST()
84 std::vector<string> post_order; in TEST() local
90 MkCallbacks(&pre_order, &post_order, &back_edges)); in TEST()
96 EXPECT_EQ(post_order, expected_post); in TEST()
114 std::vector<string> post_order; in TEST() local
120 MkCallbacks(&pre_order, &post_order, &back_edges)); in TEST()
[all …]
Dtraversal.h41 post_order(std::move(post)), in DfsCallbacks()
53 std::function<void(const NodeDef*)> post_order; member
Dtraversal.cc78 if (callbacks.post_order) { in DfsTraversal()
79 callbacks.post_order(graph_view.GetNode(w.node)); in DfsTraversal()
/external/tensorflow/tensorflow/compiler/xla/service/
Dhlo_module_test.cc101 auto post_order = module->MakeComputationPostOrder(); in TEST_F() local
105 EXPECT_EQ(post_order.size(), post_order_copied.size()); in TEST_F()
106 for (auto origin = post_order.begin(), copied = post_order_copied.begin(); in TEST_F()
107 origin != post_order.end() && copied != post_order_copied.end(); in TEST_F()
137 auto post_order = module->MakeComputationPostOrder(); in TEST_F() local
141 EXPECT_EQ(post_order.size(), post_order_copied.size()); in TEST_F()
142 for (auto origin = post_order.begin(), copied = post_order_copied.begin(); in TEST_F()
143 origin != post_order.end() && copied != post_order_copied.end(); in TEST_F()
167 auto post_order = module->MakeComputationPostOrder(); in TEST_F() local
168 EXPECT_THAT(post_order, in TEST_F()
[all …]
Dhlo_computation.cc302 std::vector<HloComputation*>* post_order) { in ComputeComputationPostOrder() argument
307 ComputeComputationPostOrder(called_computation, visited, post_order); in ComputeComputationPostOrder()
310 post_order->push_back(computation); in ComputeComputationPostOrder()
318 std::vector<HloInstruction*>* post_order, HloInstruction* root, in ComputeInstructionPostOrder() argument
334 post_order->push_back(current); in ComputeInstructionPostOrder()
422 std::vector<HloInstruction*> post_order; in MakeInstructionPostOrder() local
423 post_order.reserve(instruction_count()); in MakeInstructionPostOrder()
434 ComputeInstructionPostOrder(channel_dependency_group, &post_order, in MakeInstructionPostOrder()
438 post_order.insert(post_order.end(), trace_instructions.begin(), in MakeInstructionPostOrder()
440 CHECK_EQ(instructions_.size(), post_order.size()) in MakeInstructionPostOrder()
[all …]
Dhlo_module_group_util.cc350 std::vector<HloInstruction*> post_order; in ComputeReachability() local
354 post_order.insert(post_order.end(), instruction_group.begin(), in ComputeReachability()
363 auto reachability = absl::make_unique<HloReachabilityMap>(post_order); in ComputeReachability()
364 for (HloInstruction* hlo : post_order) { in ComputeReachability()
Dhlo_module.cc517 std::vector<HloComputation*> post_order; in MakeComputationPostOrder() local
523 post_order.push_back(embedded_computation); in MakeComputationPostOrder()
529 post_order.push_back(computation.get()); in MakeComputationPostOrder()
533 if (post_order.size() != computations_.size()) { in MakeComputationPostOrder()
534 for (HloComputation* computation : post_order) { in MakeComputationPostOrder()
542 LOG(FATAL) << "Mismatch computation count: post_order=" << post_order.size() in MakeComputationPostOrder()
545 return post_order; in MakeComputationPostOrder()
Dinstruction_fusion.h146 absl::Span<HloInstruction* const> post_order);
Dinstruction_fusion.cc239 absl::Span<HloInstruction* const> post_order) { in ComputeGloballyUnfusible() argument
252 for (HloInstruction* consumer : post_order) { in ComputeGloballyUnfusible()
/external/tensorflow/tensorflow/compiler/jit/
Dpartially_decluster_pass.cc39 absl::Span<Node* const> post_order) { in FindNodesToDecluster() argument
46 for (Node* n : post_order) { in FindNodesToDecluster()
183 std::vector<Node*> post_order; in PartiallyDeclusterGraph() local
184 GetPostOrder(*graph, &post_order, /*stable_comparator=*/NodeComparatorName(), in PartiallyDeclusterGraph()
189 FindNodesToDecluster(*graph, &nodes_to_partially_decluster, post_order)); in PartiallyDeclusterGraph()
192 for (Node* n : post_order) { in PartiallyDeclusterGraph()
199 for (Node* n : post_order) { in PartiallyDeclusterGraph()
206 post_order.clear(); in PartiallyDeclusterGraph()
207 GetPostOrder(*graph, &post_order, /*stable_comparator=*/NodeComparatorName(), in PartiallyDeclusterGraph()
211 FindNodesToDecluster(*graph, &nodes_to_partially_decluster, post_order)); in PartiallyDeclusterGraph()
/external/tensorflow/tensorflow/core/graph/
Dalgorithm_test.cc169 std::vector<Node*> post_order; in TEST() local
182 GetPostOrder(g, &post_order, /*stable_comparator=*/{}, in TEST()
185 ASSERT_EQ(expected_post_order.size(), post_order.size()); in TEST()
186 for (int i = 0; i < post_order.size(); i++) { in TEST()
187 CHECK_EQ(post_order[i], expected_post_order[i]) in TEST()
188 << post_order[i]->name() << " vs. " << expected_post_order[i]->name(); in TEST()
/external/python/cpython3/Lib/lib2to3/
Drefactor.py191 self.pre_order, self.post_order = self.get_fixers()
200 for fixer in chain(self.post_order, self.pre_order):
207 elif fixer in self.post_order:
402 for fixer in chain(self.pre_order, self.post_order):
407 self.traverse_by(self.bmi_post_order_heads, tree.post_order())
445 for node in new.post_order():
461 for fixer in chain(self.pre_order, self.post_order):
Dpytree.py85 def post_order(self): member in Base
262 def post_order(self): member in Node
265 yield from child.post_order()
375 def post_order(self): member in Leaf
/external/python/cpython2/Lib/lib2to3/
Drefactor.py210 self.pre_order, self.post_order = self.get_fixers()
219 for fixer in chain(self.post_order, self.pre_order):
226 elif fixer in self.post_order:
421 for fixer in chain(self.pre_order, self.post_order):
426 self.traverse_by(self.bmi_post_order_heads, tree.post_order())
464 for node in new.post_order():
480 for fixer in chain(self.pre_order, self.post_order):
Dpytree.py96 def post_order(self): member in Base
294 def post_order(self): member in Node
297 for node in child.post_order():
409 def post_order(self): member in Leaf
/external/tensorflow/tensorflow/compiler/xla/service/gpu/
Dgpu_layout_assignment.cc178 auto post_order = constraints->computation()->MakeInstructionPostOrder(); in AddBackendConstraints() local
179 for (auto iterator = post_order.rbegin(); iterator != post_order.rend(); in AddBackendConstraints()
/external/swiftshader/third_party/llvm-7.0/llvm/lib/Target/WebAssembly/
DWebAssemblyExceptionInfo.cpp47 for (auto DomNode : post_order(&MDT)) { in recalculate()
61 for (auto DomNode : post_order(&MDT)) { in recalculate()
/external/swiftshader/third_party/llvm-7.0/llvm/lib/CodeGen/GlobalISel/
DCombiner.cpp56 for (MachineBasicBlock *MBB : post_order(&MF)) { in combineMachineInstrs()
DInstructionSelect.cpp98 for (MachineBasicBlock *MBB : post_order(&MF)) { in runOnMachineFunction()
/external/swiftshader/third_party/SPIRV-Tools/source/opt/
Dcfg.cpp91 auto post_order = [&](cbb_ptr b) { in ComputeStructuredOrder() local
95 ignore_block, post_order, ignore_edge); in ComputeStructuredOrder()
/external/deqp-deps/SPIRV-Tools/source/opt/
Dcfg.cpp91 auto post_order = [&](cbb_ptr b) { in ComputeStructuredOrder() local
95 ignore_block, post_order, ignore_edge); in ComputeStructuredOrder()
/external/python/cpython2/Lib/lib2to3/tests/
Dtest_refactor.py315 self.assertEqual(len(rt.post_order), 0)
318 for fix in rt.post_order:
/external/python/cpython3/Lib/lib2to3/tests/
Dtest_refactor.py326 self.assertEqual(len(rt.post_order), 0)
329 for fix in rt.post_order:
/external/python/cpython3/Lib/lib2to3/fixes/
Dfix_tuple_params.py128 for n in body.post_order():
/external/python/cpython2/Lib/lib2to3/fixes/
Dfix_tuple_params.py128 for n in body.post_order():

123