alloc_utils.h 2.61 KB
Newer Older
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94
/*
 *  This file is part of libcxxsupport.
 *
 *  libcxxsupport is free software; you can redistribute it and/or modify
 *  it under the terms of the GNU General Public License as published by
 *  the Free Software Foundation; either version 2 of the License, or
 *  (at your option) any later version.
 *
 *  libcxxsupport 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 General Public License for more details.
 *
 *  You should have received a copy of the GNU General Public License
 *  along with libcxxsupport; if not, write to the Free Software
 *  Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA  02110-1301  USA
 */

/*
 *  libcxxsupport is being developed at the Max-Planck-Institut fuer Astrophysik
 *  and financially supported by the Deutsches Zentrum fuer Luft- und Raumfahrt
 *  (DLR).
 */

/*! \file alloc_utils.h
 *  Classes providing raw memory allocation and deallocation support.
 *
 *  Copyright (C) 2011-2015 Max-Planck-Society
 *  \author Martin Reinecke
 */

#ifndef PLANCK_ALLOC_UTILS_H
#define PLANCK_ALLOC_UTILS_H

#include <cstdlib>
#include <cstddef>
#include "datatypes.h"

template <typename T> class normalAlloc__
  {
  public:
    static T *alloc(tsize sz) { return (sz>0) ? new T[sz] : 0; }
    static void dealloc (T *ptr) { delete[] ptr; }
  };

template <typename T, int align> class alignAlloc__
  {
  private:
//#if (__cplusplus>=201103L)
//    enum { max_nat_align = alignof(std::max_align_t) };
//#else
    enum { max_nat_align = sizeof(void *) };
//#endif

  public:
    static T *alloc(tsize sz)
      {
      using namespace std;
      if (sz==0) return 0;
      planck_assert((align&(align-1))==0,"alignment must be power of 2");
      void *res;
      if (align<=max_nat_align)
        {
        res=malloc(sz*sizeof(T));
        planck_assert(res!=0,"error in malloc()");
        }
      else
        {
        tsize overhead=align-1+sizeof(void*);
        void *ptr=malloc(sz*sizeof(T)+overhead);
        planck_assert(ptr!=0,"error in malloc()");
        tsize sptr=reinterpret_cast<tsize>(ptr);
        sptr = (sptr+overhead) & ~(align-1);
        void **ptr2 = reinterpret_cast<void **>(sptr);
        ptr2[-1]=ptr;
        res=ptr2;
        }
      return static_cast<T *>(res);
      }
    static void dealloc(T *ptr)
      {
      using namespace std;
      if (align<=max_nat_align)
        free(ptr);
      else
        {
        if (ptr==0) return;
        void **ptr2 = reinterpret_cast<void **>(ptr);
        free (ptr2[-1]);
        }
      }
  };

#endif