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
|
/*
* 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 "RequestMessage.h"
#include "RemoteProcessorProtocol.h"
#include <assert.h>
#include <algorithm>
#include <ctype.h>
#define base CMessage
using std::string;
const char* const CRequestMessage::gacDelimiters = " \t\n\v\f\r";
CRequestMessage::CRequestMessage(const string& strCommand) : base(ECommandRequest), _strCommand(strCommand)
{
}
CRequestMessage::CRequestMessage()
{
}
// Command Name
void CRequestMessage::setCommand(const string& strCommand)
{
_strCommand = trim(strCommand);
}
const string& CRequestMessage::getCommand() const
{
return _strCommand;
}
// Arguments
void CRequestMessage::addArgument(const string& strArgument)
{
_argumentVector.push_back(trim(strArgument));
}
uint32_t CRequestMessage::getArgumentCount() const
{
return _argumentVector.size();
}
const string& CRequestMessage::getArgument(uint32_t uiArgument) const
{
assert(uiArgument < _argumentVector.size());
return _argumentVector[uiArgument];
}
const string CRequestMessage::packArguments(uint32_t uiStartArgument, uint32_t uiNbArguments) const
{
string strPackedArguments;
assert(uiStartArgument + uiNbArguments <= _argumentVector.size());
// Pack arguments, separating them with a space
uint32_t uiArgument;
bool bFirst = true;
for (uiArgument = uiStartArgument; uiArgument < uiStartArgument + uiNbArguments; uiArgument++) {
if (!bFirst) {
strPackedArguments += " ";
} else {
bFirst = false;
}
strPackedArguments += _argumentVector[uiArgument];
}
return strPackedArguments;
}
// Fill data to send
void CRequestMessage::fillDataToSend()
{
// Send command
writeString(getCommand());
// Arguments
uint32_t uiArgument;
for (uiArgument = 0; uiArgument < getArgumentCount(); uiArgument++) {
writeString(getArgument(uiArgument));
}
}
// Collect received data
void CRequestMessage::collectReceivedData()
{
// Receive command
string strCommand;
readString(strCommand);
setCommand(strCommand);
// Arguments
while (getRemainingDataSize()) {
string strArgument;
readString(strArgument);
addArgument(strArgument);
}
}
// Size
size_t CRequestMessage::getDataSize() const
{
// Command
size_t uiSize = getStringSize(getCommand());
// Arguments
uint32_t uiArgument;
for (uiArgument = 0; uiArgument < getArgumentCount(); uiArgument++) {
uiSize += getStringSize(getArgument(uiArgument));
}
return uiSize;
}
// Trim input string
string CRequestMessage::trim(const string& strToTrim)
{
// Trim string
string strTrimmed = strToTrim;
strTrimmed.erase(strTrimmed.find_last_not_of(gacDelimiters) + 1 );
strTrimmed.erase(0, strTrimmed.find_first_not_of(gacDelimiters));
return strTrimmed;
}
|
