2013-04-04 05:26:29 +00:00
|
|
|
/* RetroArch - A frontend for libretro.
|
2014-01-01 00:50:59 +00:00
|
|
|
* Copyright (C) 2010-2014 - Hans-Kristian Arntzen
|
2011-01-07 14:50:16 +00:00
|
|
|
*
|
2013-04-04 05:26:29 +00:00
|
|
|
* RetroArch is free software: you can redistribute it and/or modify it under the terms
|
2011-01-07 14:50:16 +00:00
|
|
|
* of the GNU General Public License as published by the Free Software Found-
|
|
|
|
* ation, either version 3 of the License, or (at your option) any later version.
|
|
|
|
*
|
2013-04-04 05:26:29 +00:00
|
|
|
* RetroArch is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY;
|
2011-01-07 14:50:16 +00:00
|
|
|
* without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
|
|
|
|
* PURPOSE. See the GNU General Public License for more details.
|
|
|
|
*
|
2013-04-04 05:26:29 +00:00
|
|
|
* You should have received a copy of the GNU General Public License along with RetroArch.
|
2011-01-07 14:50:16 +00:00
|
|
|
* If not, see <http://www.gnu.org/licenses/>.
|
|
|
|
*/
|
|
|
|
|
2011-06-14 17:58:12 +00:00
|
|
|
#include "fifo_buffer.h"
|
2011-01-07 14:50:16 +00:00
|
|
|
|
2011-11-01 19:27:59 +00:00
|
|
|
fifo_buffer_t *fifo_new(size_t size)
|
2011-01-07 14:50:16 +00:00
|
|
|
{
|
2011-12-24 12:46:12 +00:00
|
|
|
fifo_buffer_t *buf = (fifo_buffer_t*)calloc(1, sizeof(*buf));
|
2014-08-27 01:11:06 +00:00
|
|
|
if (!buf)
|
2011-01-07 14:50:16 +00:00
|
|
|
return NULL;
|
|
|
|
|
2011-12-24 12:46:12 +00:00
|
|
|
buf->buffer = (uint8_t*)calloc(1, size + 1);
|
2014-08-27 01:11:06 +00:00
|
|
|
if (!buf->buffer)
|
2011-01-07 14:50:16 +00:00
|
|
|
{
|
|
|
|
free(buf);
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
buf->bufsize = size + 1;
|
|
|
|
|
|
|
|
return buf;
|
|
|
|
}
|
|
|
|
|
2011-11-01 19:27:59 +00:00
|
|
|
void fifo_free(fifo_buffer_t *buffer)
|
2011-01-07 14:50:16 +00:00
|
|
|
{
|
2014-09-15 12:17:16 +00:00
|
|
|
if(!buffer)
|
|
|
|
return;
|
|
|
|
|
2011-01-07 14:50:16 +00:00
|
|
|
free(buffer->buffer);
|
|
|
|
free(buffer);
|
|
|
|
}
|
|
|
|
|
2011-11-01 19:27:59 +00:00
|
|
|
size_t fifo_read_avail(fifo_buffer_t *buffer)
|
2011-01-07 14:50:16 +00:00
|
|
|
{
|
|
|
|
size_t first = buffer->first;
|
|
|
|
size_t end = buffer->end;
|
|
|
|
if (end < first)
|
|
|
|
end += buffer->bufsize;
|
|
|
|
return end - first;
|
|
|
|
}
|
|
|
|
|
2011-11-01 19:27:59 +00:00
|
|
|
size_t fifo_write_avail(fifo_buffer_t *buffer)
|
2011-01-07 14:50:16 +00:00
|
|
|
{
|
|
|
|
size_t first = buffer->first;
|
|
|
|
size_t end = buffer->end;
|
|
|
|
if (end < first)
|
|
|
|
end += buffer->bufsize;
|
|
|
|
|
|
|
|
return (buffer->bufsize - 1) - (end - first);
|
|
|
|
}
|
|
|
|
|
2011-11-01 19:27:59 +00:00
|
|
|
void fifo_write(fifo_buffer_t *buffer, const void *in_buf, size_t size)
|
2011-01-07 14:50:16 +00:00
|
|
|
{
|
|
|
|
size_t first_write = size;
|
|
|
|
size_t rest_write = 0;
|
|
|
|
if (buffer->end + size > buffer->bufsize)
|
|
|
|
{
|
|
|
|
first_write = buffer->bufsize - buffer->end;
|
|
|
|
rest_write = size - first_write;
|
|
|
|
}
|
|
|
|
|
|
|
|
memcpy(buffer->buffer + buffer->end, in_buf, first_write);
|
2012-01-31 18:14:48 +00:00
|
|
|
memcpy(buffer->buffer, (const uint8_t*)in_buf + first_write, rest_write);
|
2011-01-07 14:50:16 +00:00
|
|
|
|
|
|
|
buffer->end = (buffer->end + size) % buffer->bufsize;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2011-11-01 19:27:59 +00:00
|
|
|
void fifo_read(fifo_buffer_t *buffer, void *in_buf, size_t size)
|
2011-01-07 14:50:16 +00:00
|
|
|
{
|
|
|
|
size_t first_read = size;
|
|
|
|
size_t rest_read = 0;
|
|
|
|
if (buffer->first + size > buffer->bufsize)
|
|
|
|
{
|
|
|
|
first_read = buffer->bufsize - buffer->first;
|
|
|
|
rest_read = size - first_read;
|
|
|
|
}
|
|
|
|
|
2011-11-01 19:27:59 +00:00
|
|
|
memcpy(in_buf, (const uint8_t*)buffer->buffer + buffer->first, first_read);
|
2012-01-31 18:14:48 +00:00
|
|
|
memcpy((uint8_t*)in_buf + first_read, buffer->buffer, rest_read);
|
2011-01-07 14:50:16 +00:00
|
|
|
|
|
|
|
buffer->first = (buffer->first + size) % buffer->bufsize;
|
|
|
|
}
|
|
|
|
|