forked from Minki/linux
4a362601ba
The Jailhouse hypervisor is able to statically partition a multicore system into multiple so-called cells. Linux is used as boot loader and continues to run in the root cell after Jailhouse is enabled. Linux can also run in non-root cells. Jailhouse does not emulate usual x86 devices. It also provides no complex ACPI but basic platform information that the boot loader forwards via setup data. This adds the infrastructure to detect when running in a non-root cell so that the platform can be configured as required in succeeding steps. Support is limited to x86-64 so far, primarily because no boot loader stub exists for i386 and, thus, we wouldn't be able to test the 32-bit path. Signed-off-by: Jan Kiszka <jan.kiszka@siemens.com> Signed-off-by: Thomas Gleixner <tglx@linutronix.de> Cc: jailhouse-dev@googlegroups.com Link: https://lkml.kernel.org/r/7f823d077b38b1a70c526b40b403f85688c137d3.1511770314.git.jan.kiszka@siemens.com
103 lines
2.6 KiB
C
103 lines
2.6 KiB
C
/*
|
|
* Common hypervisor code
|
|
*
|
|
* Copyright (C) 2008, VMware, Inc.
|
|
* Author : Alok N Kataria <akataria@vmware.com>
|
|
*
|
|
* 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.
|
|
*
|
|
* This program is distributed in the hope that it will be useful, but
|
|
* WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
* MERCHANTABILITY OR FITNESS FOR A PARTICULAR PURPOSE, GOOD TITLE or
|
|
* NON INFRINGEMENT. See the GNU General Public License for more
|
|
* details.
|
|
*
|
|
* You should have received a copy of the GNU General Public License
|
|
* along with this program; if not, write to the Free Software
|
|
* Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
|
|
*
|
|
*/
|
|
|
|
#include <linux/init.h>
|
|
#include <linux/export.h>
|
|
#include <asm/processor.h>
|
|
#include <asm/hypervisor.h>
|
|
|
|
extern const struct hypervisor_x86 x86_hyper_vmware;
|
|
extern const struct hypervisor_x86 x86_hyper_ms_hyperv;
|
|
extern const struct hypervisor_x86 x86_hyper_xen_pv;
|
|
extern const struct hypervisor_x86 x86_hyper_xen_hvm;
|
|
extern const struct hypervisor_x86 x86_hyper_kvm;
|
|
extern const struct hypervisor_x86 x86_hyper_jailhouse;
|
|
|
|
static const __initconst struct hypervisor_x86 * const hypervisors[] =
|
|
{
|
|
#ifdef CONFIG_XEN_PV
|
|
&x86_hyper_xen_pv,
|
|
#endif
|
|
#ifdef CONFIG_XEN_PVHVM
|
|
&x86_hyper_xen_hvm,
|
|
#endif
|
|
&x86_hyper_vmware,
|
|
&x86_hyper_ms_hyperv,
|
|
#ifdef CONFIG_KVM_GUEST
|
|
&x86_hyper_kvm,
|
|
#endif
|
|
#ifdef CONFIG_JAILHOUSE_GUEST
|
|
&x86_hyper_jailhouse,
|
|
#endif
|
|
};
|
|
|
|
enum x86_hypervisor_type x86_hyper_type;
|
|
EXPORT_SYMBOL(x86_hyper_type);
|
|
|
|
static inline const struct hypervisor_x86 * __init
|
|
detect_hypervisor_vendor(void)
|
|
{
|
|
const struct hypervisor_x86 *h = NULL, * const *p;
|
|
uint32_t pri, max_pri = 0;
|
|
|
|
for (p = hypervisors; p < hypervisors + ARRAY_SIZE(hypervisors); p++) {
|
|
pri = (*p)->detect();
|
|
if (pri > max_pri) {
|
|
max_pri = pri;
|
|
h = *p;
|
|
}
|
|
}
|
|
|
|
if (h)
|
|
pr_info("Hypervisor detected: %s\n", h->name);
|
|
|
|
return h;
|
|
}
|
|
|
|
static void __init copy_array(const void *src, void *target, unsigned int size)
|
|
{
|
|
unsigned int i, n = size / sizeof(void *);
|
|
const void * const *from = (const void * const *)src;
|
|
const void **to = (const void **)target;
|
|
|
|
for (i = 0; i < n; i++)
|
|
if (from[i])
|
|
to[i] = from[i];
|
|
}
|
|
|
|
void __init init_hypervisor_platform(void)
|
|
{
|
|
const struct hypervisor_x86 *h;
|
|
|
|
h = detect_hypervisor_vendor();
|
|
|
|
if (!h)
|
|
return;
|
|
|
|
copy_array(&h->init, &x86_init.hyper, sizeof(h->init));
|
|
copy_array(&h->runtime, &x86_platform.hyper, sizeof(h->runtime));
|
|
|
|
x86_hyper_type = h->type;
|
|
x86_init.hyper.init_platform();
|
|
}
|