Drop some unused code

src/hydrogen-bch.cc

 // Copyright 2013 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/hydrogen-bch.h"
 
 namespace v8 {
 namespace internal {
 
 /*
@@ skipping 219 matching lines @@
         (hoistability == OPTIMISTICALLY_HOISTABLE &&
          !graph()->use_optimistic_licm())) {
       return;
     }
 
     // We will do the hoisting, but we must see if the limit is "limit" or if
     // all checks are done on constants: if all check are done against the same
     // constant limit we will use that instead of the induction limit.
     bool has_upper_constant_limit = true;
     int32_t upper_constant_limit =
-        check != NULL && check->HasUpperLimit() ? check->upper_limit() : 0;
+        check->HasUpperLimit() ? check->upper_limit() : 0;
     for (InductionVariableData::InductionVariableCheck* current_check = check;
          current_check != NULL;
          current_check = current_check->next()) {
       has_upper_constant_limit =
-          has_upper_constant_limit &&
-          check->HasUpperLimit() &&
-          check->upper_limit() == upper_constant_limit;
+          has_upper_constant_limit && current_check->HasUpperLimit() &&

[Yang, 2014/10/02 09:54:13]

This seems like a bug fix rather and a mechanical change.

+          current_check->upper_limit() == upper_constant_limit;
       counters()->bounds_checks_eliminated()->Increment();
       current_check->check()->set_skip_check();
     }
 
     // Choose the appropriate limit.
     Zone* zone = graph()->zone();
     HValue* context = graph()->GetInvalidContext();
     HValue* limit = data->limit();
     if (has_upper_constant_limit) {
       HConstant* new_limit = HConstant::New(zone, context,
@@ skipping 112 matching lines @@
 
 void HBoundsCheckHoistingPhase::HoistRedundantBoundsChecks() {
   InductionVariableBlocksTable table(graph());
   table.CollectInductionVariableData(graph()->entry_block());
   for (int i = 0; i < graph()->blocks()->length(); i++) {
     table.EliminateRedundantBoundsChecks(graph()->blocks()->at(i));
   }
 }
 
 } }  // namespace v8::internal