/*
TEST_HEADER
id = $HopeName$
summary = allocate 100 items, throw away and repeat
language = c
link = myfmt.o testlib.o
manual = true
END_HEADER
*/
/* you have to type in the size (in hex) of the items allocated */
/* same as test function/3.c, but
this version (4.c) prints timings for each 100 iterations,
so you can see if things slow down or speed up */
#include <time.h>
#include "testlib.h"
#include "mpscamc.h"
#include "myfmt.h"
void *stackpointer;
static void test(void)
{
mps_space_t space;
mps_pool_t pool;
mps_thr_t thread;
mps_root_t root;
mps_fmt_t format;
mps_ap_t ap;
mycell *a,*b,*c;
size_t inpsize;
int i,j,k;
clock_t time0, time1;
cdie(mps_space_create(&space), "create space");
cdie(mps_thread_reg(&thread, space), "register thread");
cdie(
mps_root_create_reg(&root, space, MPS_RANK_AMBIG, 0, thread,
mps_stack_scan_ambig, stackpointer, 0),
"create root");
cdie(
mps_fmt_create_A(&format, space, &fmtA),
"create format");
formatcomments = 0;
cdie(
mps_pool_create(&pool, space, mps_class_amc(), format),
"create pool");
cdie(
mps_ap_create(&ap, pool, MPS_RANK_EXACT),
"create ap");
scanf("%lx", &inpsize);
time0 = clock();
asserts(time0 != -1, "processor time not available");
for (k=0; k<100; k++)
{
for (j=0; j<100; j++)
{
a = allocone(ap, 0, NULL, NULL, inpsize);
b = a;
for (i=1; i<100; i++)
{
c = allocone(ap, i, NULL, NULL, inpsize);
b->ref[0] = c;
b = c;
}
}
time1 = clock();
comment("%d: %i", k, (int) (100*(time1-time0)/CLOCKS_PER_SEC));
time0 = time1;
}
mps_ap_destroy(ap);
comment("Destroyed ap.");
mps_pool_destroy(pool);
comment("Destroyed pool.");
mps_fmt_destroy(format);
comment("Destroyed format.");
mps_root_destroy(root);
comment("Destroyed root.");
mps_thread_dereg(thread);
comment("Deregistered thread.");
mps_space_destroy(space);
comment("Destroyed space.");
}
int main(void)
{
void *m;
stackpointer=&m; /* hack to get stack pointer */
easy_tramp(test);
return 0;
}