Represent runtime type information as nested lists.

sdk/lib/_internal/compiler/implementation/ssa/codegen.dart

 // Copyright (c) 2012, the Dart project authors.  Please see the AUTHORS file
 // for details. All rights reserved. Use of this source code is governed by a
 // BSD-style license that can be found in the LICENSE file.
 
 part of ssa;
 
 class SsaCodeGeneratorTask extends CompilerTask {
 
   final JavaScriptBackend backend;
 
@@ skipping 2380 matching lines @@
       attachLocationToLast(node);
     } else if (types[input].canBePrimitive() || types[input].canBeNull()) {
       checkObject(input, '===');
       js.Expression objectTest = pop();
       checkType(input, type);
       push(new js.Binary('&&', objectTest, pop()), node);
     } else {
       checkType(input, type);
       attachLocationToLast(node);
     }
-    if (node.hasTypeInfo()) {
+    if (node.hasArgumentChecks()) {
       InterfaceType interfaceType = type;
       ClassElement cls = type.element;
       Link<DartType> arguments = interfaceType.typeArguments;
       js.Expression result = pop();
-      for (TypeVariableType typeVariable in cls.typeVariables) {
-        use(node.typeInfoCall);
-        int index = RuntimeTypeInformation.getTypeVariableIndex(typeVariable);
-        js.PropertyAccess field = new js.PropertyAccess.indexed(pop(), index);
-        // Also test for 'undefined' in case the object does not have
-        // any type variable.
-        js.Prefix undefinedTest = new js.Prefix('!', field);
-        if (arguments.head == compiler.types.dynamicType) {
-          result = new js.Binary('&&', result, undefinedTest);
-        } else {
-          RuntimeTypeInformation rti = backend.rti;
-          String typeName = rti.getStringRepresentation(arguments.head);
-          js.Expression genericName = new js.LiteralString("'$typeName'");
-          js.Binary eqTest = new js.Binary('===', field, genericName);
-          result = new js.Binary(
-              '&&', result, new js.Binary('||', undefinedTest, eqTest));
-        }
-        arguments = arguments.tail;
+      for (int i = 0; i < node.checkCount; i++) {
+        use(node.getCheck(i));
+        result = new js.Binary('&&', result, pop());
       }
       push(result, node);
     }
     if (node.nullOk) {
       checkNull(input);
       push(new js.Binary('||', pop(), pop()), node);
     }
   }
 
   // TODO(johnniwinther): Refactor this method.
@@ skipping 622 matching lines @@
   if (leftType.canBeNull() && rightType.canBeNull()) {
     if (left.isConstantNull() || right.isConstantNull() ||
         (leftType.isPrimitive() && leftType == rightType)) {
       return '==';
     }
     return null;
   } else {
     return '===';
   }
 }