2002-06-11 13:41:01 +00:00
|
|
|
/*
|
|
|
|
* default memory allocator for libavcodec
|
|
|
|
* Copyright (c) 2002 Fabrice Bellard.
|
|
|
|
*
|
|
|
|
* This library is free software; you can redistribute it and/or
|
|
|
|
* modify it under the terms of the GNU Lesser General Public
|
|
|
|
* License as published by the Free Software Foundation; either
|
|
|
|
* version 2 of the License, or (at your option) any later version.
|
|
|
|
*
|
|
|
|
* This library 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
|
|
|
|
* Lesser General Public License for more details.
|
|
|
|
*
|
|
|
|
* You should have received a copy of the GNU Lesser General Public
|
|
|
|
* License along with this library; if not, write to the Free Software
|
|
|
|
* Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
|
|
|
|
*/
|
2003-03-06 11:32:04 +00:00
|
|
|
|
|
|
|
/**
|
|
|
|
* @file mem.c
|
|
|
|
* default memory allocator for libavcodec.
|
|
|
|
*/
|
|
|
|
|
2002-06-11 13:41:01 +00:00
|
|
|
#include "avcodec.h"
|
2003-01-23 23:03:09 +00:00
|
|
|
|
|
|
|
/* here we can use OS dependant allocation functions */
|
|
|
|
#undef malloc
|
|
|
|
#undef free
|
|
|
|
#undef realloc
|
|
|
|
|
2002-06-11 13:41:01 +00:00
|
|
|
#ifdef HAVE_MALLOC_H
|
|
|
|
#include <malloc.h>
|
|
|
|
#endif
|
|
|
|
|
|
|
|
/* you can redefine av_malloc and av_free in your project to use your
|
|
|
|
memory allocator. You do not need to suppress this file because the
|
|
|
|
linker will do it automatically */
|
|
|
|
|
2003-01-23 23:03:09 +00:00
|
|
|
/**
|
|
|
|
* Memory allocation of size byte with alignment suitable for all
|
|
|
|
* memory accesses (including vectors if available on the
|
|
|
|
* CPU). av_malloc(0) must return a non NULL pointer.
|
|
|
|
*/
|
2002-11-12 15:00:04 +00:00
|
|
|
void *av_malloc(unsigned int size)
|
2002-06-11 13:41:01 +00:00
|
|
|
{
|
|
|
|
void *ptr;
|
2005-01-12 11:14:12 +00:00
|
|
|
int diff;
|
2005-01-12 00:16:25 +00:00
|
|
|
|
|
|
|
/* lets disallow possible ambiguous cases */
|
|
|
|
if(size > INT_MAX)
|
|
|
|
return NULL;
|
2003-01-19 17:55:13 +00:00
|
|
|
|
2004-06-06 03:45:53 +00:00
|
|
|
#ifdef MEMALIGN_HACK
|
|
|
|
ptr = malloc(size+16+1);
|
|
|
|
diff= ((-(int)ptr - 1)&15) + 1;
|
|
|
|
ptr += diff;
|
|
|
|
((char*)ptr)[-1]= diff;
|
|
|
|
#elif defined (HAVE_MEMALIGN)
|
2002-09-15 10:02:15 +00:00
|
|
|
ptr = memalign(16,size);
|
2002-06-11 13:41:01 +00:00
|
|
|
/* Why 64?
|
|
|
|
Indeed, we should align it:
|
|
|
|
on 4 for 386
|
|
|
|
on 16 for 486
|
|
|
|
on 32 for 586, PPro - k6-III
|
|
|
|
on 64 for K7 (maybe for P3 too).
|
|
|
|
Because L1 and L2 caches are aligned on those values.
|
|
|
|
But I don't want to code such logic here!
|
|
|
|
*/
|
2002-09-15 10:02:15 +00:00
|
|
|
/* Why 16?
|
|
|
|
because some cpus need alignment, for example SSE2 on P4, & most RISC cpus
|
|
|
|
it will just trigger an exception and the unaligned load will be done in the
|
|
|
|
exception handler or it will just segfault (SSE2 on P4)
|
|
|
|
Why not larger? because i didnt see a difference in benchmarks ...
|
|
|
|
*/
|
|
|
|
/* benchmarks with p3
|
|
|
|
memalign(64)+1 3071,3051,3032
|
|
|
|
memalign(64)+2 3051,3032,3041
|
|
|
|
memalign(64)+4 2911,2896,2915
|
|
|
|
memalign(64)+8 2545,2554,2550
|
|
|
|
memalign(64)+16 2543,2572,2563
|
|
|
|
memalign(64)+32 2546,2545,2571
|
|
|
|
memalign(64)+64 2570,2533,2558
|
|
|
|
|
|
|
|
btw, malloc seems to do 8 byte alignment by default here
|
|
|
|
*/
|
2002-06-11 13:41:01 +00:00
|
|
|
#else
|
|
|
|
ptr = malloc(size);
|
|
|
|
#endif
|
|
|
|
return ptr;
|
|
|
|
}
|
|
|
|
|
2003-01-21 21:30:48 +00:00
|
|
|
/**
|
2003-01-23 23:03:09 +00:00
|
|
|
* av_realloc semantics (same as glibc): if ptr is NULL and size > 0,
|
|
|
|
* identical to malloc(size). If size is zero, it is identical to
|
|
|
|
* free(ptr) and NULL is returned.
|
2003-01-21 21:30:48 +00:00
|
|
|
*/
|
2003-01-23 23:03:09 +00:00
|
|
|
void *av_realloc(void *ptr, unsigned int size)
|
|
|
|
{
|
2005-01-12 11:14:12 +00:00
|
|
|
int diff;
|
2005-01-12 00:16:25 +00:00
|
|
|
/* lets disallow possible ambiguous cases */
|
|
|
|
if(size > INT_MAX)
|
|
|
|
return NULL;
|
|
|
|
|
2004-06-06 03:45:53 +00:00
|
|
|
#ifdef MEMALIGN_HACK
|
|
|
|
//FIXME this isnt aligned correctly though it probably isnt needed
|
2004-07-27 11:09:41 +00:00
|
|
|
if(!ptr) return av_malloc(size);
|
|
|
|
diff= ((char*)ptr)[-1];
|
2004-06-06 03:45:53 +00:00
|
|
|
return realloc(ptr - diff, size + diff) + diff;
|
|
|
|
#else
|
2003-01-23 23:03:09 +00:00
|
|
|
return realloc(ptr, size);
|
2004-06-06 03:45:53 +00:00
|
|
|
#endif
|
2003-01-21 21:30:48 +00:00
|
|
|
}
|
|
|
|
|
2002-06-11 13:41:01 +00:00
|
|
|
/* NOTE: ptr = NULL is explicetly allowed */
|
|
|
|
void av_free(void *ptr)
|
|
|
|
{
|
|
|
|
/* XXX: this test should not be needed on most libcs */
|
|
|
|
if (ptr)
|
2004-06-06 03:45:53 +00:00
|
|
|
#ifdef MEMALIGN_HACK
|
|
|
|
free(ptr - ((char*)ptr)[-1]);
|
|
|
|
#else
|
2002-06-11 13:41:01 +00:00
|
|
|
free(ptr);
|
2004-06-06 03:45:53 +00:00
|
|
|
#endif
|
2002-06-11 13:41:01 +00:00
|
|
|
}
|
|
|
|
|