2005-04-17 06:20:36 +08:00
|
|
|
/*
|
|
|
|
|
* arch/ppc64/kernel/xics.h
|
|
|
|
|
*
|
|
|
|
|
* Copyright 2000 IBM Corporation.
|
|
|
|
|
*
|
|
|
|
|
* This program is free software; you can redistribute it and/or
|
|
|
|
|
* modify it under the terms of the GNU General Public License
|
|
|
|
|
* as published by the Free Software Foundation; either version
|
|
|
|
|
* 2 of the License, or (at your option) any later version.
|
|
|
|
|
*/
|
|
|
|
|
|
|
|
|
|
#ifndef _PPC64_KERNEL_XICS_H
|
|
|
|
|
#define _PPC64_KERNEL_XICS_H
|
|
|
|
|
|
|
|
|
|
#include <linux/cache.h>
|
|
|
|
|
|
|
|
|
|
void xics_init_IRQ(void);
|
|
|
|
|
int xics_get_irq(struct pt_regs *);
|
|
|
|
|
void xics_setup_cpu(void);
|
[PATCH] ppc64: kexec support for ppc64
This patch implements the kexec support for ppc64 platforms.
A couple of notes:
1) We copy the pages in virtual mode, using the full base kernel
and a statically allocated stack. At kexec_prepare time we
scan the pages and if any overlap our (0, _end[]) range we
return -ETXTBSY.
On PowerPC 64 systems running in LPAR (logical partitioning)
mode, only a small region of memory, referred to as the RMO,
can be accessed in real mode. Since Linux runs with only one
zone of memory in the memory allocator, and it can be orders of
magnitude more memory than the RMO, looping until we allocate
pages in the source region is not feasible. Copying in virtual
means we don't have to write a hash table generation and call
hypervisor to insert translations, instead we rely on the pinned
kernel linear mapping. The kernel already has move to linked
location built in, so there is no requirement to load it at 0.
If we want to load something other than a kernel, then a stub
can be written to copy a linear chunk in real mode.
2) The start entry point gets passed parameters from the kernel.
Slaves are started at a fixed address after copying code from
the entry point.
All CPUs get passed their firmware assigned physical id in r3
(most calling conventions use this register for the first
argument).
This is used to distinguish each CPU from all other CPUs.
Since firmware is not around, there is no other way to obtain
this information other than to pass it somewhere.
A single CPU, referred to here as the master and the one executing
the kexec call, branches to start with the address of start in r4.
While this can be calculated, we have to load it through a gpr to
branch to this point so defining the register this is contained
in is free. A stack of unspecified size is available at r1
(also common calling convention).
All remaining running CPUs are sent to start at absolute address
0x60 after copying the first 0x100 bytes from start to address 0.
This convention was chosen because it matches what the kernel
has been doing itself. (only gpr3 is defined).
Note: This is not quite the convention of the kexec bootblock v2
in the kernel. A stub has been written to convert between them,
and we may adjust the kernel in the future to allow this directly
without any stub.
3) Destination pages can be placed anywhere, even where they
would not be accessible in real mode. This will allow us to
place ram disks above the RMO if we choose.
Signed-off-by: Milton Miller <miltonm@bga.com>
Signed-off-by: R Sharada <sharada@in.ibm.com>
Signed-off-by: Paul Mackerras <paulus@samba.org>
Signed-off-by: Andrew Morton <akpm@osdl.org>
Signed-off-by: Linus Torvalds <torvalds@osdl.org>
2005-06-26 05:58:10 +08:00
|
|
|
void xics_teardown_cpu(void);
|
2005-04-17 06:20:36 +08:00
|
|
|
void xics_cause_IPI(int cpu);
|
|
|
|
|
void xics_request_IPIs(void);
|
|
|
|
|
void xics_migrate_irqs_away(void);
|
|
|
|
|
|
|
|
|
|
/* first argument is ignored for now*/
|
|
|
|
|
void pSeriesLP_cppr_info(int n_cpu, u8 value);
|
|
|
|
|
|
|
|
|
|
struct xics_ipi_struct {
|
|
|
|
|
volatile unsigned long value;
|
|
|
|
|
} ____cacheline_aligned;
|
|
|
|
|
|
|
|
|
|
extern struct xics_ipi_struct xics_ipi_message[NR_CPUS] __cacheline_aligned;
|
|
|
|
|
|
|
|
|
|
#endif /* _PPC64_KERNEL_XICS_H */
|
