summaryrefslogtreecommitdiffstats
path: root/src/usr/diag/prdf/common/framework/rule/prdfGroup.C
blob: 8ee505fa4c891ed103390b768b2271ba13c4a35b (plain)
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
267
268
269
270
271
272
273
/* IBM_PROLOG_BEGIN_TAG                                                   */
/* This is an automatically generated prolog.                             */
/*                                                                        */
/* $Source: src/usr/diag/prdf/common/framework/rule/prdfGroup.C $         */
/*                                                                        */
/* IBM CONFIDENTIAL                                                       */
/*                                                                        */
/* COPYRIGHT International Business Machines Corp. 2004,2013              */
/*                                                                        */
/* 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 otherwise         */
/* divested of its trade secrets, irrespective of what has been           */
/* deposited with the U.S. Copyright Office.                              */
/*                                                                        */
/* Origin: 30                                                             */
/*                                                                        */
/* IBM_PROLOG_END_TAG                                                     */

#include <prdfGroup.H>

#include <algorithm>

#include <iipResetErrorRegister.h>
#include <iipServiceDataCollector.h>
#include <prdfBitString.H>
#include <prdfMain.H>
#include <prdfResolutionMap.H>

namespace PRDF
{

Group::~Group()
{
    RegisterList_t::const_iterator l_errRegsEnd = cv_errRegs.end();
    for (RegisterList_t::const_iterator i = cv_errRegs.begin();
         i != l_errRegsEnd;
         ++i)
    {
        delete *i;
    }

    ResMaps_t::const_iterator l_resMapsEnd = cv_resMaps.end();
    for (ResMaps_t::const_iterator i = cv_resMaps.begin();
         i != l_resMapsEnd;
         ++i)
    {
        delete (ResolutionMap *)(*i).second;
    }

    // Delete filters.
    FilterList_t::const_iterator l_filterEnd = cv_filters.end();
    for (FilterList_t::const_iterator i = cv_filters.begin();
         i != l_filterEnd;
         ++i)
    {
        delete (*i);
    }
}

int32_t Group::Analyze(STEP_CODE_DATA_STRUCT & i_step)
{
    int32_t l_rc = -1;
    ServiceDataCollector l_backupStep(*i_step.service_data);
    int32_t l_tmpRC = SUCCESS;

    RegisterList_t::const_iterator l_errRegsEnd = cv_errRegs.end();
    for (RegisterList_t::const_iterator i = cv_errRegs.begin();
         (i != l_errRegsEnd) && (l_rc != SUCCESS);
         ++i)
    {
        (*i_step.service_data) = l_backupStep;
        l_tmpRC = (*i)->Analyze(i_step);

        if (PRD_SCAN_COMM_REGISTER_ZERO != l_tmpRC)
        {
            l_rc = l_tmpRC;
        }
    }
    if (PRD_SCAN_COMM_REGISTER_ZERO == l_tmpRC)
    {
        l_rc = l_tmpRC;
    }

    if (0 == cv_errRegs.size())
        l_rc = cv_defaultRes.Resolve(i_step);

    return l_rc;
};

void Group::Add(SCAN_COMM_REGISTER_CLASS * i_reg,
                    const uint8_t * i_bits,
                    size_t i_bitSize,
                    Resolution & i_action,
                    ResetAndMaskPair & i_resets,
                    uint16_t i_scrID,
                    bool i_reqTranspose)
{
    FilterClass * l_transposeFilter = NULL;
    uint8_t l_bits[1] = { '\0' };
    ResolutionMap * l_res = cv_resMaps[i_reg];

    if (NULL == l_res)
    {
        l_res = cv_resMaps[i_reg] = new ResolutionMap(1, cv_defaultRes);
        ResetAndMaskErrorRegister * l_errReg =
                new ResetAndMaskErrorRegister(*i_reg, *l_res, i_scrID);
        cv_errRegs.push_back(l_errReg);

        // Sort reset and mask lists.
        std::sort(i_resets.first.begin(), i_resets.first.end());
        std::sort(i_resets.second.begin(), i_resets.second.end());

        // Remove duplicate resets and masks.
        i_resets.first.erase(
                std::unique(i_resets.first.begin(), i_resets.first.end()),
                i_resets.first.end());
        i_resets.second.erase(
                std::unique(i_resets.second.begin(), i_resets.second.end()),
                i_resets.second.end());

        // Add resets.
        std::for_each(i_resets.first.begin(), i_resets.first.end(),
                      std::bind1st(
                          std::mem_fun(&ResetAndMaskErrorRegister::addReset),
                          l_errReg)
                      );

        // Add masks.
        std::for_each(i_resets.second.begin(), i_resets.second.end(),
                      std::bind1st(
                          std::mem_fun(&ResetAndMaskErrorRegister::addMask),
                          l_errReg)
                      );
    }

    // This action requires a transpose filter (multiple bits &'d)
    if (i_reqTranspose)
    {
        // Create key and transposition filter.  Add to filter list.
        BitKey l_tmpKey(i_bits, i_bitSize);
        l_transposeFilter = new FilterTranspose(l_tmpKey,
                                                    cv_nextBitForTranspose);
        cv_filters.push_back(l_transposeFilter);

        // Update bit string pointers/values.
        l_bits[0] = cv_nextBitForTranspose++;
        i_bits = l_bits;
        i_bitSize = 1;

        // Check for existing transposition filter, create link as needed.
        if (NULL != l_res->getFilter())
        {
            l_transposeFilter = new FilterLink(*l_res->getFilter(),
                                               *l_transposeFilter);  // pw01
            cv_filters.push_back(l_transposeFilter);
        }

        // Assign transpose filter.
        l_res->setFilter(l_transposeFilter);
    }

    // Add action to resolution.
    l_res->Add(i_bits, i_bitSize, &i_action);
};

void Group::Add(SCAN_COMM_REGISTER_CLASS * i_reg,
                    Resolution & i_action,
                    ResetAndMaskPair & i_resets,
                    uint16_t i_scrID)
{
    ResolutionMap * l_res = cv_resMaps[i_reg];

    if (NULL == l_res)
    {
        l_res = cv_resMaps[i_reg] = new ResolutionMap(1, cv_defaultRes);
        ResetAndMaskErrorRegister * l_errReg =
                new ResetAndMaskErrorRegister(*i_reg, *l_res, i_scrID);
        cv_errRegs.push_back(l_errReg);

        // Sort reset and mask lists.
        std::sort(i_resets.first.begin(), i_resets.first.end());
        std::sort(i_resets.second.begin(), i_resets.second.end());

        // Remove duplicate resets and masks.
        i_resets.first.erase(
                std::unique(i_resets.first.begin(), i_resets.first.end()),
                i_resets.first.end());
        i_resets.second.erase(
                std::unique(i_resets.second.begin(), i_resets.second.end()),
                i_resets.second.end());

        // Add resets.
        std::for_each(i_resets.first.begin(), i_resets.first.end(),
                      std::bind1st(
                          std::mem_fun(&ResetAndMaskErrorRegister::addReset),
                          l_errReg)
                      );

        // Add masks.
        std::for_each(i_resets.second.begin(), i_resets.second.end(),
                      std::bind1st(
                          std::mem_fun(&ResetAndMaskErrorRegister::addMask),
                          l_errReg)
                      );
    }

    l_res->ReplaceDefaultWith(i_action);

};

void Group::AddFilter(FilterClass * i_filter)
{
    // Add to filter list, for deallocation later.
    cv_filters.push_back(i_filter);

    // Iterate through all resolution maps.
    for(ResMaps_t::const_iterator i = cv_resMaps.begin();
        i != cv_resMaps.end();
        i++)
    {
        // Get old filter.
        FilterClass * l_filter = ((ResolutionMap *)(*i).second)->getFilter();

        // Need new filter link?
        if (NULL != l_filter)
        {
            // Use original filters first. (we add transposes first.)
            l_filter = new FilterLink(*l_filter,
                                      *i_filter);                // pw01

            // Add to filter list, for deallocation later.
            cv_filters.push_back(l_filter);
        }
        else
        {
            l_filter = i_filter;
        }

        // Assign filter to resolution map.
        ((ResolutionMap *)(*i).second)->setFilter(l_filter);
    }
}



const BIT_STRING_CLASS & Group::Read(ATTENTION_TYPE i_attn)
{
    static BIT_STRING_BUFFER_CLASS a(64);
    return a;
};

BIT_LIST_CLASS Group::Filter(const BIT_STRING_CLASS & i)
{
    return BIT_LIST_CLASS();
};

int32_t Group::Lookup(STEP_CODE_DATA_STRUCT & i_step, BIT_LIST_CLASS & b)
{
    return -1;
};

int32_t Group::Reset(const BIT_LIST_CLASS & b, STEP_CODE_DATA_STRUCT & i_step)
{
    return -1;
};

} // end namespace PRDF

OpenPOWER on IntegriCloud