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

/art/compiler/optimizing/
H A Dpretty_printer.h74 const GrowableArray<HBasicBlock*>& predecessors = block->GetPredecessors(); variable
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());
H A Dgraph_checker.cc31 // Check consistency with respect to predecessors of `block`.
32 const GrowableArray<HBasicBlock*>& predecessors = block->GetPredecessors(); local
34 for (size_t i = 0, e = predecessors.Size(); i < e; ++i) {
35 HBasicBlock* p = predecessors.Get(i);
50 "Block %d lists %zu occurrences of block %d in its predecessors, whereas "
77 "block %d lists %zu occurrences of block %d in its predecessors.",
285 // predecessors).
318 // predecessors of a loop header.
326 // predecessors are back edges.
330 "Loop header %d has less than two predecessors
456 const GrowableArray<HBasicBlock*>& predecessors = local
[all...]
H A Dgvn.cc334 // Use the reverse post order to ensure the non back-edge predecessors of a block are
343 const GrowableArray<HBasicBlock*>& predecessors = block->GetPredecessors(); local
344 if (predecessors.Size() == 0 || predecessors.Get(0)->IsEntryBlock()) {
364 } else if (predecessors.Size() > 1) {
365 for (size_t i = 0, e = predecessors.Size(); i < e; ++i) {
366 set->IntersectWith(sets_.Get(predecessors.Get(i)->GetBlockId()));
H A Dssa_liveness_analysis.cc67 // (1): Record the number of forward predecessors for each block. This is to
84 // iterate over the successors. When all non-back edge predecessors of a
376 const GrowableArray<HBasicBlock*>& predecessors = user->GetBlock()->GetPredecessors(); local
379 if (end == predecessors.Get(input_index)->GetLifetimeEnd()) {
386 predecessors.Get(i)->GetLifetimeEnd() - 1);
420 const GrowableArray<HBasicBlock*>& predecessors = defined_by_->GetBlock()->GetPredecessors(); local
423 size_t end = predecessors.Get(i)->GetLifetimeEnd();
/art/compiler/dex/
H A Dmir_graph_test.cc34 BasicBlockId predecessors[kMaxPredecessors]; member in struct:art::TopologicalSortOrderTest::BBDef
88 bb->predecessors.assign(def->predecessors, def->predecessors + def->num_predecessors);
H A Dmir_optimization_test.cc38 BasicBlockId predecessors[kMaxPredecessors]; member in struct:art::MirOptimizationTest::BBDef
127 bb->predecessors.assign(def->predecessors, def->predecessors + def->num_predecessors);
H A Dglobal_value_numbering_test.cc54 BasicBlockId predecessors[kMaxPredecessors]; member in struct:art::GlobalValueNumberingTest::BBDef
211 bb->predecessors.assign(def->predecessors, def->predecessors + def->num_predecessors);
256 ASSERT_EQ(def->num_uses, bb->predecessors.size());
257 std::copy(bb->predecessors.begin(), bb->predecessors.end(), mir->meta.phi_incoming);
H A Dgvn_dead_code_elimination_test.cc54 BasicBlockId predecessors[kMaxPredecessors]; member in struct:art::GvnDeadCodeEliminationTest::BBDef
218 bb->predecessors.assign(def->predecessors, def->predecessors + def->num_predecessors);
284 ASSERT_EQ(def->num_uses, bb->predecessors.size());
285 std::copy(bb->predecessors.begin(), bb->predecessors.end(), mir->meta.phi_incoming);
399 CHECK(!bb->predecessors.empty());
400 BasicBlock* pred_bb = cu_.mir_graph->GetBasicBlock(bb->predecessors[0]);
H A Dtype_inference_test.cc57 BasicBlockId predecessors[kMaxPredecessors]; member in struct:art::TypeInferenceTest::BBDef
330 bb->predecessors.assign(def->predecessors, def->predecessors + def->num_predecessors);
417 ASSERT_EQ(def->num_uses, bb->predecessors.size());
418 std::copy(bb->predecessors.begin(), bb->predecessors.end(), mir->meta.phi_incoming);
H A Dmir_graph.h381 predecessors(allocator->Adapter(kArenaAllocBBPredecessors)),
407 ArenaVector<BasicBlockId> predecessors; member in class:art::BasicBlock
434 * @details Unlink predecessors and successors, remove all MIRs, set the block type to kDead

Completed in 1488 milliseconds