fifo.c 4.69 KB
Newer Older
1
/*
2
 * a very simple circular buffer FIFO implementation
3 4 5
 * Copyright (c) 2000, 2001, 2002 Fabrice Bellard
 * Copyright (c) 2006 Roman Shaposhnik
 *
6 7 8
 * This file is part of FFmpeg.
 *
 * FFmpeg is free software; you can redistribute it and/or
9 10
 * modify it under the terms of the GNU Lesser General Public
 * License as published by the Free Software Foundation; either
11
 * version 2.1 of the License, or (at your option) any later version.
12
 *
13
 * FFmpeg is distributed in the hope that it will be useful,
14 15 16 17 18
 * 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
19
 * License along with FFmpeg; if not, write to the Free Software
20 21
 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
 */
22 23

#include "avassert.h"
24 25 26
#include "common.h"
#include "fifo.h"

27
AVFifoBuffer *av_fifo_alloc(unsigned int size)
28
{
29
    AVFifoBuffer *f = av_mallocz(sizeof(AVFifoBuffer));
30
    if (!f)
31
        return NULL;
32
    f->buffer = av_malloc(size);
33
    f->end    = f->buffer + size;
34
    av_fifo_reset(f);
35
    if (!f->buffer)
36 37
        av_freep(&f);
    return f;
38 39 40 41
}

void av_fifo_free(AVFifoBuffer *f)
{
42
    if (f) {
43
        av_freep(&f->buffer);
Michael Niedermayer's avatar
Michael Niedermayer committed
44
        av_free(f);
45
    }
46 47
}

48 49 50 51 52 53
void av_fifo_reset(AVFifoBuffer *f)
{
    f->wptr = f->rptr = f->buffer;
    f->wndx = f->rndx = 0;
}

54 55
int av_fifo_size(AVFifoBuffer *f)
{
56
    return (uint32_t)(f->wndx - f->rndx);
57 58
}

59 60 61 62 63
int av_fifo_space(AVFifoBuffer *f)
{
    return f->end - f->buffer - av_fifo_size(f);
}

64 65 66
int av_fifo_realloc2(AVFifoBuffer *f, unsigned int new_size)
{
    unsigned int old_size = f->end - f->buffer;
67

68
    if (old_size < new_size) {
69
        int len          = av_fifo_size(f);
70
        AVFifoBuffer *f2 = av_fifo_alloc(new_size);
71

72
        if (!f2)
73
            return AVERROR(ENOMEM);
74
        av_fifo_generic_read(f, f2->buffer, len, NULL);
75 76
        f2->wptr += len;
        f2->wndx += len;
77
        av_free(f->buffer);
78
        *f = *f2;
79
        av_free(f2);
80
    }
81
    return 0;
82 83
}

84 85 86 87 88 89 90 91 92 93 94 95 96
int av_fifo_grow(AVFifoBuffer *f, unsigned int size)
{
    unsigned int old_size = f->end - f->buffer;
    if(size + (unsigned)av_fifo_size(f) < size)
        return AVERROR(EINVAL);

    size += av_fifo_size(f);

    if (old_size < size)
        return av_fifo_realloc2(f, FFMAX(size, 2*size));
    return 0;
}

97 98 99 100
/* src must NOT be const as it can be a context for func that may need
 * updating (like a pointer or byte counter) */
int av_fifo_generic_write(AVFifoBuffer *f, void *src, int size,
                          int (*func)(void *, void *, int))
101 102
{
    int total = size;
103 104 105
    uint32_t wndx= f->wndx;
    uint8_t *wptr= f->wptr;

106
    do {
107
        int len = FFMIN(f->end - wptr, size);
108
        if (func) {
109
            if (func(src, wptr, len) <= 0)
110 111
                break;
        } else {
112
            memcpy(wptr, src, len);
113
            src = (uint8_t *)src + len;
114
        }
115
// Write memory barrier needed for SMP here in theory
116 117 118
        wptr += len;
        if (wptr >= f->end)
            wptr = f->buffer;
119
        wndx    += len;
120
        size    -= len;
121
    } while (size > 0);
122 123
    f->wndx= wndx;
    f->wptr= wptr;
124
    return total - size;
125 126
}

127 128
int av_fifo_generic_read(AVFifoBuffer *f, void *dest, int buf_size,
                         void (*func)(void *, void *, int))
129
{
130
// Read memory barrier needed for SMP here in theory
131
    do {
Michael Niedermayer's avatar
Michael Niedermayer committed
132
        int len = FFMIN(f->end - f->rptr, buf_size);
133 134 135
        if (func)
            func(dest, f->rptr, len);
        else {
136
            memcpy(dest, f->rptr, len);
137
            dest = (uint8_t *)dest + len;
138
        }
139
// memory barrier needed for SMP here in theory
140
        av_fifo_drain(f, len);
141
        buf_size -= len;
142
    } while (buf_size > 0);
143 144 145
    return 0;
}

146
/** Discard data from the FIFO. */
147 148
void av_fifo_drain(AVFifoBuffer *f, int size)
{
149
    av_assert2(av_fifo_size(f) >= size);
150 151 152
    f->rptr += size;
    if (f->rptr >= f->end)
        f->rptr -= f->end - f->buffer;
153
    f->rndx += size;
154
}
155 156 157 158 159 160 161 162 163 164 165 166 167 168

#ifdef TEST

int main(void)
{
    /* create a FIFO buffer */
    AVFifoBuffer *fifo = av_fifo_alloc(13 * sizeof(int));
    int i, j, n;

    /* fill data */
    for (i = 0; av_fifo_space(fifo) >= sizeof(int); i++)
        av_fifo_generic_write(fifo, &i, sizeof(int), NULL);

    /* peek at FIFO */
169 170 171
    n = av_fifo_size(fifo) / sizeof(int);
    for (i = -n + 1; i < n; i++) {
        int *v = (int *)av_fifo_peek2(fifo, i * sizeof(int));
172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188
        printf("%d: %d\n", i, *v);
    }
    printf("\n");

    /* read data */
    for (i = 0; av_fifo_size(fifo) >= sizeof(int); i++) {
        av_fifo_generic_read(fifo, &j, sizeof(int), NULL);
        printf("%d ", j);
    }
    printf("\n");

    av_fifo_free(fifo);

    return 0;
}

#endif