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
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
|
/* Copyright 2013-2014 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
* limitations under the License.
*/
#include <skiboot.h>
#include <chip.h>
#include <cpu.h>
#include <fsp.h>
#include <interrupts.h>
#include <opal.h>
#include <io.h>
#include <cec.h>
#include <device.h>
#include <ccan/str/str.h>
#include <timer.h>
#include <sbe-p8.h>
#include <sbe-p9.h>
/* ICP registers */
#define ICP_XIRR 0x4 /* 32-bit access */
#define ICP_CPPR 0x4 /* 8-bit access */
#define ICP_MFRR 0xc /* 8-bit access */
static LIST_HEAD(irq_sources);
static LIST_HEAD(irq_sources2);
static struct lock irq_lock = LOCK_UNLOCKED;
void __register_irq_source(struct irq_source *is, bool secondary)
{
struct irq_source *is1;
struct list_head *list = secondary ? &irq_sources2 : &irq_sources;
prlog(PR_DEBUG, "IRQ: Registering %04x..%04x ops @%p (data %p)%s\n",
is->start, is->end - 1, is->ops, is->data,
secondary ? " [secondary]" : "");
lock(&irq_lock);
list_for_each(list, is1, link) {
if (is->end > is1->start && is->start < is1->end) {
prerror("register IRQ source overlap !\n");
prerror(" new: %x..%x old: %x..%x\n",
is->start, is->end - 1,
is1->start, is1->end - 1);
assert(0);
}
}
list_add_tail(list, &is->link);
unlock(&irq_lock);
}
void register_irq_source(const struct irq_source_ops *ops, void *data,
uint32_t start, uint32_t count)
{
struct irq_source *is;
is = zalloc(sizeof(struct irq_source));
assert(is);
is->start = start;
is->end = start + count;
is->ops = ops;
is->data = data;
__register_irq_source(is, false);
}
void unregister_irq_source(uint32_t start, uint32_t count)
{
struct irq_source *is;
/* Note: We currently only unregister from the primary sources */
lock(&irq_lock);
list_for_each(&irq_sources, is, link) {
if (start >= is->start && start < is->end) {
if (start != is->start ||
count != (is->end - is->start)) {
prerror("unregister IRQ source mismatch !\n");
prerror("start:%x, count: %x match: %x..%x\n",
start, count, is->start, is->end);
assert(0);
}
list_del(&is->link);
unlock(&irq_lock);
/* XXX Add synchronize / RCU */
free(is);
return;
}
}
unlock(&irq_lock);
prerror("unregister IRQ source not found !\n");
prerror("start:%x, count: %x\n", start, count);
assert(0);
}
struct irq_source *irq_find_source(uint32_t isn)
{
struct irq_source *is;
lock(&irq_lock);
/*
* XXX This really needs some kind of caching !
*/
list_for_each(&irq_sources, is, link) {
if (isn >= is->start && isn < is->end) {
unlock(&irq_lock);
return is;
}
}
list_for_each(&irq_sources2, is, link) {
if (isn >= is->start && isn < is->end) {
unlock(&irq_lock);
return is;
}
}
unlock(&irq_lock);
return NULL;
}
void irq_for_each_source(void (*cb)(struct irq_source *, void *), void *data)
{
struct irq_source *is;
lock(&irq_lock);
list_for_each(&irq_sources, is, link)
cb(is, data);
list_for_each(&irq_sources2, is, link)
cb(is, data);
unlock(&irq_lock);
}
/*
* This takes a 6-bit chip id and returns a 20 bit value representing
* the PSI interrupt. This includes all the fields above, ie, is a
* global interrupt number.
*
* For P8, this returns the base of the 8-interrupts block for PSI
*/
uint32_t get_psi_interrupt(uint32_t chip_id)
{
uint32_t irq;
switch(proc_gen) {
case proc_gen_p7:
/* Get the chip ID into position, it already has
* the T bit so all we need is room for the GX
* bit, 9 bit BUID and 4 bit level
*/
irq = chip_id << (1 + 9 + 4);
/* Add in the BUID */
irq |= P7_PSI_IRQ_BUID << 4;
break;
case proc_gen_p8:
irq = p8_chip_irq_block_base(chip_id, P8_IRQ_BLOCK_MISC);
irq += P8_IRQ_MISC_PSI_BASE;
break;
default:
assert(false);
};
return irq;
}
struct dt_node *add_ics_node(void)
{
struct dt_node *ics = dt_new_addr(dt_root, "interrupt-controller", 0);
bool has_xive;
if (!ics)
return NULL;
has_xive = proc_gen >= proc_gen_p9;
dt_add_property_cells(ics, "reg", 0, 0, 0, 0);
dt_add_property_strings(ics, "compatible",
has_xive ? "ibm,opal-xive-vc" : "IBM,ppc-xics",
"IBM,opal-xics");
dt_add_property_cells(ics, "#address-cells", 0);
dt_add_property_cells(ics, "#interrupt-cells", 2);
dt_add_property_string(ics, "device_type",
"PowerPC-Interrupt-Source-Controller");
dt_add_property(ics, "interrupt-controller", NULL, 0);
return ics;
}
uint32_t get_ics_phandle(void)
{
struct dt_node *i;
for (i = dt_first(dt_root); i; i = dt_next(dt_root, i)) {
if (streq(i->name, "interrupt-controller@0")) {
return i->phandle;
}
}
abort();
}
void add_opal_interrupts(void)
{
struct irq_source *is;
unsigned int i, ns, tns = 0, count = 0;
uint32_t *irqs = NULL, isn;
char *names = NULL;
lock(&irq_lock);
list_for_each(&irq_sources, is, link) {
/*
* Don't even consider sources that don't have an interrupts
* callback or don't have an attributes one.
*/
if (!is->ops->interrupt || !is->ops->attributes)
continue;
for (isn = is->start; isn < is->end; isn++) {
uint64_t attr = is->ops->attributes(is, isn);
uint32_t iflags;
char *name;
if (attr & IRQ_ATTR_TARGET_LINUX)
continue;
if (attr & IRQ_ATTR_TYPE_MSI)
iflags = 0;
else
iflags = 1;
name = is->ops->name ? is->ops->name(is, isn) : NULL;
ns = name ? strlen(name) : 0;
prlog(PR_DEBUG, "irq %x name: %s %s\n",
isn,
name ? name : "<null>",
iflags ? "[level]" : "[edge]");
names = realloc(names, tns + ns + 1);
if (name) {
strcpy(names + tns, name);
tns += (ns + 1);
free(name);
} else
names[tns++] = 0;
i = count++;
irqs = realloc(irqs, 8 * count);
irqs[i*2] = isn;
irqs[i*2+1] = iflags;
}
}
unlock(&irq_lock);
/* First create the standard "interrupts" property and the
* corresponding names property
*/
dt_add_property_cells(opal_node, "interrupt-parent", get_ics_phandle());
dt_add_property(opal_node, "interrupts", irqs, count * 8);
dt_add_property(opal_node, "opal-interrupts-names", names, tns);
dt_add_property(opal_node, "interrupt-names", names, tns);
/* Now "reduce" it to the old style "opal-interrupts" property
* format by stripping out the flags. The "opal-interrupts"
* property has one cell per interrupt, it is not a standard
* "interrupt" property.
*
* Note: Even if empty, create it, otherwise some bogus error
* handling in Linux can cause problems.
*/
for (i = 1; i < count; i++)
irqs[i] = irqs[i * 2];
dt_add_property(opal_node, "opal-interrupts", irqs, count * 4);
free(irqs);
free(names);
}
/*
* This is called at init time (and one fast reboot) to sanitize the
* ICP. We set our priority to 0 to mask all interrupts and make sure
* no IPI is on the way. This is also called on wakeup from nap
*/
void reset_cpu_icp(void)
{
void *icp = this_cpu()->icp_regs;
if (!icp)
return;
/* Dummy fetch */
in_be32(icp + ICP_XIRR);
/* Clear pending IPIs */
out_8(icp + ICP_MFRR, 0xff);
/* Set priority to max, ignore all incoming interrupts, EOI IPIs */
out_be32(icp + ICP_XIRR, 2);
}
/* Used by the PSI code to send an EOI during reset. This will also
* set the CPPR to 0 which should already be the case anyway
*/
void icp_send_eoi(uint32_t interrupt)
{
void *icp = this_cpu()->icp_regs;
if (!icp)
return;
/* Set priority to max, ignore all incoming interrupts */
out_be32(icp + ICP_XIRR, interrupt & 0xffffff);
}
/* This is called before winkle or nap, we clear pending IPIs and
* set our priority to 1 to mask all but the IPI.
*/
void icp_prep_for_pm(void)
{
void *icp = this_cpu()->icp_regs;
if (!icp)
return;
/* Clear pending IPIs */
out_8(icp + ICP_MFRR, 0xff);
/* Set priority to 1, ignore all incoming interrupts, EOI IPIs */
out_be32(icp + ICP_XIRR, 0x01000002);
}
/* This is called to wakeup somebody from winkle */
void icp_kick_cpu(struct cpu_thread *cpu)
{
void *icp = cpu->icp_regs;
if (!icp)
return;
/* Send high priority IPI */
out_8(icp + ICP_MFRR, 0);
}
/* Returns the number of chip ID bits used for interrupt numbers */
static uint32_t p8_chip_id_bits(uint32_t chip)
{
struct proc_chip *proc_chip = get_chip(chip);
assert(proc_chip);
switch (proc_chip->type) {
case PROC_CHIP_P8_MURANO:
case PROC_CHIP_P8_VENICE:
return 6;
break;
case PROC_CHIP_P8_NAPLES:
return 5;
break;
default:
/* This shouldn't be called on non-P8 based systems */
assert(0);
return 0;
break;
}
}
/* The chip id mask is the upper p8_chip_id_bits of the irq number */
static uint32_t chip_id_mask(uint32_t chip)
{
uint32_t chip_id_bits = p8_chip_id_bits(chip);
uint32_t chip_id_mask;
chip_id_mask = ((1 << chip_id_bits) - 1);
chip_id_mask <<= P8_IRQ_BITS - chip_id_bits;
return chip_id_mask;
}
/* The block mask is what remains of the 19 bit irq number after
* removing the upper 5 or 6 bits for the chip# and the lower 11 bits
* for the number of bits per block. */
static uint32_t block_mask(uint32_t chip)
{
uint32_t chip_id_bits = p8_chip_id_bits(chip);
uint32_t irq_block_mask;
irq_block_mask = P8_IRQ_BITS - chip_id_bits - P8_IVE_BITS;
irq_block_mask = ((1 << irq_block_mask) - 1) << P8_IVE_BITS;
return irq_block_mask;
}
uint32_t p8_chip_irq_block_base(uint32_t chip, uint32_t block)
{
uint32_t irq;
assert(chip < (1 << p8_chip_id_bits(chip)));
irq = SETFIELD(chip_id_mask(chip), 0, chip);
irq = SETFIELD(block_mask(chip), irq, block);
return irq;
}
uint32_t p8_chip_irq_phb_base(uint32_t chip, uint32_t phb)
{
assert(chip < (1 << p8_chip_id_bits(chip)));
return p8_chip_irq_block_base(chip, phb + P8_IRQ_BLOCK_PHB_BASE);
}
uint32_t p8_irq_to_chip(uint32_t irq)
{
/* This assumes we only have one type of cpu in a system,
* which should be ok. */
return GETFIELD(chip_id_mask(this_cpu()->chip_id), irq);
}
uint32_t p8_irq_to_block(uint32_t irq)
{
return GETFIELD(block_mask(this_cpu()->chip_id), irq);
}
uint32_t p8_irq_to_phb(uint32_t irq)
{
return p8_irq_to_block(irq) - P8_IRQ_BLOCK_PHB_BASE;
}
bool __irq_source_eoi(struct irq_source *is, uint32_t isn)
{
if (!is->ops->eoi)
return false;
is->ops->eoi(is, isn);
return true;
}
bool irq_source_eoi(uint32_t isn)
{
struct irq_source *is = irq_find_source(isn);
if (!is)
return false;
return __irq_source_eoi(is, isn);
}
static int64_t opal_set_xive(uint32_t isn, uint16_t server, uint8_t priority)
{
struct irq_source *is = irq_find_source(isn);
if (!is || !is->ops->set_xive)
return OPAL_PARAMETER;
return is->ops->set_xive(is, isn, server, priority);
}
opal_call(OPAL_SET_XIVE, opal_set_xive, 3);
static int64_t opal_get_xive(uint32_t isn, uint16_t *server, uint8_t *priority)
{
struct irq_source *is = irq_find_source(isn);
if (!opal_addr_valid(server))
return OPAL_PARAMETER;
if (!is || !is->ops->get_xive)
return OPAL_PARAMETER;
return is->ops->get_xive(is, isn, server, priority);
}
opal_call(OPAL_GET_XIVE, opal_get_xive, 3);
static int64_t opal_handle_interrupt(uint32_t isn, __be64 *outstanding_event_mask)
{
struct irq_source *is = irq_find_source(isn);
int64_t rc = OPAL_SUCCESS;
if (!opal_addr_valid(outstanding_event_mask))
return OPAL_PARAMETER;
/* No source ? return */
if (!is || !is->ops->interrupt) {
rc = OPAL_PARAMETER;
goto bail;
}
/* Run it */
is->ops->interrupt(is, isn);
/* Check timers if SBE timer isn't working */
if (!p8_sbe_timer_ok() && !p9_sbe_timer_ok())
check_timers(true);
/* Update output events */
bail:
if (outstanding_event_mask)
*outstanding_event_mask = cpu_to_be64(opal_pending_events);
return rc;
}
opal_call(OPAL_HANDLE_INTERRUPT, opal_handle_interrupt, 2);
void init_interrupts(void)
{
struct dt_node *icp;
const struct dt_property *sranges;
struct cpu_thread *cpu;
u32 base, count, i;
u64 addr, size;
dt_for_each_compatible(dt_root, icp, "ibm,ppc-xicp") {
sranges = dt_require_property(icp,
"ibm,interrupt-server-ranges",
-1);
base = dt_get_number(sranges->prop, 1);
count = dt_get_number(sranges->prop + 4, 1);
for (i = 0; i < count; i++) {
addr = dt_get_address(icp, i, &size);
cpu = find_cpu_by_server(base + i);
if (cpu)
cpu->icp_regs = (void *)addr;
}
}
}
|