[Interpreter] Add support for unary operators 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 509 matching lines @@
       Matcher<Node*> feedback_vector_matcher = IsFeedbackVector(start, start);
       Matcher<Node*> store_global_matcher = IsJSStoreGlobal(
           name, value_matcher, feedback_vector_matcher, start, start);
 
       EXPECT_THAT(ret, IsReturn(_, store_global_matcher, _));
     }
   }
 }
 
 
+TEST_F(BytecodeGraphBuilderTest, LogicalNot) {
+  interpreter::BytecodeArrayBuilder array_builder(isolate(), zone());
+  array_builder.set_locals_count(1);
+  array_builder.set_context_count(0);
+  array_builder.set_parameter_count(2);
+  array_builder.LoadAccumulatorWithRegister(array_builder.Parameter(1))
+      .LogicalNot()
+      .Return();
+
+  FeedbackVectorSpec feedback_spec(zone());
+  Handle<TypeFeedbackVector> vector =
+      NewTypeFeedbackVector(isolate(), &feedback_spec);
+  Graph* graph = GetCompletedGraph(array_builder.ToBytecodeArray(), vector);
+
+  Node* ret = graph->end()->InputAt(0);
+  EXPECT_THAT(ret, IsReturn(IsJSUnaryNot(IsParameter(1)), _, _));
+}
+
+
+TEST_F(BytecodeGraphBuilderTest, TypeOf) {
+  interpreter::BytecodeArrayBuilder array_builder(isolate(), zone());
+  array_builder.set_locals_count(1);
+  array_builder.set_context_count(0);
+  array_builder.set_parameter_count(2);
+  array_builder.LoadAccumulatorWithRegister(array_builder.Parameter(1))
+      .TypeOf()
+      .Return();
+
+  FeedbackVectorSpec feedback_spec(zone());
+  Handle<TypeFeedbackVector> vector =
+      NewTypeFeedbackVector(isolate(), &feedback_spec);
+  Graph* graph = GetCompletedGraph(array_builder.ToBytecodeArray(), vector);
+
+  Node* ret = graph->end()->InputAt(0);
+  EXPECT_THAT(ret, IsReturn(IsJSTypeOf(IsParameter(1)), _, _));
+}
+
+
+TEST_F(BytecodeGraphBuilderTest, Delete) {
+  TRACED_FOREACH(LanguageMode, language_mode, kLanguageModes) {
+    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> name = GetName(isolate(), "val");
+    array_builder.LoadLiteral(name)
+        .Delete(array_builder.Parameter(1), language_mode)
+        .Return();
+
+    FeedbackVectorSpec feedback_spec(zone());
+    Handle<TypeFeedbackVector> vector =
+        NewTypeFeedbackVector(isolate(), &feedback_spec);
+    Graph* graph = GetCompletedGraph(array_builder.ToBytecodeArray(), vector,
+                                     language_mode);
+
+    Node* start = graph->start();
+    Node* ret = graph->end()->InputAt(0);
+
+    Matcher<Node*> delete_matcher =
+        IsJSDeleteProperty(IsParameter(1), IsHeapConstant(name), start, start);
+    EXPECT_THAT(ret, IsReturn(delete_matcher, _, _));
+  }
+}
+
 }  // namespace compiler
 }  // namespace internal
 }  // namespace v8