-
Notifications
You must be signed in to change notification settings - Fork 299
/
ringbuffer.c
94 lines (82 loc) · 2.39 KB
/
ringbuffer.c
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
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
/*
* 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.
*
*/
#include "ringbuffer.h"
#include <assert.h>
#include <stdlib.h>
#include <memory.h>
void allocRingBuffer(RINGBUFFER* rb, int sz, int item_size)
{
rb->first_element = 0;
rb->num_element = 0;
rb->buf_size = sz > 0 ? sz : 1;
rb->item_size = item_size;
rb->buffer = calloc(rb->buf_size, rb->item_size);
assert(rb->buffer);
}
void freeRingBuffer(RINGBUFFER* rb)
{
free(rb->buffer);
}
void* getRingData(RINGBUFFER* rb, int nIndex)
{
assert(nIndex < rb->num_element);
assert(0 <= nIndex);
return ((char*)rb->buffer)+(((rb->first_element+nIndex)%rb->buf_size)*rb->item_size);
}
void expandRingBuffer(RINGBUFFER* rb)
{
int i;
void* temp = calloc(2*rb->buf_size, rb->item_size);
assert(temp);
for(i=0; i<rb->num_element; i++)
memcpy(((char*)temp)+(i*rb->item_size), getRingData(rb, i), rb->item_size);
free(rb->buffer);
rb->buffer = temp;
rb->buf_size *= 2;
rb->first_element = 0;
}
void appendRingData(RINGBUFFER* rb, void* value)
{
if(rb->buf_size < rb->num_element+1)
expandRingBuffer(rb);
memcpy(((char*)rb->buffer)+(((rb->first_element+rb->num_element)%rb->buf_size)*rb->item_size), value, rb->item_size);
++rb->num_element;
}
void dequeueNFirstRingDatas(RINGBUFFER* rb, int n)
{
assert(n <= rb->num_element);
assert(0 <= n);
rb->first_element = (rb->first_element+n)%rb->buf_size;
rb->num_element -= n;
}
int ringBufferLength(RINGBUFFER* rb)
{
return rb->num_element;
}