|
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314 |
- /*
- ==============================================================================
-
- This file is part of the JUCE library.
- Copyright (c) 2016 - ROLI Ltd.
-
- Permission is granted to use this software under the terms of the ISC license
- http://www.isc.org/downloads/software-support-policy/isc-license/
-
- Permission to use, copy, modify, and/or distribute this software for any
- purpose with or without fee is hereby granted, provided that the above
- copyright notice and this permission notice appear in all copies.
-
- THE SOFTWARE IS PROVIDED "AS IS" AND ISC DISCLAIMS ALL WARRANTIES WITH REGARD
- TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY AND
- FITNESS. IN NO EVENT SHALL ISC BE LIABLE FOR ANY SPECIAL, DIRECT, INDIRECT,
- OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF
- USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER
- TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE
- OF THIS SOFTWARE.
-
- -----------------------------------------------------------------------------
-
- To release a closed-source product which uses other parts of JUCE not
- licensed under the ISC terms, commercial licenses are available: visit
- www.juce.com for more information.
-
- ==============================================================================
- */
-
- #ifndef JUCE_HEAPBLOCK_H_INCLUDED
- #define JUCE_HEAPBLOCK_H_INCLUDED
-
- #if ! (defined (DOXYGEN) || JUCE_EXCEPTIONS_DISABLED)
- namespace HeapBlockHelper
- {
- template <bool shouldThrow>
- struct ThrowOnFail { static void checkPointer (void*) {} };
-
- template<>
- struct ThrowOnFail<true> { static void checkPointer (void* data) { if (data == nullptr) throw std::bad_alloc(); } };
- }
- #endif
-
- //==============================================================================
- /**
- Very simple container class to hold a pointer to some data on the heap.
-
- When you need to allocate some heap storage for something, always try to use
- this class instead of allocating the memory directly using malloc/free.
-
- A HeapBlock<char> object can be treated in pretty much exactly the same way
- as an char*, but as long as you allocate it on the stack or as a class member,
- it's almost impossible for it to leak memory.
-
- It also makes your code much more concise and readable than doing the same thing
- using direct allocations,
-
- E.g. instead of this:
- @code
- int* temp = (int*) malloc (1024 * sizeof (int));
- memcpy (temp, xyz, 1024 * sizeof (int));
- free (temp);
- temp = (int*) calloc (2048 * sizeof (int));
- temp[0] = 1234;
- memcpy (foobar, temp, 2048 * sizeof (int));
- free (temp);
- @endcode
-
- ..you could just write this:
- @code
- HeapBlock<int> temp (1024);
- memcpy (temp, xyz, 1024 * sizeof (int));
- temp.calloc (2048);
- temp[0] = 1234;
- memcpy (foobar, temp, 2048 * sizeof (int));
- @endcode
-
- The class is extremely lightweight, containing only a pointer to the
- data, and exposes malloc/realloc/calloc/free methods that do the same jobs
- as their less object-oriented counterparts. Despite adding safety, you probably
- won't sacrifice any performance by using this in place of normal pointers.
-
- The throwOnFailure template parameter can be set to true if you'd like the class
- to throw a std::bad_alloc exception when an allocation fails. If this is false,
- then a failed allocation will just leave the heapblock with a null pointer (assuming
- that the system's malloc() function doesn't throw).
-
- @see Array, OwnedArray, MemoryBlock
- */
- template <class ElementType, bool throwOnFailure = false>
- class HeapBlock
- {
- public:
- //==============================================================================
- /** Creates a HeapBlock which is initially just a null pointer.
-
- After creation, you can resize the array using the malloc(), calloc(),
- or realloc() methods.
- */
- HeapBlock() noexcept : data (nullptr)
- {
- }
-
- /** Creates a HeapBlock containing a number of elements.
-
- The contents of the block are undefined, as it will have been created by a
- malloc call.
-
- If you want an array of zero values, you can use the calloc() method or the
- other constructor that takes an InitialisationState parameter.
- */
- explicit HeapBlock (const size_t numElements)
- : data (static_cast<ElementType*> (std::malloc (numElements * sizeof (ElementType))))
- {
- throwOnAllocationFailure();
- }
-
- /** Creates a HeapBlock containing a number of elements.
-
- The initialiseToZero parameter determines whether the new memory should be cleared,
- or left uninitialised.
- */
- HeapBlock (const size_t numElements, const bool initialiseToZero)
- : data (static_cast<ElementType*> (initialiseToZero
- ? std::calloc (numElements, sizeof (ElementType))
- : std::malloc (numElements * sizeof (ElementType))))
- {
- throwOnAllocationFailure();
- }
-
- /** Destructor.
- This will free the data, if any has been allocated.
- */
- ~HeapBlock()
- {
- std::free (data);
- }
-
- #if JUCE_COMPILER_SUPPORTS_MOVE_SEMANTICS
- HeapBlock (HeapBlock&& other) noexcept
- : data (other.data)
- {
- other.data = nullptr;
- }
-
- HeapBlock& operator= (HeapBlock&& other) noexcept
- {
- std::swap (data, other.data);
- return *this;
- }
- #endif
-
- //==============================================================================
- /** Returns a raw pointer to the allocated data.
- This may be a null pointer if the data hasn't yet been allocated, or if it has been
- freed by calling the free() method.
- */
- inline operator ElementType*() const noexcept { return data; }
-
- /** Returns a raw pointer to the allocated data.
- This may be a null pointer if the data hasn't yet been allocated, or if it has been
- freed by calling the free() method.
- */
- inline ElementType* getData() const noexcept { return data; }
-
- /** Returns a void pointer to the allocated data.
- This may be a null pointer if the data hasn't yet been allocated, or if it has been
- freed by calling the free() method.
- */
- inline operator void*() const noexcept { return static_cast<void*> (data); }
-
- /** Returns a void pointer to the allocated data.
- This may be a null pointer if the data hasn't yet been allocated, or if it has been
- freed by calling the free() method.
- */
- inline operator const void*() const noexcept { return static_cast<const void*> (data); }
-
- /** Lets you use indirect calls to the first element in the array.
- Obviously this will cause problems if the array hasn't been initialised, because it'll
- be referencing a null pointer.
- */
- inline ElementType* operator->() const noexcept { return data; }
-
- /** Returns a reference to one of the data elements.
- Obviously there's no bounds-checking here, as this object is just a dumb pointer and
- has no idea of the size it currently has allocated.
- */
- template <typename IndexType>
- inline ElementType& operator[] (IndexType index) const noexcept { return data [index]; }
-
- /** Returns a pointer to a data element at an offset from the start of the array.
- This is the same as doing pointer arithmetic on the raw pointer itself.
- */
- template <typename IndexType>
- inline ElementType* operator+ (IndexType index) const noexcept { return data + index; }
-
- //==============================================================================
- /** Compares the pointer with another pointer.
- This can be handy for checking whether this is a null pointer.
- */
- inline bool operator== (const ElementType* const otherPointer) const noexcept { return otherPointer == data; }
-
- /** Compares the pointer with another pointer.
- This can be handy for checking whether this is a null pointer.
- */
- inline bool operator!= (const ElementType* const otherPointer) const noexcept { return otherPointer != data; }
-
- //==============================================================================
- /** Allocates a specified amount of memory.
-
- This uses the normal malloc to allocate an amount of memory for this object.
- Any previously allocated memory will be freed by this method.
-
- The number of bytes allocated will be (newNumElements * elementSize). Normally
- you wouldn't need to specify the second parameter, but it can be handy if you need
- to allocate a size in bytes rather than in terms of the number of elements.
-
- The data that is allocated will be freed when this object is deleted, or when you
- call free() or any of the allocation methods.
- */
- void malloc (const size_t newNumElements, const size_t elementSize = sizeof (ElementType))
- {
- std::free (data);
- data = static_cast<ElementType*> (std::malloc (newNumElements * elementSize));
- throwOnAllocationFailure();
- }
-
- /** Allocates a specified amount of memory and clears it.
- This does the same job as the malloc() method, but clears the memory that it allocates.
- */
- void calloc (const size_t newNumElements, const size_t elementSize = sizeof (ElementType))
- {
- std::free (data);
- data = static_cast<ElementType*> (std::calloc (newNumElements, elementSize));
- throwOnAllocationFailure();
- }
-
- /** Allocates a specified amount of memory and optionally clears it.
- This does the same job as either malloc() or calloc(), depending on the
- initialiseToZero parameter.
- */
- void allocate (const size_t newNumElements, bool initialiseToZero)
- {
- std::free (data);
- data = static_cast<ElementType*> (initialiseToZero
- ? std::calloc (newNumElements, sizeof (ElementType))
- : std::malloc (newNumElements * sizeof (ElementType)));
- throwOnAllocationFailure();
- }
-
- /** Re-allocates a specified amount of memory.
-
- The semantics of this method are the same as malloc() and calloc(), but it
- uses realloc() to keep as much of the existing data as possible.
- */
- void realloc (const size_t newNumElements, const size_t elementSize = sizeof (ElementType))
- {
- data = static_cast<ElementType*> (data == nullptr ? std::malloc (newNumElements * elementSize)
- : std::realloc (data, newNumElements * elementSize));
- throwOnAllocationFailure();
- }
-
- /** Frees any currently-allocated data.
- This will free the data and reset this object to be a null pointer.
- */
- void free() noexcept
- {
- std::free (data);
- data = nullptr;
- }
-
- /** Swaps this object's data with the data of another HeapBlock.
- The two objects simply exchange their data pointers.
- */
- template <bool otherBlockThrows>
- void swapWith (HeapBlock<ElementType, otherBlockThrows>& other) noexcept
- {
- std::swap (data, other.data);
- }
-
- /** This fills the block with zeros, up to the number of elements specified.
- Since the block has no way of knowing its own size, you must make sure that the number of
- elements you specify doesn't exceed the allocated size.
- */
- void clear (size_t numElements) noexcept
- {
- zeromem (data, sizeof (ElementType) * numElements);
- }
-
- /** This typedef can be used to get the type of the heapblock's elements. */
- typedef ElementType Type;
-
- private:
- //==============================================================================
- ElementType* data;
-
- void throwOnAllocationFailure() const
- {
- #if JUCE_EXCEPTIONS_DISABLED
- jassert (data != nullptr); // without exceptions, you'll need to find a better way to handle this failure case.
- #else
- HeapBlockHelper::ThrowOnFail<throwOnFailure>::checkPointer (data);
- #endif
- }
-
- #if ! (defined (JUCE_DLL) || defined (JUCE_DLL_BUILD))
- JUCE_DECLARE_NON_COPYABLE (HeapBlock)
- JUCE_PREVENT_HEAP_ALLOCATION // Creating a 'new HeapBlock' would be missing the point!
- #endif
- };
-
-
- #endif // JUCE_HEAPBLOCK_H_INCLUDED
|