[turbofan] Fix more -Wsign-compare warnings.

src/compiler/effect-control-linearizer.cc

 // Copyright 2015 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/effect-control-linearizer.h"
 
 #include "src/code-factory.h"
 #include "src/compiler/access-builder.h"
 #include "src/compiler/js-graph.h"
 #include "src/compiler/linkage.h"
@@ skipping 56 matching lines @@
 
   PendingEffectPhi(Node* effect_phi, BasicBlock* block)
       : effect_phi(effect_phi), block(block) {}
 };
 
 void UpdateEffectPhi(Node* node, BasicBlock* block,
                      BlockEffectControlMap* block_effects) {
   // Update all inputs to an effect phi with the effects from the given
   // block->effect map.
   DCHECK_EQ(IrOpcode::kEffectPhi, node->opcode());
-  DCHECK_EQ(node->op()->EffectInputCount(), block->PredecessorCount());
+  DCHECK_EQ(static_cast<size_t>(node->op()->EffectInputCount()),
+            block->PredecessorCount());
   for (int i = 0; i < node->op()->EffectInputCount(); i++) {
     Node* input = node->InputAt(i);
     BasicBlock* predecessor = block->PredecessorAt(static_cast<size_t>(i));
     const BlockEffectControlData& block_effect =
         block_effects->For(predecessor, block);
     if (input != block_effect.current_effect) {
       node->ReplaceInput(i, block_effect.current_effect);
     }
   }
 }
@@ skipping 153 matching lines @@
     merge_false_inputs[index] = graph->NewNode(common->IfFalse(), branch1);
   }
   Node* const merge_true = matcher.IfTrue();
   Node* const merge_false = matcher.IfFalse();
   merge_true->TrimInputCount(0);
   merge_false->TrimInputCount(0);
   for (int i = 0; i < input_count; ++i) {
     merge_true->AppendInput(graph->zone(), merge_true_inputs[i]);
     merge_false->AppendInput(graph->zone(), merge_false_inputs[i]);
   }
-  DCHECK_EQ(2, block->SuccessorCount());
+  DCHECK_EQ(2u, block->SuccessorCount());
   NodeProperties::ChangeOp(matcher.IfTrue(), common->Merge(input_count));
   NodeProperties::ChangeOp(matcher.IfFalse(), common->Merge(input_count));
   int const true_index =
       block->SuccessorAt(0)->NodeAt(0) == matcher.IfTrue() ? 0 : 1;
   BlockEffectControlData* true_block_data =
       &block_effects->For(block, block->SuccessorAt(true_index));
   BlockEffectControlData* false_block_data =
       &block_effects->For(block, block->SuccessorAt(true_index ^ 1));
   for (Node* const phi : phis) {
     for (int index = 0; index < input_count; ++index) {
@@ skipping 3491 matching lines @@
         isolate(), graph()->zone(), callable.descriptor(), 0, flags,
         Operator::kEliminatable);
     to_number_operator_.set(common()->Call(desc));
   }
   return to_number_operator_.get();
 }
 
 }  // namespace compiler
 }  // namespace internal
 }  // namespace v8