Searched defs:blocks (Results 1 - 6 of 6) sorted by path

/art/compiler/driver/
H A Dcompiled_method_storage.cc98 const unaligned_uint32_t *blocks = reinterpret_cast<const uint32_t*>(data); local
101 uint32_t k = blocks[i];
/art/compiler/optimizing/
H A Ddominator_test.cc29 static void TestCode(const uint16_t* data, const uint32_t* blocks, size_t blocks_length) { argument
35 if (blocks[i] == kInvalidBlockId) {
45 ASSERT_EQ(blocks[i], graph->GetBlocks()[i]->GetDominator()->GetBlockId());
H A Dfind_loops_test.cc123 const BitVector& blocks = info->GetBlocks(); local
124 ASSERT_EQ(blocks.NumSetBits(), number_of_blocks);
126 ASSERT_TRUE(blocks.IsBitSet(blocks_in_loop[i]));
189 // incoming blocks and one back edge.
H A Dinliner.cc71 const ArenaVector<HBasicBlock*>& blocks = graph_->GetReversePostOrder(); local
72 DCHECK(!blocks.empty());
73 HBasicBlock* next_block = blocks[0];
74 for (size_t i = 0; i < blocks.size(); ++i) {
76 // This avoids doing the inlining work again on the inlined blocks.
77 if (blocks[i] != next_block) {
81 next_block = (i == blocks.size() - 1) ? nullptr : blocks[i + 1];
559 // and the returned block is the start of the then branch (that could contain multiple blocks).
586 // Add the newly created blocks t
[all...]
H A Dlinearize_test.cc76 const uint32_t blocks[] = {0, 1, 2, 7, 3, 4, 8, 5, 6}; local
77 TestCode(data, blocks);
101 const uint32_t blocks[] = {0, 1, 2, 7, 4, 5, 8, 3, 6}; local
102 TestCode(data, blocks);
128 const uint32_t blocks[] = {0, 1, 2, 8, 5, 6, 4, 9, 3, 7}; local
129 TestCode(data, blocks);
158 const uint32_t blocks[] = {0, 1, 2, 8, 3, 10, 4, 5, 11, 9, 6, 7}; local
159 TestCode(data, blocks);
188 const uint32_t blocks[] = {0, 1, 2, 8, 4, 10, 5, 6, 11, 9, 3, 7}; local
189 TestCode(data, blocks);
214 const uint32_t blocks[] = {0, 1, 2, 3, 4, 6, 9, 8, 5, 7}; local
242 const uint32_t blocks[] = {0, 1, 2, 3, 4, 9, 8, 6, 5, 7}; local
[all...]
H A Dnodes.cc53 // "visited" must be empty on entry, it's an output argument for all visited (i.e. live) blocks.
133 // Remove the block from the list of blocks, so that further analyses
152 // (2) Remove instructions and phis from blocks not visited during
157 // (3) Remove blocks not visited during the initial DFS.
158 // Step (5) requires dead blocks to be removed from the
159 // predecessors list of live blocks.
178 // locals at throwing instructions inside try blocks.
265 // their successors. We do that with a fix-point iteration over all blocks.
290 // Make sure that there are no remaining blocks whose dominator information
384 // Catch blocks afte
1145 const ArenaVector<HBasicBlock*>& blocks = graph_->GetBlocks(); local
[all...]

Completed in 77 milliseconds