4 ms·
Exactly. Also using a vector as underlying storage instead of sets of fixed size memory chunks seems not ideal to say the least.
by gpderetta 7y ago
Exactly. Also using a vector as underlying storage instead of sets of fixed size memory chunks seems not ideal to say the least.
- jokoon 7y agoI often read that when in doubt, use a vector. It has its disadvantages, but for performance it's usually okay. Simplicity can be a good choice.
- exDM69 7y agoSound advise for general purpose programming but not for (high end) games. Especially these days with multi-threaded game engines, a call to malloc() (e.g. from vector resizing) may attempt to grab a contended mutex and end up waiting until it misses its frame. Modern game engines use a combination of memory management techniques which are tuned for different use cases. For example: large, persistent blocks of memory are allocated ahead of time. Small, transient objects are allocated from a thread-local, per-frame pool and they're never freed explicitly (at the end of the frame, memory will be reclaimed for reuse). Most game engines don't use the C++ standard library containers at all in the first place. There are gamedev-flavored STL variants like EASTL, though.
- jokoon 7y agoFor triple-A game engines attuned to work on console hardware, sure, but they're really sophisticated optimizations. The STL is fine for a lot of things in gamedev. Object pools are not so hard to implement, the only thing a object pool really does is to reduce memory allocation and de-allocation delays while keeping the O(1) random access. It's just a strategy for allocating and accessing memory properly. It sounds like premature optimization, and it often is, because those strategies are not really trivial to use or implement.
- krona 7y agoExcept that std::vector can be specialized with custom arena allocators, which isn't uncommon in performance sensitive applications.
- gpderetta 7y agostd vector needs to be countiguous, so you cannot use a segmented storage.
- krona 7y agoMost applications need more than one vector. Management of this with custom allocators pays dividends fairly quickly.
- gpderetta 7y agoSorry, there is some confusion here. The OP is literally implementing a custom allocator. I'm saying that using std::vector for the backing store of your allocator is wrong because resizing will invalidate your already allocated objects (which is a no-can-do in a general purpose allocator) and the copying is wasteful. A custom fixed size chunk based allocator woud be better.