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
|
/*
* 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 "SelectionCriterionType.h"
#include "Tokenizer.h"
#define base CElement
const std::string CSelectionCriterionType::_strDelimiter = "|";
CSelectionCriterionType::CSelectionCriterionType(bool bIsInclusive) : _bInclusive(bIsInclusive)
{
// For inclusive criterion type, appends the pair none,0 by default.
if (_bInclusive) {
_numToLitMap["none"] = 0;
}
}
std::string CSelectionCriterionType::getKind() const
{
return "SelectionCriterionType";
}
// From ISelectionCriterionTypeInterface
bool CSelectionCriterionType::addValuePair(int iValue, const std::string& strValue)
{
// Check 1 bit set only for inclusive types
if (_bInclusive && (!iValue || (iValue & (iValue - 1)))) {
log_warning("Rejecting value pair association: 0x%X - %s for Selection Criterion Type %s", iValue, strValue.c_str(), getName().c_str());
return false;
}
// Check already inserted
if (_numToLitMap.find(strValue) != _numToLitMap.end()) {
log_warning("Rejecting value pair association (literal already present): 0x%X - %s for Selection Criterion Type %s", iValue, strValue.c_str(), getName().c_str());
return false;
}
_numToLitMap[strValue] = iValue;
return true;
}
bool CSelectionCriterionType::getNumericalValue(const std::string& strValue, int& iValue) const
{
if (_bInclusive) {
Tokenizer tok(strValue, _strDelimiter);
std::vector<std::string> astrValues = tok.split();
uint32_t uiNbValues = astrValues.size();
int iResult = 0;
uint32_t uiValueIndex;
// Looping on each std::string delimited by "|" token and adding the associated value
for (uiValueIndex = 0; uiValueIndex < uiNbValues; uiValueIndex++) {
if (!getAtomicNumericalValue(astrValues[uiValueIndex], iResult)) {
return false;
}
iValue |= iResult;
}
return true;
}
return getAtomicNumericalValue(strValue, iValue);
}
bool CSelectionCriterionType::getAtomicNumericalValue(const std::string& strValue, int& iValue) const
{
NumToLitMapConstIt it = _numToLitMap.find(strValue);
if (it != _numToLitMap.end()) {
iValue = it->second;
return true;
}
return false;
}
bool CSelectionCriterionType::getLiteralValue(int iValue, std::string& strValue) const
{
NumToLitMapConstIt it;
for (it = _numToLitMap.begin(); it != _numToLitMap.end(); ++it) {
if (it->second == iValue) {
strValue = it->first;
return true;
}
}
return false;
}
bool CSelectionCriterionType::isTypeInclusive() const
{
return _bInclusive;
}
// Value list
std::string CSelectionCriterionType::listPossibleValues() const
{
std::string strValueList = "{";
// Get comma seprated list of values
NumToLitMapConstIt it;
bool bFirst = true;
for (it = _numToLitMap.begin(); it != _numToLitMap.end(); ++it) {
if (bFirst) {
bFirst = false;
} else {
strValueList += ", ";
}
strValueList += it->first;
}
strValueList += "}";
return strValueList;
}
// Formatted state
std::string CSelectionCriterionType::getFormattedState(int iValue) const
{
std::string strFormattedState;
if (_bInclusive) {
// Need to go through all set bit
uint32_t uiBit;
bool bFirst = true;
for (uiBit = 0; uiBit < sizeof(iValue) * 8; uiBit++) {
int iSingleBitValue = iValue & (1 << uiBit);
// Check if current bit is set
if (!iSingleBitValue) {
continue;
}
// Simple translation
std::string strSingleValue;
getLiteralValue(iSingleBitValue, strSingleValue);
if (bFirst) {
bFirst = false;
} else {
strFormattedState += "|";
}
strFormattedState += strSingleValue;
}
} else {
// Simple translation
getLiteralValue(iValue, strFormattedState);
}
// Sometimes nothing is set
if (strFormattedState.empty()) {
strFormattedState = "<none>";
}
return strFormattedState;
}
|
