Searched refs:predecessors (Results 1 – 12 of 12) sorted by relevance
31 ## CHECK: predecessors "<<BEnterTry1>>"36 ## CHECK: predecessors "<<BExitTry1>>"41 ## CHECK: predecessors "<<BEnterTry2>>"47 ## CHECK: predecessors "<<BExitTry2>>"52 ## CHECK: predecessors "<<BAfterTry2>>" "<<BCatch1:B\d+>>" "<<BCatch2:B\d+>>" "<<BCatch3:B\d+>…57 ## CHECK: predecessors "<<BEnterTry1>>" "<<BExitTry1>>"63 ## CHECK: predecessors "<<BEnterTry2>>" "<<BExitTry2>>"69 ## CHECK: predecessors "<<BEnterTry1>>" "<<BEnterTry2>>" "<<BExitTry1>>" "<<BExitTry2>>"75 ## CHECK: predecessors "B0"81 ## CHECK: predecessors "<<BAdd>>"[all …]
19 # Tests that catch blocks with both normal and exceptional predecessors are27 ## CHECK-NEXT: predecessors33 ## CHECK-NEXT: predecessors "B1" "<<BCatch:B\d+>>"42 ## CHECK-NEXT: predecessors
76 const ArenaVector<HBasicBlock*>& predecessors = block->GetPredecessors(); in VisitBasicBlock() local77 if (!predecessors.empty()) { in VisitBasicBlock()79 for (size_t i = 0; i < predecessors.size() -1; i++) { in VisitBasicBlock()80 PrintInt(predecessors[i]->GetBlockId()); in VisitBasicBlock()83 PrintInt(predecessors.back()->GetBlockId()); in VisitBasicBlock()
412 const ArenaVector<HBasicBlock*>& predecessors = block->GetPredecessors(); in VisitBasicBlock() local413 if (predecessors.size() == 0 || predecessors[0]->IsEntryBlock()) { in VisitBasicBlock()460 } else if (predecessors.size() > 1) { in VisitBasicBlock()461 for (HBasicBlock* predecessor : predecessors) { in VisitBasicBlock()
385 ArrayRef<HBasicBlock* const> predecessors(block->GetPredecessors()); in MergePredecessorValues() local386 if (predecessors.size() == 0) { in MergePredecessorValues()414 for (HBasicBlock* predecessor : predecessors) { in MergePredecessorValues()471 for (HBasicBlock* predecessor : predecessors) { in MergePredecessorValues()491 } else if (predecessors.size() == 1) { in MergePredecessorValues()493 DCHECK_EQ(heap_values_for_[predecessors[0]->GetBlockId()][i], merged_value); in MergePredecessorValues()
864 const ArenaVector<HBasicBlock*>& predecessors = phi->GetBlock()->GetPredecessors(); in VisitPhi() local865 if (input_records.size() != predecessors.size()) { in VisitPhi()870 phi->GetBlock()->GetBlockId(), predecessors.size())); in VisitPhi()876 HBasicBlock* predecessor = predecessors[i]; in VisitPhi()
439 const ArenaVector<HBasicBlock*>& predecessors = defined_by_->GetBlock()->GetPredecessors(); in FindHintAtDefinition() local442 size_t end = predecessors[i]->GetLifetimeEnd(); in FindHintAtDefinition()
1359 ArrayRef<HBasicBlock* const> predecessors(defined_by->GetBlock()->GetPredecessors()); in FindCoalesceOpportunities() local1364 size_t position = predecessors[i]->GetLifetimeEnd() - 1; in FindCoalesceOpportunities()
1311 const ArenaVector<HBasicBlock*>& predecessors = user->GetBlock()->GetPredecessors(); in ReplaceUsesDominatedBy() local1312 HBasicBlock* predecessor = predecessors[index]; in ReplaceUsesDominatedBy()
2 Removing from predecessors require remove successor otherwise
61 # Test simplification of a dead catch block with normal-predecessors but81 # Test simplification of a live catch block with dead normal-predecessors and98 # This verifies because only exceptional predecessors are live.
64 # SimplifyIfs() would have looked at predecessors of this block based on the indexes