Searched refs:predecessor (Results 1 - 6 of 6) sorted by relevance
| /art/compiler/sea_ir/ir/ |
| H A D | sea.h | 91 // have multiple predecessor regions; this is why RenameToSSA has
118 // Returns the instruction that defines the phi register from predecessor
212 // Sets the phi-function uses to be as defined in @scoped_table for predecessor @@predecessor.
214 Region* predecessor);
226 void AddPredecessor(Region* predecessor) { argument
227 DCHECK(predecessor) << "Tried to add NULL predecessor to SEA node.";
228 predecessors_.push_back(predecessor);
240 std::vector<sea_ir::Region*> predecessors_; // CFG predecessor node
[all...] |
| H A D | sea.cc | 91 // NewIDom = first (processed) predecessor of b.
509 // The reaching_defs variable will contain reaching defs __for current predecessor only__
515 // The definitions from the reaching set of the predecessor
516 // may be shadowed by downward exposed definitions from the predecessor,
528 // Now we combine the reaching map coming from the current predecessor (reaching_defs)
586 const utils::ScopedHashtable<int, InstructionNode*>* scoped_table, Region* predecessor) {
589 if (predecessors_.at(crt_pred_id) == predecessor) {
585 SetPhiDefinitionsForUses( const utils::ScopedHashtable<int, InstructionNode*>* scoped_table, Region* predecessor) argument
|
| /art/compiler/optimizing/ |
| H A D | nodes.cc | 114 HBasicBlock* predecessor,
117 block->SetDominator(predecessor);
119 block->SetDominator(FindCommonDominator(block->GetDominator(), predecessor));
189 HBasicBlock* predecessor = header->GetPredecessors().Get(pred); local
190 if (predecessor != back_edge) {
191 predecessor->ReplaceSuccessor(header, pre_header);
113 VisitBlockForDominatorTree(HBasicBlock* block, HBasicBlock* predecessor, GrowableArray<size_t>* visits) argument
|
| H A D | graph_visualizer.cc | 88 HBasicBlock* predecessor = block->GetPredecessors().Get(i); local
89 output_ << " \"B" << predecessor->GetBlockId() << "\" ";
|
| H A D | register_allocator.cc | 970 HBasicBlock* predecessor = current->GetPredecessors().Get(i); local
971 DCHECK_EQ(predecessor->GetSuccessors().Size(), 1u);
974 predecessor->GetLastInstruction()->GetLifetimePosition());
976 InsertParallelMoveAtExitOf(predecessor, source, destination);
|
| H A D | nodes.h | 153 HBasicBlock* predecessor,
334 size_t GetPredecessorIndexOf(HBasicBlock* predecessor) { argument
336 if (predecessors_.Get(i) == predecessor) {
|
Completed in 2219 milliseconds