/[svn]/linuxsampler/trunk/src/common/Pool.h

Diff of /linuxsampler/trunk/src/common/Pool.h

Parent Directory | Revision Log | View Patch Patch

-revision 554 by schoenebeck,
Thu May 19 19:25:14 2005 UTC
+revision 2335 by persson,
Sat Mar 17 06:19:01 2012 UTC
 Line 3
   *   LinuxSampler - modular, streaming capable sampler                     *
   *                                                                         *
   *   Copyright (C) 2003, 2004 by Benno Senoner and Christian Schoenebeck   *
-  *   Copyright (C) 2005 Christian Schoenebeck                              *
+  *   Copyright (C) 2005 - 2012 Christian Schoenebeck                       *
   *                                                                         *
   *   This program is free software; you can redistribute it and/or modify  *
   *   it under the terms of the GNU General Public License as published by  *
 Line 44
  const std::string __err_msg_iterator_invalidated = "Pool/RTList iterator invalidated";
  #endif // CONFIG_DEVMODE
+ const std::string __err_msg_resize_while_in_use = "Pool::resizePool() ERROR: elements still in use!";
  // just symbol prototyping
  template<typename T> class Pool;
  template<typename T> class RTList;
-Line 260 
 class RTListBase {
+Line 262 
 class RTListBase {
              return _begin.next == &_end;
          }
+         inline int count() {
+             int elements = 0;
+             for (Iterator it = first(); it != end(); ++it) ++elements;
+             return elements;
+         }
      protected:
          Node _begin; // fake node (without data) which represents the begin of the list - not the first element!
          Node _end;   // fake node (without data) which represents the end of the list - not the last element!
          RTListBase() {
+             init();
+         }
+         void init() {
              // initialize boundary nodes
              _begin.prev = &_begin;
              _begin.next = &_end;
-Line 369 
 class RTList : public RTListBase<T> {
+Line 381 
 class RTList : public RTListBase<T> {
          RTList(Pool<T>* pPool) : RTListBase<T>::RTListBase() {
              this->pPool = pPool;
          }
+         /**
+          * Copy constructor
+          */
+         RTList(RTList<T>& list) : RTListBase<T>::RTListBase() {
+             this->pPool = list.pPool;
+             Iterator it = list.first();
+             Iterator end = list.end();
+             for(; it != end; ++it) {
+                 if (poolIsEmpty()) break;
+                 *(allocAppend()) = *it;
+             }
+         }
          virtual ~RTList() {
              clear();
-Line 381 
 class RTList : public RTListBase<T> {
+Line 406 
 class RTList : public RTListBase<T> {
          inline Iterator allocAppend() {
              if (pPool->poolIsEmpty()) return RTListBase<T>::begin();
              Iterator element = pPool->alloc();
-             append(element);
+             this->append(element);
              #if CONFIG_DEVMODE
              element.list = this;
              #endif // CONFIG_DEVMODE
-Line 426 
 class Pool : public RTList<T> {
+Line 451 
 class Pool : public RTList<T> {
          Node*         nodes;
          T*            data;
          RTListBase<T> freelist; // not yet allocated elements
+         int           poolsize;
          Pool(int Elements) : RTList<T>::RTList(this) {
-             data  = new T[Elements];
+             _init(Elements);
-             nodes = new Node[Elements];
-             for (int i = 0; i < Elements; i++) {
-                 nodes[i].data = &data[i];
-                 freelist.append(&nodes[i]);
-             }
          }
          virtual ~Pool() {
-Line 445 
 class Pool : public RTList<T> {
+Line 466 
 class Pool : public RTList<T> {
              return freelist.isEmpty();
          }
+         /**
+          * Returns the current size of the pool, that is the amount of
+          * pre-allocated elements from the operating system. It equals the
+          * amount of elements given to the constructor unless resizePool()
+          * is called.
+          *
+          * @see resizePool()
+          */
+         int poolSize() const {
+             return poolsize;
+         }
+         /**
+          * Alters the amount of elements to be pre-allocated from the
+          * operating system for this pool object.
+          *
+          * @e CAUTION: you MUST free all elements in use before calling this
+          * method ( e.g. by calling clear() )! Also make sure that no
+          * references of elements before this call will still be used after this
+          * call, since all elements will be reallocated and their old memory
+          * addresses become invalid!
+          *
+          * @see poolSize()
+          */
+         void resizePool(int Elements) {
+             if (freelist.count() != poolsize) {
+                 #if CONFIG_DEVMODE
+                 throw std::runtime_error(__err_msg_resize_while_in_use);
+                 #else
+                 std::cerr << __err_msg_resize_while_in_use << std::endl << std::flush;
+                 // if we're here something's terribly wrong, but we try to do the best
+                 RTList<T>::clear();
+                 #endif
+             }
+             if (nodes) delete[] nodes;
+             if (data)  delete[] data;
+             freelist.init();
+             RTListBase<T>::init();
+             _init(Elements);
+         }
      protected:
          // caution: assumes pool (that is freelist) is not empty!
          inline Iterator alloc() {
-Line 462 
 class Pool : public RTList<T> {
+Line 524 
 class Pool : public RTList<T> {
          }
          friend class RTList<T>;
+     private:
+         void _init(int Elements) {
+             data  = new T[Elements];
+             nodes = new Node[Elements];
+             for (int i = 0; i < Elements; i++) {
+                 nodes[i].data = &data[i];
+                 freelist.append(&nodes[i]);
+             }
+             poolsize = Elements;
+         }
  };
  #endif // __LS_POOL_H__

 Legend:



Removed from v.554
 


changed lines


 
Added in v.2335
 Legend:



Removed from v.554
 


changed lines


 
Added in v.2335
-Removed from v.554
+Added in v.2335

	ViewVC Help
Powered by ViewVC