https://github.com/gilzoide/c-allocators
A collection of public domain single-file custom allocators for C/C++
https://github.com/gilzoide/c-allocators
allocator header-only single-file single-header stack stack-allocator
Last synced: 3 months ago
JSON representation
A collection of public domain single-file custom allocators for C/C++
- Host: GitHub
- URL: https://github.com/gilzoide/c-allocators
- Owner: gilzoide
- License: unlicense
- Created: 2019-08-04T15:22:14.000Z (over 6 years ago)
- Default Branch: main
- Last Pushed: 2021-02-18T19:38:31.000Z (almost 5 years ago)
- Last Synced: 2024-12-21T11:10:03.136Z (about 1 year ago)
- Topics: allocator, header-only, single-file, single-header, stack, stack-allocator
- Language: C
- Homepage:
- Size: 41 KB
- Stars: 5
- Watchers: 3
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
- Funding: .github/FUNDING.yml
Awesome Lists containing this project
README
# c-allocators
[](https://travis-ci.org/gilzoide/c-allocators)
A collection of public domain single-file custom allocators for C/C++.
## Using
Copy the desired source file to your project, include it wherever necessary and
add a `#define _IMPLEMENTATION` before including it in exactly
**one** C/C++ file to create the implementation.
## [stack_allocator.h](stack_allocator.h)
A Stack (Bump) Allocator implementation, maintaining a memory buffer and the current allocation marker.
Allocation markers can be used to free allocator up to some point, instead of clearing the entire stack.
In particular, when allocating elements of a single type, this becomes a generic stack implementation.
There are typed macros for functions that expect `size` values, to help in readability.
There are also `FOREACH` macros for iterating stack in allocation order or reversed allocation order,
assuming that all values are of the same type.
## [double_stack_allocator.h](double_stack_allocator.h)
A Double Ended Stack (Bump) Allocator implementation, maintaining a memory buffer and current allocation
markers for both ends.
Allocation markers can be used to free allocator up to some point, instead of clearing the entire stack
on either end.
In particular, when allocating elements of a single type, this becomes a generic double ended stack
implementation, possibly with different types for each side.
There are typed macros for functions that expect `size` values, to help in readability.
There are also `FOREACH` macros for iterating stack in allocation order or reversed allocation order,
assuming that all values are of the same type.