2006-09-21 07:31:53 +00:00
|
|
|
/*
|
2009-01-28 00:16:05 +00:00
|
|
|
* a very simple circular buffer FIFO implementation
|
2006-09-21 07:31:53 +00:00
|
|
|
* Copyright (c) 2000, 2001, 2002 Fabrice Bellard
|
|
|
|
* Copyright (c) 2006 Roman Shaposhnik
|
|
|
|
*
|
2011-03-18 17:35:10 +00:00
|
|
|
* This file is part of Libav.
|
2006-10-07 15:30:46 +00:00
|
|
|
*
|
2011-03-18 17:35:10 +00:00
|
|
|
* Libav is free software; you can redistribute it and/or
|
2006-09-21 07:31:53 +00:00
|
|
|
* modify it under the terms of the GNU Lesser General Public
|
|
|
|
* License as published by the Free Software Foundation; either
|
2006-10-07 15:30:46 +00:00
|
|
|
* version 2.1 of the License, or (at your option) any later version.
|
2006-09-21 07:31:53 +00:00
|
|
|
*
|
2011-03-18 17:35:10 +00:00
|
|
|
* Libav is distributed in the hope that it will be useful,
|
2006-09-21 07:31:53 +00: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
|
2011-03-18 17:35:10 +00:00
|
|
|
* License along with Libav; if not, write to the Free Software
|
2006-09-21 07:31:53 +00:00
|
|
|
* Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
|
|
|
|
*/
|
|
|
|
#include "common.h"
|
|
|
|
#include "fifo.h"
|
|
|
|
|
2009-03-08 14:16:55 +00:00
|
|
|
AVFifoBuffer *av_fifo_alloc(unsigned int size)
|
2006-09-21 07:31:53 +00:00
|
|
|
{
|
2009-03-08 14:16:55 +00:00
|
|
|
AVFifoBuffer *f= av_mallocz(sizeof(AVFifoBuffer));
|
|
|
|
if(!f)
|
|
|
|
return NULL;
|
2006-09-21 07:31:53 +00:00
|
|
|
f->buffer = av_malloc(size);
|
2007-01-17 20:14:02 +00:00
|
|
|
f->end = f->buffer + size;
|
2009-03-09 09:26:32 +00:00
|
|
|
av_fifo_reset(f);
|
2006-09-21 07:31:53 +00:00
|
|
|
if (!f->buffer)
|
2009-03-08 14:16:55 +00:00
|
|
|
av_freep(&f);
|
|
|
|
return f;
|
2006-09-21 07:31:53 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
void av_fifo_free(AVFifoBuffer *f)
|
|
|
|
{
|
2009-03-08 14:16:55 +00:00
|
|
|
if(f){
|
2009-03-09 03:39:58 +00:00
|
|
|
av_free(f->buffer);
|
|
|
|
av_free(f);
|
2009-03-08 14:16:55 +00:00
|
|
|
}
|
2006-09-21 07:31:53 +00:00
|
|
|
}
|
|
|
|
|
2009-03-09 09:26:32 +00:00
|
|
|
void av_fifo_reset(AVFifoBuffer *f)
|
|
|
|
{
|
|
|
|
f->wptr = f->rptr = f->buffer;
|
|
|
|
f->wndx = f->rndx = 0;
|
|
|
|
}
|
|
|
|
|
2006-09-21 07:31:53 +00:00
|
|
|
int av_fifo_size(AVFifoBuffer *f)
|
|
|
|
{
|
2009-03-07 21:02:08 +00:00
|
|
|
return (uint32_t)(f->wndx - f->rndx);
|
2006-09-21 07:31:53 +00:00
|
|
|
}
|
|
|
|
|
2009-04-02 23:22:19 +00:00
|
|
|
int av_fifo_space(AVFifoBuffer *f)
|
|
|
|
{
|
|
|
|
return f->end - f->buffer - av_fifo_size(f);
|
|
|
|
}
|
|
|
|
|
2008-08-19 18:43:34 +00:00
|
|
|
int av_fifo_realloc2(AVFifoBuffer *f, unsigned int new_size) {
|
2006-09-21 07:31:53 +00:00
|
|
|
unsigned int old_size= f->end - f->buffer;
|
|
|
|
|
2009-03-07 21:02:08 +00:00
|
|
|
if(old_size < new_size){
|
2007-01-17 20:05:31 +00:00
|
|
|
int len= av_fifo_size(f);
|
2009-03-08 14:16:55 +00:00
|
|
|
AVFifoBuffer *f2= av_fifo_alloc(new_size);
|
2006-09-21 07:31:53 +00:00
|
|
|
|
2009-03-08 14:16:55 +00:00
|
|
|
if (!f2)
|
2008-08-19 18:43:34 +00:00
|
|
|
return -1;
|
2009-03-09 17:47:47 +00:00
|
|
|
av_fifo_generic_read(f, f2->buffer, len, NULL);
|
2009-03-08 14:16:55 +00:00
|
|
|
f2->wptr += len;
|
|
|
|
f2->wndx += len;
|
2007-01-17 20:05:31 +00:00
|
|
|
av_free(f->buffer);
|
2009-03-08 14:16:55 +00:00
|
|
|
*f= *f2;
|
|
|
|
av_free(f2);
|
2006-09-21 07:31:53 +00:00
|
|
|
}
|
2008-08-19 18:43:34 +00:00
|
|
|
return 0;
|
2006-09-21 07:31:53 +00:00
|
|
|
}
|
|
|
|
|
2010-02-23 12:14:13 +00:00
|
|
|
// src must NOT be const as it can be a context for func that may need updating (like a pointer or byte counter)
|
2008-04-09 11:36:50 +00:00
|
|
|
int av_fifo_generic_write(AVFifoBuffer *f, void *src, int size, int (*func)(void*, void*, int))
|
2008-04-09 11:35:16 +00:00
|
|
|
{
|
|
|
|
int total = size;
|
2007-01-18 00:22:24 +00:00
|
|
|
do {
|
2007-01-17 19:30:23 +00:00
|
|
|
int len = FFMIN(f->end - f->wptr, size);
|
2008-04-09 11:35:16 +00:00
|
|
|
if(func) {
|
2008-04-09 11:36:50 +00:00
|
|
|
if(func(src, f->wptr, len) <= 0)
|
2008-04-09 11:35:16 +00:00
|
|
|
break;
|
|
|
|
} else {
|
2008-04-09 11:36:50 +00:00
|
|
|
memcpy(f->wptr, src, len);
|
|
|
|
src = (uint8_t*)src + len;
|
2008-04-09 11:35:16 +00:00
|
|
|
}
|
2009-03-08 00:45:45 +00:00
|
|
|
// Write memory barrier needed for SMP here in theory
|
2006-09-21 07:31:53 +00:00
|
|
|
f->wptr += len;
|
|
|
|
if (f->wptr >= f->end)
|
|
|
|
f->wptr = f->buffer;
|
2009-03-07 21:02:08 +00:00
|
|
|
f->wndx += len;
|
2006-09-21 07:31:53 +00:00
|
|
|
size -= len;
|
2007-01-18 00:22:24 +00:00
|
|
|
} while (size > 0);
|
2008-04-09 11:35:16 +00:00
|
|
|
return total - size;
|
2006-09-21 07:31:53 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
|
2009-03-09 17:47:47 +00:00
|
|
|
int av_fifo_generic_read(AVFifoBuffer *f, void *dest, int buf_size, void (*func)(void*, void*, int))
|
2006-09-21 07:31:53 +00:00
|
|
|
{
|
2009-03-08 00:45:45 +00:00
|
|
|
// Read memory barrier needed for SMP here in theory
|
2007-01-18 00:22:24 +00:00
|
|
|
do {
|
2007-01-17 19:30:23 +00:00
|
|
|
int len = FFMIN(f->end - f->rptr, buf_size);
|
2007-01-17 19:46:33 +00:00
|
|
|
if(func) func(dest, f->rptr, len);
|
|
|
|
else{
|
|
|
|
memcpy(dest, f->rptr, len);
|
|
|
|
dest = (uint8_t*)dest + len;
|
|
|
|
}
|
2009-03-08 00:45:45 +00:00
|
|
|
// memory barrier needed for SMP here in theory
|
2007-01-17 20:11:23 +00:00
|
|
|
av_fifo_drain(f, len);
|
2006-09-21 07:31:53 +00:00
|
|
|
buf_size -= len;
|
2007-01-18 00:22:24 +00:00
|
|
|
} while (buf_size > 0);
|
2006-09-21 07:31:53 +00:00
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2009-01-28 00:16:05 +00:00
|
|
|
/** Discard data from the FIFO. */
|
2006-09-21 07:31:53 +00:00
|
|
|
void av_fifo_drain(AVFifoBuffer *f, int size)
|
|
|
|
{
|
|
|
|
f->rptr += size;
|
|
|
|
if (f->rptr >= f->end)
|
|
|
|
f->rptr -= f->end - f->buffer;
|
2009-03-07 21:02:08 +00:00
|
|
|
f->rndx += size;
|
2006-09-21 07:31:53 +00:00
|
|
|
}
|