Memory_Pool.h

Go to the documentation of this file.

#include <list>

class Memory_Pool {
public:

  Memory_Pool (std::size_t block_size, std::size_t num_blocks)
    : memory_block_ (::operator new (block_size * num_blocks)),
      block_size_ (block_size),
      num_blocks_ (num_blocks)
  {
    for (std::size_t i = 0; i < num_blocks; i++)
      {
        void *block = static_cast<char*>(memory_block_) + i*block_size;
        free_list_.push_back (block);
     }
  }
  
  void *acquire (size_t size)
  {
    if (size > block_size_)
      {
        // if blocks larger than the supported size
        // are tried to acquire, throw bad_alloc
        throw std::bad_alloc ();
      }
    else
      {   
        void *acquired_block = free_list_.front ();
        free_list_.pop_front ();
           return acquired_block;
      }
   }
  
  void release (void *block)
  {
    free_list_.push_back (block);
  }
  
  
private:
  void *memory_block_;
  std::size_t block_size_;
  std::size_t num_blocks_;
  std::list<void *> free_list_;
};

These pages document the source code of the patterns Lookup, Eager Acquisition, and Leasing.

Copyright 2004 John Wiley and Sons. All Rights Reserved.