/
ringbuffer.h
63 lines (52 loc) · 1.7 KB
/
ringbuffer.h
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
/*
* This file is part of OpenModelica.
*
* Copyright (c) 1998-2008, Linköpings University,
* Department of Computer and Information Science,
* SE-58183 Linköping, Sweden.
*
* All rights reserved.
*
* THIS PROGRAM IS PROVIDED UNDER THE TERMS OF THIS OSMC PUBLIC
* LICENSE (OSMC-PL). ANY USE, REPRODUCTION OR DISTRIBUTION OF
* THIS PROGRAM CONSTITUTES RECIPIENT'S ACCEPTANCE OF THE OSMC
* PUBLIC LICENSE.
*
* The OpenModelica software and the Open Source Modelica
* Consortium (OSMC) Public License (OSMC-PL) are obtained
* from Linköpings University, either from the above address,
* from the URL: http://www.ida.liu.se/projects/OpenModelica
* and in the OpenModelica distribution.
*
* This program is distributed WITHOUT ANY WARRANTY; without
* even the implied warranty of MERCHANTABILITY or FITNESS
* FOR A PARTICULAR PURPOSE, EXCEPT AS EXPRESSLY SET FORTH
* IN THE BY RECIPIENT SELECTED SUBSIDIARY LICENSE CONDITIONS
* OF OSMC-PL.
*
* See the full OSMC Public License conditions for more details.
*
*/
#ifndef RINGBUFFER_H
#define RINGBUFFER_H
/*
* This is an expanding ring buffer.
* When it gets full, it doubles in size.
* It's basically a queue which has get(ix) instead of get_first()/delete_first().
*/
#ifdef __cplusplus
extern "C" {
#endif
struct RINGBUFFER;
typedef struct RINGBUFFER RINGBUFFER;
RINGBUFFER *allocRingBuffer(int bufferSize, int itemSize);
void freeRingBuffer(RINGBUFFER *rb);
void *getRingData(RINGBUFFER *rb, int nIndex);
void appendRingData(RINGBUFFER *rb, void *value);
void dequeueNFirstRingDatas(RINGBUFFER *rb, int n);
int ringBufferLength(RINGBUFFER *rb);
void rotateRingBuffer(RINGBUFFER *rb, int n);
#ifdef __cplusplus
}
#endif
#endif