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
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
|
/* IBM_PROLOG_BEGIN_TAG */
/* This is an automatically generated prolog. */
/* */
/* $Source: src/occ_405/dcom/dcomMasterRx.c $ */
/* */
/* OpenPOWER OnChipController Project */
/* */
/* Contributors Listed Below - COPYRIGHT 2011,2016 */
/* [+] International Business Machines Corp. */
/* */
/* */
/* 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 _DCOMMASTERRX_C
#define _DCOMMASTERRX_C
#include "ssx.h"
#include "occhw_pba.h"
#include <rtls.h>
#include <apss.h>
#include <dcom.h>
#include <dcom_service_codes.h>
#include <occ_service_codes.h>
#include <trac.h>
#include <proc_pstate.h>
#include <amec_master_smh.h>
uint8_t G_slv_outbox_complete = 0;
// SSX Block Copy Request for the Slave Outbox Receive Queue
BceRequest G_slv_outbox_rx_pba_request[MAX_OCCS];
// Used by the master to house the doorbell data that is received from
// the slave unicast doorbells from each slave, stating that it put its slave
// outbox in main memory.
dcom_slv_outbox_doorbell_t G_dcom_slv_outbox_doorbell_rx[MAX_OCCS];
// Make sure that the Slave Outbox RX Buffer is 1kB / OCC, otherwise cause
// error on the compile.
STATIC_ASSERT( (NUM_BYTES_IN_SLAVE_OUTBOX != (sizeof(G_dcom_slv_outbox_rx)/MAX_OCCS)) );
// Function Specification
//
// Name: setbit_slvoutbox_complete
//
// Description: Helper function to set bit when outbox is complete
//
// End Function Specification
void setbit_slvoutbox_complete(uint8_t i_bit)
{
if(i_bit < MAX_NUM_OCC)
{
G_slv_outbox_complete |= (1 << i_bit);
}
}
// Function Specification
//
// Name: task_dcom_rx_slv_outboxes
//
// Description: Copy Slave outboxes from Main Memory to SRAM
// on master
//
// Task Flags: RTL_FLAG_OBS, RTL_FLAG_ACTIVE, RTL_FLAG_MSTR,
// RTL_FLAG_NOAPSS, RTL_FLAG_RUN
//
// End Function Specification
void task_dcom_rx_slv_outboxes( task_t *i_self)
{
static uint32_t L_wait4slaves = 0;
static uint8_t L_bce_not_ready_count = 0;
uint32_t l_orc = OCC_SUCCESS_REASON_CODE;
uint32_t l_orc_ext = OCC_NO_EXTENDED_RC;
uint8_t l_slv_response_mask = 0;
// Use a static local bool to track whether the BCE request used
// here has ever been successfully created at least once
static bool L_bce_slv_outbox_rx_request_created_once[MAX_OCCS] = {FALSE,};
DCOM_DBG("2. RX Slave Outboxes\n");
do
{
// Doorbell from the slave
uint32_t l_num_doorbells_rxd = dcom_rx_slv_outbox_doorbell();
// How many doorbells were received?
if( l_num_doorbells_rxd < G_occ_num_present )
{
if ( L_wait4slaves > MAX_WAIT_FOR_SLAVES )
{
/* @
* @errortype
* @moduleid DCOM_MID_TASK_RX_SLV_OUTBOX
* @reasoncode INTERNAL_FAILURE
* @userdata1 N/A
* @userdata4 ERC_GENERIC_TIMEOUT
* @devdesc Generic timeout failure
*/
TRAC_ERR("Time out waiting for slaves" );
l_orc = INTERNAL_FAILURE;
l_orc_ext = ERC_GENERIC_TIMEOUT;
break;
}
L_wait4slaves++;
}
uint32_t l_slv_idx = 0;
// Loop through all doorbells received
for(; l_slv_idx < l_num_doorbells_rxd; l_slv_idx++)
{
// Index/occ id
uint8_t l_slv = 0;
// Main memory address
uint32_t l_addr = dcom_calc_slv_outbox_addr( &G_dcom_slv_outbox_doorbell_rx[l_slv_idx], &l_slv);
G_slave_active_pcaps[l_slv].active_pcap = G_dcom_slv_outbox_doorbell_rx[l_slv_idx].active_node_pcap;
G_slave_active_pcaps[l_slv].pcap_valid = G_dcom_slv_outbox_doorbell_rx[l_slv_idx].pcap_valid;
// Add slave to mask of responding slaves
l_slv_response_mask |= (0x01 << l_slv);
// Check valid address (should be inside inbox addresses range)
if ( (SLAVE_OUTBOX_PING_COMMON_ADDRESS <= l_addr) &&
((SLAVE_OUTBOX_PONG_COMMON_ADDRESS+(sizeof(dcom_slv_outbox_t)*MAX_OCCS)) > l_addr) )
{
DCOM_DBG("2.X. Copy down Slave Outboxes from %x\n",l_addr);
uint32_t l_ssxrc = 0;
// Using a global bce request requires some special consideration
// of the possible request states. Note that since this task
// runs in the critical section of the RTL tick that external
// non-critical interrupts are disabled. This includes the PIT
// interrupt from the OCB timer used to generate the interrupt
// that runs the RTL tick code which led us here. The point is
// that this code cannot be re-entrant which implies that if a
// request is created without error then it will also be
// scheduled before this task runs again. In the good path we
// can never get here and have a BCE request that was not yet
// scheduled.
// There are four possible request states:
// 1. request is idle and complete: The request was created
// and scheduled and has completed without error.
// 2. request is idle and not complete: The request was created
// and scheduled but was either canceled, killed or has errored
// out, or there was an error scheduling the request.
// 3. request is not idle and not complete: The request was
// created and scheduled but is still in progress or still
// enqueued. Note that there is a special case here where this
// could also mean that this is the first time we are running
// this task so the global request is uninitialized. It could
// also mean there was an error creating the request (unlikely)
// so it was never scheduled.
// 4. request is not idle and complete: This can't happen.
//
bool l_proceed_with_request_and_schedule = FALSE;
int l_req_idle = async_request_is_idle(&(G_slv_outbox_rx_pba_request[l_slv].request));
int l_req_complete = async_request_completed(&(G_slv_outbox_rx_pba_request[l_slv].request));
if (!L_bce_slv_outbox_rx_request_created_once[l_slv])
{
// Do this case first, all other cases assume that this is
// true!
// This is the first time we have created a request so
// always proceed with request create and schedule
l_proceed_with_request_and_schedule = TRUE;
}
else if (l_req_idle && l_req_complete)
{
// Most likely case first. The request was created
// and scheduled and has completed without error. Proceed.
// Proceed with request create and schedule.
l_proceed_with_request_and_schedule = TRUE;
}
else if (l_req_idle && !l_req_complete)
{
// There was an error on the schedule request or the request
// was scheduled but was canceled, killed or errored out.
// Proceed with request create and schedule.
l_proceed_with_request_and_schedule = TRUE;
// Trace important information from the request
TRAC_INFO("BCE slv outbox rx request idle but not complete, \
callback_rc=%d options=0x%x state=0x%x abort_state=0x%x \
completion_state=0x%x",
G_slv_outbox_rx_pba_request[l_slv].request.callback_rc,
G_slv_outbox_rx_pba_request[l_slv].request.options,
G_slv_outbox_rx_pba_request[l_slv].request.state,
G_slv_outbox_rx_pba_request[l_slv].request.abort_state,
G_slv_outbox_rx_pba_request[l_slv].request.completion_state);
TRAC_INFO("Proceeding with BCE slv outbox rx request and schedule");
}
else if (!l_req_idle && !l_req_complete)
{
// The request was created and scheduled but is still in
// progress or still enqueued OR there was some error
// creating the request so it was never scheduled. The latter
// case is unlikely and will generate an error message when
// it occurs. It will also have to happen after the request
// was created at least once or we'll never get here. If the
// request does fail though before the state parms in the
// request are reset (like a bad parameter error), then this
// represents a hang condition that we can't recover from.
// DO NOT proceed with request create and schedule.
l_proceed_with_request_and_schedule = FALSE;
if(L_bce_not_ready_count == DCOM_TRACE_NOT_IDLE_AFTER_CONSEC_TIMES)
{
// Trace important information from the request
TRAC_INFO("BCE slv outbox rx request not idle and not complete, callback_rc[%d] options[0x%x] state[0x%x] abort_state[0x%x] completion_state[0x%x]",
G_slv_outbox_rx_pba_request[l_slv].request.callback_rc,
G_slv_outbox_rx_pba_request[l_slv].request.options,
G_slv_outbox_rx_pba_request[l_slv].request.state,
G_slv_outbox_rx_pba_request[l_slv].request.abort_state,
G_slv_outbox_rx_pba_request[l_slv].request.completion_state);
TRAC_INFO("NOT proceeding with BCE slv outbox rx request and schedule for slave[0x%02X]",
l_slv);
}
}
else
{
// This is not a possible state.
}
// Only proceed if the BCE request state checked out
if (l_proceed_with_request_and_schedule)
{
if(L_bce_not_ready_count >= DCOM_TRACE_NOT_IDLE_AFTER_CONSEC_TIMES) // previously not idle
{
TRAC_INFO("BCE slv outbox rx request idle and complete after %d times", L_bce_not_ready_count);
}
L_bce_not_ready_count = 0;
// Copy request from main memory to SRAM
l_ssxrc = bce_request_create(
&G_slv_outbox_rx_pba_request[l_slv], // block copy object
&G_pba_bcde_queue, // mainstore to sram copy engine
l_addr, // mainstore address
(uint32_t)&G_dcom_slv_outbox_rx[l_slv], // sram starting address
sizeof(dcom_slv_outbox_t), // size of copy
SSX_WAIT_FOREVER, // no timeout
(AsyncRequestCallback)setbit_slvoutbox_complete, // call back
(void *)&l_slv, // call back arguments
ASYNC_CALLBACK_IMMEDIATE // blocking request
);
if(l_ssxrc != SSX_OK)
{
/* @
* @errortype
* @moduleid DCOM_MID_TASK_RX_SLV_OUTBOX
* @reasoncode SSX_GENERIC_FAILURE
* @userdata1 N/A
* @userdata4 ERC_BCE_REQUEST_CREATE_FAILURE
* @devdesc SSX BCE related failure
*/
TRAC_ERR("PBA request create failure rc=[%08X]",l_ssxrc);
l_orc = SSX_GENERIC_FAILURE;
l_orc_ext = ERC_BCE_REQUEST_CREATE_FAILURE;
break;
}
// Request created at least once
L_bce_slv_outbox_rx_request_created_once[l_slv] = TRUE;
l_ssxrc = bce_request_schedule(&G_slv_outbox_rx_pba_request[l_slv]); // Actual copying
if(l_ssxrc != SSX_OK)
{
/* @
* @errortype
* @moduleid DCOM_MID_TASK_RX_SLV_OUTBOX
* @reasoncode SSX_GENERIC_FAILURE
* @userdata1 N/A
* @userdata4 ERC_BCE_REQUEST_SCHEDULE_FAILURE
* @devdesc SSX BCE related failure
*/
TRAC_ERR("PBA request schedule failure rc=[%08X]",l_ssxrc);
l_orc = SSX_GENERIC_FAILURE;
l_orc_ext = ERC_BCE_REQUEST_SCHEDULE_FAILURE;
break;
}
}
else
{
L_bce_not_ready_count++;
INCREMENT_ERR_HISTORY(ERRH_DCOM_RX_SLV_OUTBOX);
}
}
else
{
/* @
* @errortype
* @moduleid DCOM_MID_TASK_RX_SLV_OUTBOX
* @reasoncode INTERNAL_INVALID_INPUT_DATA
* @userdata1 N/A
* @userdata4 OCC_NO_EXTENDED_RC
* @devdesc Memory related failure
*/
TRAC_ERR("Invalid address from calculate slave inbox address function [%08X]", l_addr );
l_orc = INTERNAL_INVALID_INPUT_DATA;
l_orc_ext = OCC_NO_EXTENDED_RC;
break;
}
}
L_wait4slaves = 0;
}
while( 0 );
// Update the number of OCCs only if there is a new one that showed up
if((G_sysConfigData.is_occ_present | l_slv_response_mask) != G_sysConfigData.is_occ_present)
{
uint8_t l_temp = G_sysConfigData.is_occ_present;
// Update the mask that stores which OCCs we know are present because they
// are responding to master OCC (via doorbell). Only set, never clear.
// i.e. Don't remove the old ones. This is what is reported to TMGT
G_sysConfigData.is_occ_present |= l_slv_response_mask;
// Since we changed the mask, also update which ones are present.
G_occ_num_present = __builtin_popcount(G_sysConfigData.is_occ_present);
TRAC_IMP("Updated OCCs Present -- OldMask: 0x%02x, NewMask: 0x%02x",
l_temp,
G_sysConfigData.is_occ_present);
}
// Activly responding to master
G_dcomTime.master.allOccStatusMask.alive = l_slv_response_mask;
// Was here, but stopped responding to master
G_dcomTime.master.allOccStatusMask.zombie =
( G_sysConfigData.is_occ_present & ~l_slv_response_mask );
// Has never been here or has never responded
G_dcomTime.master.allOccStatusMask.dead = ~G_sysConfigData.is_occ_present;
if ( l_orc != OCC_SUCCESS_REASON_CODE )
{
// create and commit error
dcom_error_check( SLAVE_OUTBOX, FALSE, l_orc, l_orc_ext);
}
else
{
// done, lets clear our counter
dcom_error_check_reset( SLAVE_OUTBOX );
}
}
// Function Specification
//
// Name: dcom_rx_slv_outbox_doorbell
//
// Description: Receive unicast doorbell and save data
// from slave (slave to master)
//
// End Function Specification
uint32_t dcom_rx_slv_outbox_doorbell( void )
{
int l_pbarc = 0;
uint32_t l_read = 0;
// Grab doorbells from slave, read out the whole queue to prevent overflow
l_pbarc = pbax_read(
&G_pbax_read_queue[1],
&G_dcom_slv_outbox_doorbell_rx[0],
sizeof(dcom_slv_outbox_doorbell_t)*MAX_OCCS,
&l_read
);
if (l_pbarc != 0)
{
INCREMENT_ERR_HISTORY(ERRH_DCOM_MASTER_PBAX_READ_FAIL);
TRAC_ERR("Master PBAX Read Failure in receiving unicast slave doorbells - RC[%08X]", l_pbarc);
// Handle pbax read failure on queue 1
dcom_pbax_error_handler(1);
}
// Return the number of doorbells read by dividing the bytes read by the doorbell size
return (l_read/sizeof(dcom_slv_outbox_doorbell_t));
}
#endif // DCOMMASTERRX_C
|