blob: f11e02ba78ddf0fcf0081052f662fa30885befee (
plain)
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
|
#include "ringbuffer.h"
#include "kmalloc.h"
#include "log.h"
#include "asm_x86.h"
ringbuffer ringbuffer_init(uint32_t size)
{
ringbuffer f;
f.data=kballoc(size);
f.size=size*4096;
f.front=0;
f.back=0;
return f;
}
void ringbuffer_free(ringbuffer *f)
{
kbfree(f->data);
}
bool ringbuffer_full(ringbuffer* f)
{
return((f->back+1)%f->size==f->front);
}
bool ringbuffer_empty(ringbuffer* f)
{
return(f->front==f->back);
}
bool ringbuffer_has(ringbuffer* f)
{
return !ringbuffer_empty(f);
}
bool ringbuffer_put(ringbuffer* f,uint8_t c)
{
if(ringbuffer_full(f))
{
klog("ringbuffer is full!");
return false;
}
f->data[f->back]=c;
f->back++;
f->back%=f->size;
return true;
}
uint8_t ringbuffer_get(ringbuffer* f)
{
if(ringbuffer_empty(f))return 0; // indistinguishable from value 0 :( // TODO
uint8_t c = f->data[f->front];
f->front++;
f->front%=f->size;
return c;
}
// TODO //
uint32_t ringbuffer_write(ringbuffer* f, uint8_t *buf, uint32_t size)
{
return 0;
}
uint32_t ringbuffer_read(ringbuffer* f, uint8_t *buf, uint32_t size)
{
return 0;
}
|