I'm trying to design the internal mechanics of a simple embedded application. Chunks of data arrive on the network which need to be delivered to components determined by an addressing mechanism. Multiple components may subscribe to the same address. I want to design an architecture where incoming chunks are encapsulated into wrapper objects allocated from a memory pool. Each component might hold onto the wrappers (and the data inside them) as long as they need and it should be freed when all components let go of it. At that time it's returned to the pool and again ready to be allocated. The pool exhausting is not a concern.
I plan to use this memory pool implementation which satisfies Allocator. For the automatic destruction of wrapper objects I plan to use std::shared_ptr
so when all components free the wrapper, it is automatically destroyed and the used memory returned to the pool.
What I don't see is how these two concepts can come together. If I allocate memory from the pool directly (by calling allocate()
), it would give me a pointer to the block of data which is fine but then how will deallocate()
be called automatically? Or do I need to use another container for my wrapper objects like std::list
and pass it the memory pool allocator?
Aucun commentaire:
Enregistrer un commentaire