Sacado_Fad_MemPoolStorage.hpp

Go to the documentation of this file.

// $Id$ 
// $Source$ 
// @HEADER
// ***********************************************************************
// 
//                           Sacado Package
//                 Copyright (2006) Sandia Corporation
// 
// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation,
// the U.S. Government retains certain rights in this software.
// 
// This library is free software; you can redistribute it and/or modify
// it under the terms of the GNU Lesser General Public License as
// published by the Free Software Foundation; either version 2.1 of the
// License, or (at your option) any later version.
//  
// This library is distributed in the hope that it will be useful, but
// WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
// Lesser General Public License for more details.
//  
// You should have received a copy of the GNU Lesser General Public
// License along with this library; if not, write to the Free Software
// Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307
// USA
// Questions? Contact David M. Gay (dmgay@sandia.gov) or Eric T. Phipps
// (etphipp@sandia.gov).
// 
// ***********************************************************************
// @HEADER

#ifndef SACADO_FAD_MEMPOOLSTORAGE_HPP
#define SACADO_FAD_MEMPOOLSTORAGE_HPP

#include <new>
#include <cstring>

#include "Sacado_Traits.hpp"
#include "Sacado_Fad_MemPool.hpp"

namespace Sacado {

  namespace Fad {

    template <typename T, bool isScalar = IsScalarType<T>::value>
    struct mp_array {

      static inline T* get_and_fill(int sz, MemPool* pool) {
  if (sz) {
    T* m = static_cast<T*>(pool->alloc());
    T* p = m;
    for (int i=0; i<sz; ++i)
      new (p++) T(0.);
    return m;
  }
  else
    return NULL;
      }

      static inline T* get_and_fill(const T* src, int sz, MemPool* pool) {
  if (sz) {
    T* m = static_cast<T*>(pool->alloc());
    T* p = m; 
    for (int i=0; i<sz; ++i)
      new (p++) T(*(src++));
    return m;
  }
  else
    return NULL;
      }

      static inline void copy(const T* src, T*  dest, int sz) {
  for (int i=0; i<sz; ++i)
    *(dest++) = *(src++);
      }

      static inline void zero(T* dest, int sz) {
  for (int i=0; i<sz; ++i)
    *(dest++) = T(0.);
      }

      static inline void destroy_and_release(T* m, int sz, MemPool* pool) {
  T* e = m+sz;
  for (T* b = m; b!=e; b++)
    b->~T();
  pool->free((void*) m);
      }
    };

    template <typename T>
    struct mp_array<T,true> {

      static inline T* get_and_fill(int sz, MemPool* pool) {
  if (sz) {
    T* m = static_cast<T*>(pool->alloc());
    std::memset(m,0,sz*sizeof(T));
    return m;
  }
  else
    return NULL;
      }

      static inline T* get_and_fill(const T* src, int sz, MemPool* pool) {
  if (sz) {
    T* m = static_cast<T*>(pool->alloc());
    T* p = m; 
    for (int i=0; i<sz; ++i)
      new (p++) T(*(src++));
    return m;
  }
  else
    return NULL;
      }

      static inline void copy(const T* src, T* dest, int sz) {
  std::memcpy(dest,src,sz*sizeof(T));
      }

      static inline void zero(T* dest, int sz) {
  if (sz > 0)
    std::memset(dest,0,sz*sizeof(T));
      }

      static inline void destroy_and_release(T* m, int sz, MemPool* pool) {
  pool->free((void*) m);
      }
    };

    template <typename T> 
    class MemPoolStorage {

    public:

      MemPoolStorage(const T & x) : 
  val_(x), sz_(0), len_(0), dx_(NULL), myPool_(defaultPool_) {}


      MemPoolStorage(const int sz, const T & x) : 
  val_(x), sz_(sz), len_(sz), myPool_(defaultPool_) {
  dx_ = mp_array<T>::get_and_fill(sz_, myPool_);
      }

      MemPoolStorage(const MemPoolStorage& x) : 
  val_(x.val_), sz_(x.sz_), len_(x.sz_), myPool_(x.myPool_) {
  dx_ = mp_array<T>::get_and_fill(x.dx_, sz_, myPool_);
      }
      
      ~MemPoolStorage() {
  if (len_ != 0)
    mp_array<T>::destroy_and_release(dx_, len_, myPool_);
      }

      MemPoolStorage& operator=(const MemPoolStorage& x) { 
  val_ = x.val_;
  if (sz_ != x.sz_) {
    sz_ = x.sz_;
    if (x.sz_ > len_) {
      if (len_ != 0)
        mp_array<T>::destroy_and_release(dx_, len_, myPool_);
      len_ = x.sz_;
      myPool_ = x.myPool_;
      dx_ = mp_array<T>::get_and_fill(x.dx_, sz_, myPool_);
    }
    else 
      mp_array<T>::copy(x.dx_, dx_, sz_);
  }
  else 
    mp_array<T>::copy(x.dx_, dx_, sz_);

  return *this; 
      } 

      int size() const { return sz_;}


      void resize(int sz) { 
  if (sz > len_) {
     if (len_ != 0)
      mp_array<T>::destroy_and_release(dx_, len_, myPool_);
    myPool_ = defaultPool_;
    dx_ = mp_array<T>::get_and_fill(sz, myPool_);
    len_ = sz;
  }
  sz_ = sz;
      }


      void expand(int sz) {
        if (sz > len_) {
          T* dx_new = mp_array<T>::get_and_fill(sz, myPool_);
          mp_array<T>::copy(dx_, dx_new, sz_);
          if (len_ > 0)
            mp_array<T>::destroy_and_release(dx_, len_, myPool_);
          dx_ = dx_new;
          len_ = sz;
        }
        else if (sz > sz_) 
          mp_array<T>::zero(dx_+sz_, sz-sz_);
        sz_ = sz;
      }

      void zero() { 
  mp_array<T>::zero(dx_, sz_);
      }

      const T& val() const { return val_; }

      T& val() { return val_; }

      const T* dx() const { return dx_;}

      T dx(int i) const { return sz_ ? dx_[i] : T(0.); }
    
      T& fastAccessDx(int i) { return dx_[i];}

      const T& fastAccessDx(int i) const { return dx_[i];}

    private:

      T val_;

      int sz_;

      int len_;

      T* dx_;

    public:

      static MemPool* defaultPool_;

    protected:

      MemPool* myPool_;

    }; // class MemPoolStorage

  } // namespace Fad

} // namespace Sacado

#endif // SACADO_FAD_MEMPOOLSTORAGE_HPP