mirror of
git://git.sv.gnu.org/emacs.git
synced 2025-12-15 10:30:25 -08:00
261 lines
7.1 KiB
C
261 lines
7.1 KiB
C
/* sacss.c: SAC MANUAL ALLOC STRESS TEST
|
|
*
|
|
* $Id$
|
|
* Copyright (c) 2001-2020 Ravenbrook Limited. See end of file for license.
|
|
* Portions copyright (C) 2002 Global Graphics Software.
|
|
*/
|
|
|
|
#include "mpscmvff.h"
|
|
#include "mpscmfs.h"
|
|
#include "mpslib.h"
|
|
#include "mpsavm.h"
|
|
#include "mps.h"
|
|
|
|
#include "testlib.h"
|
|
#include "mpslib.h"
|
|
|
|
#include <stdio.h>
|
|
#include <stdlib.h>
|
|
#include <time.h>
|
|
|
|
|
|
#define TRUE 1
|
|
#define FALSE 0
|
|
|
|
#define testArenaSIZE ((((size_t)64)<<20) - 4)
|
|
#define testSetSIZE 200
|
|
#define testLOOPS 10
|
|
|
|
|
|
/* make -- allocate an object */
|
|
|
|
static mps_res_t make(mps_addr_t *p, mps_sac_t sac, size_t size)
|
|
{
|
|
mps_res_t res;
|
|
|
|
MPS_SAC_ALLOC(res, *p, sac, size, FALSE);
|
|
return res;
|
|
}
|
|
|
|
|
|
/* stress -- create a pool of the requested type and allocate in it */
|
|
|
|
static mps_res_t stress(mps_arena_t arena, mps_align_t align,
|
|
size_t (*size)(size_t i),
|
|
const char *name, mps_pool_class_t pool_class,
|
|
mps_arg_s *args)
|
|
{
|
|
mps_res_t res;
|
|
mps_pool_t pool;
|
|
mps_sac_t sac;
|
|
size_t i, k;
|
|
int *ps[testSetSIZE];
|
|
size_t ss[testSetSIZE];
|
|
mps_sac_classes_s classes[4] = {
|
|
{1, 1, 1},
|
|
{2, 1, 2},
|
|
{16, 9, 5},
|
|
{100, 9, 4},
|
|
};
|
|
size_t classes_count = sizeof classes / sizeof *classes;
|
|
for (i = 0; i < classes_count; ++i) {
|
|
classes[i].mps_block_size *= alignUp(align, sizeof(void *));
|
|
}
|
|
|
|
printf("%s\n", name);
|
|
|
|
res = mps_pool_create_k(&pool, arena, pool_class, args);
|
|
if (res != MPS_RES_OK)
|
|
return res;
|
|
|
|
die(mps_sac_create(&sac, pool, classes_count, classes),
|
|
"SACCreate");
|
|
|
|
/* allocate a load of objects */
|
|
for (i = 0; i < testSetSIZE; ++i) {
|
|
mps_addr_t obj;
|
|
ss[i] = (*size)(i);
|
|
res = make(&obj, sac, ss[i]);
|
|
if (res != MPS_RES_OK)
|
|
return res;
|
|
ps[i] = obj;
|
|
if (ss[i] >= sizeof(ps[i]))
|
|
*ps[i] = 1; /* Write something, so it gets swap. */
|
|
}
|
|
|
|
mps_pool_check_fenceposts(pool);
|
|
|
|
for (k = 0; k < testLOOPS; ++k) {
|
|
/* shuffle all the objects */
|
|
for (i=0; i<testSetSIZE; ++i) {
|
|
int j = (int)(rnd()%(unsigned)(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;
|
|
}
|
|
if (k == (testLOOPS / 2))
|
|
mps_sac_flush(sac);
|
|
/* free half of the objects */
|
|
/* upper half, as when allocating them again we want smaller objects */
|
|
/* see randomSize() */
|
|
switch (k % 2) {
|
|
case 0:
|
|
for (i=testSetSIZE/2; i<testSetSIZE; ++i)
|
|
MPS_SAC_FREE(sac, (mps_addr_t)ps[i], ss[i]);
|
|
break;
|
|
default:
|
|
for (i=testSetSIZE/2; i<testSetSIZE; ++i)
|
|
mps_sac_free(sac, (mps_addr_t)ps[i], ss[i]);
|
|
break;
|
|
}
|
|
/* allocate some new objects */
|
|
for (i=testSetSIZE/2; i<testSetSIZE; ++i) {
|
|
mps_addr_t obj;
|
|
ss[i] = (*size)(i);
|
|
switch (k % 2) {
|
|
case 0:
|
|
res = make(&obj, sac, ss[i]);
|
|
break;
|
|
default:
|
|
res = mps_sac_alloc(&obj, sac, ss[i], FALSE);
|
|
break;
|
|
}
|
|
if (res != MPS_RES_OK)
|
|
return res;
|
|
ps[i] = obj;
|
|
}
|
|
}
|
|
|
|
mps_sac_destroy(sac);
|
|
mps_pool_destroy(pool);
|
|
|
|
return MPS_RES_OK;
|
|
}
|
|
|
|
|
|
/* randomSize -- produce sizes both large and small */
|
|
|
|
static size_t randomSize(size_t i)
|
|
{
|
|
size_t maxSize = 2 * 160 * 0x2000;
|
|
size_t size;
|
|
|
|
/* Reduce by a factor of 2 every 10 cycles. Total allocation about 40 MB. */
|
|
size = rnd() % max((maxSize >> (i / 10)), 2) + 1;
|
|
return size;
|
|
}
|
|
|
|
|
|
/* fixedSize -- produce always the same size */
|
|
|
|
static size_t fixedSizeSize = 0;
|
|
|
|
static size_t fixedSize(size_t i)
|
|
{
|
|
testlib_unused(i);
|
|
return fixedSizeSize;
|
|
}
|
|
|
|
|
|
static mps_pool_debug_option_s debugOptions = {
|
|
/* .fence_template = */ "post",
|
|
/* .fence_size = */ 4,
|
|
/* .free_template = */ "DEAD",
|
|
/* .free_size = */ 4
|
|
};
|
|
|
|
|
|
/* testInArena -- test all the pool classes in the given arena */
|
|
|
|
static void testInArena(mps_arena_class_t arena_class, mps_arg_s *arena_args)
|
|
{
|
|
mps_arena_t arena;
|
|
size_t arena_grain_size = 4096;
|
|
|
|
die(mps_arena_create_k(&arena, arena_class, arena_args),
|
|
"mps_arena_create");
|
|
|
|
MPS_ARGS_BEGIN(args) {
|
|
mps_align_t align = rnd_align(sizeof(void *), arena_grain_size);
|
|
MPS_ARGS_ADD(args, MPS_KEY_ALIGN, align);
|
|
MPS_ARGS_ADD(args, MPS_KEY_MVFF_ARENA_HIGH, TRUE);
|
|
MPS_ARGS_ADD(args, MPS_KEY_MVFF_SLOT_HIGH, TRUE);
|
|
MPS_ARGS_ADD(args, MPS_KEY_MVFF_FIRST_FIT, TRUE);
|
|
die(stress(arena, align, randomSize, "MVFF", mps_class_mvff(), args),
|
|
"stress MVFF");
|
|
} MPS_ARGS_END(args);
|
|
|
|
MPS_ARGS_BEGIN(args) {
|
|
mps_align_t align = rnd_align(sizeof(void *), arena_grain_size);
|
|
MPS_ARGS_ADD(args, MPS_KEY_ALIGN, align);
|
|
MPS_ARGS_ADD(args, MPS_KEY_MVFF_ARENA_HIGH, TRUE);
|
|
MPS_ARGS_ADD(args, MPS_KEY_MVFF_SLOT_HIGH, TRUE);
|
|
MPS_ARGS_ADD(args, MPS_KEY_MVFF_FIRST_FIT, TRUE);
|
|
MPS_ARGS_ADD(args, MPS_KEY_POOL_DEBUG_OPTIONS, &debugOptions);
|
|
die(stress(arena, align, randomSize, "MVFF debug",
|
|
mps_class_mvff_debug(), args),
|
|
"stress MVFF debug");
|
|
} MPS_ARGS_END(args);
|
|
|
|
MPS_ARGS_BEGIN(args) {
|
|
fixedSizeSize = MPS_PF_ALIGN * (1 + rnd() % 100);
|
|
MPS_ARGS_ADD(args, MPS_KEY_MFS_UNIT_SIZE, fixedSizeSize);
|
|
die(stress(arena, fixedSizeSize, fixedSize, "MFS", mps_class_mfs(), args),
|
|
"stress MFS");
|
|
} MPS_ARGS_END(args);
|
|
|
|
mps_arena_destroy(arena);
|
|
}
|
|
|
|
|
|
int main(int argc, char *argv[])
|
|
{
|
|
testlib_init(argc, argv);
|
|
|
|
MPS_ARGS_BEGIN(args) {
|
|
MPS_ARGS_ADD(args, MPS_KEY_ARENA_SIZE, testArenaSIZE);
|
|
testInArena(mps_arena_class_vm(), args);
|
|
} MPS_ARGS_END(args);
|
|
|
|
MPS_ARGS_BEGIN(args) {
|
|
MPS_ARGS_ADD(args, MPS_KEY_ARENA_SIZE, testArenaSIZE);
|
|
MPS_ARGS_ADD(args, MPS_KEY_ARENA_ZONED, FALSE);
|
|
testInArena(mps_arena_class_vm(), args);
|
|
} MPS_ARGS_END(args);
|
|
|
|
printf("%s: Conclusion: Failed to find any defects.\n", argv[0]);
|
|
return 0;
|
|
}
|
|
|
|
|
|
/* C. COPYRIGHT AND LICENSE
|
|
*
|
|
* Copyright (C) 2001-2020 Ravenbrook Limited <https://www.ravenbrook.com/>.
|
|
*
|
|
* 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.
|
|
*
|
|
* 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 AND FITNESS FOR A
|
|
* PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
|
|
* HOLDER OR 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.
|
|
*/
|