[builtins] Add String.prototype.indexOf fast path in TF

src/compiler/register-allocator-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/bit-vector.h"
 #include "src/compiler/instruction.h"
 #include "src/compiler/register-allocator-verifier.h"
 
 namespace v8 {
 namespace internal {
@@ skipping 325 matching lines @@
   } else if (block->PredecessorCount() == 1 && block->phis().size() == 0) {
     const BlockAssessments* prev_block = assessments_[block->predecessors()[0]];
     ret->CopyFrom(prev_block);
   } else {
     for (RpoNumber pred_id : block->predecessors()) {
       // For every operand coming from any of the predecessors, create an
       // Unfinalized assessment.
       auto iterator = assessments_.find(pred_id);
       if (iterator == assessments_.end()) {
         // This block is the head of a loop, and this predecessor is the
-        // loopback
-        // arc.
+        // loopback arc.

[Benedikt Meurer, 2017/01/18 18:10:41]

Can you revert this change? It's a bit confusing to have a register allocator
change in this CL. You can do it separately if you want.

[Camillo Bruni, 2017/01/24 15:51:43]

excluded.

         // Validate this is a loop case, otherwise the CFG is malformed.
         CHECK(pred_id >= current_block_id);
         CHECK(block->IsLoopHeader());
         continue;
       }
       const BlockAssessments* pred_assessments = iterator->second;
       CHECK_NOT_NULL(pred_assessments);
       for (auto pair : pred_assessments->map()) {
         InstructionOperand operand = pair.first;
         if (ret->map().find(operand) == ret->map().end()) {
@@ skipping 218 matching lines @@
               new (zone()) FinalAssessment(vreg, pending);
           break;
       }
     }
   }
 }
 
 }  // namespace compiler
 }  // namespace internal
 }  // namespace v8