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
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
|
/*
* Copyright (c) 2011-2014, Intel Corporation
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without modification,
* are permitted provided that the following conditions are met:
*
* 1. Redistributions of source code must retain the above copyright notice, this
* list of conditions and the following disclaimer.
*
* 2. Redistributions in binary form must reproduce the above copyright notice,
* this list of conditions and the following disclaimer in the documentation and/or
* other materials provided with the distribution.
*
* 3. Neither the name of the copyright holder nor the names of its contributors
* may be used to endorse or promote products derived from this software without
* specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
* WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
* DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR
* ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
* (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
* LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON
* ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
* SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/
#include "Message.h"
#include <assert.h>
#include "Socket.h"
#include "RemoteProcessorProtocol.h"
#include <string.h>
#include <assert.h>
CMessage::CMessage(uint8_t ucMsgId) : _ucMsgId(ucMsgId), _pucData(NULL), _uiDataSize(0), _uiIndex(0)
{
}
CMessage::CMessage() : _ucMsgId((uint8_t)-1), _pucData(NULL), _uiDataSize(0), _uiIndex(0)
{
}
CMessage::~CMessage()
{
delete [] _pucData;
}
// Msg Id
uint8_t CMessage::getMsgId() const
{
return _ucMsgId;
}
// Data
void CMessage::writeData(const void* pvData, uint32_t uiSize)
{
assert(_uiIndex + uiSize <= _uiDataSize);
// Copy
memcpy(&_pucData[_uiIndex], pvData, uiSize);
// Index
_uiIndex += uiSize;
}
void CMessage::readData(void* pvData, uint32_t uiSize)
{
assert(_uiIndex + uiSize <= _uiDataSize);
// Copy
memcpy(pvData, &_pucData[_uiIndex], uiSize);
// Index
_uiIndex += uiSize;
}
void CMessage::writeString(const string& strData)
{
// Size
uint32_t uiSize = strData.length();
writeData(&uiSize, sizeof(uiSize));
// Content
writeData(strData.c_str(), uiSize);
}
void CMessage::readString(string& strData)
{
// Size
uint32_t uiSize;
readData(&uiSize, sizeof(uiSize));
// Data
char* pcData = new char[uiSize + 1];
// Content
readData(pcData, uiSize);
// NULL-terminate string
pcData[uiSize] = '\0';
// Output
strData = pcData;
// Delete
delete [] pcData;
}
uint32_t CMessage::getStringSize(const string& strData) const
{
// Return string length plus room to store its length
return strData.length() + sizeof(uint32_t);
}
// Remaining data size
uint32_t CMessage::getRemainingDataSize() const
{
return _uiDataSize - _uiIndex;
}
// Send/Receive
bool CMessage::serialize(CSocket* pSocket, bool bOut)
{
if (bOut) {
// Make room for data to send
allocateData(getDataSize());
// Get data from derived
fillDataToSend();
// Finished providing data?
assert(_uiIndex == _uiDataSize);
// First send sync word
uint16_t uiSyncWord = SYNC_WORD;
if (!pSocket->write(&uiSyncWord, sizeof(uiSyncWord))) {
return false;
}
// Size
uint32_t uiSize = sizeof(_ucMsgId) + _uiDataSize;
if (!pSocket->write(&uiSize, sizeof(uiSize))) {
return false;
}
// Msg Id
if (!pSocket->write(&_ucMsgId, sizeof(_ucMsgId))) {
return false;
}
// Data
if (!pSocket->write(_pucData, _uiDataSize)) {
return false;
}
// Checksum
uint8_t ucChecksum = computeChecksum();
if (!pSocket->write(&ucChecksum, sizeof(ucChecksum))) {
return false;
}
} else {
// First read sync word
uint16_t uiSyncWord;
if (!pSocket->read(&uiSyncWord, sizeof(uiSyncWord))) {
return false;
}
// Check Sync word
if (uiSyncWord != SYNC_WORD) {
return false;
}
// Size
uint32_t uiSize;
if (!pSocket->read(&uiSize, sizeof(uiSize))) {
return false;
}
// Msg Id
if (!pSocket->read(&_ucMsgId, sizeof(_ucMsgId))) {
return false;
}
// Data
// Allocate
allocateData(uiSize - sizeof(_ucMsgId));
// Data receive
if (!pSocket->read(_pucData, _uiDataSize)) {
return false;
}
// Checksum
uint8_t ucChecksum;
if (!pSocket->read(&ucChecksum, sizeof(ucChecksum))) {
return false;
}
// Compare
if (ucChecksum != computeChecksum()) {
return false;
}
// Collect data in derived
collectReceivedData();
}
return true;
}
// Checksum
uint8_t CMessage::computeChecksum() const
{
uint8_t uiChecksum = _ucMsgId;
uint32_t uiIndex;
for (uiIndex = 0; uiIndex < _uiDataSize; uiIndex++) {
uiChecksum += _pucData[uiIndex];
}
return uiChecksum;
}
// Data allocation
void CMessage::allocateData(uint32_t uiSize)
{
// Remove previous one
if (_pucData) {
delete [] _pucData;
}
// Do allocate
_pucData = new uint8_t[uiSize];
// Record size
_uiDataSize = uiSize;
// Reset Index
_uiIndex = 0;
}
|