Include more information when deserializing ProgramInfo

bin/function_size_analysis.dart

 // Copyright (c) 2015, 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.
 
 /// Command-line tool presenting how much each function contributes to the total
 /// code.
 library compiler.tool.live_code_size_analysis;
 
 import 'dart:math' as math;
 
 import 'package:dart2js_info/info.dart';
 import 'package:dart2js_info/src/graph.dart';
 import 'package:dart2js_info/src/util.dart';
 
 main(args) async {
   var info = await infoFromFile(args.first);
   showCodeDistribution(info);
 }
 
 showCodeDistribution(AllInfo info,
     {bool filter(Info info), bool showLibrarySizes: false}) {
   var realTotal = info.program.size;
   if (filter == null) filter = (i) => true;
-  var reported = []
+  var reported = <BasicInfo>[]
     ..addAll(info.functions.where(filter))
     ..addAll(info.fields.where(filter));
 
   // Compute a graph from the dependencies in [info].
   Graph<Info> graph = graphFromInfo(info);
 
   // Compute the strongly connected components and calculate their size.
   var components = graph.computeTopologicalSort();
   print('total elements: ${graph.nodes.length}');
   print('total strongly connected components: ${components.length}');
@@ skipping 27 matching lines @@
   helper(n) {
     int size = n.size;
     assert(!dominatedSize.containsKey(n));
     dominatedSize[n] = 0;
     dominatorTree.targetsOf(n).forEach((m) {
       size += helper(m);
     });
     dominatedSize[n] = size;
     return size;
   }
+
   helper(mainMethod);
   reported.forEach((n) => dominatedSize.putIfAbsent(n, () => n.size));
-  reported.sort((a, b) => (dominatedSize[b] + nodeData[b].maxSize) -
+  reported.sort((a, b) =>
+      (dominatedSize[b] + nodeData[b].maxSize) -
       (dominatedSize[a] + nodeData[a].maxSize));
 
   if (showLibrarySizes) {
     print(' --- Results per library ---');
     var totals = {};
     var longest = 0;
     reported.forEach((info) {
       var size = info.size;
       while (info != null && info is! LibraryInfo) {
         info = info.parent;
@@ skipping 37 matching lines @@
 
   void compute() {
     if (_maxSize != null) return;
     var max = 0;
     var seen = new Set();
     helper(n) {
       if (!seen.add(n)) return;
       max += n.size;
       n.deps.forEach(helper);
     }
+
     helper(this);
     _maxSize = max;
   }
 }
 
 _showLibHeader(int namePadding) {
   print(' ${pad("Library", namePadding, right: true)}'
       ' ${pad("bytes", 8)} ${pad("%", 6)}');
 }
 
@@ skipping 12 matching lines @@
 
 _showElement(String name, int size, int dominatedSize, int maxSize, int total) {
   var percent = (size * 100 / total).toStringAsFixed(2);
   var minPercent = (dominatedSize * 100 / total).toStringAsFixed(2);
   var maxPercent = (maxSize * 100 / total).toStringAsFixed(2);
   print('${pad(size, 8)} ${pad(percent, 6)}% '
       '${pad(dominatedSize, 10)} ${pad(minPercent, 6)}% '
       '${pad(maxSize, 10)} ${pad(maxPercent, 6)}% '
       '$name');
 }