1
Fork 0
mirror of git://git.sv.gnu.org/emacs.git synced 2026-03-15 11:21:19 -07:00
emacs/mps/src/mpmss.c
David Jones 7dcc596482 Merging from mmdrj_devel_arena_hysteresis, change.epcore.brisling.160132
Copied from Perforce
 Change: 20488
 ServerID: perforce.ravenbrook.com
1999-01-18 13:59:21 +00:00

186 lines
4.1 KiB
C

/* impl.c.mpmss: MPM STRESS TEST
*
* $HopeName: MMsrc!mpmss.c(MMdevel_drj_arena_hysteresis.2) $
* Copyright (C) 1998. Harlequin Group plc. All rights reserved.
*/
#include <stdio.h>
#include "mpstd.h"
#ifdef MPS_OS_SU
#include "ossu.h"
#endif
#include <stdlib.h>
#include <stdarg.h>
#ifdef MPS_OS_IA
struct itimerspec; /* stop complaints from time.h */
#endif
#include <time.h>
#include "mpscmv.h"
#include "mpslib.h"
#include "mpsavm.h"
#include "testlib.h"
#include "mps.h"
/* @@@@ Hack due to missing mpscmfs.h */
extern mps_class_t PoolClassMFS(void);
#define testArenaSIZE ((((size_t)64)<<20) - 4)
#define smallArenaSIZE ((((size_t)1)<<20) - 4)
#define testSetSIZE 200
#define testLOOPS 10
static int mpmss_random;
static mps_res_t stress(mps_class_t class, mps_arena_t arena,
size_t (*size)(int i), ...)
{
mps_res_t res;
mps_pool_t pool;
va_list arg;
int i, k;
int *ps[testSetSIZE];
size_t ss[testSetSIZE];
va_start(arg, size);
res = mps_pool_create_v(&pool, arena, class, arg);
va_end(arg);
if (res != MPS_RES_OK)
return res;
/* allocate a load of objects */
for (i=0; i<testSetSIZE; ++i) {
ss[i] = (*size)(i);
res = mps_alloc((mps_addr_t *)&ps[i], pool, ss[i]);
if (res != MPS_RES_OK)
return res;
if (ss[i] >= sizeof(ps[i]))
*ps[i] = 1; /* Write something, so it gets swap. */
if (i && i%4==0) putchar('\n');
printf("%8lX %6lX ", (unsigned long)ps[i], (unsigned long)ss[i]);
}
putchar('\n');
mps_pool_check_fenceposts(pool);
for (k=0; k<testLOOPS; ++k) {
/* shuffle all the objects */
for (i=0; i<testSetSIZE; ++i) {
int j = rnd()%(testSetSIZE-i);
void *tp;
size_t ts;
tp = ps[j]; ts = ss[j];
ps[j] = ps[i]; ss[j] = ss[i];
ps[i] = tp; ss[i] = ts;
}
/* free half of the objects */
/* upper half, as when allocating them again we want smaller objects */
/* see randomSize() */
for (i=testSetSIZE/2; i<testSetSIZE; ++i) {
mps_free(pool, (mps_addr_t)ps[i], ss[i]);
/* if (i == testSetSIZE/2) */
/* PoolDescribe((Pool)pool, mps_lib_stdout); */
}
/* allocate some new objects */
for (i=testSetSIZE/2; i<testSetSIZE; ++i) {
ss[i] = (*size)(i);
res = mps_alloc((mps_addr_t *)&ps[i], pool, ss[i]);
if (res != MPS_RES_OK) return res;
if (i && i%4==0) putchar('\n');
printf("%8lX %6lX ", (unsigned long)ps[i], (unsigned long)ss[i]);
}
putchar('\n');
}
mps_pool_destroy(pool);
return MPS_RES_OK;
}
#define max(a, b) (((a) > (b)) ? (a) : (b))
static size_t randomSize(int i)
{
/* Make the range large enough to span three pages in the segment table: */
/* 160 segments/page, page size max 0x2000. */
size_t maxSize = 2 * 160 * 0x2000;
/* Reduce by a factor of 2 every 10 cycles. Total allocation about 40 MB. */
return rnd() % max((maxSize >> (i / 10)), 2) + 1;
}
static size_t fixedSizeSize = 0;
static size_t fixedSize(int i)
{
testlib_unused(i);
return fixedSizeSize;
}
static mps_pool_debug_option_s debugOptions = { (void *)"postpost", 8 };
static int testInArena(mps_arena_t arena)
{
die(stress(mps_class_mv_debug(), arena, randomSize,
&debugOptions, (size_t)65536, (size_t)32, (size_t)65536),
"stress MV");
fixedSizeSize = 13;
die(stress(PoolClassMFS(),
arena, fixedSize, (size_t)100000, fixedSizeSize),
"stress MFS");
die(stress(mps_class_mv(), arena, randomSize,
(size_t)65536, (size_t)32, (size_t)65536),
"stress MV");
return 0;
}
int main(int argc, char **argv)
{
mps_arena_t arena;
int i;
testlib_unused(argv);
if(argc > 1) {
mpmss_random = 0;
} else {
mpmss_random = 1;
}
if(mpmss_random) {
/* Randomize the random number generator a bit. */
for (i = time(NULL) % 67; i > 0; --i)
rnd();
}
die(mps_arena_create(&arena, mps_arena_class_vm(), testArenaSIZE),
"mps_arena_create");
testInArena(arena);
mps_arena_destroy(arena);
die(mps_arena_create(&arena, mps_arena_class_vm(), smallArenaSIZE),
"mps_arena_create");
testInArena(arena);
mps_arena_destroy(arena);
return 0;
}