Check closure data for serialization

pkg/compiler/lib/src/serialization/equivalence.dart

 // Copyright (c) 2016, 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.
 
 /// Functions for asserting equivalence across serialization.
 
 library dart2js.serialization.equivalence;
 
+import '../closure.dart';
 import '../common.dart';
 import '../common/resolution.dart';
 import '../constants/expressions.dart';
 import '../dart_types.dart';
 import '../elements/elements.dart';
 import '../elements/visitor.dart';
 import '../js_backend/backend_serialization.dart'
     show JavaScriptBackendSerializer;
 import '../native/native.dart' show NativeBehavior;
 import '../resolution/access_semantics.dart';
@@ skipping 379 matching lines @@
       return visit(element1.library, element2.library);
     }
   }
 
   @override
   bool visitFieldElement(FieldElement element1, FieldElement element2) {
     return checkMembers(element1, element2);
   }
 
   @override
+  bool visitBoxFieldElement(
+      BoxFieldElement element1, BoxFieldElement element2) {
+    return element1.box.name == element2.box.name &&
+        visit(element1.box.executableContext, element2.box.executableContext) &&
+        visit(element1.variableElement, element2.variableElement);
+  }
+
+  @override
   bool visitConstructorElement(
       ConstructorElement element1, ConstructorElement element2) {
     return checkMembers(element1, element2);
   }
 
   @override
   bool visitMethodElement(MethodElement element1, MethodElement element2) {
     return checkMembers(element1, element2);
   }
 
@@ skipping 397 matching lines @@
   resolvedAst1.node.accept(indices1);
   AstIndexComputer indices2 = new AstIndexComputer();
   resolvedAst2.node.accept(indices2);
 
   TreeElements elements1 = resolvedAst1.elements;
   TreeElements elements2 = resolvedAst2.elements;
 
   TreeElementsEquivalenceVisitor visitor = new TreeElementsEquivalenceVisitor(
       indices1, indices2, elements1, elements2, strategy);
   resolvedAst1.node.accept(visitor);
-  return visitor.success;
+  if (visitor.success) {
+    return strategy.test(elements1, elements2, 'containsTryStatement',
+        elements1.containsTryStatement, elements2.containsTryStatement);
+  }
+  return false;
 }
 
 /// Visitor that checks the equivalence of [TreeElements] data.
 class TreeElementsEquivalenceVisitor extends Visitor {
   final TestStrategy strategy;
   final AstIndexComputer indices1;
   final AstIndexComputer indices2;
   final TreeElements elements1;
   final TreeElements elements2;
   bool success = true;
@@ skipping 951 matching lines @@
   @override
   bool visitStatement(Statement node1, Statement node2) {
     throw new UnsupportedError('Unexpected nodes: $node1 <> $node2');
   }
 
   @override
   bool visitStringNode(StringNode node1, StringNode node2) {
     throw new UnsupportedError('Unexpected nodes: $node1 <> $node2');
   }
 }