2015-10-09 22:03:35 +02:00
|
|
|
/*
|
|
|
|
* The copyright in this software is being made available under the 2-clauses
|
|
|
|
* BSD License, included below. This software may be subject to other third
|
|
|
|
* party and contributor rights, including patent rights, and no such rights
|
|
|
|
* are granted under this license.
|
|
|
|
*
|
|
|
|
* Copyright (c) 2015, Mathieu Malaterre <mathieu.malaterre@gmail.com>
|
2015-10-17 02:16:17 +02:00
|
|
|
* Copyright (c) 2015, Matthieu Darbois
|
2015-10-09 22:03:35 +02:00
|
|
|
* All rights reserved.
|
|
|
|
*
|
|
|
|
* Redistribution and use in source and binary forms, with or without
|
|
|
|
* modification, are permitted provided that the following conditions
|
|
|
|
* are met:
|
|
|
|
* 1. Redistributions of source code must retain the above copyright
|
|
|
|
* notice, this list of conditions and the following disclaimer.
|
|
|
|
* 2. Redistributions in binary form must reproduce the above copyright
|
|
|
|
* notice, this list of conditions and the following disclaimer in the
|
|
|
|
* documentation and/or other materials provided with the distribution.
|
|
|
|
*
|
|
|
|
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS `AS IS'
|
|
|
|
* AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
|
|
|
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
|
|
|
|
* ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
|
|
|
|
* LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
|
|
|
|
* CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
|
|
|
|
* SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
|
|
|
|
* INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
|
|
|
|
* CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
|
|
|
|
* ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
|
|
|
|
* POSSIBILITY OF SUCH DAMAGE.
|
|
|
|
*/
|
|
|
|
#define OPJ_SKIP_POISON
|
2015-10-18 02:23:01 +02:00
|
|
|
#include "opj_includes.h"
|
2015-10-09 22:03:35 +02:00
|
|
|
|
2015-10-18 02:23:01 +02:00
|
|
|
static INLINE void *opj_aligned_alloc_n(size_t alignment, size_t size)
|
2015-10-09 22:03:35 +02:00
|
|
|
{
|
2015-10-17 02:16:17 +02:00
|
|
|
void* ptr;
|
|
|
|
|
|
|
|
/* alignment shall be power of 2 */
|
|
|
|
assert( (alignment != 0U) && ((alignment & (alignment - 1U)) == 0U));
|
|
|
|
|
2015-10-17 02:55:09 +02:00
|
|
|
if (size == 0U) { /* prevent implementation defined behavior of realloc */
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
|
2015-10-10 14:54:21 +02:00
|
|
|
#if defined(HAVE_POSIX_MEMALIGN)
|
2015-10-12 21:24:10 +02:00
|
|
|
/* aligned_alloc requires c11, restrict to posix_memalign for now. Quote:
|
|
|
|
* This function was introduced in POSIX 1003.1d. Although this function is
|
|
|
|
* superseded by aligned_alloc, it is more portable to older POSIX systems
|
|
|
|
* that do not support ISO C11. */
|
2015-10-09 22:03:35 +02:00
|
|
|
if (posix_memalign (&ptr, alignment, size))
|
|
|
|
{
|
|
|
|
ptr = NULL;
|
|
|
|
}
|
2015-10-10 14:54:21 +02:00
|
|
|
/* older linux */
|
|
|
|
#elif defined(HAVE_MEMALIGN)
|
2015-10-17 02:16:17 +02:00
|
|
|
ptr = memalign( alignment, size );
|
2015-10-10 14:54:21 +02:00
|
|
|
/* _MSC_VER */
|
|
|
|
#elif defined(HAVE__ALIGNED_MALLOC)
|
2015-10-18 02:23:01 +02:00
|
|
|
ptr = _aligned_malloc(size, alignment);
|
2015-10-10 14:54:21 +02:00
|
|
|
#else
|
2015-10-09 22:03:35 +02:00
|
|
|
/* TODO: _mm_malloc(x,y) */
|
2015-10-10 14:54:21 +02:00
|
|
|
#error missing aligned alloc function
|
|
|
|
#endif
|
2015-10-17 02:16:17 +02:00
|
|
|
return ptr;
|
2015-10-09 22:03:35 +02:00
|
|
|
}
|
2015-10-18 02:23:01 +02:00
|
|
|
static INLINE void *opj_aligned_realloc_n(void *ptr, size_t alignment, size_t new_size)
|
2015-10-10 17:51:29 +02:00
|
|
|
{
|
2015-10-17 02:16:17 +02:00
|
|
|
void *r_ptr;
|
|
|
|
|
|
|
|
/* alignment shall be power of 2 */
|
|
|
|
assert( (alignment != 0U) && ((alignment & (alignment - 1U)) == 0U));
|
|
|
|
|
2015-10-17 02:55:09 +02:00
|
|
|
if (new_size == 0U) { /* prevent implementation defined behavior of realloc */
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
|
2015-10-10 17:51:29 +02:00
|
|
|
/* no portable aligned realloc */
|
|
|
|
#if defined(HAVE_POSIX_MEMALIGN) || defined(HAVE_MEMALIGN)
|
|
|
|
/* glibc doc states one can mixed aligned malloc with realloc */
|
2015-10-17 02:55:09 +02:00
|
|
|
r_ptr = realloc( ptr, new_size ); /* fast path */
|
2015-10-12 21:24:10 +02:00
|
|
|
/* we simply use `size_t` to cast, since we are only interest in binary AND
|
|
|
|
* operator */
|
2015-10-17 02:16:17 +02:00
|
|
|
if( ((size_t)r_ptr & (alignment - 1U)) != 0U ) {
|
|
|
|
/* this is non-trivial to implement a portable aligned realloc, so use a
|
|
|
|
* simple approach where we do not need a function that return the size of an
|
|
|
|
* allocated array (eg. _msize on Windows, malloc_size on MacOS,
|
|
|
|
* malloc_usable_size on systems with glibc) */
|
2015-10-17 02:55:09 +02:00
|
|
|
void *a_ptr = opj_aligned_alloc_n(alignment, new_size);
|
2015-10-17 02:16:17 +02:00
|
|
|
if (a_ptr != NULL) {
|
2015-10-17 02:55:09 +02:00
|
|
|
memcpy(a_ptr, r_ptr, new_size);
|
2015-10-17 02:16:17 +02:00
|
|
|
}
|
|
|
|
free( r_ptr );
|
|
|
|
r_ptr = a_ptr;
|
|
|
|
}
|
2015-10-10 17:51:29 +02:00
|
|
|
/* _MSC_VER */
|
|
|
|
#elif defined(HAVE__ALIGNED_MALLOC)
|
2015-10-17 02:55:09 +02:00
|
|
|
r_ptr = _aligned_realloc( ptr, new_size, alignment );
|
2015-10-10 17:51:29 +02:00
|
|
|
#else
|
|
|
|
/* TODO: _mm_malloc(x,y) */
|
|
|
|
#error missing aligned realloc function
|
|
|
|
#endif
|
2015-10-17 02:16:17 +02:00
|
|
|
return r_ptr;
|
2015-10-10 17:51:29 +02:00
|
|
|
}
|
2015-10-09 22:03:35 +02:00
|
|
|
void * opj_malloc(size_t size)
|
|
|
|
{
|
2015-10-17 02:55:09 +02:00
|
|
|
if (size == 0U) { /* prevent implementation defined behavior of realloc */
|
|
|
|
return NULL;
|
|
|
|
}
|
2015-10-09 22:03:35 +02:00
|
|
|
return malloc(size);
|
|
|
|
}
|
2015-10-17 02:55:09 +02:00
|
|
|
void * opj_calloc(size_t num, size_t size)
|
2015-10-09 22:03:35 +02:00
|
|
|
{
|
2015-10-17 02:55:09 +02:00
|
|
|
if (size == 0U) { /* prevent implementation defined behavior of realloc */
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
/* according to C89 standard, num == 0 shall return a valid pointer */
|
|
|
|
return calloc(num, size);
|
2015-10-09 22:03:35 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
void *opj_aligned_malloc(size_t size)
|
|
|
|
{
|
2015-10-17 02:55:09 +02:00
|
|
|
return opj_aligned_alloc_n(16U, size);
|
2015-10-10 17:51:29 +02:00
|
|
|
}
|
|
|
|
void * opj_aligned_realloc(void *ptr, size_t size)
|
|
|
|
{
|
2015-10-17 02:55:09 +02:00
|
|
|
return opj_aligned_realloc_n(ptr, 16U, size);
|
2015-10-09 22:03:35 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
void opj_aligned_free(void* ptr)
|
|
|
|
{
|
|
|
|
#ifdef HAVE__ALIGNED_MALLOC
|
|
|
|
_aligned_free( ptr );
|
|
|
|
#else
|
|
|
|
free( ptr );
|
|
|
|
#endif
|
|
|
|
}
|
|
|
|
|
2015-10-17 02:55:09 +02:00
|
|
|
void * opj_realloc(void *ptr, size_t new_size)
|
2015-10-09 22:03:35 +02:00
|
|
|
{
|
2015-10-17 02:55:09 +02:00
|
|
|
if (new_size == 0U) { /* prevent implementation defined behavior of realloc */
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
return realloc(ptr, new_size);
|
2015-10-09 22:03:35 +02:00
|
|
|
}
|
2015-10-17 02:55:09 +02:00
|
|
|
void opj_free(void *ptr)
|
2015-10-09 22:03:35 +02:00
|
|
|
{
|
2015-10-17 02:55:09 +02:00
|
|
|
free(ptr);
|
2015-10-09 22:03:35 +02:00
|
|
|
}
|