mirror of
git://git.sv.gnu.org/emacs.git
synced 2025-12-24 06:20: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
381 lines
12 KiB
C
381 lines
12 KiB
C
/* amcss.c: POOL CLASS AMC STRESS TEST
|
|
*
|
|
* $Id$
|
|
* Copyright (c) 2001-2013 Ravenbrook Limited. See end of file for license.
|
|
* Portions copyright (C) 2002 Global Graphics Software.
|
|
*/
|
|
|
|
#include "fmtdy.h"
|
|
#include "fmtdytst.h"
|
|
#include "testlib.h"
|
|
#include "mpscamc.h"
|
|
#include "mpsavm.h"
|
|
#include "mpstd.h"
|
|
#ifdef MPS_OS_W3
|
|
#include "mpsw3.h"
|
|
#endif
|
|
#include "mps.h"
|
|
#include <stdlib.h>
|
|
#include <string.h>
|
|
|
|
|
|
/* These values have been tuned in the hope of getting one dynamic collection. */
|
|
#define testArenaSIZE ((size_t)1000*1024)
|
|
#define gen1SIZE ((size_t)150)
|
|
#define gen2SIZE ((size_t)170)
|
|
#define avLEN 3
|
|
#define exactRootsCOUNT 180
|
|
#define ambigRootsCOUNT 50
|
|
#define genCOUNT 2
|
|
#define collectionsCOUNT 37
|
|
#define rampSIZE 9
|
|
#define initTestFREQ 6000
|
|
|
|
/* testChain -- generation parameters for the test */
|
|
|
|
static mps_gen_param_s testChain[genCOUNT] = {
|
|
{ gen1SIZE, 0.85 }, { gen2SIZE, 0.45 } };
|
|
|
|
|
|
/* objNULL needs to be odd so that it's ignored in exactRoots. */
|
|
#define objNULL ((mps_addr_t)MPS_WORD_CONST(0xDECEA5ED))
|
|
|
|
|
|
static mps_pool_t pool;
|
|
static mps_ap_t ap;
|
|
static mps_addr_t exactRoots[exactRootsCOUNT];
|
|
static mps_addr_t ambigRoots[ambigRootsCOUNT];
|
|
|
|
|
|
/* alert -- synchronous alert of collection start/stop */
|
|
|
|
static void alertfn(int alertcode, int whycode)
|
|
{
|
|
switch(alertcode) {
|
|
case MPS_ALERT_COLLECTION_BEGIN: {
|
|
printf("\n^^^^^^ BEGIN (why: %d) ^^^^^^\n", whycode);
|
|
break;
|
|
}
|
|
case MPS_ALERT_COLLECTION_END: {
|
|
printf("vvvvvv END (why: %d) vvvvvv\n", whycode);
|
|
break;
|
|
}
|
|
default: {
|
|
cdie(0, "unknown alertcode");
|
|
break;
|
|
}
|
|
}
|
|
}
|
|
|
|
/* report -- report statistics from any messages */
|
|
|
|
static void report(mps_arena_t arena)
|
|
{
|
|
static int nCollsStart = 0;
|
|
static int nCollsDone = 0;
|
|
mps_message_type_t type;
|
|
|
|
while(mps_message_queue_type(&type, arena)) {
|
|
mps_message_t message;
|
|
|
|
cdie(mps_message_get(&message, arena, type), "message get");
|
|
|
|
if (type == mps_message_type_gc_start()) {
|
|
nCollsStart += 1;
|
|
printf("\n{\n Collection %d started. Because:\n", nCollsStart);
|
|
printf(" %s\n", mps_message_gc_start_why(arena, message));
|
|
printf(" clock: %"PRIuLONGEST"\n", (ulongest_t)mps_message_clock(arena, message));
|
|
|
|
} else if (type == mps_message_type_gc()) {
|
|
size_t live, condemned, not_condemned;
|
|
|
|
nCollsDone += 1;
|
|
live = mps_message_gc_live_size(arena, message);
|
|
condemned = mps_message_gc_condemned_size(arena, message);
|
|
not_condemned = mps_message_gc_not_condemned_size(arena, message);
|
|
|
|
printf("\n Collection %d finished:\n", nCollsDone);
|
|
printf(" live %"PRIuLONGEST"\n", (ulongest_t)live);
|
|
printf(" condemned %"PRIuLONGEST"\n", (ulongest_t)condemned);
|
|
printf(" not_condemned %"PRIuLONGEST"\n", (ulongest_t)not_condemned);
|
|
printf(" clock: %"PRIuLONGEST"\n", (ulongest_t)mps_message_clock(arena, message));
|
|
printf("}\n");
|
|
|
|
if(condemned > (gen1SIZE + gen2SIZE + (size_t)128) * 1024) {
|
|
/* When condemned size is larger than could happen in a gen 2
|
|
* collection (discounting ramps, natch), guess that was a dynamic
|
|
* collection, and reset the commit limit, so it doesn't run out. */
|
|
die(mps_arena_commit_limit_set(arena, 2 * testArenaSIZE),
|
|
"set limit");
|
|
}
|
|
|
|
} else {
|
|
cdie(0, "unknown message type");
|
|
break;
|
|
}
|
|
|
|
mps_message_discard(arena, message);
|
|
}
|
|
|
|
return;
|
|
}
|
|
|
|
|
|
/* make -- create one new object */
|
|
|
|
static mps_addr_t make(void)
|
|
{
|
|
size_t length = rnd() % (2*avLEN);
|
|
size_t size = (length+2) * sizeof(mps_word_t);
|
|
mps_addr_t p;
|
|
mps_res_t res;
|
|
|
|
do {
|
|
MPS_RESERVE_BLOCK(res, p, ap, size);
|
|
if (res)
|
|
die(res, "MPS_RESERVE_BLOCK");
|
|
res = dylan_init(p, size, exactRoots, exactRootsCOUNT);
|
|
if (res)
|
|
die(res, "dylan_init");
|
|
} while(!mps_commit(ap, p, size));
|
|
|
|
return p;
|
|
}
|
|
|
|
|
|
/* test_stepper -- stepping function for walk */
|
|
|
|
static void test_stepper(mps_addr_t object, mps_fmt_t fmt, mps_pool_t pol,
|
|
void *p, size_t s)
|
|
{
|
|
testlib_unused(object); testlib_unused(fmt); testlib_unused(pol);
|
|
testlib_unused(s);
|
|
(*(unsigned long *)p)++;
|
|
}
|
|
|
|
|
|
/* test -- the body of the test */
|
|
|
|
static void test(mps_arena_t arena)
|
|
{
|
|
mps_fmt_t format;
|
|
mps_chain_t chain;
|
|
mps_root_t exactRoot, ambigRoot;
|
|
unsigned long objs; size_t i;
|
|
mps_word_t collections, rampSwitch;
|
|
mps_alloc_pattern_t ramp = mps_alloc_pattern_ramp();
|
|
int ramping;
|
|
mps_ap_t busy_ap;
|
|
mps_addr_t busy_init;
|
|
|
|
die(dylan_fmt(&format, arena), "fmt_create");
|
|
die(mps_chain_create(&chain, arena, genCOUNT, testChain), "chain_create");
|
|
|
|
die(mps_pool_create(&pool, arena, mps_class_amc(), format, chain),
|
|
"pool_create(amc)");
|
|
|
|
die(mps_ap_create(&ap, pool, mps_rank_exact()), "BufferCreate");
|
|
die(mps_ap_create(&busy_ap, pool, mps_rank_exact()), "BufferCreate 2");
|
|
|
|
for(i = 0; i < exactRootsCOUNT; ++i)
|
|
exactRoots[i] = objNULL;
|
|
for(i = 0; i < ambigRootsCOUNT; ++i)
|
|
ambigRoots[i] = rnd_addr();
|
|
|
|
die(mps_root_create_table_masked(&exactRoot, arena,
|
|
mps_rank_exact(), (mps_rm_t)0,
|
|
&exactRoots[0], exactRootsCOUNT,
|
|
(mps_word_t)1),
|
|
"root_create_table(exact)");
|
|
die(mps_root_create_table(&ambigRoot, arena,
|
|
mps_rank_ambig(), (mps_rm_t)0,
|
|
&ambigRoots[0], ambigRootsCOUNT),
|
|
"root_create_table(ambig)");
|
|
|
|
/* create an ap, and leave it busy */
|
|
die(mps_reserve(&busy_init, busy_ap, 64), "mps_reserve busy");
|
|
|
|
collections = 0;
|
|
rampSwitch = rampSIZE;
|
|
die(mps_ap_alloc_pattern_begin(ap, ramp), "pattern begin (ap)");
|
|
die(mps_ap_alloc_pattern_begin(busy_ap, ramp), "pattern begin (busy_ap)");
|
|
ramping = 1;
|
|
objs = 0;
|
|
while (collections < collectionsCOUNT) {
|
|
mps_word_t c;
|
|
size_t r;
|
|
|
|
c = mps_collections(arena);
|
|
if (collections != c) {
|
|
collections = c;
|
|
report(arena);
|
|
|
|
printf("%lu objects (mps_collections says: %lu)\n", objs, c);
|
|
|
|
/* test mps_arena_has_addr */
|
|
{
|
|
size_t hitRatio;
|
|
unsigned hitsWanted = 4; /* aim for 4 hits (on average) */
|
|
/* [Note: The for-loop condition used to be "i < 4 * hitRatio",
|
|
* with "4" an unexplained naked constant. I have now labelled
|
|
* it "hitsWanted", as I think that is the intent. RHSK]
|
|
*/
|
|
|
|
/* how many random addrs must we try, to hit the arena once? */
|
|
hitRatio = (0xfffffffful / mps_arena_committed(arena));
|
|
for (i = 0; i < hitsWanted * hitRatio ; i++) {
|
|
/* An exact root maybe in the arena, so add a random 32-bit
|
|
* offset to it. We may get no hits if it is objNULL.
|
|
*/
|
|
mps_addr_t p = (char *)exactRoots[rnd() % exactRootsCOUNT]
|
|
+ rnd()-0x80000000ul;
|
|
if (mps_arena_has_addr(arena, p)) {
|
|
printf("%p is in the arena\n", p);
|
|
}
|
|
}
|
|
}
|
|
|
|
for (i = 0; i < exactRootsCOUNT; ++i)
|
|
cdie(exactRoots[i] == objNULL
|
|
|| (dylan_check(exactRoots[i])
|
|
&& mps_arena_has_addr(arena, exactRoots[i])),
|
|
"all roots check");
|
|
cdie(!mps_arena_has_addr(arena, NULL),
|
|
"NULL in arena");
|
|
|
|
if (collections == collectionsCOUNT / 2) {
|
|
unsigned long object_count = 0;
|
|
mps_arena_park(arena);
|
|
mps_arena_formatted_objects_walk(arena, test_stepper, &object_count, 0);
|
|
mps_arena_release(arena);
|
|
printf("stepped on %lu objects.\n", object_count);
|
|
}
|
|
if (collections == rampSwitch) {
|
|
int begin_ramp = !ramping
|
|
|| /* Every other time, switch back immediately. */ (collections & 1);
|
|
|
|
rampSwitch += rampSIZE;
|
|
if (ramping) {
|
|
die(mps_ap_alloc_pattern_end(ap, ramp), "pattern end (ap)");
|
|
die(mps_ap_alloc_pattern_end(busy_ap, ramp), "pattern end (busy_ap)");
|
|
ramping = 0;
|
|
/* kill half of the roots */
|
|
for(i = 0; i < exactRootsCOUNT; i += 2) {
|
|
if (exactRoots[i] != objNULL) {
|
|
cdie(dylan_check(exactRoots[i]), "ramp kill check");
|
|
exactRoots[i] = objNULL;
|
|
}
|
|
}
|
|
}
|
|
if (begin_ramp) {
|
|
die(mps_ap_alloc_pattern_begin(ap, ramp),
|
|
"pattern rebegin (ap)");
|
|
die(mps_ap_alloc_pattern_begin(busy_ap, ramp),
|
|
"pattern rebegin (busy_ap)");
|
|
ramping = 1;
|
|
}
|
|
}
|
|
}
|
|
|
|
r = (size_t)rnd();
|
|
if (r & 1) {
|
|
i = (r >> 1) % exactRootsCOUNT;
|
|
if (exactRoots[i] != objNULL)
|
|
cdie(dylan_check(exactRoots[i]), "dying root check");
|
|
exactRoots[i] = make();
|
|
if (exactRoots[(exactRootsCOUNT-1) - i] != objNULL)
|
|
dylan_write(exactRoots[(exactRootsCOUNT-1) - i],
|
|
exactRoots, exactRootsCOUNT);
|
|
} else {
|
|
i = (r >> 1) % ambigRootsCOUNT;
|
|
ambigRoots[(ambigRootsCOUNT-1) - i] = make();
|
|
/* Create random interior pointers */
|
|
ambigRoots[i] = (mps_addr_t)((char *)(ambigRoots[i/2]) + 1);
|
|
}
|
|
|
|
if (r % initTestFREQ == 0)
|
|
*(int*)busy_init = -1; /* check that the buffer is still there */
|
|
|
|
if (objs % 1024 == 0) {
|
|
report(arena);
|
|
putchar('.');
|
|
fflush(stdout);
|
|
}
|
|
|
|
++objs;
|
|
}
|
|
|
|
(void)mps_commit(busy_ap, busy_init, 64);
|
|
mps_ap_destroy(busy_ap);
|
|
mps_ap_destroy(ap);
|
|
mps_root_destroy(exactRoot);
|
|
mps_root_destroy(ambigRoot);
|
|
mps_pool_destroy(pool);
|
|
mps_chain_destroy(chain);
|
|
mps_fmt_destroy(format);
|
|
}
|
|
|
|
int main(int argc, char *argv[])
|
|
{
|
|
mps_arena_t arena;
|
|
mps_thr_t thread;
|
|
|
|
randomize(argc, argv);
|
|
|
|
die(mps_arena_create(&arena, mps_arena_class_vm(), 2*testArenaSIZE),
|
|
"arena_create");
|
|
mps_message_type_enable(arena, mps_message_type_gc());
|
|
mps_message_type_enable(arena, mps_message_type_gc_start());
|
|
mps_alert_collection_set(arena, &alertfn);
|
|
die(mps_arena_commit_limit_set(arena, testArenaSIZE), "set limit");
|
|
die(mps_thread_reg(&thread, arena), "thread_reg");
|
|
test(arena);
|
|
mps_thread_dereg(thread);
|
|
report(arena);
|
|
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.
|
|
*/
|