Searched refs:kInvalidBlockId (Results 1 – 4 of 4) sorted by relevance
| /art/compiler/optimizing/ |
| D | find_loops_test.cc | 105 if (parent_loop_header_id == kInvalidBlockId) { in TestBlock()
137 TestBlock(graph, 0, false, kInvalidBlockId); // entry block in TEST_F()
138 TestBlock(graph, 1, false, kInvalidBlockId); // pre header in TEST_F()
142 TestBlock(graph, 4, false, kInvalidBlockId); // return block in TEST_F()
143 TestBlock(graph, 5, false, kInvalidBlockId); // exit block in TEST_F()
163 TestBlock(graph, 0, false, kInvalidBlockId); // entry block in TEST_F()
164 TestBlock(graph, 1, false, kInvalidBlockId); // goto block in TEST_F()
168 TestBlock(graph, 4, false, kInvalidBlockId); // pre header in TEST_F()
169 TestBlock(graph, 5, false, kInvalidBlockId); // return block in TEST_F()
170 TestBlock(graph, 6, false, kInvalidBlockId); // exit block in TEST_F()
[all …]
|
| D | dominator_test.cc | 38 if (blocks[i] == kInvalidBlockId) { in TestCode()
58 kInvalidBlockId, in TEST_F()
72 kInvalidBlockId, in TEST_F()
88 kInvalidBlockId, in TEST_F()
105 kInvalidBlockId, in TEST_F()
135 kInvalidBlockId, in TEST_F()
137 kInvalidBlockId, in TEST_F()
157 kInvalidBlockId, in TEST_F()
159 kInvalidBlockId, in TEST_F()
174 kInvalidBlockId, in TEST_F()
[all …]
|
| D | superblock_cloner.h | 38 DCHECK_NE(to_, kInvalidBlockId); in HEdge()
39 DCHECK_NE(from_, kInvalidBlockId); in HEdge()
42 DCHECK_NE(to_, kInvalidBlockId); in HEdge()
43 DCHECK_NE(from_, kInvalidBlockId); in HEdge()
45 HEdge() : from_(kInvalidBlockId), to_(kInvalidBlockId) {} in HEdge()
59 bool IsValid() const { return from_ != kInvalidBlockId && to_ != kInvalidBlockId; } in IsValid()
|
| D | nodes.h | 1072 static constexpr uint32_t kInvalidBlockId = static_cast<uint32_t>(-1); variable
1087 block_id_(kInvalidBlockId), in graph_()
|