fork/rust-sdks

git clone https://git.julia.blue/fork/rust-sdks

Théo Monnomsoxr-sys (#438)2e4d385

main
2.7 KiB125 linesraw
1/* SoX Resampler Library      Copyright (c) 2007-13 robs@users.sourceforge.net
2 * Licence for this file: LGPL v2.1                  See LICENCE for details. */
3
4#ifndef soxr_fifo_included
5#define soxr_fifo_included
6
7#if !defined FIFO_SIZE_T
8#define FIFO_SIZE_T size_t
9#endif
10
11#if !defined FIFO_REALLOC
12#include <stdlib.h>
13  #define FIFO_REALLOC(a,b,c) realloc(a,b)
14  #undef FIFO_FREE
15  #define FIFO_FREE free
16  #undef FIFO_MALLOC
17  #define FIFO_MALLOC malloc
18#endif
19
20typedef struct {
21  char * data;
22  size_t allocation;   /* Number of bytes allocated for data. */
23  size_t item_size;    /* Size of each item in data */
24  size_t begin;        /* Offset of the first byte to read. */
25  size_t end;          /* 1 + Offset of the last byte byte to read. */
26} fifo_t;
27
28#if !defined FIFO_MIN
29  #define FIFO_MIN 0x4000
30#endif
31
32#if !defined UNUSED
33  #define UNUSED
34#endif
35
36UNUSED static void fifo_clear(fifo_t * f)
37{
38  f->end = f->begin = 0;
39}
40
41UNUSED static void * fifo_reserve(fifo_t * f, FIFO_SIZE_T n0)
42{
43  size_t n = (size_t)n0;
44  n *= f->item_size;
45
46  if (f->begin == f->end)
47    fifo_clear(f);
48
49  while (1) {
50    if (f->end + n <= f->allocation) {
51      void *p = f->data + f->end;
52
53      f->end += n;
54      return p;
55    }
56    if (f->begin > FIFO_MIN) {
57      memmove(f->data, f->data + f->begin, f->end - f->begin);
58      f->end -= f->begin;
59      f->begin = 0;
60      continue;
61    }
62    f->data = FIFO_REALLOC(f->data, f->allocation + n, f->allocation);
63    f->allocation += n;
64    if (!f->data)
65      return 0;
66  }
67}
68
69UNUSED static void * fifo_write(fifo_t * f, FIFO_SIZE_T n0, void const * data)
70{
71  size_t n = (size_t)n0;
72  void * s = fifo_reserve(f, n0);
73  if (data)
74    memcpy(s, data, n * f->item_size);
75  return s;
76}
77
78UNUSED static void fifo_trim_to(fifo_t * f, FIFO_SIZE_T n0)
79{
80  size_t n = (size_t)n0;
81  n *= f->item_size;
82  f->end = f->begin + n;
83}
84
85UNUSED static void fifo_trim_by(fifo_t * f, FIFO_SIZE_T n0)
86{
87  size_t n = (size_t)n0;
88  n *= f->item_size;
89  f->end -= n;
90}
91
92UNUSED static FIFO_SIZE_T fifo_occupancy(fifo_t * f)
93{
94  return (FIFO_SIZE_T)((f->end - f->begin) / f->item_size);
95}
96
97UNUSED static void * fifo_read(fifo_t * f, FIFO_SIZE_T n0, void * data)
98{
99  size_t n = (size_t)n0;
100  char * ret = f->data + f->begin;
101  n *= f->item_size;
102  if (n > (f->end - f->begin))
103    return NULL;
104  if (data)
105    memcpy(data, ret, (size_t)n);
106  f->begin += n;
107  return ret;
108}
109
110#define fifo_read_ptr(f) fifo_read(f, (FIFO_SIZE_T)0, NULL)
111
112UNUSED static void fifo_delete(fifo_t * f)
113{
114  FIFO_FREE(f->data);
115}
116
117UNUSED static int fifo_create(fifo_t * f, FIFO_SIZE_T item_size)
118{
119  f->item_size = (size_t)item_size;
120  f->allocation = FIFO_MIN;
121  fifo_clear(f);
122  return !(f->data = FIFO_MALLOC(f->allocation));
123}
124
125#endif