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
|
// IBM_PROLOG_BEGIN_TAG
// This is an automatically generated prolog.
//
// $Source: src/usr/targeting/predicates/predicatepostfixexpr.C $
//
// IBM CONFIDENTIAL
//
// COPYRIGHT International Business Machines Corp. 2011
//
// p1
//
// Object Code Only (OCO) source materials
// Licensed Internal Code Source Materials
// IBM HostBoot Licensed Internal Code
//
// The source code for this program is not published or other-
// wise divested of its trade secrets, irrespective of what has
// been deposited with the U.S. Copyright Office.
//
// Origin: 30
//
// IBM_PROLOG_END
/**
* @file predicatepostfixexpr.C
*
* @brief Implementation for predicate which allows callers to chain multiple
* other predicates together in complex logical expressions, and then
* evaluate them against a target
*/
//******************************************************************************
// Includes
//******************************************************************************
// STD
// Other Host Boot Components
#include <assert.h>
// Targeting Component
#include <targeting/predicates/predicatepostfixexpr.H>
#include "../trace.H"
//******************************************************************************
// Macros
//******************************************************************************
#undef TARG_NAMESPACE
#undef TARG_CLASS
#undef TARG_FN
//******************************************************************************
// Interface
//******************************************************************************
namespace TARGETING
{
#define TARG_NAMESPACE "TARGETING::"
#define TARG_CLASS "PredicatePostfixExpr::"
//******************************************************************************
// PredicatePostfixExpr::PredicatePostfixExpr
//******************************************************************************
PredicatePostfixExpr::PredicatePostfixExpr()
{
}
//******************************************************************************
// PredicatePostfixExpr::~PredicatePostfixExpr
//******************************************************************************
PredicatePostfixExpr::~PredicatePostfixExpr()
{
}
//******************************************************************************
// PredicatePostfixExpr::push
//******************************************************************************
PredicatePostfixExpr& PredicatePostfixExpr::push(
const PredicateBase* const i_pPredicate)
{
#define TARG_FN "push(...)"
assert(i_pPredicate != NULL,
TARG_LOC "Caller supplied a NULL predicate");
Operation l_op = {EVAL,i_pPredicate};
iv_ops.push_back(l_op);
return *this;
#undef TARG_FN
}
//******************************************************************************
// PredicatePostfixExpr::And
//******************************************************************************
PredicatePostfixExpr& PredicatePostfixExpr::And()
{
#define TARG_FN "And()"
Operation l_op = {AND,NULL};
iv_ops.push_back(l_op);
return *this;
#undef TARG_FN
}
//******************************************************************************
// PredicatePostfixExpr::Not
//******************************************************************************
PredicatePostfixExpr& PredicatePostfixExpr::Not()
{
#define TARG_FN "Not()"
Operation l_op = {NOT,NULL};
iv_ops.push_back(l_op);
return *this;
#undef TARG_FN
}
//******************************************************************************
// PredicatePostfixExpr::Or
//******************************************************************************
PredicatePostfixExpr& PredicatePostfixExpr::Or()
{
#define TARG_FN "Or()"
Operation l_op = {OR,NULL};
iv_ops.push_back(l_op);
return *this;
#undef TARG_FN
}
//******************************************************************************
// PredicatePostfixExpr::operator()
//******************************************************************************
bool PredicatePostfixExpr::operator()(
const Target* const i_pTarget) const
{
#define TARG_FN "operator()(...)"
assert(i_pTarget != NULL,
TARG_LOC "Caller supplied a NULL target");
std::vector<bool> l_stack;
bool l_result = false;
for(uint32_t i=0; i<iv_ops.size(); ++i)
{
switch(iv_ops[i].logicalOp)
{
case EVAL:
l_stack.push_back((*iv_ops[i].pPredicate)(i_pTarget));
break;
case AND:
assert(l_stack.size() >= 2,
TARG_LOC "Stack for AND must be >=2 but is %d",
l_stack.size());
l_result = l_stack.back();
l_stack.pop_back();
l_stack.back() &= l_result;
break;
case OR:
assert(l_stack.size() >= 2,
TARG_LOC "Stack for OR must be >= 2 but is %d",
l_stack.size());
l_result = l_stack.back();
l_stack.pop_back();
l_stack.back() |= l_result;
break;
case NOT:
assert(l_stack.size() >= 1,
TARG_LOC "Stack for NOT must be >= 1 but is %d",
l_stack.size());
l_stack.back() = !l_stack.back();
break;
default:
assert(0,
TARG_LOC "Attempted to evaluate unsupported "
"logical operation %d",
iv_ops[i].logicalOp);
break;
}
}
// If no predicates and we haven't asserted (no misformatting), element
// should be returned
if(l_stack.size() == 0)
{
l_result = true;
}
else
{
assert(l_stack.size() == 1,
TARG_LOC "Postfix expression created incorrectly. Stack "
"size should be 1 but is %d",
l_stack.size());
l_result = l_stack.front();
}
return l_result;
#undef TARG_FN
}
#undef TARG_CLASS
#undef TARG_NAMESPACE
} // End namespace TARGETING
|
