Home
last modified time | relevance | path

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

12

/art/compiler/optimizing/
Dlinearize_test.cc78 const uint32_t blocks[] = {0, 1, 2, 7, 3, 4, 8, 5, 6}; in TEST_F() local
79 TestCode(data, blocks); in TEST_F()
103 const uint32_t blocks[] = {0, 1, 2, 7, 4, 5, 8, 3, 6}; in TEST_F() local
104 TestCode(data, blocks); in TEST_F()
130 const uint32_t blocks[] = {0, 1, 2, 8, 5, 6, 4, 9, 3, 7}; in TEST_F() local
131 TestCode(data, blocks); in TEST_F()
160 const uint32_t blocks[] = {0, 1, 2, 8, 3, 10, 4, 5, 11, 9, 6, 7}; in TEST_F() local
161 TestCode(data, blocks); in TEST_F()
190 const uint32_t blocks[] = {0, 1, 2, 8, 4, 10, 5, 6, 11, 9, 3, 7}; in TEST_F() local
191 TestCode(data, blocks); in TEST_F()
[all …]
Ddominator_test.cc30 void TestCode(const std::vector<uint16_t>& data, const uint32_t* blocks, size_t blocks_length);
34 const uint32_t* blocks, in TestCode() argument
39 if (blocks[i] == kInvalidBlockId) { in TestCode()
49 ASSERT_EQ(blocks[i], graph->GetBlocks()[i]->GetDominator()->GetBlockId()); in TestCode()
Dfind_loops_test.cc114 const BitVector& blocks = info->GetBlocks(); in TestBlock() local
115 ASSERT_EQ(blocks.NumSetBits(), number_of_blocks); in TestBlock()
117 ASSERT_TRUE(blocks.IsBitSet(blocks_in_loop[i])); in TestBlock()
/art/test/480-checker-dead-blocks/
DAndroid.bp3 // Build rules for ART run-test `480-checker-dead-blocks`.
16 name: "art-run-test-480-checker-dead-blocks",
21 ":art-run-test-480-checker-dead-blocks-expected-stdout",
22 ":art-run-test-480-checker-dead-blocks-expected-stderr",
31 name: "art-run-test-480-checker-dead-blocks-expected-stdout",
32 out: ["art-run-test-480-checker-dead-blocks-expected-stdout.txt"],
39 name: "art-run-test-480-checker-dead-blocks-expected-stderr",
40 out: ["art-run-test-480-checker-dead-blocks-expected-stderr.txt"],
Dinfo.txt1 Test removal of dead blocks.
/art/runtime/oat/
Dimage.cc344 dchecked_vector<ImageHeader::Block> blocks; in WriteData() local
388 blocks.emplace_back(ImageHeader::Block( in WriteData()
409 CHECK(!blocks.empty()); in WriteData()
410 const size_t blocks_bytes = blocks.size() * sizeof(blocks[0]); in WriteData()
411 if (!image_file->PwriteFully(&blocks[0], blocks_bytes, out_offset)) { in WriteData()
417 this->blocks_count_ = blocks.size(); in WriteData()
/art/test/543-checker-dce-trycatch/
Dinfo.txt1 Tests removal of try/catch blocks by DCE.
/art/test/2266-checker-remove-empty-ifs/
Dinfo.txt1 Tests that DCE deletes HIfs with empty blocks.
/art/test/510-checker-try-catch/
Dinfo.txt1 Tests the generation of try/catch blocks in Optimizing.
/art/test/578-bce-visit/
Dinfo.txt1 Fuzz test that exposed bug in bounds check elimination visiting of blocks.
/art/test/2250-inline-throw-into-try/
Dinfo.txt1 Tests that we inline methods that end with a throw, inside of try blocks.
/art/test/2243-checker-not-inline-into-throw/
Dinfo.txt1 Tests that we don't inline methods if their basic blocks end with a throw.
/art/test/578-polymorphic-inlining/
Dinfo.txt2 wrongly the try/catch information of new blocks.
/art/test/546-regression-simplify-catch/
Dinfo.txt1 Tests simplification of catch blocks in the presence of trivially dead code
/art/test/523-checker-can-throw-regression/
Dinfo.txt2 but would not update information about which blocks throw.
/art/test/2244-checker-remove-try-boundary/
Dinfo.txt2 Sometimes we can remove the catch blocks too.
/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/570-checker-osr/smali/
DOsr.smali19 # Check that blocks only havig nops are not merged when they are loop headers.
20 # This ensures we can do on-stack replacement for branches to those nop 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/libartbase/base/
Ddata_hash.h48 const unaligned_uint32_t* blocks = reinterpret_cast<const unaligned_uint32_t*>(data); in operator() local
50 hash = Murmur3Update(hash, blocks[i]); in operator()
/art/test/596-checker-dead-phi/smali/
DIrreducibleLoop.smali19 # Test case where liveness analysis produces linear order where loop blocks are
29 # Check that the linear order has non-adjacent loop blocks.
/art/test/594-checker-irreducible-linorder/smali/
DIrreducibleLoop.smali18 # Test case where liveness analysis produces linear order where loop blocks are
43 # Trivially dead code to ensure linear order verification skips removed blocks (b/28252537).

12