From fb9005a925451590c19a817147be106d7efd6f02 Mon Sep 17 00:00:00 2001 From: Richard Kistruck Date: Wed, 3 Mar 2010 15:12:44 +0000 Subject: [PATCH] Mps master: design/tests: correction: it's fin1658a.c and job001658, not 1638. Copied from Perforce Change: 169915 ServerID: perforce.ravenbrook.com --- mps/design/tests/index.html | 12 +++++++++--- 1 file changed, 9 insertions(+), 3 deletions(-) diff --git a/mps/design/tests/index.html b/mps/design/tests/index.html index 894a981c2b1..c959912244f 100644 --- a/mps/design/tests/index.html +++ b/mps/design/tests/index.html @@ -46,8 +46,8 @@
Oldest. Registers a few objects (for finalization) and pseudorandomly makes them unreachable, deregisters them, etc. Churns to provoke minor (nursery) collection.
finaltest.c
Uses newer fmtdytst facilities. Creates a large binary tree, and registers every node. Drops top ref, requests collection, and counts the messages.
-
fin1638a.c
-
Newest. Single-issue test: see job001638. Drops refs and requests collection. Verifies that all non-E-reachable registered objects are finalized in a single collection, even if there are >1 segs of poolmrg guardians.
+
fin1658a.c
+
Newest. Single-issue test: see job001658. Drops refs and requests collection. Verifies that all non-E-reachable registered objects are finalized in a single collection, even if there are >1 segs of poolmrg guardians.

There's also expt825.c, which verifies that protection expose/remember works correctly for poolmrg (scanned but not GC'd segs); see job000825.

@@ -95,12 +95,18 @@ Create. Describe finalization tests. + + 2010-03-03 + RHSK + Correction: it's fin1658a.c and job001658, not 1638. + +

C. Copyright and License

-

This document is copyright © 2008 Ravenbrook Limited. All rights reserved. This is an open source license. Contact Ravenbrook for commercial licensing options.

+

This document is copyright © 2008, 2010 Ravenbrook Limited. All rights reserved. This is an open source license. Contact Ravenbrook for commercial licensing options.

Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met: