[stubs] Renames WordIsSmi to TaggedIsSmi, introducing an appropriate bitcast of the parameter.

src/builtins/builtins-array.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.h"
 #include "src/builtins/builtins-utils.h"
 
 #include "src/code-factory.h"
 #include "src/elements.h"
 
@@ skipping 1218 matching lines @@
 void Builtins::Generate_ArrayIsArray(CodeStubAssembler* assembler) {
   typedef compiler::Node Node;
   typedef CodeStubAssembler::Label Label;
 
   Node* object = assembler->Parameter(1);
   Node* context = assembler->Parameter(4);
 
   Label call_runtime(assembler), return_true(assembler),
       return_false(assembler);
 
-  assembler->GotoIf(assembler->WordIsSmi(object), &return_false);
+  assembler->GotoIf(assembler->TaggedIsSmi(object), &return_false);
   Node* instance_type = assembler->LoadInstanceType(object);
 
   assembler->GotoIf(assembler->Word32Equal(
                         instance_type, assembler->Int32Constant(JS_ARRAY_TYPE)),
                     &return_true);
 
   // TODO(verwaest): Handle proxies in-place.
   assembler->Branch(assembler->Word32Equal(
                         instance_type, assembler->Int32Constant(JS_PROXY_TYPE)),
                     &call_runtime, &return_false);
@@ skipping 39 matching lines @@
   len_var.Bind(intptr_zero);
 
   // Take slow path if not a JSArray, if retrieving elements requires
   // traversing prototype, or if access checks are required.
   assembler->BranchIfFastJSArray(array, context, &init_len, &call_runtime);
 
   assembler->Bind(&init_len);
   {
     // Handle case where JSArray length is not an Smi in the runtime
     Node* len = assembler->LoadObjectField(array, JSArray::kLengthOffset);
-    assembler->GotoUnless(assembler->WordIsSmi(len), &call_runtime);
+    assembler->GotoUnless(assembler->TaggedIsSmi(len), &call_runtime);
 
     len_var.Bind(assembler->SmiToWord(len));
     assembler->Branch(assembler->WordEqual(len_var.value(), intptr_zero),
                       &return_false, &init_k);
   }
 
   assembler->Bind(&init_k);
   {
     Label done(assembler), init_k_smi(assembler), init_k_heap_num(assembler),
         init_k_zero(assembler), init_k_n(assembler);
     Node* tagged_n = assembler->ToInteger(context, start_from);
 
-    assembler->Branch(assembler->WordIsSmi(tagged_n), &init_k_smi,
+    assembler->Branch(assembler->TaggedIsSmi(tagged_n), &init_k_smi,
                       &init_k_heap_num);
 
     assembler->Bind(&init_k_smi);
     {
       start_from_var.Bind(assembler->SmiUntag(tagged_n));
       assembler->Goto(&init_k_n);
     }
 
     assembler->Bind(&init_k_heap_num);
     {
@@ skipping 65 matching lines @@
 
   assembler->Bind(&if_smiorobjects);
   {
     Variable search_num(assembler, MachineRepresentation::kFloat64);
     Label ident_loop(assembler, &index_var),
         heap_num_loop(assembler, &search_num),
         string_loop(assembler, &index_var), simd_loop(assembler),
         undef_loop(assembler, &index_var), not_smi(assembler),
         not_heap_num(assembler);
 
-    assembler->GotoUnless(assembler->WordIsSmi(search_element), &not_smi);
+    assembler->GotoUnless(assembler->TaggedIsSmi(search_element), &not_smi);
     search_num.Bind(assembler->SmiToFloat64(search_element));
     assembler->Goto(&heap_num_loop);
 
     assembler->Bind(&not_smi);
     assembler->GotoIf(assembler->WordEqual(search_element, undefined),
                       &undef_loop);
     Node* map = assembler->LoadMap(search_element);
     assembler->GotoIf(assembler->WordNotEqual(map, heap_number_map),
                       &not_heap_num);
     search_num.Bind(assembler->LoadHeapNumberValue(search_element));
@@ skipping 48 matching lines @@
 
       assembler->Bind(&not_nan_loop);
       {
         Label continue_loop(assembler), not_smi(assembler);
         assembler->GotoUnless(
             assembler->UintPtrLessThan(index_var.value(), len_var.value()),
             &return_false);
         Node* element_k = assembler->LoadFixedArrayElement(
             elements, index_var.value(), 0,
             CodeStubAssembler::INTPTR_PARAMETERS);
-        assembler->GotoUnless(assembler->WordIsSmi(element_k), &not_smi);
+        assembler->GotoUnless(assembler->TaggedIsSmi(element_k), &not_smi);
         assembler->Branch(
             assembler->Float64Equal(search_num.value(),
                                     assembler->SmiToFloat64(element_k)),
             &return_true, &continue_loop);
 
         assembler->Bind(&not_smi);
         assembler->GotoIf(assembler->WordNotEqual(assembler->LoadMap(element_k),
                                                   heap_number_map),
                           &continue_loop);
         assembler->BranchIfFloat64Equal(
             search_num.value(), assembler->LoadHeapNumberValue(element_k),
             &return_true, &continue_loop);
 
         assembler->Bind(&continue_loop);
         index_var.Bind(assembler->IntPtrAdd(index_var.value(), intptr_one));
         assembler->Goto(&not_nan_loop);
       }
 
       assembler->Bind(&nan_loop);
       {
         Label continue_loop(assembler);
         assembler->GotoUnless(
             assembler->UintPtrLessThan(index_var.value(), len_var.value()),
             &return_false);
         Node* element_k = assembler->LoadFixedArrayElement(
             elements, index_var.value(), 0,
             CodeStubAssembler::INTPTR_PARAMETERS);
-        assembler->GotoIf(assembler->WordIsSmi(element_k), &continue_loop);
+        assembler->GotoIf(assembler->TaggedIsSmi(element_k), &continue_loop);
         assembler->GotoIf(assembler->WordNotEqual(assembler->LoadMap(element_k),
                                                   heap_number_map),
                           &continue_loop);
         assembler->BranchIfFloat64IsNaN(
             assembler->LoadHeapNumberValue(element_k), &return_true,
             &continue_loop);
 
         assembler->Bind(&continue_loop);
         index_var.Bind(assembler->IntPtrAdd(index_var.value(), intptr_one));
         assembler->Goto(&nan_loop);
       }
     }
 
     assembler->Bind(&string_loop);
     {
       Label continue_loop(assembler);
       assembler->GotoUnless(
           assembler->UintPtrLessThan(index_var.value(), len_var.value()),
           &return_false);
       Node* element_k = assembler->LoadFixedArrayElement(
           elements, index_var.value(), 0, CodeStubAssembler::INTPTR_PARAMETERS);
-      assembler->GotoIf(assembler->WordIsSmi(element_k), &continue_loop);
+      assembler->GotoIf(assembler->TaggedIsSmi(element_k), &continue_loop);
       assembler->GotoUnless(assembler->IsStringInstanceType(
                                 assembler->LoadInstanceType(element_k)),
                             &continue_loop);
 
       // TODO(bmeurer): Consider inlining the StringEqual logic here.
       Callable callable = CodeFactory::StringEqual(assembler->isolate());
       Node* result =
           assembler->CallStub(callable, context, search_element, element_k);
       assembler->Branch(
           assembler->WordEqual(assembler->BooleanConstant(true), result),
@@ skipping 11 matching lines @@
       Node* map = assembler->LoadMap(search_element);
 
       assembler->Goto(&loop_body);
       assembler->Bind(&loop_body);
       assembler->GotoUnless(
           assembler->UintPtrLessThan(index_var.value(), len_var.value()),
           &return_false);
 
       Node* element_k = assembler->LoadFixedArrayElement(
           elements, index_var.value(), 0, CodeStubAssembler::INTPTR_PARAMETERS);
-      assembler->GotoIf(assembler->WordIsSmi(element_k), &continue_loop);
+      assembler->GotoIf(assembler->TaggedIsSmi(element_k), &continue_loop);
 
       Node* map_k = assembler->LoadMap(element_k);
       assembler->BranchIfSimd128Equal(search_element, map, element_k, map_k,
                                       &return_true, &continue_loop);
 
       assembler->Bind(&continue_loop);
       index_var.Bind(assembler->IntPtrAdd(index_var.value(), intptr_one));
       assembler->Goto(&loop_body);
     }
   }
 
   assembler->Bind(&if_packed_doubles);
   {
     Label nan_loop(assembler, &index_var), not_nan_loop(assembler, &index_var),
         hole_loop(assembler, &index_var), search_notnan(assembler);
     Variable search_num(assembler, MachineRepresentation::kFloat64);
 
-    assembler->GotoUnless(assembler->WordIsSmi(search_element), &search_notnan);
+    assembler->GotoUnless(assembler->TaggedIsSmi(search_element),
+                          &search_notnan);
     search_num.Bind(assembler->SmiToFloat64(search_element));
     assembler->Goto(&not_nan_loop);
 
     assembler->Bind(&search_notnan);
     assembler->GotoIf(assembler->WordNotEqual(
                           assembler->LoadMap(search_element), heap_number_map),
                       &return_false);
 
     search_num.Bind(assembler->LoadHeapNumberValue(search_element));
 
@@ skipping 33 matching lines @@
       assembler->Goto(&nan_loop);
     }
   }
 
   assembler->Bind(&if_holey_doubles);
   {
     Label nan_loop(assembler, &index_var), not_nan_loop(assembler, &index_var),
         hole_loop(assembler, &index_var), search_notnan(assembler);
     Variable search_num(assembler, MachineRepresentation::kFloat64);
 
-    assembler->GotoUnless(assembler->WordIsSmi(search_element), &search_notnan);
+    assembler->GotoUnless(assembler->TaggedIsSmi(search_element),
+                          &search_notnan);
     search_num.Bind(assembler->SmiToFloat64(search_element));
     assembler->Goto(&not_nan_loop);
 
     assembler->Bind(&search_notnan);
     assembler->GotoIf(assembler->WordEqual(search_element, undefined),
                       &hole_loop);
     assembler->GotoIf(assembler->WordNotEqual(
                           assembler->LoadMap(search_element), heap_number_map),
                       &return_false);
 
@@ skipping 99 matching lines @@
   len_var.Bind(intptr_zero);
 
   // Take slow path if not a JSArray, if retrieving elements requires
   // traversing prototype, or if access checks are required.
   assembler->BranchIfFastJSArray(array, context, &init_len, &call_runtime);
 
   assembler->Bind(&init_len);
   {
     // Handle case where JSArray length is not an Smi in the runtime
     Node* len = assembler->LoadObjectField(array, JSArray::kLengthOffset);
-    assembler->GotoUnless(assembler->WordIsSmi(len), &call_runtime);
+    assembler->GotoUnless(assembler->TaggedIsSmi(len), &call_runtime);
 
     len_var.Bind(assembler->SmiToWord(len));
     assembler->Branch(assembler->WordEqual(len_var.value(), intptr_zero),
                       &return_not_found, &init_k);
   }
 
   assembler->Bind(&init_k);
   {
     Label done(assembler), init_k_smi(assembler), init_k_heap_num(assembler),
         init_k_zero(assembler), init_k_n(assembler);
     Node* tagged_n = assembler->ToInteger(context, start_from);
 
-    assembler->Branch(assembler->WordIsSmi(tagged_n), &init_k_smi,
+    assembler->Branch(assembler->TaggedIsSmi(tagged_n), &init_k_smi,
                       &init_k_heap_num);
 
     assembler->Bind(&init_k_smi);
     {
       start_from_var.Bind(assembler->SmiUntag(tagged_n));
       assembler->Goto(&init_k_n);
     }
 
     assembler->Bind(&init_k_heap_num);
     {
@@ skipping 65 matching lines @@
 
   assembler->Bind(&if_smiorobjects);
   {
     Variable search_num(assembler, MachineRepresentation::kFloat64);
     Label ident_loop(assembler, &index_var),
         heap_num_loop(assembler, &search_num),
         string_loop(assembler, &index_var), simd_loop(assembler),
         undef_loop(assembler, &index_var), not_smi(assembler),
         not_heap_num(assembler);
 
-    assembler->GotoUnless(assembler->WordIsSmi(search_element), &not_smi);
+    assembler->GotoUnless(assembler->TaggedIsSmi(search_element), &not_smi);
     search_num.Bind(assembler->SmiToFloat64(search_element));
     assembler->Goto(&heap_num_loop);
 
     assembler->Bind(&not_smi);
     assembler->GotoIf(assembler->WordEqual(search_element, undefined),
                       &undef_loop);
     Node* map = assembler->LoadMap(search_element);
     assembler->GotoIf(assembler->WordNotEqual(map, heap_number_map),
                       &not_heap_num);
     search_num.Bind(assembler->LoadHeapNumberValue(search_element));
@@ skipping 45 matching lines @@
 
       assembler->Bind(&not_nan_loop);
       {
         Label continue_loop(assembler), not_smi(assembler);
         assembler->GotoUnless(
             assembler->UintPtrLessThan(index_var.value(), len_var.value()),
             &return_not_found);
         Node* element_k = assembler->LoadFixedArrayElement(
             elements, index_var.value(), 0,
             CodeStubAssembler::INTPTR_PARAMETERS);
-        assembler->GotoUnless(assembler->WordIsSmi(element_k), &not_smi);
+        assembler->GotoUnless(assembler->TaggedIsSmi(element_k), &not_smi);
         assembler->Branch(
             assembler->Float64Equal(search_num.value(),
                                     assembler->SmiToFloat64(element_k)),
             &return_found, &continue_loop);
 
         assembler->Bind(&not_smi);
         assembler->GotoIf(assembler->WordNotEqual(assembler->LoadMap(element_k),
                                                   heap_number_map),
                           &continue_loop);
         assembler->BranchIfFloat64Equal(
             search_num.value(), assembler->LoadHeapNumberValue(element_k),
             &return_found, &continue_loop);
 
         assembler->Bind(&continue_loop);
         index_var.Bind(assembler->IntPtrAdd(index_var.value(), intptr_one));
         assembler->Goto(&not_nan_loop);
       }
     }
 
     assembler->Bind(&string_loop);
     {
       Label continue_loop(assembler);
       assembler->GotoUnless(
           assembler->UintPtrLessThan(index_var.value(), len_var.value()),
           &return_not_found);
       Node* element_k = assembler->LoadFixedArrayElement(
           elements, index_var.value(), 0, CodeStubAssembler::INTPTR_PARAMETERS);
-      assembler->GotoIf(assembler->WordIsSmi(element_k), &continue_loop);
+      assembler->GotoIf(assembler->TaggedIsSmi(element_k), &continue_loop);
       assembler->GotoUnless(assembler->IsStringInstanceType(
                                 assembler->LoadInstanceType(element_k)),
                             &continue_loop);
 
       // TODO(bmeurer): Consider inlining the StringEqual logic here.
       Callable callable = CodeFactory::StringEqual(assembler->isolate());
       Node* result =
           assembler->CallStub(callable, context, search_element, element_k);
       assembler->Branch(
           assembler->WordEqual(assembler->BooleanConstant(true), result),
@@ skipping 11 matching lines @@
       Node* map = assembler->LoadMap(search_element);
 
       assembler->Goto(&loop_body);
       assembler->Bind(&loop_body);
       assembler->GotoUnless(
           assembler->UintPtrLessThan(index_var.value(), len_var.value()),
           &return_not_found);
 
       Node* element_k = assembler->LoadFixedArrayElement(
           elements, index_var.value(), 0, CodeStubAssembler::INTPTR_PARAMETERS);
-      assembler->GotoIf(assembler->WordIsSmi(element_k), &continue_loop);
+      assembler->GotoIf(assembler->TaggedIsSmi(element_k), &continue_loop);
 
       Node* map_k = assembler->LoadMap(element_k);
       assembler->BranchIfSimd128Equal(search_element, map, element_k, map_k,
                                       &return_found, &continue_loop);
 
       assembler->Bind(&continue_loop);
       index_var.Bind(assembler->IntPtrAdd(index_var.value(), intptr_one));
       assembler->Goto(&loop_body);
     }
   }
 
   assembler->Bind(&if_packed_doubles);
   {
     Label not_nan_loop(assembler, &index_var), search_notnan(assembler);
     Variable search_num(assembler, MachineRepresentation::kFloat64);
 
-    assembler->GotoUnless(assembler->WordIsSmi(search_element), &search_notnan);
+    assembler->GotoUnless(assembler->TaggedIsSmi(search_element),
+                          &search_notnan);
     search_num.Bind(assembler->SmiToFloat64(search_element));
     assembler->Goto(&not_nan_loop);
 
     assembler->Bind(&search_notnan);
     assembler->GotoIf(assembler->WordNotEqual(
                           assembler->LoadMap(search_element), heap_number_map),
                       &return_not_found);
 
     search_num.Bind(assembler->LoadHeapNumberValue(search_element));
 
@@ skipping 16 matching lines @@
       index_var.Bind(assembler->IntPtrAdd(index_var.value(), intptr_one));
       assembler->Goto(&not_nan_loop);
     }
   }
 
   assembler->Bind(&if_holey_doubles);
   {
     Label not_nan_loop(assembler, &index_var), search_notnan(assembler);
     Variable search_num(assembler, MachineRepresentation::kFloat64);
 
-    assembler->GotoUnless(assembler->WordIsSmi(search_element), &search_notnan);
+    assembler->GotoUnless(assembler->TaggedIsSmi(search_element),
+                          &search_notnan);
     search_num.Bind(assembler->SmiToFloat64(search_element));
     assembler->Goto(&not_nan_loop);
 
     assembler->Bind(&search_notnan);
     assembler->GotoIf(assembler->WordNotEqual(
                           assembler->LoadMap(search_element), heap_number_map),
                       &return_not_found);
 
     search_num.Bind(assembler->LoadHeapNumberValue(search_element));
 
@@ skipping 27 matching lines @@
   assembler->Bind(&return_not_found);
   assembler->Return(assembler->NumberConstant(-1));
 
   assembler->Bind(&call_runtime);
   assembler->Return(assembler->CallRuntime(Runtime::kArrayIndexOf, context,
                                            array, search_element, start_from));
 }
 
 }  // namespace internal
 }  // namespace v8