mirror of
git://git.sv.gnu.org/emacs.git
synced 2025-12-24 14:30:43 -08:00
8dc0d72a8d
1. "make test" now reports the name of the test case before running it, so that when you look back through the test output you can see which test case failed.
2. "make test" now collects the standard output from all the tests to a log file in /tmp, so that this does not clutter the user's terminal, and so that nothing is lost if the output exceeds the terminal's scrollback.
3. Each test case now prints a success message ("Conclusion: Failed to find any defects.") to standard output (not standard error) so that these messages do not clutter up the terminal when running "make test".
4. Each test case now uses its result code (not the printed message) to indicate whether it succeeded or failed.
5. More of the diagnostic messages from the test cases now start by printing argv[0] so that it is easier to tell which test case was running.
Copied from Perforce
Change: 181071
ServerID: perforce.ravenbrook.com
299 lines
9.4 KiB
C
299 lines
9.4 KiB
C
/* finaltest.c: LARGE-SCALE FINALIZATION TEST
|
|
*
|
|
* $Id$
|
|
* Copyright (c) 2001-2013 Ravenbrook Limited. See end of file for license.
|
|
* Portions copyright (C) 2002 Global Graphics Software.
|
|
*
|
|
* DESIGN
|
|
*
|
|
* DEPENDENCIES
|
|
*
|
|
* This test uses the dylan object format, but the reliance on this
|
|
* particular format is not great and could be removed.
|
|
*
|
|
* NOTES
|
|
*
|
|
* This code was created by first copying <code/finalcv.c>
|
|
*/
|
|
|
|
#include "testlib.h"
|
|
#include "mps.h"
|
|
#include "mpscamc.h"
|
|
#include "mpsavm.h"
|
|
#include "fmtdy.h"
|
|
#include "fmtdytst.h"
|
|
#include "mpstd.h"
|
|
#ifdef MPS_OS_W3
|
|
#include "mpsw3.h"
|
|
#endif
|
|
#include <stdlib.h>
|
|
|
|
|
|
#define testArenaSIZE ((size_t)16<<20)
|
|
#define rootCOUNT 20
|
|
#define maxtreeDEPTH 12
|
|
#define collectionCOUNT 10
|
|
#define genCOUNT 2
|
|
|
|
/* testChain -- generation parameters for the test */
|
|
|
|
static mps_gen_param_s testChain[genCOUNT] = {
|
|
{ 150, 0.85 }, { 170, 0.45 } };
|
|
|
|
|
|
/* global object counter */
|
|
|
|
static mps_word_t object_count = 0;
|
|
|
|
static mps_word_t make_numbered_cons(mps_word_t car, mps_word_t cdr,
|
|
mps_ap_t ap)
|
|
{
|
|
mps_word_t cons;
|
|
die(make_dylan_vector(&cons, ap, 3), "make_dylan_vector");
|
|
DYLAN_VECTOR_SLOT(cons, 0) = car;
|
|
DYLAN_VECTOR_SLOT(cons, 1) = cdr;
|
|
DYLAN_VECTOR_SLOT(cons, 2) = DYLAN_INT(object_count);
|
|
++ object_count;
|
|
return cons;
|
|
}
|
|
|
|
static mps_word_t make_numbered_tree(mps_word_t depth,
|
|
mps_ap_t ap)
|
|
{
|
|
mps_word_t left, right;
|
|
if (depth < 2) {
|
|
left = DYLAN_INT(object_count);
|
|
right = DYLAN_INT(object_count);
|
|
} else {
|
|
left = make_numbered_tree(depth-1, ap);
|
|
right = make_numbered_tree(depth-1, ap);
|
|
}
|
|
return make_numbered_cons(left, right, ap);
|
|
}
|
|
|
|
static void register_numbered_tree(mps_word_t tree, mps_arena_t arena)
|
|
{
|
|
/* don't finalize ints */
|
|
if ((tree & 1) == 0) {
|
|
mps_addr_t tree_ref = (mps_addr_t)tree;
|
|
mps_finalize(arena, &tree_ref);
|
|
register_numbered_tree(DYLAN_VECTOR_SLOT(tree, 0), arena);
|
|
register_numbered_tree(DYLAN_VECTOR_SLOT(tree, 1), arena);
|
|
}
|
|
}
|
|
|
|
static mps_word_t make_indirect_cons(mps_word_t car, mps_word_t cdr,
|
|
mps_ap_t ap)
|
|
{
|
|
mps_word_t cons, indirect;
|
|
die(make_dylan_vector(&indirect, ap, 1), "make_dylan_vector");
|
|
DYLAN_VECTOR_SLOT(indirect, 0) = DYLAN_INT(object_count);
|
|
die(make_dylan_vector(&cons, ap, 3), "make_dylan_vector");
|
|
DYLAN_VECTOR_SLOT(cons, 0) = car;
|
|
DYLAN_VECTOR_SLOT(cons, 1) = cdr;
|
|
DYLAN_VECTOR_SLOT(cons, 2) = indirect;
|
|
++ object_count;
|
|
return cons;
|
|
}
|
|
|
|
static mps_word_t make_indirect_tree(mps_word_t depth,
|
|
mps_ap_t ap)
|
|
{
|
|
mps_word_t left, right;
|
|
if (depth < 2) {
|
|
left = DYLAN_INT(object_count);
|
|
right = DYLAN_INT(object_count);
|
|
} else {
|
|
left = make_indirect_tree(depth-1, ap);
|
|
right = make_indirect_tree(depth-1, ap);
|
|
}
|
|
return make_indirect_cons(left, right, ap);
|
|
}
|
|
|
|
static void register_indirect_tree(mps_word_t tree, mps_arena_t arena)
|
|
{
|
|
/* don't finalize ints */
|
|
if ((tree & 1) == 0) {
|
|
mps_word_t indirect = DYLAN_VECTOR_SLOT(tree,2);
|
|
mps_addr_t indirect_ref = (mps_addr_t)indirect;
|
|
mps_finalize(arena, &indirect_ref);
|
|
register_indirect_tree(DYLAN_VECTOR_SLOT(tree, 0), arena);
|
|
register_indirect_tree(DYLAN_VECTOR_SLOT(tree, 1), arena);
|
|
}
|
|
}
|
|
|
|
|
|
static void *root[rootCOUNT];
|
|
|
|
static void *test(void *arg, size_t s)
|
|
{
|
|
mps_ap_t ap;
|
|
mps_fmt_t fmt;
|
|
mps_chain_t chain;
|
|
mps_word_t finals;
|
|
mps_pool_t amc;
|
|
mps_root_t mps_root;
|
|
mps_arena_t arena;
|
|
mps_message_t message;
|
|
size_t i;
|
|
|
|
arena = (mps_arena_t)arg;
|
|
(void)s;
|
|
|
|
die(mps_fmt_create_A(&fmt, arena, dylan_fmt_A()), "fmt_create\n");
|
|
die(mps_chain_create(&chain, arena, genCOUNT, testChain), "chain_create");
|
|
die(mps_pool_create(&amc, arena, mps_class_amc(), fmt, chain),
|
|
"pool_create amc\n");
|
|
die(mps_root_create_table(&mps_root, arena, mps_rank_exact(), (mps_rm_t)0,
|
|
root, (size_t)rootCOUNT),
|
|
"root_create\n");
|
|
die(mps_ap_create(&ap, amc, mps_rank_exact()), "ap_create\n");
|
|
|
|
mps_message_type_enable(arena, mps_message_type_finalization());
|
|
|
|
mps_arena_park(arena);
|
|
|
|
object_count = 0;
|
|
|
|
printf("Making some finalized trees of objects.\n");
|
|
/* make some trees */
|
|
for(i = 0; i < rootCOUNT; ++i) {
|
|
root[i] = (void *)make_numbered_tree(maxtreeDEPTH, ap);
|
|
register_numbered_tree((mps_word_t)root[i], arena);
|
|
}
|
|
|
|
printf("Losing all pointers to the trees.\n");
|
|
/* clean out the roots */
|
|
for(i = 0; i < rootCOUNT; ++i) {
|
|
root[i] = 0;
|
|
}
|
|
|
|
finals = 0;
|
|
|
|
while ((finals < object_count) &&
|
|
(mps_collections(arena) < collectionCOUNT)) {
|
|
mps_word_t final_this_time = 0;
|
|
printf("Collecting...");
|
|
fflush(stdout);
|
|
die(mps_arena_collect(arena), "collect");
|
|
printf(" Done.\n");
|
|
while (mps_message_poll(arena)) {
|
|
mps_addr_t objaddr;
|
|
cdie(mps_message_get(&message, arena,
|
|
mps_message_type_finalization()),
|
|
"get");
|
|
mps_message_finalization_ref(&objaddr, arena, message);
|
|
mps_message_discard(arena, message);
|
|
++ final_this_time;
|
|
}
|
|
finals += final_this_time;
|
|
printf("%lu objects finalized: total %lu of %lu\n",
|
|
final_this_time, finals, object_count);
|
|
}
|
|
|
|
object_count = 0;
|
|
|
|
printf("Making some indirectly finalized trees of objects.\n");
|
|
/* make some trees */
|
|
for(i = 0; i < rootCOUNT; ++i) {
|
|
root[i] = (void *)make_indirect_tree(maxtreeDEPTH, ap);
|
|
register_indirect_tree((mps_word_t)root[i], arena);
|
|
}
|
|
|
|
printf("Losing all pointers to the trees.\n");
|
|
/* clean out the roots */
|
|
for(i = 0; i < rootCOUNT; ++i) {
|
|
root[i] = 0;
|
|
}
|
|
|
|
finals = 0;
|
|
|
|
while ((finals < object_count) &&
|
|
(mps_collections(arena) < collectionCOUNT)) {
|
|
mps_word_t final_this_time = 0;
|
|
printf("Collecting...");
|
|
fflush(stdout);
|
|
die(mps_arena_collect(arena), "collect");
|
|
printf(" Done.\n");
|
|
while (mps_message_poll(arena)) {
|
|
mps_addr_t objaddr;
|
|
cdie(mps_message_get(&message, arena,
|
|
mps_message_type_finalization()),
|
|
"get");
|
|
mps_message_finalization_ref(&objaddr, arena, message);
|
|
mps_message_discard(arena, message);
|
|
++ final_this_time;
|
|
}
|
|
finals += final_this_time;
|
|
printf("%lu objects finalized: total %lu of %lu\n",
|
|
final_this_time, finals, object_count);
|
|
}
|
|
|
|
mps_ap_destroy(ap);
|
|
mps_root_destroy(mps_root);
|
|
mps_pool_destroy(amc);
|
|
mps_chain_destroy(chain);
|
|
mps_fmt_destroy(fmt);
|
|
|
|
return NULL;
|
|
}
|
|
|
|
|
|
int main(int argc, char *argv[])
|
|
{
|
|
mps_arena_t arena;
|
|
mps_thr_t thread;
|
|
void *r;
|
|
|
|
die(mps_arena_create(&arena, mps_arena_class_vm(), testArenaSIZE),
|
|
"arena_create\n");
|
|
die(mps_thread_reg(&thread, arena), "thread_reg\n");
|
|
mps_tramp(&r, test, arena, 0);
|
|
mps_thread_dereg(thread);
|
|
mps_arena_destroy(arena);
|
|
|
|
printf("%s: Conclusion: Failed to find any defects.\n", argv[0]);
|
|
return 0;
|
|
}
|
|
|
|
|
|
/* C. COPYRIGHT AND LICENSE
|
|
*
|
|
* Copyright (c) 2001-2013 Ravenbrook Limited <http://www.ravenbrook.com/>.
|
|
* 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:
|
|
*
|
|
* 1. Redistributions of source code must retain the above copyright
|
|
* notice, this list of conditions and the following disclaimer.
|
|
*
|
|
* 2. Redistributions in binary form must reproduce the above copyright
|
|
* notice, this list of conditions and the following disclaimer in the
|
|
* documentation and/or other materials provided with the distribution.
|
|
*
|
|
* 3. Redistributions in any form must be accompanied by information on how
|
|
* to obtain complete source code for this software and any accompanying
|
|
* software that uses this software. The source code must either be
|
|
* included in the distribution or be available for no more than the cost
|
|
* of distribution plus a nominal fee, and must be freely redistributable
|
|
* under reasonable conditions. For an executable file, complete source
|
|
* code means the source code for all modules it contains. It does not
|
|
* include source code for modules or files that typically accompany the
|
|
* major components of the operating system on which the executable file
|
|
* runs.
|
|
*
|
|
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS
|
|
* IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED
|
|
* TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR
|
|
* PURPOSE, OR NON-INFRINGEMENT, ARE DISCLAIMED. IN NO EVENT SHALL THE
|
|
* COPYRIGHT HOLDERS AND CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,
|
|
* INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
|
|
* NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF
|
|
* USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON
|
|
* ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
|
|
* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
|
|
* THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
|
*/
|