Searched refs:NumInnerloops (Results 1 – 4 of 4) sorted by relevance
| /frameworks/libs/binary_translation/backend/x86_64/ |
| D | machine_ir_analysis_test.cc | 214 EXPECT_EQ(tree.root()->NumInnerloops(), 1UL); in TEST()
218 EXPECT_EQ(node->NumInnerloops(), 0UL); in TEST()
239 EXPECT_EQ(tree.root()->NumInnerloops(), 2UL); in TEST()
243 EXPECT_EQ(node1->NumInnerloops(), 0UL); in TEST()
247 EXPECT_EQ(node2->NumInnerloops(), 0UL); in TEST()
267 EXPECT_EQ(tree.root()->NumInnerloops(), 1UL); in TEST()
271 EXPECT_EQ(node1->NumInnerloops(), 1UL); in TEST()
275 EXPECT_EQ(node2->NumInnerloops(), 0UL); in TEST()
307 EXPECT_EQ(root->NumInnerloops(), 1UL); in TEST()
354 EXPECT_EQ(root->NumInnerloops(), 1UL); in TEST()
[all …]
|
| D | machine_ir_analysis.cc | 182 for (size_t i = 0; i < node->NumInnerloops(); i++) { in TryInsertLoopAtNode()
|
| D | loop_guest_context_optimizer.cc | 296 for (size_t i = 0; i < node->NumInnerloops(); i++) { in OptimizeLoopTree()
|
| /frameworks/libs/binary_translation/backend/include/berberis/backend/x86_64/ |
| D | machine_ir_analysis.h | 35 size_t NumInnerloops() const { return innerloop_nodes_.size(); }; in NumInnerloops() function
|