1
Fork 0
mirror of git://git.sv.gnu.org/emacs.git synced 2025-12-25 23:10:47 -08:00
emacs/mps/test/function/203.c
Gareth Rees fd3136bb30 Fix mmqa function test cases so that they run on windows. in detail:
1. On w3i6mv, int and long are 32 bits, so these types can't be used to hold a size_t or an mps_word_t. See 26.c, 38.c, 47.c, 66.c, 123.c, 136.c, 164.c, 165.c, 200.c, 203.c, 204.c, 205.c, 206.c, 207.c, 215.c, 223.c.
2. The Windows command line doesn't cope with parentheses. See 170.c.
3. The natural platform alignment is 16 bytes on w3i6mv, so allocations into pools using the default alignment need to be rounded up. See 21.c, 22.c, 203.c, 204.c, 205.c.
4. Microsoft Visual C/C++ is fussy about signed/unsigned comparison. See 226.c.
5. windows.h defines a SIZE macro so you can't use it as a parameter. See 232.c.

Copied from Perforce
 Change: 191569
 ServerID: perforce.ravenbrook.com
2016-04-22 15:44:58 +01:00

214 lines
5.3 KiB
C

/*
TEST_HEADER
id = $Id$
summary = new MVT allocation test
language = c
link = testlib.o
parameters = ITERATIONS=1000
END_HEADER
*/
#include <time.h>
#include "testlib.h"
#include "mpscmvt.h"
#include "mpsavm.h"
#define MAXNUMBER 100000
void *stackpointer;
mps_arena_t arena;
static struct {mps_addr_t addr; size_t size;} queue[MAXNUMBER];
enum {SEQ=0, RAN=1, SEQGAP=2, RANGAP=3, DUMMY=4};
static char *tdesc[] = {"sequential", "random",
"sequential gap", "random gap", "dummy"};
static void setobj(mps_addr_t a, size_t size, unsigned char val)
{
unsigned char *b;
b = a;
while (size>0)
{
*b=val;
/* comment("%p = %i", b, (int) val);
*/
b++;
size--;
}
}
static mps_res_t mvt_alloc(mps_addr_t *ref, mps_ap_t ap, size_t size) {
mps_res_t res;
size = (size + MPS_PF_ALIGN - 1) & ~(MPS_PF_ALIGN - 1);
do {
MPS_RESERVE_BLOCK(res, *ref, ap, size);
if (res != MPS_RES_OK) return res;
} while (!mps_commit(ap, *ref, size));
return MPS_RES_OK;
}
static int chkobj(mps_addr_t a, size_t size, unsigned char val)
{
unsigned char *b;
b = a;
while (size>0)
{
/* comment("%p == %i", b, (int) val);
*/
if (*b != val) return 0;
b++;
size--;
}
return 1;
}
static void dt(int kind,
size_t minSize, size_t avgSize, size_t maxSize,
mps_word_t depth, mps_word_t fragLimit,
unsigned long mins, unsigned long maxs, int number, int iter)
{
mps_pool_t pool;
mps_ap_t ap;
int i, hd;
clock_t time0, time1;
size_t size;
double secs;
asserts(number <= MAXNUMBER, "number too big");
time0 = clock();
asserts(time0 != -1, "processor time not available");
die(
mps_pool_create(&pool, arena, mps_class_mvt(),
minSize, avgSize, maxSize, depth, fragLimit),
"create MVT pool");
die(mps_ap_create(&ap, pool, mps_rank_ambig()), "create ap");
for(hd=0; hd<number; hd++)
{
size = ranrange(mins, maxs);
if ((ranint(2) && (kind & 2)) || (kind==DUMMY))
{
queue[hd].addr=NULL;
}
else
{
die(mvt_alloc(&queue[hd].addr, ap, size), "alloc");
setobj(queue[hd].addr, size, (unsigned char) (hd%256));
queue[hd].size = size;
}
};
hd=-1;
for(i=0; i<iter; i++)
{
if (kind & 1) hd = ranint(number);
else {ranint(number); hd=(hd+1)%number;} /* call raninit anyway
to use same time */
if (queue[hd].addr != NULL)
{
asserts(chkobj(queue[hd].addr, queue[hd].size, (unsigned char) (hd%256)),
"corrupt at %x (%s: %x, %x, %x, %i, %i, %lx, %lx, %i, %i)",
queue[hd].addr,
tdesc[kind], (int) minSize, (int) avgSize, (int) maxSize,
(int) depth, (int) fragLimit,
mins, maxs, number, iter);
mps_free(pool, queue[hd].addr, queue[hd].size);
}
size = ranrange(mins, maxs);
if ((ranint(2) && (kind & 2)) || (kind==DUMMY))
{
queue[hd].addr=NULL;
}
else
{
die(mvt_alloc(&queue[hd].addr, ap, size),"alloc");
setobj(queue[hd].addr, size, (unsigned char) (hd%256));
queue[hd].size = size;
}
}
mps_ap_destroy(ap);
mps_pool_destroy(pool);
time1=clock();
secs=(time1-time0)/(double)CLOCKS_PER_SEC;
comment("%s test (%x, %x, %x, %i, %i, %lx, %lx, %i, %i) in %.2f s",
tdesc[kind], (int) minSize, (int) avgSize, (int) maxSize,
(int) depth, (int) fragLimit,
mins, maxs, number, iter, secs);
}
static void test(void)
{
mps_thr_t thread;
unsigned long mins;
mps_word_t dep, frag;
cdie(mps_arena_create(&arena, mps_arena_class_vm(), (size_t) (1024*1024*100)), "create arena");
cdie(mps_thread_reg(&thread, arena), "register thread");
mins = sizeof(int);
dep = 1000;
for (frag = 40; frag >= 5; frag = (frag >> 1)) {
comment("Frag: %i", frag);
dt(SEQ, 8, 8, 9, dep, frag, 8, 9, 5, ITERATIONS);
dt(RANGAP, 64, 64, 64, dep, frag, 8, 128, 100, ITERATIONS);
dt(DUMMY, 8, 32, 64, dep, frag, 8, 64, 1000, ITERATIONS);
dt(SEQ, 8, 32, 64, dep, frag, 8, 64, 1000, ITERATIONS);
dt(RAN, 8, 32, 64, dep, frag, 8, 64, 1000, ITERATIONS);
dt(SEQGAP, 8, 32, 64, dep, frag, 8, 64, 1000, ITERATIONS);
dt(RANGAP, 8, 32, 64, dep, frag, 8, 64, 1000, ITERATIONS);
dt(DUMMY, 100, 116, 132, dep, frag, 100, 132, 1000, ITERATIONS);
dt(SEQ, 100, 116, 132, dep, frag, 100, 132, 1000, ITERATIONS);
dt(RAN, 100, 116, 132, dep, frag, 100, 132, 1000, ITERATIONS);
dt(SEQGAP, 100, 116, 132, dep, frag, 100, 132, 1000, ITERATIONS);
dt(RANGAP, 100, 116, 132, dep, frag, 100, 132, 1000, ITERATIONS);
dt(DUMMY, mins, 60*1024, 120*1024, dep, frag, mins, 128*1024, 100, ITERATIONS);
dt(SEQ, mins, 60*1024, 120*1024, dep, frag, mins, 128*1024, 100, ITERATIONS);
dt(RAN, mins, 60*1024, 120*1024, dep, frag, mins, 128*1024, 100, ITERATIONS);
dt(SEQGAP, mins, 60*1024, 120*1024, dep, frag, mins, 128*1024, 100, ITERATIONS);
dt(RANGAP, mins, 60*1024, 120*1024, dep, frag, mins, 128*1024, 100, ITERATIONS);
/* try again using exceptional obj for anything over 16K */
dt(DUMMY, mins, 8*1024, 16*1024, dep, frag, mins, 128*1024, 100, ITERATIONS);
dt(SEQ, mins, 8*1024, 16*1024, dep, frag, mins, 128*1024, 100, ITERATIONS);
dt(RAN, mins, 8*1024, 16*1024, dep, frag, mins, 128*1024, 100, ITERATIONS);
dt(SEQGAP, mins, 8*1024, 16*1024, dep, frag, mins, 128*1024, 100, ITERATIONS);
dt(RANGAP, mins, 8*1024, 16*1024, dep, frag, mins, 128*1024, 100, ITERATIONS);
}
mps_thread_dereg(thread);
mps_arena_destroy(arena);
}
int main(void)
{
void *m;
stackpointer=&m; /* hack to get stack pointer */
easy_tramp(test);
pass();
return 0;
}