Expose memory allocations in search benchmarks.

Author: isoos

app/bin/tools/isolate_search_benchmark.dart

@@ -2,6 +2,7 @@
 // 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.
 
+import 'dart:io';
 import 'dart:math';
 
 import 'package:_pub_shared/search/search_form.dart';
@@ -23,13 +24,15 @@ final queries = [
 ];
 
 Future<void> main(List<String> args) async {
-  print('Loading...');
+  print('Started. Current memory: ${ProcessInfo.currentRss ~/ 1024} KiB,  '
+      'max memory: ${ProcessInfo.maxRss ~/ 1024} KiB');
   final primaryRunner = await startSearchIsolate(snapshot: args.first);
   final reducedRunner = await startSearchIsolate(
     snapshot: args.first,
     removeTextContent: true,
   );
-  print('Loaded.');
+  print('Loaded. Current memory: ${ProcessInfo.currentRss ~/ 1024} KiB,  '
+      'max memory: ${ProcessInfo.maxRss ~/ 1024} KiB');
 
   for (var i = 0; i < 5; i++) {
     await _benchmark(primaryRunner, primaryRunner);
@@ -39,6 +42,8 @@ Future<void> main(List<String> args) async {
 
   await primaryRunner.close();
   await reducedRunner.close();
+  print('Done. Current memory: ${ProcessInfo.currentRss ~/ 1024} KiB,  '
+      'max memory: ${ProcessInfo.maxRss ~/ 1024} KiB');
 }
 
 Future<void> _benchmark(IsolateRunner primary, IsolateRunner reduced) async {

app/bin/tools/sdk_search_benchmark.dart

@@ -2,11 +2,17 @@
 // 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.
 
+import 'dart:io';
+
 import 'package:pub_dev/search/sdk_mem_index.dart';
 
 /// Loads a Dart SDK search snapshot and executes queries on it, benchmarking their total time to complete.
 Future<void> main() async {
+  print('Started. Current memory: ${ProcessInfo.currentRss ~/ 1024} KiB,  '
+      'max memory: ${ProcessInfo.maxRss ~/ 1024} KiB');
   final index = await createSdkMemIndex();
+  print('Loaded. Current memory: ${ProcessInfo.currentRss ~/ 1024} KiB,  '
+      'max memory: ${ProcessInfo.maxRss ~/ 1024} KiB');
 
   // NOTE: please add more queries to this list, especially if there is a performance bottleneck.
   final queries = [
@@ -25,4 +31,6 @@ Future<void> main() async {
   }
   sw.stop();
   print('${(sw.elapsedMilliseconds / count).toStringAsFixed(2)} ms/request');
+  print('Done. Current memory: ${ProcessInfo.currentRss ~/ 1024} KiB,  '
+      'max memory: ${ProcessInfo.maxRss ~/ 1024} KiB');
 }

app/bin/tools/search_benchmark.dart

@@ -2,14 +2,21 @@
 // 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.
 
+import 'dart:async';
+import 'dart:io';
+
 import 'package:_pub_shared/search/search_form.dart';
 import 'package:pub_dev/search/search_service.dart';
 import 'package:pub_dev/search/updater.dart';
 
 /// Loads a search snapshot and executes queries on it, benchmarking their total time to complete.
 Future<void> main(List<String> args) async {
+  print('Started. Current memory: ${ProcessInfo.currentRss ~/ 1024} KiB,  '
+      'max memory: ${ProcessInfo.maxRss ~/ 1024} KiB');
   // Assumes that the first argument is a search snapshot file.
   final index = await loadInMemoryPackageIndexFromFile(args.first);
+  print('Loaded. Current memory: ${ProcessInfo.currentRss ~/ 1024} KiB,  '
+      'max memory: ${ProcessInfo.maxRss ~/ 1024} KiB');
 
   // NOTE: please add more queries to this list, especially if there is a performance bottleneck.
   final queries = [
@@ -34,4 +41,6 @@ Future<void> main(List<String> args) async {
   }
   sw.stop();
   print('${(sw.elapsedMilliseconds / count).toStringAsFixed(2)} ms/request');
+  print('Done. Current memory: ${ProcessInfo.currentRss ~/ 1024} KiB,  '
+      'max memory: ${ProcessInfo.maxRss ~/ 1024} KiB');
 }