Something went wrong. Try again.
This repository has no description
Something went wrong. Try again.
22 kB · 679 lines
C++
at develop
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680/* -*- mode: C++; c-basic-offset: 2; indent-tabs-mode: nil -*- *//* * Main authors: * Christian Schulte <schulte@gecode.org> * * Copyright: * Christian Schulte, 2008 * * This file is part of Gecode, the generic constraint * development environment: * http://www.gecode.org * * Permission is hereby granted, free of charge, to any person obtaining * a copy of this software and associated documentation files (the * "Software"), to deal in the Software without restriction, including * without limitation the rights to use, copy, modify, merge, publish, * distribute, sublicense, and/or sell copies of the Software, and to * permit persons to whom the Software is furnished to do so, subject to * the following conditions: * * The above copyright notice and this permission notice shall be * included in all copies or substantial portions of the Software. * * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE * LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION * OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION * WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. * */
#include <cstring>#include <cstdlib>#include <algorithm>
#ifdef GECODE_PEAKHEAP_MALLOC_H#include <malloc.h>#endif
#ifdef GECODE_PEAKHEAP_MALLOC_MALLOC_H#include <malloc/malloc.h>#endif
namespace Gecode {
/** * \defgroup FuncMemHeap %Heap memory management * * \ingroup FuncMem */
/** * \brief %Heap memory management class * * All routines throw an exception of MemoryExhausted, if a request * cannot be fulfilled. * \ingroup FuncMemHeap */ class Heap { public: /// Default constructor (ensuring that only a single instance is created) Heap(void); /// \name Typed allocation routines //@{ /** * \brief Allocate block of \a n objects of type \a T from heap * * Note that this function implements C++ semantics: the default * constructor of \a T is run for all \a n objects. */ template<class T> T* alloc(long unsigned int n); /** * \brief Allocate block of \a n objects of type \a T from heap * * Note that this function implements C++ semantics: the default * constructor of \a T is run for all \a n objects. */ template<class T> T* alloc(long int n); /** * \brief Allocate block of \a n objects of type \a T from heap * * Note that this function implements C++ semantics: the default * constructor of \a T is run for all \a n objects. */ template<class T> T* alloc(unsigned int n); /** * \brief Allocate block of \a n objects of type \a T from heap * * Note that this function implements C++ semantics: the default * constructor of \a T is run for all \a n objects. */ template<class T> T* alloc(int n); /** * \brief Delete \a n objects starting at \a b * * Note that this function implements C++ semantics: the destructor * of \a T is run for all \a n objects. */ template<class T> void free(T* b, long unsigned int n); /** * \brief Delete \a n objects starting at \a b * * Note that this function implements C++ semantics: the destructor * of \a T is run for all \a n objects. */ template<class T> void free(T* b, long int n); /** * \brief Delete \a n objects starting at \a b * * Note that this function implements C++ semantics: the destructor * of \a T is run for all \a n objects. */ template<class T> void free(T* b, unsigned int n); /** * \brief Delete \a n objects starting at \a b * * Note that this function implements C++ semantics: the destructor * of \a T is run for all \a n objects. */ template<class T> void free(T* b, int n); /** * \brief Reallocate block of \a n objects starting at \a b to \a m objects of type \a T from heap * * Note that this function implements C++ semantics: the copy constructor * of \a T is run for all \f$\min(n,m)\f$ objects, the default * constructor of \a T is run for all remaining * \f$\max(n,m)-\min(n,m)\f$ objects, and the destrucor of \a T is * run for all \a n objects in \a b. * * Returns the address of the new block. */ template<class T> T* realloc(T* b, long unsigned int n, long unsigned int m); /** * \brief Reallocate block of \a n objects starting at \a b to \a m objects of type \a T from heap * * Note that this function implements C++ semantics: the copy constructor * of \a T is run for all \f$\min(n,m)\f$ objects, the default * constructor of \a T is run for all remaining * \f$\max(n,m)-\min(n,m)\f$ objects, and the destrucor of \a T is * run for all \a n objects in \a b. * * Returns the address of the new block. */ template<class T> T* realloc(T* b, long int n, long int m); /** * \brief Reallocate block of \a n objects starting at \a b to \a m objects of type \a T from heap * * Note that this function implements C++ semantics: the copy constructor * of \a T is run for all \f$\min(n,m)\f$ objects, the default * constructor of \a T is run for all remaining * \f$\max(n,m)-\min(n,m)\f$ objects, and the destrucor of \a T is * run for all \a n objects in \a b. * * Returns the address of the new block. */ template<class T> T* realloc(T* b, unsigned int n, unsigned int m); /** * \brief Reallocate block of \a n objects starting at \a b to \a m objects of type \a T from heap * * Note that this function implements C++ semantics: the copy constructor * of \a T is run for all \f$\min(n,m)\f$ objects, the default * constructor of \a T is run for all remaining * \f$\max(n,m)-\min(n,m)\f$ objects, and the destrucor of \a T is * run for all \a n objects in \a b. * * Returns the address of the new block. */ template<class T> T* realloc(T* b, int n, int m); /** * \brief Reallocate block of \a n pointers starting at \a b to \a m objects of type \a T* from heap * * Returns the address of the new block. * * This is a specialization for performance. */ template<class T> T** realloc(T** b, long unsigned int n, long unsigned int m); /** * \brief Reallocate block of \a n pointers starting at \a b to \a m objects of type \a T* from heap * * Returns the address of the new block. * * This is a specialization for performance. */ template<class T> T** realloc(T** b, long int n, long int m); /** * \brief Reallocate block of \a n pointers starting at \a b to \a m objects of type \a T* from heap * * Returns the address of the new block. * * This is a specialization for performance. */ template<class T> T** realloc(T** b, unsigned int n, unsigned int m); /** * \brief Reallocate block of \a n pointers starting at \a b to \a m objects of type \a T* from heap * * Returns the address of the new block. * * This is a specialization for performance. */ template<class T> T** realloc(T** b, int n, int m); /** * \brief Copy \a n objects starting at \a s to \a d * * Note that this function implements C++ semantics: the assignment * operator of \a T is run for all \a n objects. * * Returns \a d. */ template<class T> static T* copy(T* d, const T* s, long unsigned int n); /** * \brief Copy \a n objects starting at \a s to \a d * * Note that this function implements C++ semantics: the assignment * operator of \a T is run for all \a n objects. * * Returns \a d. */ template<class T> static T* copy(T* d, const T* s, long int n); /** * \brief Copy \a n objects starting at \a s to \a d * * Note that this function implements C++ semantics: the assignment * operator of \a T is run for all \a n objects. * * Returns \a d. */ template<class T> static T* copy(T* d, const T* s, unsigned int n); /** * \brief Copy \a n objects starting at \a s to \a d * * Note that this function implements C++ semantics: the assignment * operator of \a T is run for all \a n objects. * * Returns \a d. */ template<class T> static T* copy(T* d, const T* s, int n); /** * \brief Copy \a n pointers starting at \a s to \a d * * Returns \a d. * * This is a specialization for performance. */ template<class T> static T** copy(T** d, const T** s, long unsigned int n); /** * \brief Copy \a n pointers starting at \a s to \a d * * Returns \a d. * * This is a specialization for performance. */ template<class T> static T** copy(T** d, const T** s, long int n); /** * \brief Copy \a n pointers starting at \a s to \a d * * Returns \a d. * * This is a specialization for performance. */ template<class T> static T** copy(T** d, const T** s, unsigned int n); /** * \brief Copy \a n pointers starting at \a s to \a d * * Returns \a d. * * This is a specialization for performance. */ template<class T> static T** copy(T** d, const T** s, int n); //@} /// \name Raw allocation routines //@{ /// Allocate \a s bytes from heap void* ralloc(size_t s); /// Free memory block starting at \a p void rfree(void* p); /// Free memory block starting at \a p with size \a s void rfree(void* p, size_t s); /// Change memory block starting at \a p to size \a s void* rrealloc(void* p, size_t s); //@}#ifdef GECODE_PEAKHEAP private: /// Mutex for accessing heap size Support::FastMutex _m; /// Peak heap size size_t _peak; /// Current heap size size_t _cur;public: size_t peak(void);#endif /// Allocate memory from heap (disabled) static void* operator new(size_t s) = delete; /// Free memory allocated from heap (disabled) static void operator delete(void* p) = delete; /// Copy constructor (disabled) Heap(const Heap&) = delete; /// Assignment operator (disabled) const Heap& operator =(const Heap&) = delete; };
/** * \brief The single global heap * \ingroup FuncMemHeap */ extern GECODE_SUPPORT_EXPORT Heap heap;
/** * \brief Base class for heap allocated objects * \ingroup FuncMemHeap */ class GECODE_SUPPORT_EXPORT HeapAllocated { public: /// Memory management //@{ /// Allocate memory from heap static void* operator new(size_t s); /// Free memory allocated from heap static void operator delete(void* p); //@} };
/* * Wrappers for raw allocation routines * */ forceinline void* Heap::ralloc(size_t s) { void* p = Support::allocator.alloc(s);#ifdef GECODE_PEAKHEAP _m.acquire(); _cur += GECODE_MSIZE(p); _peak = std::max(_peak,_cur); _m.release();#endif if (p != nullptr) return p; throw MemoryExhausted(); }
forceinline void Heap::rfree(void* p) {#ifdef GECODE_PEAKHEAP _m.acquire(); _cur -= GECODE_MSIZE(p); _m.release();#endif Support::allocator.free(p); }
forceinline void Heap::rfree(void* p, size_t) {#ifdef GECODE_PEAKHEAP _m.acquire(); _cur -= GECODE_MSIZE(p); _m.release();#endif Support::allocator.free(p); }
forceinline void* Heap::rrealloc(void* p, size_t s) {#ifdef GECODE_PEAKHEAP _m.acquire(); _cur -= GECODE_MSIZE(p); _m.release();#endif p = Support::allocator.realloc(p,s);#ifdef GECODE_PEAKHEAP _m.acquire(); _cur += GECODE_MSIZE(p); _peak = std::max(_peak,_cur); _m.release();#endif if (p != nullptr || s == 0) return p; throw MemoryExhausted(); }
/* * Heap allocated objects * */ forceinline void* HeapAllocated::operator new(size_t s) { return heap.ralloc(s); } forceinline void HeapAllocated::operator delete(void* p) { heap.rfree(p); }
/* * Typed allocation routines * */ template<class T> forceinline T* Heap::alloc(long unsigned int n) { T* p = static_cast<T*>(ralloc(sizeof(T)*n)); for (long unsigned int i=0U; i<n; i++) (void) new (p+i) T(); return p; } template<class T> forceinline T* Heap::alloc(long int n) { assert(n >= 0); return alloc<T>(static_cast<long unsigned int>(n)); } template<class T> forceinline T* Heap::alloc(unsigned int n) { return alloc<T>(static_cast<long unsigned int>(n)); } template<class T> forceinline T* Heap::alloc(int n) { assert(n >= 0); return alloc<T>(static_cast<long unsigned int>(n)); }
template<class T> forceinline void Heap::free(T* b, long unsigned int n) { for (long unsigned int i=0U; i<n; i++) b[i].~T(); rfree(b); } template<class T> forceinline void Heap::free(T* b, long int n) { assert(n >= 0); free<T>(b, static_cast<long unsigned int>(n)); } template<class T> forceinline void Heap::free(T* b, unsigned int n) { free<T>(b, static_cast<long unsigned int>(n)); } template<class T> forceinline void Heap::free(T* b, int n) { assert(n >= 0); free<T>(b, static_cast<long unsigned int>(n)); }
template<class T> forceinline T* Heap::realloc(T* b, long unsigned int n, long unsigned int m) { if (n == m) return b; T* p = static_cast<T*>(ralloc(sizeof(T)*m)); for (long unsigned int i=0U; i<std::min(n,m); i++) (void) new (p+i) T(b[i]); for (long unsigned int i=n; i<m; i++) (void) new (p+i) T(); free<T>(b,n); return p; } template<class T> forceinline T* Heap::realloc(T* b, long int n, long int m) { assert((n >= 0) && (m >= 0)); return realloc<T>(b,static_cast<long unsigned int>(n), static_cast<long unsigned int>(m)); } template<class T> forceinline T* Heap::realloc(T* b, unsigned int n, unsigned int m) { return realloc<T>(b,static_cast<long unsigned int>(n), static_cast<long unsigned int>(m)); } template<class T> forceinline T* Heap::realloc(T* b, int n, int m) { assert((n >= 0) && (m >= 0)); return realloc<T>(b,static_cast<long unsigned int>(n), static_cast<long unsigned int>(m)); }
#define GECODE_SUPPORT_REALLOC(T) \ template<> \ forceinline T* \ Heap::realloc<T>(T* b, long unsigned int, long unsigned int m) { \ return static_cast<T*>(rrealloc(b,m*sizeof(T))); \ } \ template<> \ forceinline T* \ Heap::realloc<T>(T* b, long int n, long int m) { \ assert((n >= 0) && (m >= 0)); \ return realloc<T>(b,static_cast<long unsigned int>(n), \ static_cast<long unsigned int>(m)); \ } \ template<> \ forceinline T* \ Heap::realloc<T>(T* b, unsigned int n, unsigned int m) { \ return realloc<T>(b,static_cast<long unsigned int>(n), \ static_cast<long unsigned int>(m)); \ } \ template<> \ forceinline T* \ Heap::realloc<T>(T* b, int n, int m) { \ assert((n >= 0) && (m >= 0)); \ return realloc<T>(b,static_cast<long unsigned int>(n), \ static_cast<long unsigned int>(m)); \ }
GECODE_SUPPORT_REALLOC(bool) GECODE_SUPPORT_REALLOC(signed char) GECODE_SUPPORT_REALLOC(unsigned char) GECODE_SUPPORT_REALLOC(signed short int) GECODE_SUPPORT_REALLOC(unsigned short int) GECODE_SUPPORT_REALLOC(signed int) GECODE_SUPPORT_REALLOC(unsigned int) GECODE_SUPPORT_REALLOC(signed long int) GECODE_SUPPORT_REALLOC(unsigned long int) GECODE_SUPPORT_REALLOC(float) GECODE_SUPPORT_REALLOC(double)
#undef GECODE_SUPPORT_REALLOC
template<class T> forceinline T** Heap::realloc(T** b, long unsigned int, long unsigned int m) { return static_cast<T**>(rrealloc(b,m*sizeof(T*))); } template<class T> forceinline T** Heap::realloc(T** b, long int n, long int m) { assert((n >= 0) && (m >= 0)); return realloc<T*>(b,static_cast<long unsigned int>(n), static_cast<long unsigned int>(m)); } template<class T> forceinline T** Heap::realloc(T** b, unsigned int n, unsigned int m) { return realloc<T*>(b,static_cast<long unsigned int>(n), static_cast<long unsigned int>(m)); } template<class T> forceinline T** Heap::realloc(T** b, int n, int m) { assert((n >= 0) && (m >= 0)); return realloc<T*>(b,static_cast<long unsigned int>(n), static_cast<long unsigned int>(m)); }
template<class T> forceinline T* Heap::copy(T* d, const T* s, long unsigned int n) { for (long unsigned int i=0U; i<n; i++) d[i]=s[i]; return d; } template<class T> forceinline T* Heap::copy(T* d, const T* s, long int n) { assert(n >= 0); return copy<T>(d,s,static_cast<long unsigned int>(n)); } template<class T> forceinline T* Heap::copy(T* d, const T* s, unsigned int n) { return copy<T>(d,s,static_cast<long unsigned int>(n)); } template<class T> forceinline T* Heap::copy(T* d, const T* s, int n) { assert(n >= 0); return copy<T>(d,s,static_cast<long unsigned int>(n)); }
#define GECODE_SUPPORT_COPY(T) \ template<> \ forceinline T* \ Heap::copy(T* d, const T* s, long unsigned int n) { \ return static_cast<T*>(Support::allocator.memcpy(d,s,n*sizeof(T))); \ } \ template<> \ forceinline T* \ Heap::copy(T* d, const T* s, long int n) { \ assert(n >= 0); \ return copy<T>(d,s,static_cast<long unsigned int>(n)); \ } \ template<> \ forceinline T* \ Heap::copy(T* d, const T* s, unsigned int n) { \ return copy<T>(d,s,static_cast<long unsigned int>(n)); \ } \ template<> \ forceinline T* \ Heap::copy(T* d, const T* s, int n) { \ assert(n >= 0); \ return copy<T>(d,s,static_cast<long unsigned int>(n)); \ }
GECODE_SUPPORT_COPY(bool) GECODE_SUPPORT_COPY(signed char) GECODE_SUPPORT_COPY(unsigned char) GECODE_SUPPORT_COPY(signed short int) GECODE_SUPPORT_COPY(unsigned short int) GECODE_SUPPORT_COPY(signed int) GECODE_SUPPORT_COPY(unsigned int) GECODE_SUPPORT_COPY(signed long int) GECODE_SUPPORT_COPY(unsigned long int) GECODE_SUPPORT_COPY(float) GECODE_SUPPORT_COPY(double)
#undef GECODE_SUPPORT_COPY
template<class T> forceinline T** Heap::copy(T** d, const T** s, long unsigned int n) { return static_cast<T**>(Support::allocator.memcpy(d,s,n*sizeof(T*))); } template<class T> forceinline T** Heap::copy(T** d, const T** s, long int n) { assert(n >= 0); return copy<T*>(d,s,static_cast<long unsigned int>(n)); } template<class T> forceinline T** Heap::copy(T** d, const T** s, unsigned int n) { return copy<T*>(d,s,static_cast<long unsigned int>(n)); } template<class T> forceinline T** Heap::copy(T** d, const T** s, int n) { assert(n >= 0); return copy<T*>(d,s,static_cast<long unsigned int>(n)); }
#ifdef GECODE_PEAKHEAP forceinline size_t Heap::peak(void) { _m.acquire(); size_t ret = _peak; _m.release(); return ret; }#endif
}
// STATISTICS: support-any