[Interpreter] Add support for Call bytecode to bytecode graph builder.

test/unittests/compiler/bytecode-graph-builder-unittest.cc

 // Copyright 2015 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 <iostream>
 
 #include "src/compiler/bytecode-graph-builder.h"
 #include "src/compiler/common-operator.h"
 #include "src/compiler/graph-visualizer.h"
 #include "src/compiler/instruction.h"
@@ skipping 38 matching lines @@
   SEP()                       \
   REPEAT_32(SEP, __VA_ARGS__) \
   SEP()                       \
   REPEAT_16(SEP, __VA_ARGS__) \
   SEP()                       \
   REPEAT_8(SEP, __VA_ARGS__)  \
   SEP()                       \
   REPEAT_4(SEP, __VA_ARGS__) SEP() REPEAT_2(SEP, __VA_ARGS__) SEP() __VA_ARGS__
 
 
+Handle<TypeFeedbackVector> NewTypeFeedbackVector(
+    Isolate* isolate, FeedbackVectorSpec* spec) {
+  Handle<TypeFeedbackMetadata> vector_metadata =
+      TypeFeedbackMetadata::New(isolate, spec);
+  return TypeFeedbackVector::New(isolate, vector_metadata);
+}
+
+
 class BytecodeGraphBuilderTest : public TestWithIsolateAndZone {
  public:
   BytecodeGraphBuilderTest() {}
 
-  Graph* GetCompletedGraph(Handle<BytecodeArray> bytecode_array);
+  Graph* GetCompletedGraph(Handle<BytecodeArray> bytecode_array,
+                           MaybeHandle<TypeFeedbackVector> feedback_vector =
+                               MaybeHandle<TypeFeedbackVector>());
 
   Matcher<Node*> IsUndefinedConstant();
   Matcher<Node*> IsNullConstant();
   Matcher<Node*> IsTheHoleConstant();
   Matcher<Node*> IsFalseConstant();
   Matcher<Node*> IsTrueConstant();
   Matcher<Node*> IsIntPtrConstant(int value);
   Matcher<Node*> IsFeedbackVector(Node* effect, Node* control);
 
   static Handle<String> GetName(Isolate* isolate, const char* name) {
     Handle<String> result = isolate->factory()->NewStringFromAsciiChecked(name);
     return isolate->factory()->string_table()->LookupString(isolate, result);
   }
 
  private:
   DISALLOW_COPY_AND_ASSIGN(BytecodeGraphBuilderTest);
 };
 
 
 Graph* BytecodeGraphBuilderTest::GetCompletedGraph(
-    Handle<BytecodeArray> bytecode_array) {
+    Handle<BytecodeArray> bytecode_array,
+    MaybeHandle<TypeFeedbackVector> feedback_vector) {
   MachineOperatorBuilder* machine = new (zone()) MachineOperatorBuilder(
       zone(), kMachPtr, InstructionSelector::SupportedMachineOperatorFlags());
   CommonOperatorBuilder* common = new (zone()) CommonOperatorBuilder(zone());
   JSOperatorBuilder* javascript = new (zone()) JSOperatorBuilder(zone());
   Graph* graph = new (zone()) Graph(zone());
   JSGraph* jsgraph = new (zone())
       JSGraph(isolate(), graph, common, javascript, nullptr, machine);
 
   Handle<String> name = factory()->NewStringFromStaticChars("test");
   Handle<String> script = factory()->NewStringFromStaticChars("test() {}");
   Handle<SharedFunctionInfo> shared_info =
       factory()->NewSharedFunctionInfo(name, MaybeHandle<Code>());
   shared_info->set_script(*factory()->NewScript(script));
+  if (!feedback_vector.is_null()) {
+    shared_info->set_feedback_vector(*feedback_vector.ToHandleChecked());
+  }
 
   ParseInfo parse_info(zone(), shared_info);
   CompilationInfo info(&parse_info);
   info.shared_info()->set_function_data(*bytecode_array);
 
   BytecodeGraphBuilder graph_builder(zone(), &info, jsgraph);
   graph_builder.CreateGraph();
   return graph;
 }
 
@@ skipping 288 matching lines @@
   Matcher<Node*> feedback_vector_matcher = IsFeedbackVector(start, start);
   Matcher<Node*> preceeding_load = IsJSLoadNamed(val_prev, _, _, _, _);
   Matcher<Node*> load_named_matcher_wide =
       IsJSLoadNamed(val, IsParameter(1), feedback_vector_matcher,
                     preceeding_load, IsIfSuccess(_));
 
   EXPECT_THAT(ret, IsReturn(load_named_matcher_wide, _, _));
 }
 
 
+TEST_F(BytecodeGraphBuilderTest, CallProperty0) {
+  FeedbackVectorSpec feedback_spec(zone());
+  FeedbackVectorSlot call_slot = feedback_spec.AddCallICSlot();
+  FeedbackVectorSlot load_slot = feedback_spec.AddLoadICSlot();
+  Handle<TypeFeedbackVector> vector =
+      NewTypeFeedbackVector(isolate(), &feedback_spec);
+
+  interpreter::BytecodeArrayBuilder array_builder(isolate(), zone());
+  array_builder.set_locals_count(1);
+  array_builder.set_context_count(0);
+  array_builder.set_parameter_count(2);
+
+  Handle<Name> func_name = GetName(isolate(), "func");
+  size_t func_name_index = array_builder.GetConstantPoolEntry(func_name);
+
+  interpreter::Register reg0 = interpreter::Register(0);
+  array_builder.LoadNamedProperty(
+        array_builder.Parameter(1), func_name_index,
+        vector->GetIndex(load_slot), LanguageMode::SLOPPY)
+      .StoreAccumulatorInRegister(reg0)
+      .Call(reg0, array_builder.Parameter(1), 0, vector->GetIndex(call_slot))
+      .Return();
+
+  Graph* graph = GetCompletedGraph(array_builder.ToBytecodeArray(), vector);
+  Node* ret = graph->end()->InputAt(0);
+  Node* start = graph->start();
+
+  Matcher<Node*> feedback_vector_matcher = IsFeedbackVector(start, start);
+  Matcher<Node*> load_named_matcher = IsJSLoadNamed(
+      func_name, IsParameter(1), feedback_vector_matcher, start, start);
+  std::vector<Matcher<Node*>> call_inputs;
+  call_inputs.push_back(load_named_matcher);
+  call_inputs.push_back(IsParameter(1));
+  Matcher<Node*> call_matcher =
+      IsJSCallFunction(call_inputs, load_named_matcher, IsIfSuccess(_));
+
+  EXPECT_THAT(ret, IsReturn(call_matcher, _, _));
+}
+
+
+TEST_F(BytecodeGraphBuilderTest, CallProperty2) {
+  FeedbackVectorSpec feedback_spec(zone());
+  FeedbackVectorSlot call_slot = feedback_spec.AddCallICSlot();
+  FeedbackVectorSlot load_slot = feedback_spec.AddLoadICSlot();
+  Handle<TypeFeedbackVector> vector =
+      NewTypeFeedbackVector(isolate(), &feedback_spec);
+
+  interpreter::BytecodeArrayBuilder array_builder(isolate(), zone());
+  array_builder.set_locals_count(4);
+  array_builder.set_context_count(0);
+  array_builder.set_parameter_count(4);
+
+  Handle<Name> func_name = GetName(isolate(), "func");
+  size_t func_name_index = array_builder.GetConstantPoolEntry(func_name);
+
+  interpreter::Register reg0 = interpreter::Register(0);
+  interpreter::Register reg1 = interpreter::Register(1);
+  interpreter::Register reg2 = interpreter::Register(2);
+  interpreter::Register reg3 = interpreter::Register(3);
+  array_builder.LoadNamedProperty(
+        array_builder.Parameter(1), func_name_index,
+        vector->GetIndex(load_slot), LanguageMode::SLOPPY)
+      .StoreAccumulatorInRegister(reg0)
+      .LoadAccumulatorWithRegister(array_builder.Parameter(1))
+      .StoreAccumulatorInRegister(reg1)
+      .LoadAccumulatorWithRegister(array_builder.Parameter(2))
+      .StoreAccumulatorInRegister(reg2)
+      .LoadAccumulatorWithRegister(array_builder.Parameter(3))
+      .StoreAccumulatorInRegister(reg3)
+      .Call(reg0, reg1, 2, vector->GetIndex(call_slot))
+      .Return();
+
+  Graph* graph = GetCompletedGraph(array_builder.ToBytecodeArray(), vector);
+  Node* ret = graph->end()->InputAt(0);
+  Node* start = graph->start();
+
+  Matcher<Node*> feedback_vector_matcher = IsFeedbackVector(start, start);
+  Matcher<Node*> load_named_matcher = IsJSLoadNamed(
+      func_name, IsParameter(1), feedback_vector_matcher, start, start);
+  std::vector<Matcher<Node*>> call_inputs;
+  call_inputs.push_back(load_named_matcher);
+  call_inputs.push_back(IsParameter(1));
+  call_inputs.push_back(IsParameter(2));
+  call_inputs.push_back(IsParameter(3));
+  Matcher<Node*> call_matcher =
+      IsJSCallFunction(call_inputs, load_named_matcher, IsIfSuccess(_));
+
+  EXPECT_THAT(ret, IsReturn(call_matcher, _, _));
+}
+
 }  // namespace compiler
 }  // namespace internal
 }  // namespace v8