#include <allocator.hpp>

Public Member Functions
void *	alloc (std::size_t size)

void	free (void *ptr) noexcept

void *	alloc (std::size_t size)

void	free (void *ptr) noexcept

Static Public Member Functions
static jit_allocator &	instance ()

static jit_allocator &	instance ()

Detailed Description

Definition at line 126 of file allocator.hpp.

Member Function Documentation

◆ alloc() [1/2]

void * sysio::vm::jit_allocator::alloc ( std::size_t size )

inline

Definition at line 130 of file allocator.hpp.

                                   {
         std::lock_guard l{_mutex};
         size = round_to_page(size);
         auto best = free_blocks_by_size.lower_bound(size);
         if(best == free_blocks_by_size.end()) {
            best = allocate_segment(size);
         }
         if (best->first > size) {
            best = split_block(best, size);
         }
         transfer_node(free_blocks, allocated_blocks, best->second);
         best = transfer_node(free_blocks_by_size, allocated_blocks_by_size, *best);
         return best->second;
      }

◆ alloc() [2/2]

void * sysio::vm::jit_allocator::alloc ( std::size_t size )

inline

Definition at line 130 of file allocator.hpp.

                                   {
         std::lock_guard l{_mutex};
         size = round_to_page(size);
         auto best = free_blocks_by_size.lower_bound(size);
         if(best == free_blocks_by_size.end()) {
            best = allocate_segment(size);
         }
         if (best->first > size) {
            best = split_block(best, size);
         }
         transfer_node(free_blocks, allocated_blocks, best->second);
         best = transfer_node(free_blocks_by_size, allocated_blocks_by_size, *best);
         return best->second;
      }

◆ free() [1/2]

void sysio::vm::jit_allocator::free ( void * ptr )

inlinenoexcept

Definition at line 145 of file allocator.hpp.

                                    {
         std::lock_guard l{_mutex};
         auto pos = transfer_node(allocated_blocks, free_blocks, ptr);
         transfer_node(allocated_blocks_by_size, free_blocks_by_size, {pos->second, pos->first});
 
         // merge the freed block with adjacent free blocks
         if(pos != free_blocks.begin()) {
            auto prev = pos;
            --prev;
            pos = maybe_consolidate_blocks(prev, pos);
         }
         auto next = pos;
         ++next;
         if (next != free_blocks.end()) {
            maybe_consolidate_blocks(pos, next);
         }
      }

Here is the caller graph for this function:

◆ free() [2/2]

void sysio::vm::jit_allocator::free ( void * ptr )

inlinenoexcept

Definition at line 145 of file allocator.hpp.

                                    {
         std::lock_guard l{_mutex};
         auto pos = transfer_node(allocated_blocks, free_blocks, ptr);
         transfer_node(allocated_blocks_by_size, free_blocks_by_size, {pos->second, pos->first});
 
         // merge the freed block with adjacent free blocks
         if(pos != free_blocks.begin()) {
            auto prev = pos;
            --prev;
            pos = maybe_consolidate_blocks(prev, pos);
         }
         auto next = pos;
         ++next;
         if (next != free_blocks.end()) {
            maybe_consolidate_blocks(pos, next);
         }
      }

◆ instance() [1/2]

static jit_allocator & sysio::vm::jit_allocator::instance ( )

inlinestatic

Definition at line 162 of file allocator.hpp.

                                       {
         static jit_allocator the_jit_allocator;
         return the_jit_allocator;
      }