Home
last modified time | relevance | path

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

12

/external/tensorflow/tensorflow/compiler/xla/service/
Dhlo_module_test.cc96 auto post_order = module->MakeComputationPostOrder(); in TEST_F() local
100 EXPECT_EQ(post_order.size(), post_order_copied.size()); in TEST_F()
101 for (auto origin = post_order.begin(), copied = post_order_copied.begin(); in TEST_F()
102 origin != post_order.end() && copied != post_order_copied.end(); in TEST_F()
132 auto post_order = module->MakeComputationPostOrder(); in TEST_F() local
136 EXPECT_EQ(post_order.size(), post_order_copied.size()); in TEST_F()
137 for (auto origin = post_order.begin(), copied = post_order_copied.begin(); in TEST_F()
138 origin != post_order.end() && copied != post_order_copied.end(); in TEST_F()
162 auto post_order = module->MakeComputationPostOrder(); in TEST_F() local
163 EXPECT_THAT(post_order, in TEST_F()
[all …]
Dcomputation_tracker.cc95 std::list<VersionedComputationHandle> post_order; in SnapshotComputation() local
98 ComputeComputationPostOrder(entry_versioned_handle, &visited, &post_order); in SnapshotComputation()
105 for (auto it = ++post_order.rbegin(); it != post_order.rend(); ++it) { in SnapshotComputation()
150 std::list<VersionedComputationHandle>* post_order) const { in ComputeComputationPostOrder()
162 ComputeComputationPostOrder(embedded_handle, visited, post_order); in ComputeComputationPostOrder()
166 post_order->push_back(versioned_handle); in ComputeComputationPostOrder()
186 std::list<VersionedComputationHandle> post_order; in BuildHloModule() local
187 ComputeComputationPostOrder(entry_handle, &visited, &post_order); in BuildHloModule()
204 for (const VersionedComputationHandle& versioned_handle : post_order) { in BuildHloModule()
212 for (auto versioned_handle : post_order) { in BuildHloModule()
Dinstruction_fusion.cc238 std::vector<HloInstruction*> post_order(post_order_list.begin(), in Run() local
242 for (size_t i = 0; i < post_order.size(); ++i) { in Run()
243 InsertOrDie(&post_order_index, post_order[i], i); in Run()
263 for (HloInstruction* consumer : post_order) { in Run()
281 while (!post_order.empty()) { in Run()
284 HloInstruction* instruction = post_order.back(); in Run()
285 post_order.pop_back(); in Run()
374 post_order.push_back(fusion_instruction); in Run()
376 post_order.size() - 1); in Run()
382 post_order[FindOrDie(post_order_index, operand)] = nullptr; in Run()
Dhlo_computation.cc309 std::list<HloComputation*>* post_order) { in ComputeComputationPostOrder() argument
317 ComputeComputationPostOrder(called_computation, visited, post_order); in ComputeComputationPostOrder()
322 post_order->push_back(computation); in ComputeComputationPostOrder()
328 std::list<HloInstruction*> post_order; in MakeInstructionPostOrder() local
338 post_order.splice(post_order.end(), in MakeInstructionPostOrder()
343 post_order.splice(post_order.end(), trace_instructions); in MakeInstructionPostOrder()
344 CHECK_EQ(instructions_.size(), post_order.size()) in MakeInstructionPostOrder()
346 return post_order; in MakeInstructionPostOrder()
352 std::list<HloComputation*> post_order; in MakeEmbeddedComputationsList() local
358 &post_order); in MakeEmbeddedComputationsList()
[all …]
Dhlo_cse.cc102 std::list<HloInstruction*> post_order = in Run() local
105 for (auto instruction : post_order) { in Run()
Dhlo_module.cc505 std::list<HloComputation*> post_order; in MakeComputationPostOrder() local
511 post_order.push_back(embedded_computation); in MakeComputationPostOrder()
517 post_order.push_back(computation.get()); in MakeComputationPostOrder()
521 CHECK_EQ(post_order.size(), computations_.size()); in MakeComputationPostOrder()
522 return post_order; in MakeComputationPostOrder()
Dcomputation_tracker.h123 std::list<VersionedComputationHandle>* post_order) const
Dhlo_computation_test.cc197 auto post_order = computation->MakeInstructionPostOrder(); in TEST_F() local
198 EXPECT_EQ(6, post_order.size()); in TEST_F()
199 EXPECT_THAT(post_order, UnorderedElementsAre(constant1, constant2, constant3, in TEST_F()
/external/tensorflow/tensorflow/core/grappler/utils/
Dtraversal_test.cc59 std::vector<string> post_order; in TEST_F() local
64 [&post_order](NodeDef* n) { post_order.push_back(n->name()); }, in TEST_F()
68 EXPECT_EQ(std::vector<string>({"4", "5", "2", "3", "1", "0"}), post_order); in TEST_F()
84 std::vector<string> post_order; in TEST_F() local
89 [&post_order](NodeDef* n) { post_order.push_back(n->name()); }, in TEST_F()
95 EXPECT_EQ(std::vector<string>({"1", "4", "5", "2", "3", "6"}), post_order); in TEST_F()
Dtraversal.cc24 const std::function<void(NodeDef*)>& post_order, in ReverseDfs() argument
48 if (post_order) { in ReverseDfs()
49 post_order(w.node); in ReverseDfs()
Dtraversal.h33 const std::function<void(NodeDef*)>& post_order,
/external/python/cpython3/Lib/lib2to3/
Drefactor.py207 self.pre_order, self.post_order = self.get_fixers()
216 for fixer in chain(self.post_order, self.pre_order):
223 elif fixer in self.post_order:
418 for fixer in chain(self.pre_order, self.post_order):
423 self.traverse_by(self.bmi_post_order_heads, tree.post_order())
461 for node in new.post_order():
477 for fixer in chain(self.pre_order, self.post_order):
Dpytree.py86 def post_order(self): member in Base
263 def post_order(self): member in Node
266 yield from child.post_order()
376 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/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.py309 self.assertEqual(len(rt.post_order), 0)
312 for fix in rt.post_order:
/external/python/cpython2/Lib/lib2to3/fixes/
Dfix_tuple_params.py128 for n in body.post_order():
/external/python/cpython3/Lib/lib2to3/fixes/
Dfix_tuple_params.py128 for n in body.post_order():
/external/llvm/include/llvm/Analysis/
DLoopInfoImpl.h425 for (BlockT *BB : post_order(EntryBlock)) in traverse()
475 for (auto DomNode : post_order(DomRoot)) { in analyze()
/external/llvm/include/llvm/ADT/
DPostOrderIterator.h182 template <class T> iterator_range<po_iterator<T>> post_order(const T &G) { in post_order() function
/external/llvm/lib/Analysis/
DBranchProbabilityInfo.cpp653 for (auto BB : post_order(&F.getEntryBlock())) { in calculate()
/external/tensorflow/tensorflow/compiler/jit/
Dencapsulate_subgraphs_pass.cc1890 std::vector<Node*> post_order; in MakeGraphForOutsideCompilationSends() local
1891 GetReversePostOrder(*(*pruned_graph), &post_order); in MakeGraphForOutsideCompilationSends()
1892 for (auto node : post_order) { in MakeGraphForOutsideCompilationSends()
/external/llvm/lib/CodeGen/SelectionDAG/
DFunctionLoweringInfo.cpp557 for (auto i : post_order(T)) { in ComputeUsesVAFloatArgument()
/external/llvm/lib/CodeGen/
DEarlyIfConversion.cpp812 for (auto DomNode : post_order(DomTree)) in runOnMachineFunction()

12