Home
last modified time | relevance | path

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

12

/art/compiler/optimizing/
Dlinearize_test.cc77 const uint32_t blocks[] = {0, 1, 2, 7, 3, 4, 8, 5, 6}; in TEST_F() local
78 TestCode(data, blocks); in TEST_F()
102 const uint32_t blocks[] = {0, 1, 2, 7, 4, 5, 8, 3, 6}; in TEST_F() local
103 TestCode(data, blocks); in TEST_F()
129 const uint32_t blocks[] = {0, 1, 2, 8, 5, 6, 4, 9, 3, 7}; in TEST_F() local
130 TestCode(data, blocks); in TEST_F()
159 const uint32_t blocks[] = {0, 1, 2, 8, 3, 10, 4, 5, 11, 9, 6, 7}; in TEST_F() local
160 TestCode(data, blocks); in TEST_F()
189 const uint32_t blocks[] = {0, 1, 2, 8, 4, 10, 5, 6, 11, 9, 3, 7}; in TEST_F() local
190 TestCode(data, blocks); in TEST_F()
[all …]
Ddominator_test.cc29 void TestCode(const std::vector<uint16_t>& data, const uint32_t* blocks, size_t blocks_length);
33 const uint32_t* blocks, in TestCode() argument
38 if (blocks[i] == kInvalidBlockId) { in TestCode()
48 ASSERT_EQ(blocks[i], graph->GetBlocks()[i]->GetDominator()->GetBlockId()); in TestCode()
Dfind_loops_test.cc113 const BitVector& blocks = info->GetBlocks(); in TestBlock() local
114 ASSERT_EQ(blocks.NumSetBits(), number_of_blocks); in TestBlock()
116 ASSERT_TRUE(blocks.IsBitSet(blocks_in_loop[i])); in TestBlock()
Dload_store_elimination.cc1685 const ArenaVector<HBasicBlock*>& blocks = GetGraph()->GetBlocks(); in MaterializeNonLoopPhis() local
1705 HBasicBlock* current_block = blocks[current_block_id]; in MaterializeNonLoopPhis()
1914 const ArenaVector<HBasicBlock*>& blocks = GetGraph()->GetBlocks(); in TryReplacingLoopPhiPlaceholderWithDefault() local
1921 HBasicBlock* block = blocks[current_phi_placeholder.GetBlockId()]; in TryReplacingLoopPhiPlaceholderWithDefault()
1955 blocks[record.stored_by.GetPhiPlaceholder().GetBlockId()]->IsLoopHeader()) { in TryReplacingLoopPhiPlaceholderWithDefault()
1957 blocks[record.stored_by.GetPhiPlaceholder().GetBlockId()]->GetLoopInformation(); in TryReplacingLoopPhiPlaceholderWithDefault()
1999 const ArenaVector<HBasicBlock*>& blocks = GetGraph()->GetBlocks(); in TryReplacingLoopPhiPlaceholderWithSingleInput() local
2005 HBasicBlock* current_block = blocks[current_phi_placeholder.GetBlockId()]; in TryReplacingLoopPhiPlaceholderWithSingleInput()
2054 const ArenaVector<HBasicBlock*>& blocks = GetGraph()->GetBlocks(); in FindLoopPhisToMaterialize() local
2067 HBasicBlock* current_block = blocks[current_phi_placeholder.GetBlockId()]; in FindLoopPhisToMaterialize()
[all …]
/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/test/543-checker-dce-trycatch/
Dinfo.txt1 Tests removal of try/catch blocks by DCE.
/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/578-polymorphic-inlining/
Dinfo.txt2 wrongly the try/catch information of new blocks.
/art/libartbase/base/
Ddata_hash.h60 const unaligned_uint32_t *blocks = reinterpret_cast<const uint32_t*>(data); in operator() local
63 uint32_t k = blocks[i]; in operator()
/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/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/test/596-checker-dead-phi/smali/
DIrreducibleLoop.smali19 # Test case where liveness analysis produces linear order where loop blocks are
28 # 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).
/art/test/531-regression-debugphi/smali/
DTestCase.smali22 # - iterate over blocks in reverse post order
70 # - iterate over blocks in reverse post order
/art/test/800-smali/smali/
Db_22411633_2.smali31 # Arbitrary work to separate blocks. At this point, v4 is of type Reference<Object>.
/art/tools/jfuzz/
DREADME.md31 -t : defines a fuzzing nest for try-catch-finally blocks
32 (higher values yield deeper nested try-catch-finally blocks)
/art/test/622-simplifyifs-exception-edges/smali/
DTest.smali65 # of the catch Phi's inputs. For catch blocks these two arrays are unrelated, so

12