Home
last modified time | relevance | path

Searched refs:first_predecessor (Results 1 – 2 of 2) sorted by relevance

/art/compiler/optimizing/
Dgraph_checker.cc698 HBasicBlock* first_predecessor = loop_header->GetPredecessors()[0]; in HandleLoop() local
699 if (loop_information->IsBackEdge(*first_predecessor)) { in HandleLoop()
Dnodes.cc721 HBasicBlock* first_predecessor = block->GetPredecessors()[0]; in ComputeTryBlockInformation() local
722 DCHECK(!block->IsLoopHeader() || !block->GetLoopInformation()->IsBackEdge(*first_predecessor)); in ComputeTryBlockInformation()
723 const HTryBoundary* try_entry = first_predecessor->ComputeTryEntryOfSuccessors(); in ComputeTryBlockInformation()