mirror of
git://git.sv.gnu.org/emacs.git
synced 2026-01-15 07:41:09 -08:00
3d5e2ca85f
This was achieved by partially undoing changelist 24817, including an accidental corruption of eventgen.pl. Copied from Perforce Change: 24877 ServerID: perforce.ravenbrook.com
178 lines
3 KiB
C
178 lines
3 KiB
C
/* impl.c.abqtest: AVAILABLE BLOCK QUEUE TEST
|
|
*
|
|
* $Id$
|
|
* $HopeName: MMsrc!abqtest.c(trunk.6) $
|
|
* Copyright (c) 2001 Ravenbrook Limited.
|
|
*/
|
|
|
|
#include "abq.h"
|
|
#include "cbs.h"
|
|
#include "mpm.h"
|
|
#include "mps.h"
|
|
#include "mpsavm.h"
|
|
#include "testlib.h"
|
|
#include <stdlib.h>
|
|
#include <stdarg.h>
|
|
#include "mpstd.h"
|
|
#ifdef MPS_OS_IA
|
|
struct itimerspec; /* stop complaints from time.h */
|
|
#endif
|
|
#include <time.h>
|
|
#include <math.h>
|
|
|
|
|
|
SRCID(abqtest, "$Id$");
|
|
|
|
|
|
static ABQStruct abq; /* the ABQ which we will use */
|
|
static Size abqSize; /* the size of the current ABQ */
|
|
|
|
#define ABQ_SIZE 10
|
|
#define TEST_ITER 10000
|
|
|
|
|
|
static unsigned long abqRnd(unsigned long n)
|
|
{
|
|
return rnd()%n;
|
|
}
|
|
|
|
|
|
static int pushee = 1;
|
|
static int popee = 1;
|
|
static int deleted = 0;
|
|
|
|
|
|
typedef struct TestStruct *Test;
|
|
|
|
typedef struct TestStruct
|
|
{
|
|
Test next;
|
|
int id;
|
|
CBSBlockStruct cbsBlockStruct;
|
|
} TestStruct;
|
|
|
|
|
|
static CBSBlock TestCBSBlock(Test t)
|
|
{
|
|
return &t->cbsBlockStruct;
|
|
}
|
|
|
|
static Test CBSBlockTest(CBSBlock c)
|
|
{
|
|
return PARENT(TestStruct, cbsBlockStruct, c);
|
|
}
|
|
|
|
|
|
static Test testBlocks = NULL;
|
|
|
|
|
|
static CBSBlock CreateCBSBlock(int no)
|
|
{
|
|
Test b = malloc(sizeof(TestStruct));
|
|
cdie(b != NULL, "malloc");
|
|
|
|
b->next = testBlocks;
|
|
b->id = no;
|
|
b->cbsBlockStruct.base = 0;
|
|
b->cbsBlockStruct.limit = 0;
|
|
|
|
testBlocks = b;
|
|
|
|
return TestCBSBlock(b);
|
|
}
|
|
|
|
|
|
static void DestroyCBSBlock(CBSBlock c)
|
|
{
|
|
Test b = CBSBlockTest(c);
|
|
|
|
if (b == testBlocks)
|
|
testBlocks = b->next;
|
|
else {
|
|
Test prev;
|
|
|
|
for (prev = testBlocks; prev != 0; prev = prev->next)
|
|
if (prev->next == b) {
|
|
prev->next = b->next;
|
|
break;
|
|
}
|
|
}
|
|
|
|
free(b);
|
|
}
|
|
|
|
|
|
static void step(void)
|
|
{
|
|
Res res;
|
|
CBSBlock a;
|
|
|
|
switch (abqRnd(9)) {
|
|
case 0: case 1: case 2: case 3:
|
|
push:
|
|
res = ABQPush(&abq, CreateCBSBlock(pushee));
|
|
if (res != ResOK) {
|
|
goto pop;
|
|
}
|
|
pushee++;
|
|
break;
|
|
case 5: case 6: case 7: case 8:
|
|
pop:
|
|
res = ABQPop(&abq, &a);
|
|
if (res != ResOK){
|
|
goto push;
|
|
}
|
|
if (popee == deleted) {
|
|
popee++;
|
|
deleted = 0;
|
|
}
|
|
cdie(CBSBlockTest(a)->id == popee, "pop");
|
|
popee++;
|
|
DestroyCBSBlock(a);
|
|
break;
|
|
default:
|
|
if (!deleted & (pushee > popee)) {
|
|
Test b;
|
|
|
|
deleted = abqRnd (pushee - popee) + popee;
|
|
for (b = testBlocks; b != NULL; b = b->next)
|
|
if (b->id == deleted)
|
|
break;
|
|
cdie(b != NULL, "found to delete");
|
|
res = ABQDelete(&abq, TestCBSBlock(b));
|
|
cdie(res == ResOK, "ABQDelete");
|
|
}
|
|
}
|
|
}
|
|
|
|
|
|
#define testArenaSIZE (((size_t)4)<<20)
|
|
|
|
extern int main(int argc, char *argv[])
|
|
{
|
|
Res res;
|
|
mps_arena_t arena;
|
|
int i;
|
|
|
|
randomize(argc, argv);
|
|
|
|
abqSize = 0;
|
|
|
|
die(mps_arena_create(&arena, mps_arena_class_vm(), testArenaSIZE),
|
|
"mps_arena_create");
|
|
|
|
res = ABQInit((Arena)arena, &abq, NULL, ABQ_SIZE);
|
|
if (res == ResOK) {
|
|
abqSize = ABQ_SIZE;
|
|
} else {
|
|
printf("ABQCreate returned %d\n",res);
|
|
return 1;
|
|
}
|
|
|
|
for (i = 0; i < TEST_ITER; i++) {
|
|
step();
|
|
}
|
|
|
|
printf("All tests passed.\n");
|
|
return 0;
|
|
}
|