Searched refs:kInvalidBlockId (Results 1 – 4 of 4) sorted by relevance
| /art/compiler/optimizing/ |
| D | find_loops_test.cc | 106 if (parent_loop_header_id == kInvalidBlockId) { in TestBlock()
138 TestBlock(graph, 0, false, kInvalidBlockId); // entry block in TEST_F()
139 TestBlock(graph, 1, false, kInvalidBlockId); // pre header in TEST_F()
143 TestBlock(graph, 4, false, kInvalidBlockId); // return block in TEST_F()
144 TestBlock(graph, 5, false, kInvalidBlockId); // exit block in TEST_F()
164 TestBlock(graph, 0, false, kInvalidBlockId); // entry block in TEST_F()
165 TestBlock(graph, 1, false, kInvalidBlockId); // goto block in TEST_F()
169 TestBlock(graph, 4, false, kInvalidBlockId); // pre header in TEST_F()
170 TestBlock(graph, 5, false, kInvalidBlockId); // return block in TEST_F()
171 TestBlock(graph, 6, false, kInvalidBlockId); // exit block in TEST_F()
[all …]
|
| D | dominator_test.cc | 39 if (blocks[i] == kInvalidBlockId) { in TestCode()
59 kInvalidBlockId, in TEST_F()
73 kInvalidBlockId, in TEST_F()
89 kInvalidBlockId, in TEST_F()
106 kInvalidBlockId, in TEST_F()
136 kInvalidBlockId, in TEST_F()
138 kInvalidBlockId, in TEST_F()
158 kInvalidBlockId, in TEST_F()
160 kInvalidBlockId, in TEST_F()
175 kInvalidBlockId, in TEST_F()
[all …]
|
| D | superblock_cloner.h | 39 DCHECK_NE(to_, kInvalidBlockId); in HEdge()
40 DCHECK_NE(from_, kInvalidBlockId); in HEdge()
43 DCHECK_NE(to_, kInvalidBlockId); in HEdge()
44 DCHECK_NE(from_, kInvalidBlockId); in HEdge()
46 HEdge() : from_(kInvalidBlockId), to_(kInvalidBlockId) {} in HEdge()
60 bool IsValid() const { return from_ != kInvalidBlockId && to_ != kInvalidBlockId; } in IsValid()
|
| D | nodes.h | 1099 static constexpr uint32_t kInvalidBlockId = static_cast<uint32_t>(-1); variable
1114 block_id_(kInvalidBlockId), in graph_()
|