Tweak public APIs and use them in patch_sdk, dart2js, and kernel-service

pkg/kernel/lib/binary/ast_from_binary.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.
 library kernel.ast_from_binary;
 
 import 'dart:convert';
 import 'dart:typed_data';
 
 import '../ast.dart';
 import '../transformations/flags.dart';
@@ skipping 141 matching lines @@
     if (length == 0) return const <Expression>[];
     List<Expression> list = new List<Expression>(length);
     for (int i = 0; i < length; ++i) {
       list[i] = readExpression()..parent = parent;
     }
     return list;
   }
 
   void _fillTreeNodeList(
       List<TreeNode> list, TreeNode buildObject(), TreeNode parent) {
-    list.length = readUInt();
-    for (int i = 0; i < list.length; ++i) {
-      list[i] = buildObject()..parent = parent;
+    var length = readUInt();
+    list.length = length;
+    for (int i = 0; i < length; ++i) {
+      TreeNode object = buildObject();
+      list[i] = object..parent = parent;
     }
   }
 
   void _fillNonTreeNodeList(List<Node> list, Node buildObject()) {
-    list.length = readUInt();
-    for (int i = 0; i < list.length; ++i) {
-      list[i] = buildObject();
+    var length = readUInt();
+    list.length = length;
+    for (int i = 0; i < length; ++i) {
+      Node object = buildObject();
+      list[i] = object;
     }
   }
 
+  void _skipNodeList(Node skipObject()) {
+    var length = readUInt();
+    for (int i = 0; i < length; ++i) {
+      skipObject();
+    }
+  }
+
   /// Reads a list of named nodes, reusing any existing objects already in the
   /// linking tree. The nodes are merged into [list], and if reading the library
   /// implementation, the order is corrected.
   ///
   /// [readObject] should read the object definition and its canonical name.
   /// If an existing object is bound to the canonical name, the existing object
   /// must be reused and returned.
   void _mergeNamedNodeList(
       List<NamedNode> list, NamedNode readObject(), TreeNode parent) {
     if (_isReadingLibraryImplementation) {
@@ skipping 164 matching lines @@
     String fileUri = readUriReference();
 
     if (shouldWriteData) {
       library.isExternal = isExternal;
       library.name = name;
       library.fileUri = fileUri;
     }
 
     debugPath.add(library.name ?? library.importUri?.toString() ?? 'library');
 
-    _fillTreeNodeList(library.annotations, readExpression, library);
+    if (shouldWriteData) {
+      _fillTreeNodeList(library.annotations, readExpression, library);
+    } else {
+      _skipNodeList(readExpression);
+    }
     _readLibraryDependencies(library);
     _mergeNamedNodeList(library.typedefs, readTypedef, library);
     _mergeNamedNodeList(library.classes, readClass, library);
     _mergeNamedNodeList(library.fields, readField, library);
     _mergeNamedNodeList(library.procedures, readProcedure, library);
 
     debugPath.removeLast();
     _currentLibrary = null;
     return library;
   }
@@ skipping 68 matching lines @@
     if (level.index >= node.level.index) {
       node.level = level;
     }
     var name = readStringOrNullIfEmpty();
     var fileUri = readUriReference();
     var annotations = readAnnotationList(node);
     debugPath.add(node.name ?? 'normal-class');
     readAndPushTypeParameterList(node.typeParameters, node);
     var supertype = readSupertypeOption();
     var mixedInType = readSupertypeOption();
-    _fillNonTreeNodeList(node.implementedTypes, readSupertype);
+    if (shouldWriteData) {
+      _fillNonTreeNodeList(node.implementedTypes, readSupertype);
+    } else {
+      _skipNodeList(readSupertype);
+    }
     _mergeNamedNodeList(node.fields, readField, node);
     _mergeNamedNodeList(node.constructors, readConstructor, node);
     _mergeNamedNodeList(node.procedures, readProcedure, node);
     typeParameterStack.length = 0;
     debugPath.removeLast();
     if (shouldWriteData) {
       node.name = name;
       node.fileUri = fileUri;
       node.annotations = annotations;
       node.supertype = supertype;
@@ skipping 63 matching lines @@
     var fileOffset = readOffset();
     var fileEndOffset = readOffset();
     var flags = readByte();
     readUInt(); // parent class binary offset.
     var name = readName();
     var annotations = readAnnotationList(node);
     debugPath.add(node.name?.name ?? 'constructor');
     var function = readFunctionNode();
     pushVariableDeclarations(function.positionalParameters);
     pushVariableDeclarations(function.namedParameters);
-    _fillTreeNodeList(node.initializers, readInitializer, node);
+    if (shouldWriteData) {
+      _fillTreeNodeList(node.initializers, readInitializer, node);
+    } else {
+      _skipNodeList(readInitializer);
+    }
     variableStack.length = 0;
     var transformerFlags = getAndResetTransformerFlags();
     debugPath.removeLast();
     if (shouldWriteData) {
       node.fileOffset = fileOffset;
       node.fileEndOffset = fileEndOffset;
       node.flags = flags;
       node.name = name;
       node.annotations = annotations;
       node.function = function..parent = node;
@@ skipping 658 matching lines @@
       ..fileOffset = offset
       ..fileEqualsOffset = fileEqualsOffset;
   }
 
   int readOffset() {
     // Offset is saved as unsigned,
     // but actually ranges from -1 and up (thus the -1)
     return readUInt() - 1;
   }
 }