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
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
|
/* $Header: /pjproject-0.3/pjlib/src/pj/fifobuf.c 4 9/17/05 10:37a Bennylp $ */
/* $Log: /pjproject-0.3/pjlib/src/pj/fifobuf.c $
*
* 4 9/17/05 10:37a Bennylp
* Major reorganization towards version 0.3.
*
*/
#include <pj/fifobuf.h>
#include <pj/log.h>
#include <pj/assert.h>
#include <pj/os.h>
#define THIS_FILE "fifobuf"
#define SZ sizeof(unsigned)
PJ_DEF(void)
pj_fifobuf_init (pj_fifobuf_t *fifobuf, void *buffer, unsigned size)
{
PJ_CHECK_STACK();
PJ_LOG(6, (THIS_FILE,
"fifobuf_init fifobuf=%p buffer=%p, size=%d",
fifobuf, buffer, size));
fifobuf->first = buffer;
fifobuf->last = fifobuf->first + size;
fifobuf->ubegin = fifobuf->uend = fifobuf->first;
fifobuf->full = 0;
}
PJ_DEF(unsigned)
pj_fifobuf_max_size (pj_fifobuf_t *fifobuf)
{
unsigned s1, s2;
PJ_CHECK_STACK();
if (fifobuf->uend >= fifobuf->ubegin) {
s1 = fifobuf->last - fifobuf->uend;
s2 = fifobuf->ubegin - fifobuf->first;
} else {
s1 = s2 = fifobuf->ubegin - fifobuf->uend;
}
return s1<s2 ? s2 : s1;
}
PJ_DEF(void*)
pj_fifobuf_alloc (pj_fifobuf_t *fifobuf, unsigned size)
{
unsigned available;
char *start;
PJ_CHECK_STACK();
if (fifobuf->full) {
PJ_LOG(6, (THIS_FILE,
"fifobuf_alloc fifobuf=%p, size=%d: full!",
fifobuf, size));
return NULL;
}
/* try to allocate from the end part of the fifo */
if (fifobuf->uend >= fifobuf->ubegin) {
available = fifobuf->last - fifobuf->uend;
if (available >= size+SZ) {
char *ptr = fifobuf->uend;
fifobuf->uend += (size+SZ);
if (fifobuf->uend == fifobuf->last)
fifobuf->uend = fifobuf->first;
if (fifobuf->uend == fifobuf->ubegin)
fifobuf->full = 1;
*(unsigned*)ptr = size+SZ;
ptr += SZ;
PJ_LOG(6, (THIS_FILE,
"fifobuf_alloc fifobuf=%p, size=%d: returning %p, p1=%p, p2=%p",
fifobuf, size, ptr, fifobuf->ubegin, fifobuf->uend));
return ptr;
}
}
/* try to allocate from the start part of the fifo */
start = (fifobuf->uend <= fifobuf->ubegin) ? fifobuf->uend : fifobuf->first;
available = fifobuf->ubegin - start;
if (available >= size+SZ) {
char *ptr = start;
fifobuf->uend = start + size + SZ;
if (fifobuf->uend == fifobuf->ubegin)
fifobuf->full = 1;
*(unsigned*)ptr = size+SZ;
ptr += SZ;
PJ_LOG(6, (THIS_FILE,
"fifobuf_alloc fifobuf=%p, size=%d: returning %p, p1=%p, p2=%p",
fifobuf, size, ptr, fifobuf->ubegin, fifobuf->uend));
return ptr;
}
PJ_LOG(6, (THIS_FILE,
"fifobuf_alloc fifobuf=%p, size=%d: no space left! p1=%p, p2=%p",
fifobuf, size, fifobuf->ubegin, fifobuf->uend));
return NULL;
}
PJ_DEF(pj_status_t)
pj_fifobuf_unalloc (pj_fifobuf_t *fifobuf, void *buf)
{
char *ptr = buf;
char *endptr;
unsigned sz;
PJ_CHECK_STACK();
ptr -= SZ;
sz = *(unsigned*)ptr;
endptr = fifobuf->uend;
if (endptr == fifobuf->first)
endptr = fifobuf->last;
if (ptr+sz != endptr) {
pj_assert(!"Invalid pointer to undo alloc");
return -1;
}
fifobuf->uend = ptr;
fifobuf->full = 0;
PJ_LOG(6, (THIS_FILE,
"fifobuf_unalloc fifobuf=%p, ptr=%p, size=%d, p1=%p, p2=%p",
fifobuf, buf, sz, fifobuf->ubegin, fifobuf->uend));
return 0;
}
PJ_DEF(pj_status_t)
pj_fifobuf_free (pj_fifobuf_t *fifobuf, void *buf)
{
char *ptr = buf;
char *end;
unsigned sz;
PJ_CHECK_STACK();
ptr -= SZ;
if (ptr < fifobuf->first || ptr >= fifobuf->last) {
pj_assert(!"Invalid pointer to free");
return -1;
}
if (ptr != fifobuf->ubegin && ptr != fifobuf->first) {
pj_assert(!"Invalid free() sequence!");
return -1;
}
end = (fifobuf->uend > fifobuf->ubegin) ? fifobuf->uend : fifobuf->last;
sz = *(unsigned*)ptr;
if (ptr+sz > end) {
pj_assert(!"Invalid size!");
return -1;
}
fifobuf->ubegin = ptr + sz;
/* Rollover */
if (fifobuf->ubegin == fifobuf->last)
fifobuf->ubegin = fifobuf->first;
/* Reset if fifobuf is empty */
if (fifobuf->ubegin == fifobuf->uend)
fifobuf->ubegin = fifobuf->uend = fifobuf->first;
fifobuf->full = 0;
PJ_LOG(6, (THIS_FILE,
"fifobuf_free fifobuf=%p, ptr=%p, size=%d, p1=%p, p2=%p",
fifobuf, buf, sz, fifobuf->ubegin, fifobuf->uend));
return 0;
}
|
