Fix oversight in type change

src/compiler/verifier.cc

 // Copyright 2014 the V8 project authors. All rights reserved.
 // Use of this source code is governed by a BSD-style license that can be
 // found in the LICENSE file.
 
 #include "src/compiler/verifier.h"
 
 #include <deque>
 #include <queue>
 
 #include "src/compiler/generic-algorithm.h"
@@ skipping 148 matching lines @@
         CHECK(!OperatorProperties::HasControlOutput(node->op()));
         // Type is empty.
         CHECK(!NodeProperties::IsTyped(node));
         break;
       case IrOpcode::kDead:
         // Dead is never connected to the graph.
         UNREACHABLE();
       case IrOpcode::kBranch: {
         // Branch uses are IfTrue and IfFalse.
         Node::Uses uses = node->uses();
-        bool count_true = 0, count_false = 0;
+        int count_true = 0, count_false = 0;
         for (Node::Uses::iterator it = uses.begin(); it != uses.end(); ++it) {
           CHECK((*it)->opcode() == IrOpcode::kIfTrue ||
                 (*it)->opcode() == IrOpcode::kIfFalse);
           if ((*it)->opcode() == IrOpcode::kIfTrue) ++count_true;
           if ((*it)->opcode() == IrOpcode::kIfFalse) ++count_false;
         }
         CHECK(count_true == 1 && count_false == 1);
         // Type is empty.
         CHECK(!NodeProperties::IsTyped(node));
         break;
@@ skipping 705 matching lines @@
     // Check inputs for all nodes in the block.
     for (size_t i = 0; i < block->NodeCount(); i++) {
       Node* node = block->NodeAt(i);
       CheckInputsDominate(schedule, block, node, static_cast<int>(i) - 1);
     }
   }
 }
 }
 }
 }  // namespace v8::internal::compiler