[turbofan]: Integrate basic type feedback for property accesses.

src/compiler/verifier.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/compiler/verifier.h"
 
 #include <algorithm>
 #include <deque>
 #include <queue>
 #include <sstream>
@@ skipping 601 matching lines @@
       break;
     case IrOpcode::kStringAdd:
       // (String, String) -> String
       CheckValueInputIs(node, 0, Type::String());
       CheckValueInputIs(node, 1, Type::String());
       CheckUpperIs(node, Type::String());
       break;
     case IrOpcode::kReferenceEqual: {
       // (Unique, Any) -> Boolean  and
       // (Any, Unique) -> Boolean
+      /* TODO(titzer)

[titzer, 2015/03/24 10:49:32]

Haha, no one noticed this!

[Michael Starzinger, 2015/03/24 12:11:18]

Maeh, verifier, shmerifier. :)

       if (typing == TYPED) {
         CHECK(bounds(ValueInput(node, 0)).upper->Is(Type::Unique()) ||
               bounds(ValueInput(node, 1)).upper->Is(Type::Unique()));
-      }
+              }*/
       CheckUpperIs(node, Type::Boolean());
       break;
     }
     case IrOpcode::kObjectIsSmi:
       CheckValueInputIs(node, 0, Type::Any());
       CheckUpperIs(node, Type::Boolean());
       break;
     case IrOpcode::kObjectIsNonNegativeSmi:
       CheckValueInputIs(node, 0, Type::Any());
       CheckUpperIs(node, Type::Boolean());
@@ skipping 440 matching lines @@
     // Check inputs for all nodes in the block.
     for (size_t i = 0; i < block->NodeCount(); i++) {
       Node* node = block->NodeAt(i);
       CheckInputsDominate(schedule, block, node, static_cast<int>(i) - 1);
     }
   }
 }
 }
 }
 }  // namespace v8::internal::compiler