cpp-memory-allocators

KO | EN

gitlite — search

#javascript #python #hacktoberfest #react #typescript #rust #deep-learning #nodejs #kubernetes #vue #awesome-list #mcp #openai #open-source

cpp-memory-allocators

(★ 11)

Multiple custom memory allocators and a basic benchmarking tool written in C++

cpp-memory-allocators 최신버젼 다운로드

최종 버전 다운로드 (.zip)

// repository documentation

Was this content helpful?

★ 0 (0 ratings)

# Custom Memory Allocators in C++
Multiple custom allocators written in C++ for my renderer, it's still incomplete and has somewhat inconsistent API, but this can be regarded as a personal experiment, and I'm more concerned with trying new things rather than having a shippable and replicable software package.

## Allocators and worst case complexities for alloc & dealloc (N: # of free blocks):
* **Linea Allocator, O(1), O(1)**
  + Also known as frame allocator, this class only allows user to allocate or deallocate the memory as a whole.
* **Pool Allocator, O(1), O(1)**
  + Can perform free operation but only allows allocating and deallocating certain sized blocks. It's absurdly simple but most of the time it works wonders. 
* **Stack Allocator, O(1), O(1)**
  + This allocator can deallocate the last allocated block.
* **Sequential Lists Allocator, O(N), O(N)**
  + Can allocate and deallocate blocks of any size. But it's a terrible general purpose allocator. 
  It can be used as a higher level memory manager, while managing the allocated blocks with seperate, more efficient allocators.
* **Red Black Tree Allocator, O(log(N)), O(log(N))**
  + An allocator that constructs an Red Black Tree out of the unused blocks in the memory arena.

## Some remarks and features:
* A basic benchmarking tool that measures the performance of allocation and free operations. Currently it accepts a union of these flags:
  + ALLOC_RAND, ALLOC_SEQ, FREE_LIFO, FREE_FIFO, FREE_RAND
* Can initialize allocators with **STATIC**, **STATIC_PREALLOC**, **VMDYNAMIC** modes. Currently only Sequential Lists accepts these arguments, but it's straightforward to replicate the idea for others as it's independent of the implementation details.
  + **STATIC**: Let the allocator commit a static pool memory.  
  + **STATIC_PREALLLOC**: Allow a preallocated block to be managed by the allocator.  
  + **VMDYNAMIC**: Use Win32 API to allocate a huge contiguous virtual memory block (most advantageous in 64-bit systems), which then can be committed as needed.

## What I intent to work on next:
* Have a proper benchmarking tool that allocates & frees in a randomly fashion rather than having a long alloc or free strike one after other.
* Get RBTreeAllocator to coalesce adjacent free blocks.
* Implement a segregated lists algorithm.
* Homogenize the API across different allocators (template arguments etc.).

## How to run?
* If you have a basic Win32 VS set-up, set the language standard to **C++ 17**, for contexprs, and you should be ready to go. If you face any problems feel free to drop an issue.

## Exposed API for the base class:
```
class Allocator {
public:
    ...
    // allocate
    virtual void* Alloc(size_t sz, size_t alignment) =0;   
    // deallocate
    virtual void Free(void*&) =0;
    // reset allocator state
    virtual void Reset() =0;
    // override memory region with zeroes
    virtual void ZeroMem() =0;
    // release (if exists) the buffer allocated from the OS at the initialiation of the allocator.
    virtual void Release() = 0;
    // print the memory layout for debugging purposes
    virtual void Layout() =0;
};

```

cpp-memory-allocators

cpp-memory-allocators 최신버젼 다운로드

오늘의 추천 프로젝트

Was this content helpful?

Recent Feedback

cpp-memory-allocators

cpp-memory-allocators 최신버젼 다운로드

오늘의 추천 프로젝트

Was this content helpful?

Recent Feedback

Download README