Use default argument count for runtime function calls.

src/compiler/js-typed-lowering.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/code-factory.h"
 #include "src/compilation-dependencies.h"
 #include "src/compiler/access-builder.h"
 #include "src/compiler/js-graph.h"
 #include "src/compiler/js-typed-lowering.h"
 #include "src/compiler/linkage.h"
@@ skipping 1203 matching lines @@
 
 
   Node* runtime_has_in_proto_chain = control = graph()->NewNode(
       common()->Merge(2), if_is_access_check_needed, if_is_proxy);
   effect = graph()->NewNode(common()->EffectPhi(2), e_is_access_check_needed,
                             e_is_proxy, control);
 
   // If we need an access check or the object is a Proxy, make a runtime call
   // to finish the lowering.
   Node* bool_result_runtime_has_in_proto_chain_case = graph()->NewNode(
-      javascript()->CallRuntime(Runtime::kHasInPrototypeChain, 2), r.left(),
+      javascript()->CallRuntime(Runtime::kHasInPrototypeChain), r.left(),
       prototype, context, frame_state, effect, control);
 
   control = graph()->NewNode(common()->IfFalse(), branch_is_proxy);
 
   Node* object_prototype = effect = graph()->NewNode(
       simplified()->LoadField(AccessBuilder::ForMapPrototype()),
       loop_object_map, loop_effect, control);
 
   // Check if object prototype is equal to function prototype.
   Node* eq_proto =
@@ skipping 1038 matching lines @@
 Reduction JSTypedLowering::ReduceJSForInPrepare(Node* node) {
   DCHECK_EQ(IrOpcode::kJSForInPrepare, node->opcode());
   Node* receiver = NodeProperties::GetValueInput(node, 0);
   Node* context = NodeProperties::GetContextInput(node);
   Node* frame_state = NodeProperties::GetFrameStateInput(node, 0);
   Node* effect = NodeProperties::GetEffectInput(node);
   Node* control = NodeProperties::GetControlInput(node);
 
   // Get the set of properties to enumerate.
   Node* cache_type = effect = graph()->NewNode(
-      javascript()->CallRuntime(Runtime::kGetPropertyNamesFast, 1), receiver,
+      javascript()->CallRuntime(Runtime::kGetPropertyNamesFast), receiver,
       context, frame_state, effect, control);
   control = graph()->NewNode(common()->IfSuccess(), cache_type);
 
   Node* receiver_map = effect =
       graph()->NewNode(simplified()->LoadField(AccessBuilder::ForMap()),
                        receiver, effect, control);
   Node* cache_type_map = effect =
       graph()->NewNode(simplified()->LoadField(AccessBuilder::ForMap()),
                        cache_type, effect, control);
   Node* meta_map = jsgraph()->HeapConstant(factory()->meta_map());
@@ skipping 185 matching lines @@
       vtrue1 = key;
     }
 
     Node* if_false1 = graph()->NewNode(common()->IfFalse(), branch1);
     Node* efalse1;
     Node* vfalse1;
     {
       // Filter the {key} to check if it's still a valid property of the
       // {receiver} (does the ToName conversion implicitly).
       vfalse1 = efalse1 = graph()->NewNode(
-          javascript()->CallRuntime(Runtime::kForInFilter, 2), receiver, key,
+          javascript()->CallRuntime(Runtime::kForInFilter), receiver, key,
           context, frame_state, effect, if_false1);
       if_false1 = graph()->NewNode(common()->IfSuccess(), vfalse1);
     }
 
     if_false0 = graph()->NewNode(common()->Merge(2), if_true1, if_false1);
     efalse0 =
         graph()->NewNode(common()->EffectPhi(2), etrue1, efalse1, if_false0);
     vfalse0 = graph()->NewNode(common()->Phi(MachineRepresentation::kTagged, 2),
                                vtrue1, vfalse1, if_false0);
   }
@@ skipping 352 matching lines @@
 }
 
 
 CompilationDependencies* JSTypedLowering::dependencies() const {
   return dependencies_;
 }
 
 }  // namespace compiler
 }  // namespace internal
 }  // namespace v8