-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathqueue.c
More file actions
78 lines (64 loc) · 1.93 KB
/
Copy pathqueue.c
File metadata and controls
78 lines (64 loc) · 1.93 KB
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
/*******************************************************************************
Copyright 2014 Matthew Thiffault
This file is part of HeatheRTOS.
HeatheRTOS 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.
HeatheRTOS 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 HeatheRTOS. If not, see <http://www.gnu.org/licenses/>.
*******************************************************************************/
#include "xbool.h"
#include "queue.h"
#include "xdef.h"
#include "xmemcpy.h"
#include "xassert.h"
/* Initialize a queue */
void
q_init(struct queue *q, void *mem, int eltsize, int memsize)
{
q->mem = mem;
q->eltsize = eltsize;
q->cap = (memsize / eltsize) * eltsize;
q->wr = 0;
q->rd = 0;
q->size = 0;
q->count = 0;
}
/* Remove an item from the queue */
bool
q_dequeue(struct queue *q, void *buf_out)
{
if (q->size == 0)
return false;
memcpy(buf_out, q->mem + q->rd, q->eltsize);
q->rd += q->eltsize;
q->rd %= q->cap;
q->size -= q->eltsize;
q->count--;
return true;
}
/* Add an item to the queue */
int
q_enqueue(struct queue *q, const void *buf_in)
{
if (q->size == q->cap)
return -1;
assert(q->size <= q->cap - q->eltsize);
memcpy(q->mem + q->wr, buf_in, q->eltsize);
q->wr += q->eltsize;
q->wr %= q->cap;
q->size += q->eltsize;
q->count++;
return 0;
}
/* Returns how many items are in a queue */
int
q_size(struct queue *q)
{
return q->count;
}