mirror of
https://github.com/dart-lang/sdk
synced 2024-09-05 16:41:07 +00:00
b101a7d002
Change-Id: Ib33169c3e0ffc870915c189404074a1dea472546 Reviewed-on: https://dart-review.googlesource.com/c/sdk/+/196548 Reviewed-by: Bob Nystrom <rnystrom@google.com> Commit-Queue: Leaf Petersen <leafp@google.com>
44 lines
1.7 KiB
Dart
44 lines
1.7 KiB
Dart
// Copyright (c) 2017, 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.
|
|
|
|
// @dart = 2.9
|
|
|
|
// Deliberately fragment the heap and test that GC peformance does not
|
|
// break down. See https://github.com/dart-lang/sdk/issues/29588
|
|
// Normally runs in about 6-7 seconds on an x64 machine, using about 2.5Gbytes
|
|
// of memory.
|
|
//
|
|
// This test is deliberately CPU-light and so it can make a lot of
|
|
// progress before the concurrent sweepers are done sweeping the heap.
|
|
// In that time there is no freelist and so the issue does not arise.
|
|
// VMOptions=--no_concurrent_mark --no_concurrent_sweep
|
|
// VMOptions=--no_concurrent_mark --concurrent_sweep
|
|
// VMOptions=--no_concurrent_mark --use_compactor
|
|
// VMOptions=--no_concurrent_mark --use_compactor --force_evacuation
|
|
// VMOptions=--concurrent_mark --no_concurrent_sweep
|
|
// VMOptions=--concurrent_mark --concurrent_sweep
|
|
// VMOptions=--concurrent_mark --use_compactor
|
|
// VMOptions=--concurrent_mark --use_compactor --force_evacuation
|
|
// VMOptions=--scavenger_tasks=0
|
|
// VMOptions=--scavenger_tasks=1
|
|
// VMOptions=--scavenger_tasks=2
|
|
// VMOptions=--scavenger_tasks=3
|
|
|
|
main() {
|
|
final List<List> arrays = [];
|
|
// Fill up heap with alternate large-small items.
|
|
for (int i = 0; i < 500000; i++) {
|
|
arrays.add(new List(260));
|
|
arrays.add(new List(1));
|
|
}
|
|
// Clear the large items so that the heap is full of 260-word gaps.
|
|
for (int i = 0; i < arrays.length; i += 2) {
|
|
arrays[i] = null;
|
|
}
|
|
// Allocate a lot of 300-word objects that don't fit in the gaps.
|
|
for (int i = 0; i < 600000; i++) {
|
|
arrays.add(new List(300));
|
|
}
|
|
}
|