11. MVFF (Manual Variable First Fit)

MVFF manually manages variable-sized, unformatted objects. It uses the first fit allocation policy for blocks allocated via mps_alloc().

Johnstone (1997) found that in his test cases:

No version of best fit had more than 5% actual fragmentation. This is also true for all versions of first fit that used an address-ordered free list, and the two versions of first fit that used a FIFO free list. This strongly suggests that the basic best-fit algorithm and the first-fit algorithm with an address-ordered free list are very robust algorithms.

The MVFF pool class also supports buffered allocation (that is, allocation via allocation points), and in this case, the allocation policy is different: the buffers are filled according to the worst fit policy, and allocation always proceeds upwards from the base.

Buffered and unbuffered allocation can be used at the same time, but the first allocation point must be created before any call to mps_alloc().

It is usually not advisable to use buffered and unbuffered allocation on the same pool, because the worst-fit policy of buffer filling will grab all the large blocks, leading to severe fragmentation. If you need both forms of allocation, use two separate pools.

Note that buffered allocation can’t allocate across segment boundaries (see Allocation point implementation for the technical reason). This can cause added external fragmentation if objects are allocated that are a significant fraction of the segment size.

Note

If you need to allocate large objects in an MVFF pool, contact us.

11.1. MVFF properties

11.2. MVFF interface

#include "mpscmvff.h"
mps_class_t mps_class_mvff(void)

Return the pool class for an MVFF (Manual Variable First Fit) pool.

When creating an MVFF pool, mps_pool_create_k() may take the following keyword arguments:

  • MPS_KEY_EXTEND_BY (type size_t, default 65536) is the size of segment that the pool will request from the arena.

  • MPS_KEY_MEAN_SIZE (type size_t, default 32) is the predicted mean size of blocks that will be allocated from the pool. This is a hint to the MPS: the pool will be less efficient if this is wrong, but nothing will break.

  • MPS_KEY_ALIGN (type mps_align_t, default is MPS_PF_ALIGN) is the alignment of addresses for allocation (and freeing) in the pool. If an unaligned size is passed to mps_alloc() or mps_free(), it will be rounded up to the pool’s alignment. The minimum alignment supported by pools of this class is sizeof(void*).

  • MPS_KEY_SPARE (type double, default 0.75) is the maximum proportion of memory that the pool will keep spare for future allocations. If the proportion of memory that’s free exceeds this, then the pool will return some of it to the arena for use by other pools.

  • MPS_KEY_MVFF_ARENA_HIGH (type mps_bool_t, default false) determines whether new segments are acquired at high addresses (if true), or at low addresses (if false).

  • MPS_KEY_MVFF_SLOT_HIGH 1 (type mps_bool_t, default false) determines whether to search for the highest addressed free area (if true) or lowest (if false) when allocating using mps_alloc().

  • MPS_KEY_MVFF_FIRST_FIT 1 (type mps_bool_t, default true) determines whether to allocate from the highest address in a found free area (if true) or lowest (if false) when allocating using mps_alloc().

1(1,2)

Allocation points are not affected by MPS_KEY_MVFF_SLOT_HIGH or MPS_KEY_MVFF_FIRST_FIT. They use a worst-fit policy in order to maximise the number of in-line allocations.

The defaults yield a a simple first-fit allocator. Specify MPS_KEY_MVFF_ARENA_HIGH and MPS_KEY_MVFF_SLOT_HIGH true, and MPS_KEY_MVFF_FIRST_FIT false to get a first-fit allocator that works from the top of memory downwards. Other combinations may be useful in special circumstances.

For example:

MPS_ARGS_BEGIN(args) {
    MPS_ARGS_ADD(args, MPS_KEY_EXTEND_BY, 1024 * 1024);
    MPS_ARGS_ADD(args, MPS_KEY_MEAN_SIZE, 32);
    MPS_ARGS_ADD(args, MPS_KEY_ALIGN, 8);
    MPS_ARGS_ADD(args, MPS_KEY_MVFF_ARENA_HIGH, 1);
    MPS_ARGS_ADD(args, MPS_KEY_MVFF_SLOT_HIGH, 1);
    MPS_ARGS_ADD(args, MPS_KEY_MVFF_FIRST_FIT, 0);
    res = mps_pool_create_k(&pool, arena, mps_class_mvff(), args);
} MPS_ARGS_END(args);

Deprecated

starting with version 1.112.

When using mps_pool_create(), pass the arguments like this:

mps_res_t mps_pool_create(mps_pool_t *pool_o, mps_arena_t arena,
                          mps_class_t mps_class_mvff(),
                          size_t extend_size,
                          size_t average_size,
                          mps_align_t alignment,
                          mps_bool_t slot_high,
                          mps_bool_t arena_high,
                          mps_bool_t first_fit)
mps_class_t mps_class_mvff_debug(void)

A debugging version of the MVFF pool class.

When creating a debugging MVFF pool, mps_pool_create_k() takes seven keyword arguments.

  • MPS_KEY_EXTEND_BY, MPS_KEY_MEAN_SIZE, MPS_KEY_ALIGN, MPS_KEY_MVFF_ARENA_HIGH, MPS_KEY_MVFF_SLOT_HIGH, and MPS_KEY_MVFF_FIRST_FIT are as described above, and MPS_KEY_POOL_DEBUG_OPTIONS specifies the debugging options. See mps_pool_debug_option_s.

Deprecated

starting with version 1.112.

When using mps_pool_create(), pass the arguments like this:

mps_res_t mps_pool_create(mps_pool_t *pool_o, mps_arena_t arena,
                          mps_class_t mps_class_mvff_debug(),
                          mps_pool_debug_option_s debug_option,
                          size_t extend_size,
                          size_t average_size,
                          mps_align_t alignment,
                          mps_bool_t slot_high,
                          mps_bool_t arena_high,
                          mps_bool_t first_fit)

11.3. MVFF introspection

#include "mpscmvff.h"
size_t mps_mvff_free_size(mps_pool_t pool)

Return the total amount of free space in an MVFF pool.

pool is the MVFF pool.

Returns the total free space in the pool, in bytes (1).

size_t mps_mvff_size(mps_pool_t pool)

Return the total size of an MVFF pool.

pool is the MVFF pool.

Returns the total size of the pool, in bytes (1). This is the sum of allocated space and free space.