176       block->GetPredecessors().Size() - block->NumberOfBackEdges()) {  in VisitBlockForDominatorTree()
216   size_t number_of_incomings = header->GetPredecessors().Size() - info->NumberOfBackEdges();  in SimplifyLoop()
222     for (size_t pred = 0; pred < header->GetPredecessors().Size(); ++pred) {  in SimplifyLoop()
223       HBasicBlock* predecessor = header->GetPredecessors().Get(pred);  in SimplifyLoop()
233   if (info->IsBackEdge(*header->GetPredecessors().Get(0))) {  in SimplifyLoop()
234     HBasicBlock* to_swap = header->GetPredecessors().Get(0);  in SimplifyLoop()
235     for (size_t pred = 1, e = header->GetPredecessors().Size(); pred < e; ++pred) {  in SimplifyLoop()
236       HBasicBlock* predecessor = header->GetPredecessors().Get(pred);  in SimplifyLoop()
268         if (successor->GetPredecessors().Size() > 1) {  in SimplifyCFG()
364   for (size_t i = 0, e = block->GetPredecessors().Size(); i < e; ++i) {  in PopulateRecursive()
365     PopulateRecursive(block->GetPredecessors().Get(i));  in PopulateRecursive()
1098   DCHECK_EQ(other->GetPredecessors().Size(), 1u);  in MergeWith()
1099   DCHECK_EQ(other->GetPredecessors().Get(0), this);  in MergeWith()
1148   DCHECK_EQ(other->GetPredecessors().Size(), 1u);  in MergeWithInlined()
1149   DCHECK(other->GetPredecessors().Get(0)->IsEntryBlock());  in MergeWithInlined()
1176   while (!GetPredecessors().IsEmpty()) {  in ReplaceWith()
1177     HBasicBlock* predecessor = GetPredecessors().Get(0);  in ReplaceWith()
1209   DCHECK(block->GetPredecessors().IsEmpty());  in DeleteDeadBlock()
1262     bool returns_void = to->GetPredecessors().Get(0)->GetLastInstruction()->IsReturnVoid();  in InlineInto()
1263     if (to->GetPredecessors().Size() == 1) {  in InlineInto()
1264       HBasicBlock* predecessor = to->GetPredecessors().Get(0);  in InlineInto()
1278       for (size_t i = 0, e = to->GetPredecessors().Size(); i < e; ++i) {  in InlineInto()
1279         HBasicBlock* predecessor = to->GetPredecessors().Get(i);  in InlineInto()