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
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
|
/* Implementation of a virtual FIFO for OpenPCD
* (C) 2006 by Harald Welte <hwelte@hmw-consulting.de>
*
* This program is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation; either version 2 of the License, or
* (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program; if not, write to the Free Software
* Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
*
*/
#include "fifo.h"
#include <errno.h>
#include <string.h>
#define FIFO_IRQ_LO 0x01
#define FIFO_IRQ_HI 0x02
#define FIFO_IRQ_OFLOW 0x04
/* returns number of data bytes present in the fifo */
int fifo_available(struct fifo *fifo)
{
if (fifo->producer > fifo->consumer)
return fifo->producer - fifo->consumer;
else
return (fifo->size - fifo->consumer) + fifo->producer;
}
void fifo_check_water(struct fifo *fifo)
{
int avail = fifo_available(fifo);
if (avail <= fifo->watermark)
fifo->irq |= FIFO_IRQ_LO;
else
fifo->irq &= FIFO_IRQ_LO;
if (fifo->size - avail >= fifo->watermark)
fifo->irq |= FIFO_IRQ_HI;
else
fifo->irq &= FIFO_IRQ_HI;
}
void fifo_check_raise_int(struct fifo *fifo)
{
if (fifo->irq & fifo->irq_en)
fifo->callback(fifo, fifo->irq, fifo->cb_data);
}
u_int16_t fifo_data_put(struct fifo *fifo, u_int16_t len, u_int8_t *data)
{
if (len > fifo_available(fifo)) {
len = fifo_available(fifo);
fifo->irq |= FIFO_IRQ_OFLOW;
}
if (len + fifo->producer <= fifo->size) {
/* easy case */
memcpy(&fifo->data[fifo->producer], data, len);
fifo->producer += len;
} else {
/* difficult: wrap around */
u_int16_t chunk_len;
chunk_len = fifo->size - fifo->producer;
memcpy(&fifo->data[fifo->producer], data, chunk_len);
memcpy(&fifo->data[0], data + chunk_len, len - chunk_len);
fifo->producer = len - chunk_len;
}
fifo_check_water(fifo);
return len;
}
u_int16_t fifo_data_get(struct fifo *fifo, u_int16_t len, u_int8_t *data)
{
u_int16_t avail = fifo_available(fifo);
if (avail < len)
len = avail;
if (fifo->producer > fifo->consumer) {
/* easy case */
memcpy(data, &fifo->data[fifo->consumer], len);
} else {
/* difficult case: wrap */
u_int16_t chunk_len = fifo->size - fifo->consumer;
memcpy(data, &fifo->data[fifo->consumer], chunk_len);
memcpy(data+chunk_len, &fifo->data[0], len - chunk_len);
}
fifo_check_water(fifo);
return len;
}
int fifo_init(struct fifo *fifo, u_int16_t size,
void (*cb)(struct fifo *fifo, u_int8_t event, void *data), void *cb_data)
{
if (size > sizeof(fifo->data))
return -EINVAL;
memset(fifo->data, 0, sizeof(fifo->data));
fifo->size = size;
fifo->producer = fifo->consumer = 0;
fifo->watermark = 0;
fifo->callback = cb;
fifo->cb_data = cb_data;
return 0;
}
|
