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
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
|
/*
* Ouroboros - Copyright (C) 2016
*
* Data Unit Buffer
*
* Dimitri Staessens <dimitri.staessens@intec.ugent.be>
* Sander Vrijders <sander.vrijders@intec.ugent.be>
*
* 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., 675 Mass Ave, Cambridge, MA 02139, USA.
*/
#include <malloc.h>
#include <string.h>
#include <errno.h>
#include "ouroboros/du_buff.h"
#define OUROBOROS_PREFIX "du_buff"
#include "ouroboros/logs.h"
struct buffer {
uint8_t * data;
size_t size;
struct list_head list;
};
struct du_buff {
struct buffer * buffer;
size_t size;
size_t du_start;
size_t du_end;
struct list_head list;
};
void buffer_destroy(struct buffer * buf)
{
if (buf == NULL) {
LOG_DBGF("Bogus input, bugging out.");
return;
}
list_del(&(buf->list));
free (&(buf->data));
free (buf);
}
void buffer_destroy_list(struct buffer * head)
{
struct list_head * ptr;
struct list_head * n;
if (head == NULL) {
LOG_DBGF("Bogus input, bugging out.");
return;
}
list_for_each_safe(ptr, n, &(head->list)) {
struct buffer * tmp = list_entry(ptr, struct buffer, list);
list_del(ptr);
buffer_destroy(tmp);
}
}
struct buffer * buffer_create (size_t size)
{
struct buffer * head = NULL;
size_t remaining = size;
const size_t page_size = sysconf(_SC_PAGESIZE);
head = (struct buffer *) malloc(sizeof(struct buffer));
head->size=0;
head->data=NULL;
INIT_LIST_HEAD(&(head->list));
while (remaining > 0) {
struct buffer * buf;
size_t sz = remaining < page_size ? remaining : page_size;
buf = (struct buffer *) malloc(sizeof(struct buffer));
if (buf == NULL) {
LOG_WARN("Could not allocate struct.");
return NULL;
}
buf->data = (uint8_t *) malloc(sz);
if (buf->data == NULL) {
LOG_WARN("Could not allocate memory block.");
buffer_destroy_list(head);
return NULL;
}
buf->size = sz;
list_add_tail(&(buf->list), &(head->list));
remaining -= buf->size;
}
return head;
}
struct buffer * buffer_seek(const struct buffer * head, size_t pos)
{
struct list_head * ptr = NULL;
size_t cur_buf_start = 0;
size_t cur_buf_end = 0;
if (head == NULL) {
LOG_DBGF("Bogus input, bugging out.");
return NULL;
}
list_for_each(ptr, &(head->list)) {
struct buffer * tmp = list_entry(ptr, struct buffer, list);
if (tmp == NULL) {
LOG_WARN("Could not iterate over elements %p", head);
return NULL;
}
cur_buf_end = cur_buf_start + tmp->size;
if (cur_buf_end > pos)
return tmp;
cur_buf_start = cur_buf_end;
}
return NULL;
}
uint8_t * buffer_seek_pos(const struct buffer * head, size_t pos)
{
struct list_head * ptr = NULL;
size_t cur_buf_start = 0;
size_t cur_buf_end = 0;
if (head == NULL) {
LOG_DBGF("Bogus input, bugging out.");
return NULL;
}
list_for_each(ptr, &(head->list)) {
struct buffer * tmp = list_entry(ptr, struct buffer, list);
cur_buf_end = cur_buf_start + tmp->size;
if (cur_buf_end > pos)
return tmp->data + (pos - cur_buf_start);
cur_buf_start = cur_buf_end;
}
return NULL;
}
int buffer_copy_data(struct buffer * head,
size_t pos,
const void * src,
size_t len)
{
struct list_head * ptr = NULL;
struct buffer * buf_start = NULL;
struct buffer * buf_end = NULL;
uint8_t * ptr_start = NULL;
size_t space_in_buf;
size_t bytes_remaining;
uint8_t * copy_pos = NULL;
if (head == NULL || src == NULL) {
LOG_DBGF("Bogus input, bugging out.");
return -EINVAL;
}
buf_start = buffer_seek(head, pos);
buf_end = buffer_seek(head, pos + len);
if (buf_start == NULL || buf_end == NULL) {
LOG_DBGF("Index out of bounds %llu, %llu", pos, pos + len);
return -EINVAL;
}
ptr_start = buffer_seek_pos(head, pos);
if (buf_start == buf_end) {
memcpy(ptr_start, src, len);
return 0;
}
copy_pos = (uint8_t *)src;
bytes_remaining = len;
list_for_each(ptr, &(head->list)) {
struct buffer * tmp = list_entry(ptr, struct buffer, list);
if (tmp != buf_start)
continue;
space_in_buf = (tmp->data + tmp->size) - ptr_start;
if (space_in_buf >= bytes_remaining) {
memcpy(ptr_start, copy_pos, bytes_remaining);
return 0;
}
else
memcpy(ptr_start, copy_pos, space_in_buf);
bytes_remaining -= space_in_buf;
}
return 0;
}
du_buff_t * du_buff_create(size_t size)
{
du_buff_t * dub = (du_buff_t *)malloc(sizeof(du_buff_t));
if (dub == NULL) {
LOG_DBGF("Bogus input, bugging out.");
return NULL;
}
dub->buffer = buffer_create(size);
if (dub->buffer == NULL) {
free (dub);
return NULL;
}
dub->size = size;
dub->du_start = 0;
dub->du_end = 0;
INIT_LIST_HEAD(&(dub->list));
return dub;
}
void du_buff_destroy(du_buff_t * dub)
{
if (dub == NULL) {
LOG_DBGF("Bogus input, bugging out.");
return;
}
buffer_destroy_list(dub->buffer);
list_del(&(dub->list));
free (dub);
}
int du_buff_init(du_buff_t * dub,
size_t start,
uint8_t * data,
size_t len)
{
if (dub == NULL || data == NULL) {
LOG_DBG("Bogus input, bugging out.");
return -EINVAL;
}
if (start + len > dub->size) {
LOG_DBGF("Index out of bounds %llu.", start);
return -EINVAL;
}
dub->du_start = start;
dub->du_end = start + len;
return buffer_copy_data(dub->buffer, start, data, len);
}
int du_buff_head_alloc(du_buff_t * dub, size_t size)
{
if (dub == NULL) {
LOG_DBGF("Bogus input, bugging out.");
return -EINVAL;
}
if (dub->du_start - size < 0) {
LOG_WARN("Failed to allocate PCI headspace");
return -1;
}
dub->du_start -= size;
return 0;
}
int du_buff_tail_alloc(du_buff_t * dub, size_t size)
{
if (dub == NULL) {
LOG_DBGF("Bogus input, bugging out.");
return -EINVAL;
}
if (dub->du_end + size >= dub->size) {
LOG_WARN("Failed to allocate PCI tailspace");
return -1;
}
dub->du_end += size;
return 0;
}
int du_buff_head_release(du_buff_t * dub, size_t size)
{
if (dub == NULL) {
LOG_DBGF("Bogus input, bugging out.");
return -EINVAL;
}
if (size > dub->du_end - dub->du_start) {
LOG_WARN("Tried to release beyond sdu boundary");
return -1;
}
dub->du_start += size;
/* FIXME: copy some random crap to the buffer for security */
return 0;
}
int du_buff_tail_release(du_buff_t * dub, size_t size)
{
if (dub == NULL) {
LOG_DBGF("Bogus input, bugging out.");
return -EINVAL;
}
if (size > dub->du_end - dub->du_start) {
LOG_WARN("Tried to release beyond sdu boundary");
return -1;
}
dub->du_end -= size;
/* FIXME: copy some random crap to the buffer for security */
return 0;
}
|