Searched refs:PredecessorCount (Results 1 – 6 of 6) sorted by relevance
61 CHECK_EQ(0, entry->PredecessorCount()); in TEST()65 CHECK_EQ(1, next->PredecessorCount()); in TEST()86 CHECK_EQ(0, entry->PredecessorCount()); in TEST()91 CHECK_EQ(1, tblock->PredecessorCount()); in TEST()95 CHECK_EQ(1, fblock->PredecessorCount()); in TEST()109 CHECK_EQ(0, entry->PredecessorCount()); in TEST()123 CHECK_EQ(0, entry->PredecessorCount()); in TEST()
39 if (block->PredecessorCount() != 0) os << " <- "; in operator <<()
546 DCHECK(index < static_cast<int>(successor->PredecessorCount())); in ComputeLiveOut()778 DCHECK((*succ)->PredecessorCount() == 1); in MeetRegisterConstraintsForLastInstructionInBlock()796 DCHECK((*succ)->PredecessorCount() == 1); in MeetRegisterConstraintsForLastInstructionInBlock()1079 if (j >= block->PredecessorCount()) continue; in ResolvePhis()1179 if (block->PredecessorCount() == 1) { in ResolveControlFlow()1254 if (block->PredecessorCount() != 1) return false; in CanEagerlyResolveControlFlow()
106 int PredecessorCount() { return InputCount(); } in PredecessorCount() function
35 DCHECK_NE(0, block->PredecessorCount()); in SelectInstructions()36 DCHECK_NE(1, block->PredecessorCount()); in SelectInstructions()
816 for (int i = 0; i < block->PredecessorCount(); i++) { in ComputeLoopInfo()