[Interpreter] Optimize equality check with null/undefined with a check on the map.

src/interpreter/bytecode-peephole-optimizer.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/interpreter/bytecode-peephole-optimizer.h"
 
 #include "src/objects-inl.h"
 #include "src/objects.h"
 
 namespace v8 {
@@ skipping 120 matching lines @@
                                                 BytecodeNode* const last,
                                                 BytecodeNode* const current) {
   DCHECK_EQ(last->bytecode(), Bytecode::kLdaZero);
   current->set_bytecode(new_bytecode, 0, current->operand(0),
                         current->operand(1));
   if (last->source_info().is_valid()) {
     current->set_source_info(last->source_info());
   }
 }
 
+void TransformEqualityWithNullOrUndefinedToTestUndetectable(
+    BytecodeNode* const last, BytecodeNode* const current) {
+  DCHECK((last->bytecode() == Bytecode::kLdaNull) ||
+         (last->bytecode() == Bytecode::kLdaUndefined));

[rmcilroy, 2016/12/05 19:08:09]

Do you want to DCHECK that this current bytecode is a TestEqual here?

[mythria, 2016/12/06 10:13:27]

Done.

+  current->set_bytecode(Bytecode::kTestUndetectable, current->operand(0));
+  if (last->source_info().is_valid()) {
+    current->set_source_info(last->source_info());
+  }
+}
+
 }  // namespace
 
 void BytecodePeepholeOptimizer::DefaultAction(
     BytecodeNode* const node, const PeepholeActionAndData* action_data) {
   DCHECK(LastIsValid());
   DCHECK(!Bytecodes::IsJump(node->bytecode()));
 
   next_stage()->Write(last());
   SetLast(node);
 }
@@ skipping 93 matching lines @@
   if (!node->source_info().is_valid() || !last()->source_info().is_valid()) {
     // Fused last and current into current.
     TransformLdaZeroBinaryOpToBinaryOpWithZero(action_data->bytecode, last(),
                                                node);
     SetLast(node);
   } else {
     DefaultAction(node);
   }
 }
 
+void BytecodePeepholeOptimizer::
+    TransformEqualityWithNullOrUndefinedToTestUndetectableAction(
+        BytecodeNode* const node, const PeepholeActionAndData* action_data) {
+  DCHECK(LastIsValid());
+  DCHECK(!Bytecodes::IsJump(node->bytecode()));
+  // Fused last and current into current.
+  TransformEqualityWithNullOrUndefinedToTestUndetectable(last(), node);
+  SetLast(node);
+}
+
 void BytecodePeepholeOptimizer::DefaultJumpAction(
     BytecodeNode* const node, const PeepholeActionAndData* action_data) {
   DCHECK(LastIsValid());
   DCHECK(Bytecodes::IsJump(node->bytecode()));
 
   next_stage()->Write(last());
   InvalidateLast();
 }
 
 void BytecodePeepholeOptimizer::UpdateLastJumpAction(
@@ skipping 42 matching lines @@
 #undef CASE
     default:
       UNREACHABLE();
       break;
   }
 }
 
 }  // namespace interpreter
 }  // namespace internal
 }  // namespace v8