Memory allocators
| OSX/Linux | Windows |
|---|---|
 |
sralloc is a set of memory allocators written in politely coded C99 (possibly with C++ wrappers in the future). They are intended to be more or less interchangeable, stackable, and swappable, in addition to being performant and visualizable.
sralloc is mainly intended for game development but there isn’t really anything game-specific in it.
sralloc is still WIP - that includes the documentation. Also, this is very much a learning project for me, so there may very well be ways to do things smarterly! Feedback appreciated. :)
Using allocators generally comes with a set of pros and cons and sralloc is no different.
The main things sralloc will give you are:
As for the negatives:
my_container.push(my_object, my_allocator);A word to the wise: allocators do well in “system” based code such as ECS architectures, and less well when each instance or object needs to manage memory, simply because of the memory overhead. A friend once calculated that sizeof(TheGameObject) in an engine we used was about 1kb (which is eyebrow-raising on its own) and that 10% of that was pointers to the same allocator. This happened because an object had multiple sub-objects (graphics, physics, etc) and each of those needed a pointer to the allocator, too.
This section serves as both a usage guide and a beginner’s tutorial for people who don’t know anything about memory allocators, how they can be used, and why they are common in the games industry.
(By the way, much of this library is loosely inspired by the Stingray engine’s take on allocators, so in addition to reading this, I also recommend checking out the Bitsquid (same thing, different name) blog and Niklas Gray’s videos on Stingray. References to these and other allocator-related resources can be found at the bottom of this document.)
Let’s say you’re just starting out and you want the simplest thing possible. For now you just want to use the malloc allocator as your main allocator. This is how you would do that:
#define SRALLOC_IMPLEMENTATION // Standard single-header-library detail#include <sralloc.h>void main() {srallocator_t* mallocalloc = sralloc_create_malloc_allocator( "root" );void* ptr = sralloc_alloc( mallocalloc, 1024 );// ...do things with ptr...sralloc_dealloc( allocator, ptr );sralloc_destroy_malloc_allocator( mallocalloc );}
The malloc allocator is stupid simple - it simply calls malloc and free to manage its allocations. It also collects some statistics and handles memory alignment - more on that later.
Lots of ado about nothing, right? You could just call malloc and free directly and lose all the cruft. Well yes, but…
Let’s say that you’re writing a game, and you’ve just set up a basic structure: simulation + rendering. You’d like to use separate allocators for them so that you can know how much memory the different parts use, and what their allocation patterns looks like.
Let’s see what that might look like.
void main() {srallocator_t* mallocalloc = sralloc_create_malloc_allocator( "root" );srallocator_t* simalloc = sralloc_create_proxy_allocator( mallocalloc, "sim" );srallocator_t* graphicsalloc = sralloc_create_proxy_allocator( mallocalloc, "graphics" );Simulation* sim = SRALLOC_OBJECT( simalloc, Simulation );Graphics* graphics = SRALLOC_OBJECT( graphicsalloc, Graphics );setup_sim(sim, simalloc);setup_graphics(graphics, graphicsalloc);bool quit = false;while (!quit) {quit = update_simulation(sim, simalloc);render_game(sim, graphics, graphicsalloc);}destroy_sim(sim, simalloc);destroy_graphics(graphics, graphicsalloc);sralloc_dealloc( allocator, sim );sralloc_dealloc( allocator, graphics );sralloc_destroy_proxy_allocator( simalloc );sralloc_destroy_proxy_allocator( graphicsalloc );sralloc_destroy_malloc_allocator( mallocalloc );}void setup_sim(Simulation* sim, srallocator_t* allocator) {srallocator_t* sys1alloc = sralloc_create_proxy_allocator( allocator, "sys1" );sim->system1 = create_sys1(sysalloc1);}void destroy_sim(Simulation* sim, srallocator_t* allocator) {srallocator_t* sys1alloc = sys1->allocator;destroy_sys1(sys1alloc);sralloc_destroy_proxy_allocator( sys1alloc );}
It’s still not very exciting, but one perk you get immediately is that if you haven’t cleaned up properly - if one of the allocators hasn’t freed exactly the same amount of memory that it has allocated, it will assert, letting you know which allocator failed, and how many allocations and the amount of memory it still had allocated. Memory leaks begone. (Well, not gone, but they will certainly be easier to find!)
Of course, allocation tracking and statistics is something you can disable, since it has some performance and memory overhead. Simply #define SRALLOC_DISABLE_STATS before including sralloc.h.
So what does the proxy allocator do? Simple - it forwards any allocations to its backing allocator - in this case, the malloc allocator (we pass it in to sralloc_create_proxy_allocator, see?). And like every other allocator, it collects stats and aligns memory if you so wish.
We used the utility macro SRALLOC_OBJECT. It takes a type as the second parameter, allocates something of its size, and casts the return value. It does NOT initialize the value, and obviously, does not do inplace new (that’s C++ after all) but I intend to add utility macros for that too, since it can be quite nice.
The macro SRALLOC_ARRAY takes a type and a count and allocates an array of that size.
For consistency, there’s also a SRALLOC_BYTES that simply wraps sralloc_alloc, and SRALLOC_DEALLOC that wraps sralloc_dealloc.
For those macros, there are also matching macros that returns aligned pointers, SRALLOC_ALIGNED_BYTES and so on.
As you may have guessed, sralloc_alloc and sralloc_alloc_aligned are the “core” functions that you will call to allocate memory.
There’s one more detail that’s worth mentioning here. There’s also sralloc_alloc_with_size (and aligned) that gives you a struct result back:
typedef struct {void* ptr;srint_t size;} sr_result_t;
Sometimes, an allocator can return more memory than you requested. In some cases you may be able to take advantage of this, and that’s where this comes in.
In Sweden we say that “a beloved child has many names”. I’m not sure where it comes from but it’s certainly true for the Frame allocator. I’ve heard “arena allocator”, “scratch allocator”, “stack allocator”, “frame allocator”, “stack frame allocator”, and “temp allocator”, and as far as I know, they all mean the same thing.
Let’s see how one might be useful.
In the example above, there’s an update loop. A common pattern in games is that memory needs to be allocated during a frame and then only gets used during that frame. This fact can be abused.
Here are some issues you might run into with non-allocator based solutions:
One solution you might try is to malloc some memory, pass the pointer and rely on the receiving system to free it. I would generally consider this a very bad solution - unless you like memory leaks. In my experience, it’s almost always the case that you want the place in the code that deallocates memory to be very close to the code that allocated it.
Another solution is to go full C++ and use something like shared_ptr, but as you well know, you never go full C++. Joking aside, the games industry seem to be moving away from shared_ptrs and the like. We used it on Just Cause 2 and didn’t realize the performance, compile-time, and executable-size implications until too late (don’t ask me for numbers, it was many years ago, I can only say that for a period of time, rebuilding the JC2 code base took 40+ minutes. I don’t know how much of that was due to shared_ptr, but hopefully you can appreciate the operational cost of 50 programmers rolling their thumbs for hours each day, so compile-time costs are nothing to scoff at).
Even if you can malloc and free the pointer inside your system, like this….
void sys1_update(System1* sys) {for (i = 0; i < 1000) {MyObject* obj = malloc(sizeof(MyObject));init_obj(sys, i, obj);sys2_api(obj);free(obj);}}
… it might not be a good solution because heap allocations can be relatively expensive.
Here’s how using a frame allocator would fix the problem:
void main() {// ...srallocator_t* frame_allocator = sralloc_create_frame_allocator("my_frame", mallocalloc, 10000);bool quit = false;while (!quit) {sralloc_frame_allocator_clear(frame_allocator);quit = update_simulation(sim, frame_allocator);render_game(sim, graphics, frame_allocator);}sralloc_destroy_frame_allocator(frame_allocator);// ...}void sys1_update(System1* sys, srallocator_t* frame_allocator) {for (i = 0; i < 1000) {MyObject* obj = SRALLOC_OBJECT(frame_allocator, System2Object);init_obj(sys, i, obj);syst2_api(obj);}}
We create a frame allocator with a predetermined size. Systems are free to allocate memory from it and don’t have to care about freeing it. (In fact, deallocing a stack allocated pointer does nothing!)
So a frame allocator is faster for two reasons:
You could alternatively have a frame allocator for each system that needs it. However, a “global” (or shared) frame allocator will, in all likelyhood, save you memory. You’re sharing the allocator between multiple systems - one system can use more memory one frame while another uses less.
Of course it’s important to allocate enough for the worst-case-scenario, but depending on your game this might be less than the sum of the worst-case-scenario of each individual system. For example, maybe you know that there can be a maximum of 100 space aliens and 50 tentacle monsters, but each spawned tentacle monster eats two space aliens, so there’ll never be a total of 150 enemies.
MIT/PD