2002-06-11 15:41:01 +02:00
|
|
|
/*
|
2006-07-19 09:28:58 +02:00
|
|
|
* default memory allocator for libavutil
|
2009-01-19 16:46:40 +01:00
|
|
|
* Copyright (c) 2002 Fabrice Bellard
|
2002-06-11 15:41:01 +02:00
|
|
|
*
|
2006-10-07 17:30:46 +02:00
|
|
|
* This file is part of FFmpeg.
|
|
|
|
*
|
|
|
|
* FFmpeg is free software; you can redistribute it and/or
|
2002-06-11 15:41:01 +02:00
|
|
|
* modify it under the terms of the GNU Lesser General Public
|
|
|
|
* License as published by the Free Software Foundation; either
|
2006-10-07 17:30:46 +02:00
|
|
|
* version 2.1 of the License, or (at your option) any later version.
|
2002-06-11 15:41:01 +02:00
|
|
|
*
|
2006-10-07 17:30:46 +02:00
|
|
|
* FFmpeg is distributed in the hope that it will be useful,
|
2002-06-11 15:41:01 +02:00
|
|
|
* 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
|
2006-10-07 17:30:46 +02:00
|
|
|
* License along with FFmpeg; if not, write to the Free Software
|
2006-01-12 23:43:26 +01:00
|
|
|
* Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
|
2002-06-11 15:41:01 +02:00
|
|
|
*/
|
2005-12-17 19:14:38 +01:00
|
|
|
|
2003-03-06 12:32:04 +01:00
|
|
|
/**
|
2010-04-20 16:45:34 +02:00
|
|
|
* @file
|
2009-01-28 01:16:05 +01:00
|
|
|
* default memory allocator for libavutil
|
2003-03-06 12:32:04 +01:00
|
|
|
*/
|
2005-12-17 19:14:38 +01:00
|
|
|
|
2011-05-12 15:11:27 +02:00
|
|
|
#define _XOPEN_SOURCE 600
|
|
|
|
|
2009-01-24 15:55:30 +01:00
|
|
|
#include "config.h"
|
2003-01-24 00:03:09 +01:00
|
|
|
|
2009-01-24 15:55:30 +01:00
|
|
|
#include <limits.h>
|
2012-10-18 19:27:51 +02:00
|
|
|
#include <stdint.h>
|
2009-01-08 00:36:34 +01:00
|
|
|
#include <stdlib.h>
|
2009-01-24 15:55:30 +01:00
|
|
|
#include <string.h>
|
2009-01-14 00:44:16 +01:00
|
|
|
#if HAVE_MALLOC_H
|
2002-06-11 15:41:01 +02:00
|
|
|
#include <malloc.h>
|
|
|
|
#endif
|
|
|
|
|
2013-02-22 20:30:52 +01:00
|
|
|
#include "avassert.h"
|
2010-01-28 14:06:31 +01:00
|
|
|
#include "avutil.h"
|
2012-10-18 19:27:51 +02:00
|
|
|
#include "intreadwrite.h"
|
2009-01-25 23:40:43 +01:00
|
|
|
#include "mem.h"
|
|
|
|
|
2010-01-28 14:06:31 +01:00
|
|
|
#ifdef MALLOC_PREFIX
|
|
|
|
|
|
|
|
#define malloc AV_JOIN(MALLOC_PREFIX, malloc)
|
|
|
|
#define memalign AV_JOIN(MALLOC_PREFIX, memalign)
|
|
|
|
#define posix_memalign AV_JOIN(MALLOC_PREFIX, posix_memalign)
|
|
|
|
#define realloc AV_JOIN(MALLOC_PREFIX, realloc)
|
|
|
|
#define free AV_JOIN(MALLOC_PREFIX, free)
|
|
|
|
|
|
|
|
void *malloc(size_t size);
|
|
|
|
void *memalign(size_t align, size_t size);
|
|
|
|
int posix_memalign(void **ptr, size_t align, size_t size);
|
|
|
|
void *realloc(void *ptr, size_t size);
|
|
|
|
void free(void *ptr);
|
|
|
|
|
|
|
|
#endif /* MALLOC_PREFIX */
|
|
|
|
|
2011-05-10 03:15:42 +02:00
|
|
|
#define ALIGN (HAVE_AVX ? 32 : 16)
|
|
|
|
|
2012-04-15 22:35:19 +02:00
|
|
|
/* NOTE: if you want to override these functions with your own
|
|
|
|
* implementations (not recommended) you have to link libav* as
|
|
|
|
* dynamic libraries and remove -Wl,-Bsymbolic from the linker flags.
|
|
|
|
* Note that this will cost performance. */
|
2002-06-11 15:41:01 +02:00
|
|
|
|
2011-12-25 18:43:58 +01:00
|
|
|
static size_t max_alloc_size= INT_MAX;
|
|
|
|
|
|
|
|
void av_max_alloc(size_t max){
|
|
|
|
max_alloc_size = max;
|
|
|
|
}
|
2011-05-18 23:59:38 +02:00
|
|
|
|
2011-04-12 21:17:26 +02:00
|
|
|
void *av_malloc(size_t size)
|
2002-06-11 15:41:01 +02:00
|
|
|
{
|
2009-01-08 00:36:34 +01:00
|
|
|
void *ptr = NULL;
|
2009-01-14 00:44:16 +01:00
|
|
|
#if CONFIG_MEMALIGN_HACK
|
2006-01-30 23:59:09 +01:00
|
|
|
long diff;
|
2005-02-24 20:08:50 +01:00
|
|
|
#endif
|
2005-01-12 01:16:25 +01:00
|
|
|
|
2006-06-30 04:47:36 +02:00
|
|
|
/* let's disallow possible ambiguous cases */
|
2012-10-20 13:18:59 +02:00
|
|
|
if (size > (max_alloc_size - 32))
|
2005-01-12 01:16:25 +01:00
|
|
|
return NULL;
|
2005-12-17 19:14:38 +01:00
|
|
|
|
2009-01-14 00:44:16 +01:00
|
|
|
#if CONFIG_MEMALIGN_HACK
|
2012-10-20 13:18:59 +02:00
|
|
|
ptr = malloc(size + ALIGN);
|
2012-10-18 19:16:37 +02:00
|
|
|
if (!ptr)
|
2006-06-30 10:00:01 +02:00
|
|
|
return ptr;
|
2012-12-14 05:36:22 +01:00
|
|
|
diff = ((~(long)ptr)&(ALIGN - 1)) + 1;
|
2012-10-18 19:16:37 +02:00
|
|
|
ptr = (char *)ptr + diff;
|
|
|
|
((char *)ptr)[-1] = diff;
|
2009-01-14 00:44:16 +01:00
|
|
|
#elif HAVE_POSIX_MEMALIGN
|
2011-12-11 01:56:48 +01:00
|
|
|
if (size) //OS X on SDK 10.6 has a broken posix_memalign implementation
|
2012-10-20 13:18:59 +02:00
|
|
|
if (posix_memalign(&ptr, ALIGN, size))
|
2009-02-21 21:38:27 +01:00
|
|
|
ptr = NULL;
|
2012-06-18 15:37:02 +02:00
|
|
|
#elif HAVE_ALIGNED_MALLOC
|
2012-06-19 20:52:00 +02:00
|
|
|
ptr = _aligned_malloc(size, ALIGN);
|
2009-01-14 00:44:16 +01:00
|
|
|
#elif HAVE_MEMALIGN
|
2013-03-10 10:22:45 +01:00
|
|
|
#ifndef __DJGPP__
|
2012-10-20 13:18:59 +02:00
|
|
|
ptr = memalign(ALIGN, size);
|
2013-03-10 10:22:45 +01:00
|
|
|
#else
|
|
|
|
ptr = memalign(size, ALIGN);
|
|
|
|
#endif
|
2005-12-17 19:14:38 +01:00
|
|
|
/* Why 64?
|
2012-10-18 19:16:37 +02:00
|
|
|
* 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-06-11 15:41:01 +02:00
|
|
|
*/
|
2012-10-18 19:16:37 +02:00
|
|
|
/* Why 32?
|
|
|
|
* For AVX ASM. SSE / NEON needs only 16.
|
|
|
|
* Why not larger? Because I did not see a difference in benchmarks ...
|
2002-09-15 12:02:15 +02:00
|
|
|
*/
|
2012-10-18 19:16:37 +02:00
|
|
|
/* 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-09-15 12:02:15 +02:00
|
|
|
*/
|
2002-06-11 15:41:01 +02:00
|
|
|
#else
|
|
|
|
ptr = malloc(size);
|
|
|
|
#endif
|
2012-07-02 19:31:35 +02:00
|
|
|
if(!ptr && !size) {
|
|
|
|
size = 1;
|
2011-05-07 15:28:39 +02:00
|
|
|
ptr= av_malloc(1);
|
2012-07-02 19:31:35 +02:00
|
|
|
}
|
|
|
|
#if CONFIG_MEMORY_POISONING
|
|
|
|
if (ptr)
|
2013-05-12 13:37:33 +02:00
|
|
|
memset(ptr, FF_MEMORY_POISON, size);
|
2012-07-02 19:31:35 +02:00
|
|
|
#endif
|
2002-06-11 15:41:01 +02:00
|
|
|
return ptr;
|
|
|
|
}
|
|
|
|
|
2011-04-12 21:17:26 +02:00
|
|
|
void *av_realloc(void *ptr, size_t size)
|
2003-01-24 00:03:09 +01:00
|
|
|
{
|
2009-01-14 00:44:16 +01:00
|
|
|
#if CONFIG_MEMALIGN_HACK
|
2006-08-17 10:18:48 +02:00
|
|
|
int diff;
|
|
|
|
#endif
|
2005-02-24 20:08:50 +01:00
|
|
|
|
2006-06-30 04:47:36 +02:00
|
|
|
/* let's disallow possible ambiguous cases */
|
2012-10-20 13:18:59 +02:00
|
|
|
if (size > (max_alloc_size - 32))
|
2005-01-12 01:16:25 +01:00
|
|
|
return NULL;
|
|
|
|
|
2009-01-14 00:44:16 +01:00
|
|
|
#if CONFIG_MEMALIGN_HACK
|
2006-08-17 10:18:48 +02:00
|
|
|
//FIXME this isn't aligned correctly, though it probably isn't needed
|
2012-10-18 19:16:37 +02:00
|
|
|
if (!ptr)
|
|
|
|
return av_malloc(size);
|
|
|
|
diff = ((char *)ptr)[-1];
|
2013-02-22 20:30:52 +01:00
|
|
|
av_assert0(diff>0 && diff<=ALIGN);
|
2012-10-20 13:18:59 +02:00
|
|
|
ptr = realloc((char *)ptr - diff, size + diff);
|
|
|
|
if (ptr)
|
|
|
|
ptr = (char *)ptr + diff;
|
2011-10-11 22:03:19 +02:00
|
|
|
return ptr;
|
2012-06-18 15:37:02 +02:00
|
|
|
#elif HAVE_ALIGNED_MALLOC
|
2012-06-19 20:52:00 +02:00
|
|
|
return _aligned_realloc(ptr, size + !size, ALIGN);
|
2006-08-17 10:18:48 +02:00
|
|
|
#else
|
2011-05-07 15:28:07 +02:00
|
|
|
return realloc(ptr, size + !size);
|
2004-06-06 05:45:53 +02:00
|
|
|
#endif
|
2003-01-21 22:30:48 +01:00
|
|
|
}
|
|
|
|
|
2011-03-20 19:39:20 +01:00
|
|
|
void *av_realloc_f(void *ptr, size_t nelem, size_t elsize)
|
|
|
|
{
|
|
|
|
size_t size;
|
|
|
|
void *r;
|
|
|
|
|
|
|
|
if (av_size_mult(elsize, nelem, &size)) {
|
|
|
|
av_free(ptr);
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
r = av_realloc(ptr, size);
|
|
|
|
if (!r && size)
|
|
|
|
av_free(ptr);
|
|
|
|
return r;
|
|
|
|
}
|
|
|
|
|
2002-06-11 15:41:01 +02:00
|
|
|
void av_free(void *ptr)
|
|
|
|
{
|
2009-01-14 00:44:16 +01:00
|
|
|
#if CONFIG_MEMALIGN_HACK
|
2013-02-22 20:30:52 +01:00
|
|
|
if (ptr) {
|
|
|
|
int v= ((char *)ptr)[-1];
|
|
|
|
av_assert0(v>0 && v<=ALIGN);
|
|
|
|
free((char *)ptr - v);
|
|
|
|
}
|
2012-06-18 15:37:02 +02:00
|
|
|
#elif HAVE_ALIGNED_MALLOC
|
|
|
|
_aligned_free(ptr);
|
2004-06-06 05:45:53 +02:00
|
|
|
#else
|
2011-02-03 01:40:35 +01:00
|
|
|
free(ptr);
|
2004-06-06 05:45:53 +02:00
|
|
|
#endif
|
2002-06-11 15:41:01 +02:00
|
|
|
}
|
|
|
|
|
2006-09-25 17:23:40 +02:00
|
|
|
void av_freep(void *arg)
|
|
|
|
{
|
2012-10-18 19:16:37 +02:00
|
|
|
void **ptr = (void **)arg;
|
2006-09-25 17:23:40 +02:00
|
|
|
av_free(*ptr);
|
|
|
|
*ptr = NULL;
|
|
|
|
}
|
|
|
|
|
2011-04-12 21:17:26 +02:00
|
|
|
void *av_mallocz(size_t size)
|
2006-09-25 17:23:40 +02:00
|
|
|
{
|
2008-04-03 21:18:14 +02:00
|
|
|
void *ptr = av_malloc(size);
|
2006-09-25 17:23:40 +02:00
|
|
|
if (ptr)
|
|
|
|
memset(ptr, 0, size);
|
|
|
|
return ptr;
|
|
|
|
}
|
|
|
|
|
2011-09-24 18:39:13 +02:00
|
|
|
void *av_calloc(size_t nmemb, size_t size)
|
|
|
|
{
|
|
|
|
if (size <= 0 || nmemb >= INT_MAX / size)
|
|
|
|
return NULL;
|
|
|
|
return av_mallocz(nmemb * size);
|
|
|
|
}
|
|
|
|
|
2006-09-25 17:23:40 +02:00
|
|
|
char *av_strdup(const char *s)
|
|
|
|
{
|
2012-10-18 19:16:37 +02:00
|
|
|
char *ptr = NULL;
|
|
|
|
if (s) {
|
2008-05-23 14:37:52 +02:00
|
|
|
int len = strlen(s) + 1;
|
|
|
|
ptr = av_malloc(len);
|
|
|
|
if (ptr)
|
|
|
|
memcpy(ptr, s, len);
|
2008-05-23 14:37:32 +02:00
|
|
|
}
|
2006-09-25 17:23:40 +02:00
|
|
|
return ptr;
|
|
|
|
}
|
|
|
|
|
2013-04-28 00:49:14 +02:00
|
|
|
void *av_memdup(const void *p, size_t size)
|
|
|
|
{
|
|
|
|
void *ptr = NULL;
|
|
|
|
if (p) {
|
|
|
|
ptr = av_malloc(size);
|
|
|
|
if (ptr)
|
|
|
|
memcpy(ptr, p, size);
|
|
|
|
}
|
|
|
|
return ptr;
|
|
|
|
}
|
|
|
|
|
2011-04-29 17:33:38 +02:00
|
|
|
void av_dynarray_add(void *tab_ptr, int *nb_ptr, void *elem)
|
|
|
|
{
|
|
|
|
/* see similar ffmpeg.c:grow_array() */
|
|
|
|
int nb, nb_alloc;
|
|
|
|
intptr_t *tab;
|
|
|
|
|
|
|
|
nb = *nb_ptr;
|
|
|
|
tab = *(intptr_t**)tab_ptr;
|
|
|
|
if ((nb & (nb - 1)) == 0) {
|
2013-04-25 00:27:46 +02:00
|
|
|
if (nb == 0) {
|
2011-04-29 17:33:38 +02:00
|
|
|
nb_alloc = 1;
|
2013-04-25 00:27:46 +02:00
|
|
|
} else {
|
|
|
|
if (nb > INT_MAX / (2 * sizeof(intptr_t)))
|
|
|
|
goto fail;
|
2011-04-29 17:33:38 +02:00
|
|
|
nb_alloc = nb * 2;
|
2013-04-25 00:27:46 +02:00
|
|
|
}
|
2011-04-29 17:33:38 +02:00
|
|
|
tab = av_realloc(tab, nb_alloc * sizeof(intptr_t));
|
2013-04-25 00:27:46 +02:00
|
|
|
if (!tab)
|
|
|
|
goto fail;
|
2011-04-29 17:33:38 +02:00
|
|
|
*(intptr_t**)tab_ptr = tab;
|
|
|
|
}
|
|
|
|
tab[nb++] = (intptr_t)elem;
|
|
|
|
*nb_ptr = nb;
|
2013-04-25 00:27:46 +02:00
|
|
|
return;
|
|
|
|
|
|
|
|
fail:
|
|
|
|
av_freep(tab_ptr);
|
|
|
|
*nb_ptr = 0;
|
2011-04-29 17:33:38 +02:00
|
|
|
}
|
2012-01-29 00:34:59 +01:00
|
|
|
|
2013-04-14 03:07:54 +02:00
|
|
|
void *av_dynarray2_add(void **tab_ptr, int *nb_ptr, size_t elem_size,
|
|
|
|
const uint8_t *elem_data)
|
|
|
|
{
|
|
|
|
int nb = *nb_ptr, nb_alloc;
|
|
|
|
uint8_t *tab = *tab_ptr, *tab_elem_data;
|
|
|
|
|
|
|
|
if ((nb & (nb - 1)) == 0) {
|
|
|
|
if (nb == 0) {
|
|
|
|
nb_alloc = 1;
|
|
|
|
} else {
|
|
|
|
if (nb > INT_MAX / (2 * elem_size))
|
|
|
|
goto fail;
|
|
|
|
nb_alloc = nb * 2;
|
|
|
|
}
|
|
|
|
tab = av_realloc(tab, nb_alloc * elem_size);
|
|
|
|
if (!tab)
|
|
|
|
goto fail;
|
|
|
|
*tab_ptr = tab;
|
|
|
|
}
|
|
|
|
*nb_ptr = nb + 1;
|
|
|
|
tab_elem_data = tab + nb*elem_size;
|
|
|
|
if (elem_data)
|
|
|
|
memcpy(tab_elem_data, elem_data, elem_size);
|
|
|
|
else if (CONFIG_MEMORY_POISONING)
|
|
|
|
memset(tab_elem_data, FF_MEMORY_POISON, elem_size);
|
|
|
|
return tab_elem_data;
|
|
|
|
|
|
|
|
fail:
|
|
|
|
av_freep(tab_ptr);
|
|
|
|
*nb_ptr = 0;
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
|
2012-10-26 15:42:23 +02:00
|
|
|
static void fill16(uint8_t *dst, int len)
|
|
|
|
{
|
|
|
|
uint32_t v = AV_RN16(dst - 2);
|
|
|
|
|
|
|
|
v |= v << 16;
|
|
|
|
|
|
|
|
while (len >= 4) {
|
|
|
|
AV_WN32(dst, v);
|
|
|
|
dst += 4;
|
|
|
|
len -= 4;
|
|
|
|
}
|
|
|
|
|
|
|
|
while (len--) {
|
|
|
|
*dst = dst[-2];
|
|
|
|
dst++;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
static void fill24(uint8_t *dst, int len)
|
|
|
|
{
|
|
|
|
#if HAVE_BIGENDIAN
|
|
|
|
uint32_t v = AV_RB24(dst - 3);
|
|
|
|
uint32_t a = v << 8 | v >> 16;
|
|
|
|
uint32_t b = v << 16 | v >> 8;
|
|
|
|
uint32_t c = v << 24 | v;
|
|
|
|
#else
|
|
|
|
uint32_t v = AV_RL24(dst - 3);
|
|
|
|
uint32_t a = v | v << 24;
|
|
|
|
uint32_t b = v >> 8 | v << 16;
|
|
|
|
uint32_t c = v >> 16 | v << 8;
|
|
|
|
#endif
|
|
|
|
|
|
|
|
while (len >= 12) {
|
|
|
|
AV_WN32(dst, a);
|
|
|
|
AV_WN32(dst + 4, b);
|
|
|
|
AV_WN32(dst + 8, c);
|
|
|
|
dst += 12;
|
|
|
|
len -= 12;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (len >= 4) {
|
|
|
|
AV_WN32(dst, a);
|
|
|
|
dst += 4;
|
|
|
|
len -= 4;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (len >= 4) {
|
|
|
|
AV_WN32(dst, b);
|
|
|
|
dst += 4;
|
|
|
|
len -= 4;
|
|
|
|
}
|
|
|
|
|
|
|
|
while (len--) {
|
|
|
|
*dst = dst[-3];
|
|
|
|
dst++;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
static void fill32(uint8_t *dst, int len)
|
|
|
|
{
|
|
|
|
uint32_t v = AV_RN32(dst - 4);
|
|
|
|
|
|
|
|
while (len >= 4) {
|
|
|
|
AV_WN32(dst, v);
|
|
|
|
dst += 4;
|
|
|
|
len -= 4;
|
|
|
|
}
|
|
|
|
|
|
|
|
while (len--) {
|
|
|
|
*dst = dst[-4];
|
|
|
|
dst++;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2012-10-18 19:27:51 +02:00
|
|
|
void av_memcpy_backptr(uint8_t *dst, int back, int cnt)
|
|
|
|
{
|
|
|
|
const uint8_t *src = &dst[-back];
|
2013-02-13 21:36:25 +01:00
|
|
|
if (!back)
|
|
|
|
return;
|
|
|
|
|
2012-10-18 19:27:51 +02:00
|
|
|
if (back == 1) {
|
|
|
|
memset(dst, *src, cnt);
|
2012-10-26 15:42:23 +02:00
|
|
|
} else if (back == 2) {
|
|
|
|
fill16(dst, cnt);
|
|
|
|
} else if (back == 3) {
|
|
|
|
fill24(dst, cnt);
|
|
|
|
} else if (back == 4) {
|
|
|
|
fill32(dst, cnt);
|
2012-10-18 19:27:51 +02:00
|
|
|
} else {
|
2012-10-26 15:42:23 +02:00
|
|
|
if (cnt >= 16) {
|
2012-10-18 19:27:51 +02:00
|
|
|
int blocklen = back;
|
|
|
|
while (cnt > blocklen) {
|
|
|
|
memcpy(dst, src, blocklen);
|
|
|
|
dst += blocklen;
|
|
|
|
cnt -= blocklen;
|
|
|
|
blocklen <<= 1;
|
|
|
|
}
|
|
|
|
memcpy(dst, src, cnt);
|
2012-10-26 15:42:23 +02:00
|
|
|
return;
|
|
|
|
}
|
|
|
|
if (cnt >= 8) {
|
|
|
|
AV_COPY32U(dst, src);
|
|
|
|
AV_COPY32U(dst + 4, src + 4);
|
|
|
|
src += 8;
|
|
|
|
dst += 8;
|
|
|
|
cnt -= 8;
|
|
|
|
}
|
|
|
|
if (cnt >= 4) {
|
|
|
|
AV_COPY32U(dst, src);
|
|
|
|
src += 4;
|
|
|
|
dst += 4;
|
|
|
|
cnt -= 4;
|
|
|
|
}
|
|
|
|
if (cnt >= 2) {
|
|
|
|
AV_COPY16U(dst, src);
|
|
|
|
src += 2;
|
|
|
|
dst += 2;
|
|
|
|
cnt -= 2;
|
2012-10-18 19:27:51 +02:00
|
|
|
}
|
2012-10-26 15:42:23 +02:00
|
|
|
if (cnt)
|
|
|
|
*dst = *src;
|
2012-10-18 19:27:51 +02:00
|
|
|
}
|
|
|
|
}
|
2012-10-25 13:15:58 +02:00
|
|
|
|