2 * The copyright in this software is being made available under the 2-clauses
3 * BSD License, included below. This software may be subject to other third
4 * party and contributor rights, including patent rights, and no such rights
5 * are granted under this license.
7 * Copyright (c) 2015, Mathieu Malaterre <mathieu.malaterre@gmail.com>
8 * Copyright (c) 2015, Matthieu Darbois
11 * Redistribution and use in source and binary forms, with or without
12 * modification, are permitted provided that the following conditions
14 * 1. Redistributions of source code must retain the above copyright
15 * notice, this list of conditions and the following disclaimer.
16 * 2. Redistributions in binary form must reproduce the above copyright
17 * notice, this list of conditions and the following disclaimer in the
18 * documentation and/or other materials provided with the distribution.
20 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS `AS IS'
21 * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
22 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
23 * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
24 * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
25 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
26 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
27 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
28 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
29 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
30 * POSSIBILITY OF SUCH DAMAGE.
32 #define OPJ_SKIP_POISON
33 #include "opj_includes.h"
36 #define SIZE_MAX ((size_t) -1)
39 static INLINE void *opj_aligned_alloc_n(size_t alignment, size_t size)
43 /* alignment shall be power of 2 */
44 assert( (alignment != 0U) && ((alignment & (alignment - 1U)) == 0U));
46 if (size == 0U) { /* prevent implementation defined behavior of realloc */
50 #if defined(HAVE_POSIX_MEMALIGN)
51 /* aligned_alloc requires c11, restrict to posix_memalign for now. Quote:
52 * This function was introduced in POSIX 1003.1d. Although this function is
53 * superseded by aligned_alloc, it is more portable to older POSIX systems
54 * that do not support ISO C11. */
55 if (posix_memalign (&ptr, alignment, size))
60 #elif defined(HAVE_MEMALIGN)
61 ptr = memalign( alignment, size );
63 #elif defined(HAVE__ALIGNED_MALLOC)
64 ptr = _aligned_malloc(size, alignment);
67 * Generic aligned malloc implementation.
68 * Uses ptrdiff_t for the integer manipulation of the pointer, as
69 * uintptr_t is not available in C89.
75 /* Room for padding and extra pointer stored in front of allocated area */
76 size_t overhead = (alignment - 1) + sizeof(void *);
78 /* Avoid integer overflow */
79 if (size > SIZE_MAX - overhead)
82 mem = malloc(size + overhead);
86 mask = ~(ptrdiff_t)(alignment - 1);
87 ptr = (void *) ((ptrdiff_t) (mem + overhead) & mask);
88 ((void**) ptr)[-1] = mem;
93 static INLINE void *opj_aligned_realloc_n(void *ptr, size_t alignment, size_t new_size)
97 /* alignment shall be power of 2 */
98 assert( (alignment != 0U) && ((alignment & (alignment - 1U)) == 0U));
100 if (new_size == 0U) { /* prevent implementation defined behavior of realloc */
104 /* no portable aligned realloc */
105 #if defined(HAVE_POSIX_MEMALIGN) || defined(HAVE_MEMALIGN)
106 /* glibc doc states one can mixed aligned malloc with realloc */
107 r_ptr = realloc( ptr, new_size ); /* fast path */
108 /* we simply use `size_t` to cast, since we are only interest in binary AND
110 if( ((size_t)r_ptr & (alignment - 1U)) != 0U ) {
111 /* this is non-trivial to implement a portable aligned realloc, so use a
112 * simple approach where we do not need a function that return the size of an
113 * allocated array (eg. _msize on Windows, malloc_size on MacOS,
114 * malloc_usable_size on systems with glibc) */
115 void *a_ptr = opj_aligned_alloc_n(alignment, new_size);
117 memcpy(a_ptr, r_ptr, new_size);
123 #elif defined(HAVE__ALIGNED_MALLOC)
124 r_ptr = _aligned_realloc( ptr, new_size, alignment );
127 void *oldmem, *newmem;
128 size_t overhead = (alignment - 1) + sizeof(void *);
131 my_aligned_free(ptr);
135 /* Avoid integer overflow */
136 if (new_size > SIZE_MAX - overhead)
139 oldmem = ((void**) ptr)[-1];
140 newmem = realloc(oldmem, new_size + overhead);
144 if (newmem == oldmem) {
148 ptrdiff_t old_offset, new_offset;
151 /* realloc created a new copy, realign the copied memory block */
152 old_offset = (char *) ptr - (char *) oldmem;
154 mask = ~(ptrdiff_t)(alignment - 1);
155 r_ptr = (void *) ((ptrdiff_t) (newmem + overhead) & mask);
157 new_offset = (char *) r_ptr - (char *) newmem;
159 if (new_offset != old_offset) {
160 memmove((char *) newmem + new_offset, (char *) newmem + old_offset,
163 ((void**) r_ptr)[-1] = newmem;
169 void * opj_malloc(size_t size)
171 if (size == 0U) { /* prevent implementation defined behavior of realloc */
176 void * opj_calloc(size_t num, size_t size)
178 if (size == 0U) { /* prevent implementation defined behavior of realloc */
181 /* according to C89 standard, num == 0 shall return a valid pointer */
182 return calloc(num, size);
185 void *opj_aligned_malloc(size_t size)
187 return opj_aligned_alloc_n(16U, size);
189 void * opj_aligned_realloc(void *ptr, size_t size)
191 return opj_aligned_realloc_n(ptr, 16U, size);
194 void opj_aligned_free(void* ptr)
196 #if defined(HAVE_POSIX_MEMALIGN) || defined(HAVE_MEMALIGN)
198 #elif defined(HAVE__ALIGNED_MALLOC)
199 _aligned_free( ptr );
201 /* Generic implementation has malloced pointer stored in front of used area */
203 free(((void**) ptr)[-1]);
207 void * opj_realloc(void *ptr, size_t new_size)
209 if (new_size == 0U) { /* prevent implementation defined behavior of realloc */
212 return realloc(ptr, new_size);
214 void opj_free(void *ptr)