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

/art/compiler/optimizing/
H A Dpretty_printer.h74 const ArenaVector<HBasicBlock*>& predecessors = block->GetPredecessors(); variable
75 if (!predecessors.empty()) {
77 for (size_t i = 0; i < predecessors.size() -1; i++) {
78 PrintInt(predecessors[i]->GetBlockId());
81 PrintInt(predecessors.back()->GetBlockId());
H A Dgvn.cc412 // Use the reverse post order to ensure the non back-edge predecessors of a block are
422 const ArenaVector<HBasicBlock*>& predecessors = block->GetPredecessors(); local
423 if (predecessors.size() == 0 || predecessors[0]->IsEntryBlock()) {
470 } else if (predecessors.size() > 1) {
471 for (HBasicBlock* predecessor : predecessors) {
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
473 const ArenaVector<HBasicBlock*>& predecessors = defined_by_->GetBlock()->GetPredecessors(); local
476 size_t end = predecessors[i]->GetLifetimeEnd();
H A Dgraph_checker.cc48 // Check consistency with respect to predecessors of `block`.
64 "Block %d lists %zu occurrences of block %d in its predecessors, whereas "
88 "block %d lists %zu occurrences of block %d in its predecessors.",
180 // predecessors). Exceptional edges are synthesized and hence
582 // predecessors are back edges.
586 "Loop header %d has less than two predecessors: %zu.",
644 // Ensure the pre-header block is first in the list of predecessors of a loop
754 // of its predecessors.
755 const ArenaVector<HBasicBlock*>& predecessors = phi->GetBlock()->GetPredecessors(); local
756 if (phi->InputCount() != predecessors
[all...]
H A Dload_store_elimination.cc641 const ArenaVector<HBasicBlock*>& predecessors = block->GetPredecessors(); local
642 if (predecessors.size() == 0) {
647 HInstruction* pred0_value = heap_values_for_[predecessors[0]->GetBlockId()][i];
650 for (size_t j = 1; j < predecessors.size(); j++) {
651 HInstruction* pred_value = heap_values_for_[predecessors[j]->GetBlockId()][i];
661 for (size_t j = 0; j < predecessors.size(); j++) {
662 ArenaVector<HInstruction*>& pred_values = heap_values_for_[predecessors[j]->GetBlockId()];

Completed in 177 milliseconds