1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
/* 
TEST_HEADER
 id = $Id: //info.ravenbrook.com/project/mps/master/test/function/232.c#5 $
 summary = grey-box test of arena extension and compaction
 language = c
 link = testlib.o
 parameters = CHUNKSIZE=1024*1024 ITERATIONS=100
END_HEADER
*/

#include "mpm.h"
#include "mpscmvff.h"
#include "testlib.h"

static void check_chunks(mps_arena_t arena, unsigned expected)
{
  unsigned chunks = (unsigned)RingLength(ArenaChunkRing((Arena)arena));
  asserts(chunks == expected, "expected %u chunks, got %u", expected, chunks);
}

static void test(void *stack_pointer)
{
  mps_arena_t arena;
  mps_pool_t pool;
  mps_addr_t block[ITERATIONS];
  unsigned i;

  MPS_ARGS_BEGIN(args) {
    MPS_ARGS_ADD(args, MPS_KEY_ARENA_SIZE, CHUNKSIZE);
    die(mps_arena_create_k(&arena, mps_arena_class_vm(), args), "arena_create");
  } MPS_ARGS_END(args);

  MPS_ARGS_BEGIN(args) {
    MPS_ARGS_ADD(args, MPS_KEY_SPARE, 0);
    die(mps_pool_create_k(&pool, arena, mps_class_mvff(), args), "pool_create");
  } MPS_ARGS_END(args);
  check_chunks(arena, 1);

  for (i = 0; i < ITERATIONS; ++i) {
    die(mps_alloc(&block[i], pool, CHUNKSIZE), "mps_alloc");
    check_chunks(arena, i + 2);
  }

  for (i = ITERATIONS; i > 0; --i) {
    mps_free(pool, block[i - 1], CHUNKSIZE);
    mps_arena_collect(arena); /* ensure ArenaCompact is called */
    /* The first chunk to be freed from the pool to the arena gets
     * some of its memory stolen for the spare memory land's block
     * pool, and this prevents the chunk from being destroyed.
     * Subsequent chunks can be freed in their entirety because the
     * spare memory land has enough blocks. */
    check_chunks(arena, i + 1);
  }

  mps_pool_destroy(pool);
  mps_arena_destroy(arena);
}

int main(void)
{
  run_test(test);
  pass();
  return 0;
}