Searched defs:predecessors (Results 1 - 6 of 6) sorted by relevance

/art/compiler/optimizing/
H A Dpretty_printer.h74 const GrowableArray<HBasicBlock*>& predecessors = block->GetPredecessors(); local
75 if (!predecessors.IsEmpty()) {
77 for (size_t i = 0; i < predecessors.Size() -1; i++) {
78 PrintInt(predecessors.Get(i)->GetBlockId());
81 PrintInt(predecessors.Peek()->GetBlockId());
/art/compiler/dex/
H A Dmir_graph_test.cc32 BasicBlockId predecessors[kMaxPredecessors]; member in struct:art::TopologicalSortOrderTest::BBDef
89 bb->predecessors = new (&cu_.arena) GrowableArray<BasicBlockId>(
92 ASSERT_NE(0u, def->predecessors[j]);
93 bb->predecessors->Insert(def->predecessors[j]);
H A Dmir_optimization_test.cc43 BasicBlockId predecessors[kMaxPredecessors]; member in struct:art::ClassInitCheckEliminationTest::BBDef
132 bb->predecessors = new (&cu_.arena) GrowableArray<BasicBlockId>(
135 ASSERT_NE(0u, def->predecessors[j]);
136 bb->predecessors->Insert(def->predecessors[j]);
H A Dglobal_value_numbering_test.cc50 BasicBlockId predecessors[kMaxPredecessors]; member in struct:art::GlobalValueNumberingTest::BBDef
206 bb->predecessors = new (&cu_.arena) GrowableArray<BasicBlockId>(
209 ASSERT_NE(0u, def->predecessors[j]);
210 bb->predecessors->Insert(def->predecessors[j]);
254 mir->meta.phi_incoming[i] = bb->predecessors->Get(i);
H A Dmir_graph.h415 GrowableArray<BasicBlockId>* predecessors; member in struct:art::BasicBlock
/art/compiler/sea_ir/code_gen/
H A Dcode_gen.cc31 const std::vector<Region*>* predecessors = r->GetPredecessors(); local
32 DCHECK(NULL != predecessors);
33 DCHECK_GT(predecessors->size(), 0u);
35 llvm::Type::getInt32Ty(*llvm_data_->context_), predecessors->size(), phi->StringId());
259 const std::vector<Region*>* predecessors = r->GetPredecessors(); local
260 DCHECK(NULL != predecessors);
261 DCHECK_GT(predecessors->size(), 0u);
265 for (std::vector<Region*>::const_iterator cit = predecessors->begin();
266 cit != predecessors->end(); ++cit) {

Completed in 779 milliseconds