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
|
/* Copyright (c) 2014, Nordic Semiconductor ASA
*
* Permission is hereby granted, free of charge, to any person obtaining a copy
* of this software and associated documentation files (the "Software"), to deal
* in the Software without restriction, including without limitation the rights
* to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
* copies of the Software, and to permit persons to whom the Software is
* furnished to do so, subject to the following conditions:
*
* The above copyright notice and this permission notice shall be included in all
* copies or substantial portions of the Software.
*
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
* IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
* FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
* AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
* LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
* OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
* SOFTWARE.
*/
/** @file
@brief Implementation of a circular queue for ACI data
*/
#include "hal_aci_tl.h"
#include "aci_queue.h"
void aci_queue_init(aci_queue_t *aci_q)
{
uint8_t loop;
// ble_assert(NULL != aci_q);
aci_q->head = 0;
aci_q->tail = 0;
for(loop=0; loop<ACI_QUEUE_SIZE; loop++)
{
aci_q->aci_data[loop].buffer[0] = 0x00;
aci_q->aci_data[loop].buffer[1] = 0x00;
}
}
bool aci_queue_dequeue(aci_queue_t *aci_q, hal_aci_data_t *p_data)
{
// ble_assert(NULL != aci_q);
// ble_assert(NULL != p_data);
if (aci_queue_is_empty(aci_q))
{
return false;
}
memcpy((uint8_t *)p_data, (uint8_t *)&(aci_q->aci_data[aci_q->head]), sizeof(hal_aci_data_t));
aci_q->head = (aci_q->head + 1) % ACI_QUEUE_SIZE;
return true;
}
bool aci_queue_dequeue_from_isr(aci_queue_t *aci_q, hal_aci_data_t *p_data)
{
// ble_assert(NULL != aci_q);
// ble_assert(NULL != p_data);
if (aci_queue_is_empty_from_isr(aci_q))
{
return false;
}
memcpy((uint8_t *)p_data, (uint8_t *)&(aci_q->aci_data[aci_q->head]), sizeof(hal_aci_data_t));
aci_q->head = (aci_q->head + 1) % ACI_QUEUE_SIZE;
return true;
}
bool aci_queue_enqueue(aci_queue_t *aci_q, hal_aci_data_t *p_data)
{
const uint8_t length = p_data->buffer[0];
// ble_assert(NULL != aci_q);
// ble_assert(NULL != p_data);
if (aci_queue_is_full(aci_q))
{
return false;
}
aci_q->aci_data[aci_q->tail].status_byte = 0;
memcpy((uint8_t *)&(aci_q->aci_data[aci_q->tail].buffer[0]), (uint8_t *)&p_data->buffer[0], length + 1);
aci_q->tail = (aci_q->tail + 1) % ACI_QUEUE_SIZE;
return true;
}
bool aci_queue_enqueue_from_isr(aci_queue_t *aci_q, hal_aci_data_t *p_data)
{
const uint8_t length = p_data->buffer[0];
// ble_assert(NULL != aci_q);
// ble_assert(NULL != p_data);
if (aci_queue_is_full_from_isr(aci_q))
{
return false;
}
aci_q->aci_data[aci_q->tail].status_byte = 0;
memcpy((uint8_t *)&(aci_q->aci_data[aci_q->tail].buffer[0]), (uint8_t *)&p_data->buffer[0], length + 1);
aci_q->tail = (aci_q->tail + 1) % ACI_QUEUE_SIZE;
return true;
}
bool aci_queue_is_empty(aci_queue_t *aci_q)
{
bool state = false;
// ble_assert(NULL != aci_q);
//Critical section
// noInterrupts();
if (aci_q->head == aci_q->tail)
{
state = true;
}
// interrupts();
return state;
}
bool aci_queue_is_empty_from_isr(aci_queue_t *aci_q)
{
// ble_assert(NULL != aci_q);
return aci_q->head == aci_q->tail;
}
bool aci_queue_is_full(aci_queue_t *aci_q)
{
uint8_t next;
bool state;
// ble_assert(NULL != aci_q);
//This should be done in a critical section
// noInterrupts();
next = (aci_q->tail + 1) % ACI_QUEUE_SIZE;
if (next == aci_q->head)
{
state = true;
}
else
{
state = false;
}
// interrupts();
//end
return state;
}
bool aci_queue_is_full_from_isr(aci_queue_t *aci_q)
{
const uint8_t next = (aci_q->tail + 1) % ACI_QUEUE_SIZE;
// ble_assert(NULL != aci_q);
return next == aci_q->head;
}
bool aci_queue_peek(aci_queue_t *aci_q, hal_aci_data_t *p_data)
{
// ble_assert(NULL != aci_q);
// ble_assert(NULL != p_data);
if (aci_queue_is_empty(aci_q))
{
return false;
}
memcpy((uint8_t *)p_data, (uint8_t *)&(aci_q->aci_data[aci_q->head]), sizeof(hal_aci_data_t));
return true;
}
bool aci_queue_peek_from_isr(aci_queue_t *aci_q, hal_aci_data_t *p_data)
{
// ble_assert(NULL != aci_q);
// ble_assert(NULL != p_data);
if (aci_queue_is_empty_from_isr(aci_q))
{
return false;
}
memcpy((uint8_t *)p_data, (uint8_t *)&(aci_q->aci_data[aci_q->head]), sizeof(hal_aci_data_t));
return true;
}
|
