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
|
/*
* Copyright (c) 2020-2022 Arm Limited.
*
* SPDX-License-Identifier: Apache-2.0
*
* Licensed under the Apache License, Version 2.0 (the License); you may
* not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an AS IS BASIS, WITHOUT
* WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
#include "message_queue.hpp"
#include <cstddef>
#include <cstdio>
#include <cstring>
#include <inttypes.h>
namespace MessageQueue {
QueueImpl::QueueImpl(EthosU::ethosu_core_queue &_queue) : queue(_queue) {
cleanHeaderData();
}
bool QueueImpl::empty() const {
invalidateHeaderData();
return queue.header.read == queue.header.write;
}
size_t QueueImpl::available() const {
invalidateHeaderData();
size_t avail = queue.header.write - queue.header.read;
if (queue.header.read > queue.header.write) {
avail += queue.header.size;
}
return avail;
}
size_t QueueImpl::capacity() const {
return queue.header.size - available();
}
bool QueueImpl::read(uint8_t *dst, uint32_t length) {
const uint8_t *end = dst + length;
// Available will invalidate the cache
if (length > available()) {
return false;
}
uint32_t rpos = queue.header.read;
while (dst < end) {
*dst++ = queue.data[rpos];
rpos = (rpos + 1) % queue.header.size;
}
queue.header.read = rpos;
cleanHeader();
return true;
}
bool QueueImpl::write(const Vec *vec, size_t length) {
size_t total = 0;
for (size_t i = 0; i < length; i++) {
total += vec[i].length;
}
invalidateHeader();
if (total > capacity()) {
return false;
}
uint32_t wpos = queue.header.write;
for (size_t i = 0; i < length; i++) {
const uint8_t *src = reinterpret_cast<const uint8_t *>(vec[i].base);
const uint8_t *end = src + vec[i].length;
while (src < end) {
queue.data[wpos] = *src++;
wpos = (wpos + 1) % queue.header.size;
}
}
// Update the write position last
queue.header.write = wpos;
cleanHeaderData();
return true;
}
bool QueueImpl::write(const uint32_t type, const void *src, uint32_t length) {
EthosU::ethosu_core_msg msg = {ETHOSU_CORE_MSG_MAGIC, type, length};
Vec vec[2] = {{&msg, sizeof(msg)}, {src, length}};
return write(vec, 2);
}
// Skip to magic or end of queue
void QueueImpl::reset() {
invalidateHeader();
queue.header.read = queue.header.write;
cleanHeader();
}
void QueueImpl::cleanHeader() const {
#if defined(__DCACHE_PRESENT) && (__DCACHE_PRESENT == 1U)
SCB_CleanDCache_by_Addr(reinterpret_cast<uint32_t *>(&queue.header), sizeof(queue.header));
#endif
}
void QueueImpl::cleanHeaderData() const {
#if defined(__DCACHE_PRESENT) && (__DCACHE_PRESENT == 1U)
SCB_CleanDCache_by_Addr(reinterpret_cast<uint32_t *>(&queue.header), sizeof(queue.header));
uintptr_t queueDataPtr = reinterpret_cast<uintptr_t>(&queue.data[0]);
SCB_CleanDCache_by_Addr(reinterpret_cast<uint32_t *>(queueDataPtr & ~3), queue.header.size + (queueDataPtr & 3));
#endif
}
void QueueImpl::invalidateHeader() const {
#if defined(__DCACHE_PRESENT) && (__DCACHE_PRESENT == 1U)
SCB_InvalidateDCache_by_Addr(reinterpret_cast<uint32_t *>(&queue.header), sizeof(queue.header));
#endif
}
void QueueImpl::invalidateHeaderData() const {
#if defined(__DCACHE_PRESENT) && (__DCACHE_PRESENT == 1U)
SCB_InvalidateDCache_by_Addr(reinterpret_cast<uint32_t *>(&queue.header), sizeof(queue.header));
uintptr_t queueDataPtr = reinterpret_cast<uintptr_t>(&queue.data[0]);
SCB_InvalidateDCache_by_Addr(reinterpret_cast<uint32_t *>(queueDataPtr & ~3),
queue.header.size + (queueDataPtr & 3));
#endif
}
} // namespace MessageQueue
|
