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
|
/* Copyright 2014-2015 IBM 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
* imitations under the License.
*/
#include <skiboot.h>
#include <opal.h>
#include <lock.h>
#include <xscom.h>
#include <chip.h>
#include <opal-msg.h>
#include <fsp.h>
#include <mem_region.h>
enum events {
EVENT_ATTN = 1 << 0,
EVENT_OCC_ERROR = 1 << 1,
EVENT_OCC_RESET = 1 << 2,
};
static uint8_t events[MAX_CHIPS];
static uint64_t ipoll_status[MAX_CHIPS];
static struct opal_prd_msg prd_msg;
static bool prd_msg_inuse, prd_active;
struct dt_node *prd_node;
/* Locking:
*
* The events lock serialises access to the events, ipoll_status,
* prd_msg_inuse, and prd_active variables.
*
* The ipoll_lock protects against concurrent updates to the ipoll registers.
*
* The ipoll_lock may be acquired with events_lock held. This order must
* be preserved.
*/
static struct lock events_lock = LOCK_UNLOCKED;
static struct lock ipoll_lock = LOCK_UNLOCKED;
/* PRD registers */
#define PRD_IPOLL_REG_MASK 0x01020013
#define PRD_IPOLL_REG_STATUS 0x01020014
#define PRD_IPOLL_XSTOP PPC_BIT(0) /* Xstop for host/core/millicode */
#define PRD_IPOLL_RECOV PPC_BIT(1) /* Recoverable */
#define PRD_IPOLL_SPEC_ATTN PPC_BIT(2) /* Special attention */
#define PRD_IPOLL_HOST_ATTN PPC_BIT(3) /* Host attention */
#define PRD_IPOLL_MASK PPC_BITMASK(0, 3)
static int queue_prd_msg_hbrt(struct opal_prd_msg *msg,
void (*consumed)(void *data))
{
uint64_t *buf;
BUILD_ASSERT(sizeof(*msg) / sizeof(uint64_t) == 4);
buf = (uint64_t *)msg;
return _opal_queue_msg(OPAL_MSG_PRD, msg, consumed, 4, buf);
}
static int queue_prd_msg_nop(struct opal_prd_msg *msg,
void (*consumed)(void *data))
{
(void)msg;
(void)consumed;
return OPAL_UNSUPPORTED;
}
static int (*queue_prd_msg)(struct opal_prd_msg *msg,
void (*consumed)(void *data)) = queue_prd_msg_nop;
static void send_next_pending_event(void);
static void prd_msg_consumed(void *data)
{
struct opal_prd_msg *msg = data;
uint32_t proc;
uint8_t event = 0;
lock(&events_lock);
switch (msg->hdr.type) {
case OPAL_PRD_MSG_TYPE_ATTN:
proc = msg->attn.proc;
/* If other ipoll events have been received in the time
* between prd_msg creation and consumption, we'll need to
* raise a separate ATTN message for those. So, we only
* clear the event if we don't have any further ipoll_status
* bits.
*/
ipoll_status[proc] &= ~msg->attn.ipoll_status;
if (!ipoll_status[proc])
event = EVENT_ATTN;
break;
case OPAL_PRD_MSG_TYPE_OCC_ERROR:
proc = msg->occ_error.chip;
event = EVENT_OCC_ERROR;
break;
case OPAL_PRD_MSG_TYPE_OCC_RESET:
proc = msg->occ_reset.chip;
event = EVENT_OCC_RESET;
break;
default:
prlog(PR_ERR, "PRD: invalid msg consumed, type: 0x%x\n",
msg->hdr.type);
}
if (event)
events[proc] &= ~event;
prd_msg_inuse = false;
send_next_pending_event();
unlock(&events_lock);
}
static int populate_ipoll_msg(struct opal_prd_msg *msg, uint32_t proc)
{
uint64_t ipoll_mask;
int rc;
lock(&ipoll_lock);
rc = xscom_read(proc, PRD_IPOLL_REG_MASK, &ipoll_mask);
unlock(&ipoll_lock);
if (rc) {
prlog(PR_ERR, "PRD: Unable to read ipoll status (chip %d)!\n",
proc);
return -1;
}
msg->attn.proc = proc;
msg->attn.ipoll_status = ipoll_status[proc];
msg->attn.ipoll_mask = ipoll_mask;
return 0;
}
static void send_next_pending_event(void)
{
struct proc_chip *chip;
uint32_t proc;
uint8_t event;
assert(!prd_msg_inuse);
if (!prd_active)
return;
event = 0;
for_each_chip(chip) {
proc = chip->id;
if (events[proc]) {
event = events[proc];
break;
}
}
if (!event)
return;
prd_msg_inuse = true;
prd_msg.token = 0;
prd_msg.hdr.size = sizeof(prd_msg);
if (event & EVENT_ATTN) {
prd_msg.hdr.type = OPAL_PRD_MSG_TYPE_ATTN;
populate_ipoll_msg(&prd_msg, proc);
} else if (event & EVENT_OCC_ERROR) {
prd_msg.hdr.type = OPAL_PRD_MSG_TYPE_OCC_ERROR;
prd_msg.occ_error.chip = proc;
} else if (event & EVENT_OCC_RESET) {
prd_msg.hdr.type = OPAL_PRD_MSG_TYPE_OCC_RESET;
prd_msg.occ_reset.chip = proc;
}
queue_prd_msg(&prd_msg, prd_msg_consumed);
}
static void __prd_event(uint32_t proc, uint8_t event)
{
events[proc] |= event;
if (!prd_msg_inuse)
send_next_pending_event();
}
static void prd_event(uint32_t proc, uint8_t event)
{
lock(&events_lock);
__prd_event(proc, event);
unlock(&events_lock);
}
static int __ipoll_update_mask(uint32_t proc, bool set, uint64_t bits)
{
uint64_t mask;
int rc;
rc = xscom_read(proc, PRD_IPOLL_REG_MASK, &mask);
if (rc)
return rc;
if (set)
mask |= bits;
else
mask &= ~bits;
return xscom_write(proc, PRD_IPOLL_REG_MASK, mask);
}
static int ipoll_record_and_mask_pending(uint32_t proc)
{
uint64_t status;
int rc;
lock(&ipoll_lock);
rc = xscom_read(proc, PRD_IPOLL_REG_STATUS, &status);
status &= PRD_IPOLL_MASK;
if (!rc)
__ipoll_update_mask(proc, true, status);
unlock(&ipoll_lock);
if (!rc)
ipoll_status[proc] |= status;
return rc;
}
/* Entry point for interrupts */
void prd_psi_interrupt(uint32_t proc)
{
int rc;
lock(&events_lock);
rc = ipoll_record_and_mask_pending(proc);
if (rc)
prlog(PR_ERR, "PRD: Failed to update IPOLL mask\n");
__prd_event(proc, EVENT_ATTN);
unlock(&events_lock);
}
void prd_tmgt_interrupt(uint32_t proc)
{
prd_event(proc, EVENT_OCC_ERROR);
}
void prd_occ_reset(uint32_t proc)
{
prd_event(proc, EVENT_OCC_RESET);
}
/* incoming message handlers */
static int prd_msg_handle_attn_ack(struct opal_prd_msg *msg)
{
int rc;
lock(&ipoll_lock);
rc = __ipoll_update_mask(msg->attn_ack.proc, false,
msg->attn_ack.ipoll_ack & PRD_IPOLL_MASK);
unlock(&ipoll_lock);
if (rc)
prlog(PR_ERR, "PRD: Unable to unmask ipoll!\n");
return rc;
}
static int prd_msg_handle_init(struct opal_prd_msg *msg)
{
struct proc_chip *chip;
lock(&ipoll_lock);
for_each_chip(chip) {
__ipoll_update_mask(chip->id, false,
msg->init.ipoll & PRD_IPOLL_MASK);
}
unlock(&ipoll_lock);
/* we're transitioning from inactive to active; send any pending tmgt
* interrupts */
lock(&events_lock);
prd_active = true;
if (!prd_msg_inuse)
send_next_pending_event();
unlock(&events_lock);
return OPAL_SUCCESS;
}
static int prd_msg_handle_fini(void)
{
struct proc_chip *chip;
lock(&events_lock);
prd_active = false;
unlock(&events_lock);
lock(&ipoll_lock);
for_each_chip(chip) {
__ipoll_update_mask(chip->id, true, PRD_IPOLL_MASK);
}
unlock(&ipoll_lock);
return OPAL_SUCCESS;
}
/* Entry from the host above */
static int64_t opal_prd_msg(struct opal_prd_msg *msg)
{
int rc;
/* fini is a little special: the kernel (which may not have the entire
* opal_prd_msg definition) can send a FINI message, so we don't check
* the full size */
if (msg->hdr.size >= sizeof(struct opal_prd_msg_header) &&
msg->hdr.type == OPAL_PRD_MSG_TYPE_FINI)
return prd_msg_handle_fini();
if (msg->hdr.size != sizeof(*msg))
return OPAL_PARAMETER;
switch (msg->hdr.type) {
case OPAL_PRD_MSG_TYPE_INIT:
rc = prd_msg_handle_init(msg);
break;
case OPAL_PRD_MSG_TYPE_ATTN_ACK:
rc = prd_msg_handle_attn_ack(msg);
break;
default:
rc = OPAL_UNSUPPORTED;
}
return rc;
}
void prd_init(void)
{
struct proc_chip *chip;
/* mask everything */
lock(&ipoll_lock);
for_each_chip(chip) {
__ipoll_update_mask(chip->id, true, PRD_IPOLL_MASK);
}
unlock(&ipoll_lock);
if (fsp_present()) {
/* todo: FSP implementation */
queue_prd_msg = queue_prd_msg_nop;
} else {
queue_prd_msg = queue_prd_msg_hbrt;
opal_register(OPAL_PRD_MSG, opal_prd_msg, 1);
}
prd_node = dt_new(opal_node, "diagnostics");
dt_add_property_strings(prd_node, "compatible", "ibm,opal-prd");
}
void prd_register_reserved_memory(void)
{
struct mem_region *region;
if (!prd_node)
return;
lock(&mem_region_lock);
for (region = mem_region_next(NULL); region;
region = mem_region_next(region)) {
if (region->type != REGION_HW_RESERVED)
continue;
if (!region->node)
continue;
if (!dt_find_property(region->node, "ibm,prd-label")) {
dt_add_property_string(region->node, "ibm,prd-label",
region->name);
}
}
unlock(&mem_region_lock);
}
|