LCOV - code coverage report
Current view: top level - src/libavutil/tests - fifo.c (source / functions) Hit Total Coverage
Test: coverage.info Lines: 46 48 95.8 %
Date: 2017-01-22 02:20:28 Functions: 1 1 100.0 %

          Line data    Source code
       1             : /*
       2             :  * This file is part of FFmpeg.
       3             :  *
       4             :  * FFmpeg is free software; you can redistribute it and/or
       5             :  * modify it under the terms of the GNU Lesser General Public
       6             :  * License as published by the Free Software Foundation; either
       7             :  * version 2.1 of the License, or (at your option) any later version.
       8             :  *
       9             :  * FFmpeg is distributed in the hope that it will be useful,
      10             :  * but WITHOUT ANY WARRANTY; without even the implied warranty of
      11             :  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
      12             :  * Lesser General Public License for more details.
      13             :  *
      14             :  * You should have received a copy of the GNU Lesser General Public
      15             :  * License along with FFmpeg; if not, write to the Free Software
      16             :  * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
      17             :  */
      18             : 
      19             : #include <stdio.h>
      20             : #include <stdlib.h>
      21             : #include "libavutil/fifo.h"
      22             : 
      23           1 : int main(void)
      24             : {
      25             :     /* create a FIFO buffer */
      26           1 :     AVFifoBuffer *fifo = av_fifo_alloc(13 * sizeof(int));
      27             :     int i, j, n, *p;
      28             : 
      29             :     /* fill data */
      30          14 :     for (i = 0; av_fifo_space(fifo) >= sizeof(int); i++)
      31          13 :         av_fifo_generic_write(fifo, &i, sizeof(int), NULL);
      32             : 
      33             :     /* peek at FIFO */
      34           1 :     n = av_fifo_size(fifo) / sizeof(int);
      35          26 :     for (i = -n + 1; i < n; i++) {
      36          25 :         int *v = (int *)av_fifo_peek2(fifo, i * sizeof(int));
      37          25 :         printf("%d: %d\n", i, *v);
      38             :     }
      39           1 :     printf("\n");
      40             : 
      41             :     /* peek_at at FIFO */
      42           1 :     n = av_fifo_size(fifo) / sizeof(int);
      43          14 :     for (i = 0; i < n; i++) {
      44          13 :         av_fifo_generic_peek_at(fifo, &j, i * sizeof(int), sizeof(j), NULL);
      45          13 :         printf("%d: %d\n", i, j);
      46             :     }
      47           1 :     printf("\n");
      48             : 
      49             :     /* generic peek at FIFO */
      50             : 
      51           1 :     n = av_fifo_size(fifo);
      52           1 :     p = malloc(n);
      53           1 :     if (p == NULL) {
      54           0 :         fprintf(stderr, "failed to allocate memory.\n");
      55           0 :         exit(1);
      56             :     }
      57             : 
      58           1 :     (void) av_fifo_generic_peek(fifo, p, n, NULL);
      59             : 
      60             :     /* read data at p */
      61           1 :     n /= sizeof(int);
      62          14 :     for(i = 0; i < n; ++i)
      63          13 :         printf("%d: %d\n", i, p[i]);
      64             : 
      65           1 :     putchar('\n');
      66             : 
      67             :     /* read data */
      68          14 :     for (i = 0; av_fifo_size(fifo) >= sizeof(int); i++) {
      69          13 :         av_fifo_generic_read(fifo, &j, sizeof(int), NULL);
      70          13 :         printf("%d ", j);
      71             :     }
      72           1 :     printf("\n");
      73             : 
      74             :     /* test *ndx overflow */
      75           1 :     av_fifo_reset(fifo);
      76           1 :     fifo->rndx = fifo->wndx = ~(uint32_t)0 - 5;
      77             : 
      78             :     /* fill data */
      79          14 :     for (i = 0; av_fifo_space(fifo) >= sizeof(int); i++)
      80          13 :         av_fifo_generic_write(fifo, &i, sizeof(int), NULL);
      81             : 
      82             :     /* peek_at at FIFO */
      83           1 :     n = av_fifo_size(fifo) / sizeof(int);
      84          14 :     for (i = 0; i < n; i++) {
      85          13 :         av_fifo_generic_peek_at(fifo, &j, i * sizeof(int), sizeof(j), NULL);
      86          13 :         printf("%d: %d\n", i, j);
      87             :     }
      88           1 :     putchar('\n');
      89             : 
      90             :     /* test fifo_grow */
      91           1 :     (void) av_fifo_grow(fifo, 15 * sizeof(int));
      92             : 
      93             :     /* fill data */
      94           1 :     n = av_fifo_size(fifo) / sizeof(int);
      95          16 :     for (i = n; av_fifo_space(fifo) >= sizeof(int); ++i)
      96          15 :         av_fifo_generic_write(fifo, &i, sizeof(int), NULL);
      97             : 
      98             :     /* peek_at at FIFO */
      99           1 :     n = av_fifo_size(fifo) / sizeof(int);
     100          29 :     for (i = 0; i < n; i++) {
     101          28 :         av_fifo_generic_peek_at(fifo, &j, i * sizeof(int), sizeof(j), NULL);
     102          28 :         printf("%d: %d\n", i, j);
     103             :     }
     104             : 
     105           1 :     av_fifo_free(fifo);
     106           1 :     free(p);
     107             : 
     108           1 :     return 0;
     109             : }

Generated by: LCOV version 1.12