[interpreter][stubs] Fixing issues found by machine graph verifier.

src/builtins/builtins-regexp.cc

 // Copyright 2016 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/builtins/builtins-utils.h"
 #include "src/builtins/builtins.h"
 #include "src/code-factory.h"
 #include "src/code-stub-assembler.h"
 #include "src/regexp/jsregexp.h"
 #include "src/regexp/regexp-utils.h"
@@ skipping 240 matching lines @@
 
     Bind(&if_doupdate);
     {
       Node* const regexp_lastindex =
           LoadLastIndex(context, regexp, is_fastpath);
       var_lastindex.Bind(regexp_lastindex);
 
       // Omit ToLength if lastindex is a non-negative smi.
       {
         Label call_tolength(this, Label::kDeferred), next(this);
-        Branch(WordIsPositiveSmi(regexp_lastindex), &next, &call_tolength);
+        Branch(TaggedIsPositiveSmi(regexp_lastindex), &next, &call_tolength);
 
         Bind(&call_tolength);
         {
           Callable tolength_callable = CodeFactory::ToLength(isolate);
           var_lastindex.Bind(
               CallStub(tolength_callable, context, regexp_lastindex));
           Goto(&next);
         }
 
         Bind(&next);
@@ skipping 2272 matching lines @@
   Bind(&if_matched);
   {
     Node* result =
         ConstructNewResultFromMatchInfo(context, match_indices, string);
     Return(result);
   }
 }
 
 }  // namespace internal
 }  // namespace v8