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
|
/* IBM_PROLOG_BEGIN_TAG */
/* This is an automatically generated prolog. */
/* */
/* $Source: src/usr/diag/attn/test/attntestlist.H $ */
/* */
/* OpenPOWER HostBoot Project */
/* */
/* COPYRIGHT International Business Machines Corp. 2012,2014 */
/* */
/* 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 */
/* */
/* http://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. */
/* */
/* IBM_PROLOG_END_TAG */
#ifndef __TEST_ATTNTESTLIST_H
#define __TEST_ATTNTESTLIST_H
/**
* @file attntestlist.H
*
* @brief Unit test for the attnlist module.
*/
#include "../attnfwd.H"
#include "../attnlist.H"
#include <cxxtest/TestSuite.H>
using namespace ATTN;
using namespace TARGETING;
using namespace PRDF;
/**
* @brief CounterFunct Functor for testing the forEach method.
*/
struct CounterFunct
{
uint64_t counter;
CounterFunct() : counter(0) {}
void operator()(const Attention &)
{
counter++;
}
};
/**
* @brief CheckstopPredicate Predicate for testing split method.
*/
struct CheckstopPredicate
{
bool operator()(const Attention & i_attn)
{
AttnData d;
i_attn.getData(d);
return d.attnType == CHECK_STOP;
}
};
/**
* @brief AttnListTest Unit test for the attnlist module.
*/
class AttnListTest : public CxxTest::TestSuite
{
public:
/**
* @brief testEmpty Unit test for the
* empty method.
*/
void testEmpty(void)
{
static AttentionOps * nullOps = 0;
TS_TRACE(ENTER_MRK "testEmpty");
do {
AttentionList l;
if(!l.empty())
{
TS_FAIL("Defalt constructed attention list not empty");
break;
}
l.add(Attention(AttnData(), nullOps));
if(l.empty())
{
TS_FAIL("Attention list empty after insert");
break;
}
} while(0);
TS_TRACE(EXIT_MRK "testEmpty");
}
/**
* @brief testInsert Unit test for the
* insert method.
*/
void testInsert(void)
{
static AttentionOps * nullOps = 0;
static const uint64_t size = 10;
TS_TRACE(ENTER_MRK "testInsert");
AttentionList l;
for(uint64_t count = 0; count < size; ++count)
{
l.add(Attention(AttnData(), nullOps));
}
// verify correct number of elements inserted
if(l.size() != size)
{
TS_FAIL("Unexpected number of elements inserted: %d", l.size());
}
AttentionList::iterator it2 = l.begin();
AttentionList::iterator it1 = it2;
it2++;
while(it2 != l.end())
{
if((*it2) < (*it1))
{
TS_FAIL("Attention list not sorted");
break;
}
++it1;
++it2;
}
l.clear();
if(!l.empty())
{
TS_FAIL("Attention list not cleared");
}
TS_TRACE(EXIT_MRK "testInsert");
}
/**
* @brief testGetAttnList Unit test for the
* getAttnList method.
*/
void testGetAttnList(void)
{
static AttentionOps * nullOps = 0;
static const TargetHandle_t nullTarget = 0;
static const AttnData tests[] =
{
{nullTarget, CHECK_STOP},
{nullTarget +1, CHECK_STOP},
{nullTarget +2, CHECK_STOP},
{nullTarget, RECOVERABLE},
{nullTarget +1, RECOVERABLE},
{nullTarget +2, RECOVERABLE},
};
static const AttnData * testsEnd = tests
+ sizeof(tests)/sizeof(*tests);
TS_TRACE(ENTER_MRK "testGetAttnList");
const AttnData * testIt = tests;
AttentionList attentionList;
while(testIt != testsEnd)
{
AttentionList l;
l.add(Attention(*testIt, nullOps));
attentionList.add(Attention(*testIt, nullOps));
AttnList attnList;
l.getAttnList(attnList);
if(attnList.size() != 1
|| attnList[0].targetHndl != testIt->targetHndl
|| attnList[0].attnType != testIt->attnType)
{
TS_FAIL("Unexpected error calling getAttnList");
break;
}
++testIt;
}
AttnList l;
attentionList.getAttnList(l);
testIt = tests;
while(testIt != testsEnd)
{
if(static_cast<uint64_t>(testIt - tests) >= l.size())
{
TS_FAIL("Unexpected number of elements");
break;
}
AttnData & d = l[testIt - tests];
if(d.targetHndl != testIt->targetHndl
|| d.attnType != testIt->attnType)
{
TS_FAIL("Unexpected error calling getAttnList");
break;
}
++testIt;
}
TS_TRACE(EXIT_MRK "testGetAttnData");
}
/**
* @brief testForEach Unit test for the
* forEach method.
*/
void testForEach(void)
{
static AttentionOps * nullOps = 0;
static const uint64_t size = 10;
TS_TRACE(ENTER_MRK "testForEach");
AttentionList l;
for(uint64_t count = 0; count < size; ++count)
{
l.add(Attention(AttnData(), nullOps));
}
if(l.forEach(CounterFunct()).counter != size)
{
TS_FAIL("Unexpected result calling forEach");
}
TS_TRACE(EXIT_MRK "testForEach");
}
};
#endif
|
