Home
last modified time | relevance | path

Searched defs:predecessor (Results 1 – 8 of 8) sorted by relevance

/art/compiler/optimizing/
Dscheduler.h171 void AddDataPredecessor(SchedulingNode* predecessor) { in AddDataPredecessor()
184 void AddOtherPredecessor(SchedulingNode* predecessor) { in AddOtherPredecessor()
Dscheduler.cc436 for (const SchedulingNode* predecessor : node->GetDataPredecessors()) { in DumpAsDotNode() local
441 for (const SchedulingNode* predecessor : node->GetOtherPredecessors()) { in DumpAsDotNode() local
Dgraph_checker.cc705 HBasicBlock* predecessor = loop_header->GetPredecessors()[i]; in HandleLoop() local
882 HBasicBlock* predecessor = predecessors[i]; in VisitPhi() local
Dnodes.cc565 HBasicBlock* predecessor = header->GetPredecessors()[pred]; in OrderLoopHeaderPredecessors() local
582 HBasicBlock* predecessor = header->GetPredecessors()[pred]; in FixControlForNewSinglePreheader() local
637 HBasicBlock* predecessor = header->GetPredecessors()[pred]; in TransformLoopToSinglePreheaderFormat() local
1534 HBasicBlock* predecessor = predecessors[index]; in ReplaceUsesDominatedBy() local
2625 HBasicBlock* predecessor = GetPredecessors()[0]; in ReplaceWith() local
2827 HBasicBlock* predecessor = to->GetPredecessors()[pred]; in InlineInto() local
Dgvn.cc142 void IntersectWith(ValueSet* predecessor) { in IntersectWith()
Dregister_allocation_resolver.cc189 HBasicBlock* predecessor = block->GetPredecessors()[i]; in Resolve() local
Dnodes.h1217 void InsertBetween(HBasicBlock* predecessor, HBasicBlock* successor) { in InsertBetween()
1253 size_t GetPredecessorIndexOf(HBasicBlock* predecessor) const { in GetPredecessorIndexOf()
1273 bool IsFirstIndexOfPredecessor(HBasicBlock* predecessor, size_t idx) const { in IsFirstIndexOfPredecessor()
Dload_store_elimination.cc2239 HBasicBlock* predecessor = block->GetPredecessors()[i]; in MaterializeLoopPhis() local