Home
last modified time | relevance | path

Searched refs:blocks (Results 1 – 12 of 12) sorted by relevance

/art/compiler/optimizing/
Dlinearize_test.cc83 const int blocks[] = {0, 1, 2, 7, 3, 4, 8, 5, 6}; in TEST() local
84 TestCode(data, blocks, 9); in TEST()
108 const int blocks[] = {0, 1, 2, 7, 4, 5, 8, 3, 6}; in TEST() local
109 TestCode(data, blocks, 9); in TEST()
135 const int blocks[] = {0, 1, 2, 8, 5, 6, 4, 9, 3, 7}; in TEST() local
136 TestCode(data, blocks, 10); in TEST()
165 const int blocks[] = {0, 1, 2, 8, 3, 10, 4, 5, 11, 9, 6, 7}; in TEST() local
166 TestCode(data, blocks, 12); in TEST()
195 const int blocks[] = {0, 1, 2, 8, 4, 10, 5, 6, 11, 9, 3, 7}; in TEST() local
196 TestCode(data, blocks, 12); in TEST()
[all …]
Ddominator_test.cc27 static void TestCode(const uint16_t* data, const int* blocks, size_t blocks_length) { in TestCode() argument
38 if (blocks[i] == -1) { in TestCode()
48 ASSERT_EQ(blocks[i], graph->GetBlocks().Get(i)->GetDominator()->GetBlockId()); in TestCode()
Dinliner.cc52 const GrowableArray<HBasicBlock*>& blocks = graph_->GetReversePostOrder(); in Run() local
53 for (size_t i = 0; i < blocks.Size(); ++i) { in Run()
54 HBasicBlock* block = blocks.Get(i); in Run()
Dfind_loops_test.cc131 const BitVector& blocks = info->GetBlocks(); in TestBlock() local
132 ASSERT_EQ(blocks.NumSetBits(), number_of_blocks); in TestBlock()
134 ASSERT_TRUE(blocks.IsBitSet(blocks_in_loop[i])); in TestBlock()
Dnodes.cc793 const GrowableArray<HBasicBlock*>& blocks = graph_->GetBlocks(); in FOR_EACH_INSTRUCTION() local
794 for (size_t i = 0 ; i < blocks.Size(); i++) { in FOR_EACH_INSTRUCTION()
795 HBasicBlock* block = blocks.Get(i); in FOR_EACH_INSTRUCTION()
1195 static void MakeRoomFor(GrowableArray<HBasicBlock*>* blocks, in MakeRoomFor() argument
1198 size_t old_size = blocks->Size(); in MakeRoomFor()
1200 blocks->SetSize(new_size); in MakeRoomFor()
1202 blocks->Put(j, blocks->Get(i)); in MakeRoomFor()
/art/test/480-checker-dead-blocks/
Dinfo.txt1 Test removal of dead blocks.
/art/test/515-dce-dominator/
Dinfo.txt3 the graph when blocks get removed.
/art/test/485-checker-dce-loop-update/
Dinfo.txt2 live blocks outside the loop they had been a member of.
/art/test/433-gvn/
Dinfo.txt3 a dominator and its dominated blocks.
/art/test/484-checker-register-hints/
Dinfo.txt2 blocks because one block forced spilling. The block that
/art/test/090-loop-formation/
Dinfo.txt2 catch here is to make sure that some never-exercised code blocks are included
/art/compiler/driver/
Dcompiler_driver.h711 const unaligned_uint32_t *blocks = reinterpret_cast<const uint32_t*>(data); in operator() local
714 uint32_t k = blocks[i]; in operator()