-
Notifications
You must be signed in to change notification settings - Fork 1
/
queue.cpp
139 lines (116 loc) · 2.92 KB
/
queue.cpp
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
/*
* queue.cpp
*
* Created on: May 10, 2016
* Author: Mathias Neerup
*/
#include "queue.h"
QueueHandle_t QueueCreate(uint8_t queuesize, uint8_t typesize){
static uint8_t id_count = 0;
QueueHandle_t currentQueue;
currentQueue.mem = (uint32_t*)calloc(queuesize, typesize);
currentQueue.wr = 0;
currentQueue.rd = 0;
currentQueue.typesize = (typesize);
currentQueue.queuesize = queuesize;
currentQueue.elements = 0;
currentQueue.id = id_count++;
return currentQueue;
}
uint8_t QueueSend(QueueHandle_t *queue, const void * dataIn){
uint8_t retval = false;
/*
//Write-pointer overrun
queue->wr %= queue->queuesize;
if(queue->elements < queue->queuesize){
++queue->elements;
//Copy content of void * dataIn to the queue, and increment write-pointer
memcpy ( queue->mem+((queue->typesize)*(queue->wr++)), dataIn, queue->typesize );
retval = true;
}
*/
cli();
uint8_t wr_next = (queue->wr+1 )% queue->queuesize;
if(wr_next != queue->rd){
queue->elements++;
memcpy ( queue->mem+((queue->typesize)*(queue->wr)), dataIn, queue->typesize );
retval = 1;
queue->wr = wr_next;
}
sei();
return retval;
}
uint8_t QueueReceive(QueueHandle_t *queue, void * dataOut){
uint8_t retval = false;
/*
//check if data is available
if(queue->elements > 0){
--queue->elements;
//Copy content of queue to dataOut
memcpy( dataOut, queue->mem+((queue->typesize)*(queue->rd++)), queue->typesize);
//Pointer read overrun
queue->rd %= queue->queuesize;
retval = true;
}
*/
cli();
if(queue->wr != queue->rd || queue->elements > 0){
queue->elements--;
memcpy( dataOut, queue->mem+((queue->typesize)*(queue->rd)), queue->typesize);
queue->rd = (queue->rd + 1) % queue->queuesize;
retval=true;
} else {
//no items or queue full
retval = false;
}
sei();
return retval;
}
uint8_t QueueSpaceLeft(QueueHandle_t *queue){
return ((queue->queuesize)-(queue->elements));
}
uint8_t QueuePeek(QueueHandle_t *queue, void * dataOut){
uint8_t retval = false;
//check if data is available
if(queue->elements > 0){
//Copy content of queue to dataOut
memcpy( dataOut, queue->mem+(queue->typesize*queue->rd), queue->typesize);
retval = true;
}
return retval;
}
/*
int main(){
QueueHandle_t Queue1 = QueueCreate(8, sizeof(char));
char dataOut;
char dataIn = 'A';
QueueSend(&Queue1, &dataIn);
dataIn = 'B';
QueueSend(&Queue1, &dataIn);
dataIn = 'C';
QueueOverwrite(&Queue1,&dataIn);
dataIn = 'D';
QueueSend(&Queue1, &dataIn);
dataIn = 'E';
QueueSend(&Queue1, &dataIn);
dataIn = 'F';
QueueSend(&Queue1, &dataIn);
dataIn = 'G';
QueueSend(&Queue1, &dataIn);
dataIn = 'H';
QueueSend(&Queue1, &dataIn);
dataIn = 'I';
QueueOverwrite(&Queue1, &dataIn);
dataIn = 'J';
QueueOverwrite(&Queue1, &dataIn);
int i = 0;
for(; i < 10; i++){
if(QueueReceive(&Queue1, &dataOut)){
uartprintf("%d: Out from queue: %c \r\n",i ,dataOut);
} else {
uartprintf("No data available\r\n");
}
}
return 1;
}
*/