Commit 2e04ef76 authored by Rusty Russell's avatar Rusty Russell

lguest: fix comment style

I don't really notice it (except to begrudge the extra vertical
space), but Ingo does.  And he pointed out that one excuse of lguest
is as a teaching tool, it should set a good example.
Signed-off-by: default avatarRusty Russell <rusty@rustcorp.com.au>
Cc: Ingo Molnar <mingo@redhat.com>
parent e969fed5
This diff is collapsed.
...@@ -17,8 +17,7 @@ ...@@ -17,8 +17,7 @@
/* Pages for switcher itself, then two pages per cpu */ /* Pages for switcher itself, then two pages per cpu */
#define TOTAL_SWITCHER_PAGES (SHARED_SWITCHER_PAGES + 2 * nr_cpu_ids) #define TOTAL_SWITCHER_PAGES (SHARED_SWITCHER_PAGES + 2 * nr_cpu_ids)
/* We map at -4M (-2M when PAE is activated) for ease of mapping /* We map at -4M (-2M for PAE) for ease of mapping (one PTE page). */
* into the guest (one PTE page). */
#ifdef CONFIG_X86_PAE #ifdef CONFIG_X86_PAE
#define SWITCHER_ADDR 0xFFE00000 #define SWITCHER_ADDR 0xFFE00000
#else #else
......
...@@ -30,7 +30,8 @@ ...@@ -30,7 +30,8 @@
#include <asm/hw_irq.h> #include <asm/hw_irq.h>
#include <asm/kvm_para.h> #include <asm/kvm_para.h>
/*G:030 But first, how does our Guest contact the Host to ask for privileged /*G:030
* But first, how does our Guest contact the Host to ask for privileged
* operations? There are two ways: the direct way is to make a "hypercall", * operations? There are two ways: the direct way is to make a "hypercall",
* to make requests of the Host Itself. * to make requests of the Host Itself.
* *
...@@ -41,16 +42,15 @@ ...@@ -41,16 +42,15 @@
* *
* Grossly invalid calls result in Sudden Death at the hands of the vengeful * Grossly invalid calls result in Sudden Death at the hands of the vengeful
* Host, rather than returning failure. This reflects Winston Churchill's * Host, rather than returning failure. This reflects Winston Churchill's
* definition of a gentleman: "someone who is only rude intentionally". */ * definition of a gentleman: "someone who is only rude intentionally".
/*:*/ :*/
/* Can't use our min() macro here: needs to be a constant */ /* Can't use our min() macro here: needs to be a constant */
#define LGUEST_IRQS (NR_IRQS < 32 ? NR_IRQS: 32) #define LGUEST_IRQS (NR_IRQS < 32 ? NR_IRQS: 32)
#define LHCALL_RING_SIZE 64 #define LHCALL_RING_SIZE 64
struct hcall_args { struct hcall_args {
/* These map directly onto eax, ebx, ecx, edx and esi /* These map directly onto eax/ebx/ecx/edx/esi in struct lguest_regs */
* in struct lguest_regs */
unsigned long arg0, arg1, arg2, arg3, arg4; unsigned long arg0, arg1, arg2, arg3, arg4;
}; };
......
This diff is collapsed.
...@@ -5,7 +5,8 @@ ...@@ -5,7 +5,8 @@
#include <asm/thread_info.h> #include <asm/thread_info.h>
#include <asm/processor-flags.h> #include <asm/processor-flags.h>
/*G:020 Our story starts with the kernel booting into startup_32 in /*G:020
* Our story starts with the kernel booting into startup_32 in
* arch/x86/kernel/head_32.S. It expects a boot header, which is created by * arch/x86/kernel/head_32.S. It expects a boot header, which is created by
* the bootloader (the Launcher in our case). * the bootloader (the Launcher in our case).
* *
...@@ -21,11 +22,14 @@ ...@@ -21,11 +22,14 @@
* data without remembering to subtract __PAGE_OFFSET! * data without remembering to subtract __PAGE_OFFSET!
* *
* The .section line puts this code in .init.text so it will be discarded after * The .section line puts this code in .init.text so it will be discarded after
* boot. */ * boot.
*/
.section .init.text, "ax", @progbits .section .init.text, "ax", @progbits
ENTRY(lguest_entry) ENTRY(lguest_entry)
/* We make the "initialization" hypercall now to tell the Host about /*
* us, and also find out where it put our page tables. */ * We make the "initialization" hypercall now to tell the Host about
* us, and also find out where it put our page tables.
*/
movl $LHCALL_LGUEST_INIT, %eax movl $LHCALL_LGUEST_INIT, %eax
movl $lguest_data - __PAGE_OFFSET, %ebx movl $lguest_data - __PAGE_OFFSET, %ebx
.byte 0x0f,0x01,0xc1 /* KVM_HYPERCALL */ .byte 0x0f,0x01,0xc1 /* KVM_HYPERCALL */
...@@ -33,13 +37,14 @@ ENTRY(lguest_entry) ...@@ -33,13 +37,14 @@ ENTRY(lguest_entry)
/* Set up the initial stack so we can run C code. */ /* Set up the initial stack so we can run C code. */
movl $(init_thread_union+THREAD_SIZE),%esp movl $(init_thread_union+THREAD_SIZE),%esp
/* Jumps are relative, and we're running __PAGE_OFFSET too low at the /* Jumps are relative: we're running __PAGE_OFFSET too low. */
* moment. */
jmp lguest_init+__PAGE_OFFSET jmp lguest_init+__PAGE_OFFSET
/*G:055 We create a macro which puts the assembler code between lgstart_ and /*G:055
* lgend_ markers. These templates are put in the .text section: they can't be * We create a macro which puts the assembler code between lgstart_ and lgend_
* discarded after boot as we may need to patch modules, too. */ * markers. These templates are put in the .text section: they can't be
* discarded after boot as we may need to patch modules, too.
*/
.text .text
#define LGUEST_PATCH(name, insns...) \ #define LGUEST_PATCH(name, insns...) \
lgstart_##name: insns; lgend_##name:; \ lgstart_##name: insns; lgend_##name:; \
...@@ -48,58 +53,74 @@ ENTRY(lguest_entry) ...@@ -48,58 +53,74 @@ ENTRY(lguest_entry)
LGUEST_PATCH(cli, movl $0, lguest_data+LGUEST_DATA_irq_enabled) LGUEST_PATCH(cli, movl $0, lguest_data+LGUEST_DATA_irq_enabled)
LGUEST_PATCH(pushf, movl lguest_data+LGUEST_DATA_irq_enabled, %eax) LGUEST_PATCH(pushf, movl lguest_data+LGUEST_DATA_irq_enabled, %eax)
/*G:033 But using those wrappers is inefficient (we'll see why that doesn't /*G:033
* matter for save_fl and irq_disable later). If we write our routines * But using those wrappers is inefficient (we'll see why that doesn't matter
* carefully in assembler, we can avoid clobbering any registers and avoid * for save_fl and irq_disable later). If we write our routines carefully in
* jumping through the wrapper functions. * assembler, we can avoid clobbering any registers and avoid jumping through
* the wrapper functions.
* *
* I skipped over our first piece of assembler, but this one is worth studying * I skipped over our first piece of assembler, but this one is worth studying
* in a bit more detail so I'll describe in easy stages. First, the routine * in a bit more detail so I'll describe in easy stages. First, the routine to
* to enable interrupts: */ * enable interrupts:
*/
ENTRY(lg_irq_enable) ENTRY(lg_irq_enable)
/* The reverse of irq_disable, this sets lguest_data.irq_enabled to /*
* X86_EFLAGS_IF (ie. "Interrupts enabled"). */ * The reverse of irq_disable, this sets lguest_data.irq_enabled to
* X86_EFLAGS_IF (ie. "Interrupts enabled").
*/
movl $X86_EFLAGS_IF, lguest_data+LGUEST_DATA_irq_enabled movl $X86_EFLAGS_IF, lguest_data+LGUEST_DATA_irq_enabled
/* But now we need to check if the Host wants to know: there might have /*
* But now we need to check if the Host wants to know: there might have
* been interrupts waiting to be delivered, in which case it will have * been interrupts waiting to be delivered, in which case it will have
* set lguest_data.irq_pending to X86_EFLAGS_IF. If it's not zero, we * set lguest_data.irq_pending to X86_EFLAGS_IF. If it's not zero, we
* jump to send_interrupts, otherwise we're done. */ * jump to send_interrupts, otherwise we're done.
*/
testl $0, lguest_data+LGUEST_DATA_irq_pending testl $0, lguest_data+LGUEST_DATA_irq_pending
jnz send_interrupts jnz send_interrupts
/* One cool thing about x86 is that you can do many things without using /*
* One cool thing about x86 is that you can do many things without using
* a register. In this case, the normal path hasn't needed to save or * a register. In this case, the normal path hasn't needed to save or
* restore any registers at all! */ * restore any registers at all!
*/
ret ret
send_interrupts: send_interrupts:
/* OK, now we need a register: eax is used for the hypercall number, /*
* OK, now we need a register: eax is used for the hypercall number,
* which is LHCALL_SEND_INTERRUPTS. * which is LHCALL_SEND_INTERRUPTS.
* *
* We used not to bother with this pending detection at all, which was * We used not to bother with this pending detection at all, which was
* much simpler. Sooner or later the Host would realize it had to * much simpler. Sooner or later the Host would realize it had to
* send us an interrupt. But that turns out to make performance 7 * send us an interrupt. But that turns out to make performance 7
* times worse on a simple tcp benchmark. So now we do this the hard * times worse on a simple tcp benchmark. So now we do this the hard
* way. */ * way.
*/
pushl %eax pushl %eax
movl $LHCALL_SEND_INTERRUPTS, %eax movl $LHCALL_SEND_INTERRUPTS, %eax
/* This is a vmcall instruction (same thing that KVM uses). Older /*
* This is a vmcall instruction (same thing that KVM uses). Older
* assembler versions might not know the "vmcall" instruction, so we * assembler versions might not know the "vmcall" instruction, so we
* create one manually here. */ * create one manually here.
*/
.byte 0x0f,0x01,0xc1 /* KVM_HYPERCALL */ .byte 0x0f,0x01,0xc1 /* KVM_HYPERCALL */
popl %eax popl %eax
ret ret
/* Finally, the "popf" or "restore flags" routine. The %eax register holds the /*
* Finally, the "popf" or "restore flags" routine. The %eax register holds the
* flags (in practice, either X86_EFLAGS_IF or 0): if it's X86_EFLAGS_IF we're * flags (in practice, either X86_EFLAGS_IF or 0): if it's X86_EFLAGS_IF we're
* enabling interrupts again, if it's 0 we're leaving them off. */ * enabling interrupts again, if it's 0 we're leaving them off.
*/
ENTRY(lg_restore_fl) ENTRY(lg_restore_fl)
/* This is just "lguest_data.irq_enabled = flags;" */ /* This is just "lguest_data.irq_enabled = flags;" */
movl %eax, lguest_data+LGUEST_DATA_irq_enabled movl %eax, lguest_data+LGUEST_DATA_irq_enabled
/* Now, if the %eax value has enabled interrupts and /*
* Now, if the %eax value has enabled interrupts and
* lguest_data.irq_pending is set, we want to tell the Host so it can * lguest_data.irq_pending is set, we want to tell the Host so it can
* deliver any outstanding interrupts. Fortunately, both values will * deliver any outstanding interrupts. Fortunately, both values will
* be X86_EFLAGS_IF (ie. 512) in that case, and the "testl" * be X86_EFLAGS_IF (ie. 512) in that case, and the "testl"
* instruction will AND them together for us. If both are set, we * instruction will AND them together for us. If both are set, we
* jump to send_interrupts. */ * jump to send_interrupts.
*/
testl lguest_data+LGUEST_DATA_irq_pending, %eax testl lguest_data+LGUEST_DATA_irq_pending, %eax
jnz send_interrupts jnz send_interrupts
/* Again, the normal path has used no extra registers. Clever, huh? */ /* Again, the normal path has used no extra registers. Clever, huh? */
...@@ -109,22 +130,24 @@ ENTRY(lg_restore_fl) ...@@ -109,22 +130,24 @@ ENTRY(lg_restore_fl)
.global lguest_noirq_start .global lguest_noirq_start
.global lguest_noirq_end .global lguest_noirq_end
/*M:004 When the Host reflects a trap or injects an interrupt into the Guest, /*M:004
* it sets the eflags interrupt bit on the stack based on * When the Host reflects a trap or injects an interrupt into the Guest, it
* lguest_data.irq_enabled, so the Guest iret logic does the right thing when * sets the eflags interrupt bit on the stack based on lguest_data.irq_enabled,
* restoring it. However, when the Host sets the Guest up for direct traps, * so the Guest iret logic does the right thing when restoring it. However,
* such as system calls, the processor is the one to push eflags onto the * when the Host sets the Guest up for direct traps, such as system calls, the
* stack, and the interrupt bit will be 1 (in reality, interrupts are always * processor is the one to push eflags onto the stack, and the interrupt bit
* enabled in the Guest). * will be 1 (in reality, interrupts are always enabled in the Guest).
* *
* This turns out to be harmless: the only trap which should happen under Linux * This turns out to be harmless: the only trap which should happen under Linux
* with interrupts disabled is Page Fault (due to our lazy mapping of vmalloc * with interrupts disabled is Page Fault (due to our lazy mapping of vmalloc
* regions), which has to be reflected through the Host anyway. If another * regions), which has to be reflected through the Host anyway. If another
* trap *does* go off when interrupts are disabled, the Guest will panic, and * trap *does* go off when interrupts are disabled, the Guest will panic, and
* we'll never get to this iret! :*/ * we'll never get to this iret!
:*/
/*G:045 There is one final paravirt_op that the Guest implements, and glancing /*G:045
* at it you can see why I left it to last. It's *cool*! It's in *assembler*! * There is one final paravirt_op that the Guest implements, and glancing at it
* you can see why I left it to last. It's *cool*! It's in *assembler*!
* *
* The "iret" instruction is used to return from an interrupt or trap. The * The "iret" instruction is used to return from an interrupt or trap. The
* stack looks like this: * stack looks like this:
...@@ -148,15 +171,18 @@ ENTRY(lg_restore_fl) ...@@ -148,15 +171,18 @@ ENTRY(lg_restore_fl)
* return to userspace or wherever. Our solution to this is to surround the * return to userspace or wherever. Our solution to this is to surround the
* code with lguest_noirq_start: and lguest_noirq_end: labels. We tell the * code with lguest_noirq_start: and lguest_noirq_end: labels. We tell the
* Host that it is *never* to interrupt us there, even if interrupts seem to be * Host that it is *never* to interrupt us there, even if interrupts seem to be
* enabled. */ * enabled.
*/
ENTRY(lguest_iret) ENTRY(lguest_iret)
pushl %eax pushl %eax
movl 12(%esp), %eax movl 12(%esp), %eax
lguest_noirq_start: lguest_noirq_start:
/* Note the %ss: segment prefix here. Normal data accesses use the /*
* Note the %ss: segment prefix here. Normal data accesses use the
* "ds" segment, but that will have already been restored for whatever * "ds" segment, but that will have already been restored for whatever
* we're returning to (such as userspace): we can't trust it. The %ss: * we're returning to (such as userspace): we can't trust it. The %ss:
* prefix makes sure we use the stack segment, which is still valid. */ * prefix makes sure we use the stack segment, which is still valid.
*/
movl %eax,%ss:lguest_data+LGUEST_DATA_irq_enabled movl %eax,%ss:lguest_data+LGUEST_DATA_irq_enabled
popl %eax popl %eax
iret iret
......
/*P:400 This contains run_guest() which actually calls into the Host<->Guest /*P:400
* This contains run_guest() which actually calls into the Host<->Guest
* Switcher and analyzes the return, such as determining if the Guest wants the * Switcher and analyzes the return, such as determining if the Guest wants the
* Host to do something. This file also contains useful helper routines. :*/ * Host to do something. This file also contains useful helper routines.
:*/
#include <linux/module.h> #include <linux/module.h>
#include <linux/stringify.h> #include <linux/stringify.h>
#include <linux/stddef.h> #include <linux/stddef.h>
...@@ -24,7 +26,8 @@ static struct page **switcher_page; ...@@ -24,7 +26,8 @@ static struct page **switcher_page;
/* This One Big lock protects all inter-guest data structures. */ /* This One Big lock protects all inter-guest data structures. */
DEFINE_MUTEX(lguest_lock); DEFINE_MUTEX(lguest_lock);
/*H:010 We need to set up the Switcher at a high virtual address. Remember the /*H:010
* We need to set up the Switcher at a high virtual address. Remember the
* Switcher is a few hundred bytes of assembler code which actually changes the * Switcher is a few hundred bytes of assembler code which actually changes the
* CPU to run the Guest, and then changes back to the Host when a trap or * CPU to run the Guest, and then changes back to the Host when a trap or
* interrupt happens. * interrupt happens.
...@@ -33,7 +36,8 @@ DEFINE_MUTEX(lguest_lock); ...@@ -33,7 +36,8 @@ DEFINE_MUTEX(lguest_lock);
* Host since it will be running as the switchover occurs. * Host since it will be running as the switchover occurs.
* *
* Trying to map memory at a particular address is an unusual thing to do, so * Trying to map memory at a particular address is an unusual thing to do, so
* it's not a simple one-liner. */ * it's not a simple one-liner.
*/
static __init int map_switcher(void) static __init int map_switcher(void)
{ {
int i, err; int i, err;
...@@ -47,8 +51,10 @@ static __init int map_switcher(void) ...@@ -47,8 +51,10 @@ static __init int map_switcher(void)
* easy. * easy.
*/ */
/* We allocate an array of struct page pointers. map_vm_area() wants /*
* this, rather than just an array of pages. */ * We allocate an array of struct page pointers. map_vm_area() wants
* this, rather than just an array of pages.
*/
switcher_page = kmalloc(sizeof(switcher_page[0])*TOTAL_SWITCHER_PAGES, switcher_page = kmalloc(sizeof(switcher_page[0])*TOTAL_SWITCHER_PAGES,
GFP_KERNEL); GFP_KERNEL);
if (!switcher_page) { if (!switcher_page) {
...@@ -56,8 +62,10 @@ static __init int map_switcher(void) ...@@ -56,8 +62,10 @@ static __init int map_switcher(void)
goto out; goto out;
} }
/* Now we actually allocate the pages. The Guest will see these pages, /*
* so we make sure they're zeroed. */ * Now we actually allocate the pages. The Guest will see these pages,
* so we make sure they're zeroed.
*/
for (i = 0; i < TOTAL_SWITCHER_PAGES; i++) { for (i = 0; i < TOTAL_SWITCHER_PAGES; i++) {
unsigned long addr = get_zeroed_page(GFP_KERNEL); unsigned long addr = get_zeroed_page(GFP_KERNEL);
if (!addr) { if (!addr) {
...@@ -67,19 +75,23 @@ static __init int map_switcher(void) ...@@ -67,19 +75,23 @@ static __init int map_switcher(void)
switcher_page[i] = virt_to_page(addr); switcher_page[i] = virt_to_page(addr);
} }
/* First we check that the Switcher won't overlap the fixmap area at /*
* First we check that the Switcher won't overlap the fixmap area at
* the top of memory. It's currently nowhere near, but it could have * the top of memory. It's currently nowhere near, but it could have
* very strange effects if it ever happened. */ * very strange effects if it ever happened.
*/
if (SWITCHER_ADDR + (TOTAL_SWITCHER_PAGES+1)*PAGE_SIZE > FIXADDR_START){ if (SWITCHER_ADDR + (TOTAL_SWITCHER_PAGES+1)*PAGE_SIZE > FIXADDR_START){
err = -ENOMEM; err = -ENOMEM;
printk("lguest: mapping switcher would thwack fixmap\n"); printk("lguest: mapping switcher would thwack fixmap\n");
goto free_pages; goto free_pages;
} }
/* Now we reserve the "virtual memory area" we want: 0xFFC00000 /*
* Now we reserve the "virtual memory area" we want: 0xFFC00000
* (SWITCHER_ADDR). We might not get it in theory, but in practice * (SWITCHER_ADDR). We might not get it in theory, but in practice
* it's worked so far. The end address needs +1 because __get_vm_area * it's worked so far. The end address needs +1 because __get_vm_area
* allocates an extra guard page, so we need space for that. */ * allocates an extra guard page, so we need space for that.
*/
switcher_vma = __get_vm_area(TOTAL_SWITCHER_PAGES * PAGE_SIZE, switcher_vma = __get_vm_area(TOTAL_SWITCHER_PAGES * PAGE_SIZE,
VM_ALLOC, SWITCHER_ADDR, SWITCHER_ADDR VM_ALLOC, SWITCHER_ADDR, SWITCHER_ADDR
+ (TOTAL_SWITCHER_PAGES+1) * PAGE_SIZE); + (TOTAL_SWITCHER_PAGES+1) * PAGE_SIZE);
...@@ -89,11 +101,13 @@ static __init int map_switcher(void) ...@@ -89,11 +101,13 @@ static __init int map_switcher(void)
goto free_pages; goto free_pages;
} }
/* This code actually sets up the pages we've allocated to appear at /*
* This code actually sets up the pages we've allocated to appear at
* SWITCHER_ADDR. map_vm_area() takes the vma we allocated above, the * SWITCHER_ADDR. map_vm_area() takes the vma we allocated above, the
* kind of pages we're mapping (kernel pages), and a pointer to our * kind of pages we're mapping (kernel pages), and a pointer to our
* array of struct pages. It increments that pointer, but we don't * array of struct pages. It increments that pointer, but we don't
* care. */ * care.
*/
pagep = switcher_page; pagep = switcher_page;
err = map_vm_area(switcher_vma, PAGE_KERNEL_EXEC, &pagep); err = map_vm_area(switcher_vma, PAGE_KERNEL_EXEC, &pagep);
if (err) { if (err) {
...@@ -101,8 +115,10 @@ static __init int map_switcher(void) ...@@ -101,8 +115,10 @@ static __init int map_switcher(void)
goto free_vma; goto free_vma;
} }
/* Now the Switcher is mapped at the right address, we can't fail! /*
* Copy in the compiled-in Switcher code (from <arch>_switcher.S). */ * Now the Switcher is mapped at the right address, we can't fail!
* Copy in the compiled-in Switcher code (from <arch>_switcher.S).
*/
memcpy(switcher_vma->addr, start_switcher_text, memcpy(switcher_vma->addr, start_switcher_text,
end_switcher_text - start_switcher_text); end_switcher_text - start_switcher_text);
...@@ -124,8 +140,7 @@ static __init int map_switcher(void) ...@@ -124,8 +140,7 @@ static __init int map_switcher(void)
} }
/*:*/ /*:*/
/* Cleaning up the mapping when the module is unloaded is almost... /* Cleaning up the mapping when the module is unloaded is almost... too easy. */
* too easy. */
static void unmap_switcher(void) static void unmap_switcher(void)
{ {
unsigned int i; unsigned int i;
...@@ -151,16 +166,19 @@ static void unmap_switcher(void) ...@@ -151,16 +166,19 @@ static void unmap_switcher(void)
* But we can't trust the Guest: it might be trying to access the Launcher * But we can't trust the Guest: it might be trying to access the Launcher
* code. We have to check that the range is below the pfn_limit the Launcher * code. We have to check that the range is below the pfn_limit the Launcher
* gave us. We have to make sure that addr + len doesn't give us a false * gave us. We have to make sure that addr + len doesn't give us a false
* positive by overflowing, too. */ * positive by overflowing, too.
*/
bool lguest_address_ok(const struct lguest *lg, bool lguest_address_ok(const struct lguest *lg,
unsigned long addr, unsigned long len) unsigned long addr, unsigned long len)
{ {
return (addr+len) / PAGE_SIZE < lg->pfn_limit && (addr+len >= addr); return (addr+len) / PAGE_SIZE < lg->pfn_limit && (addr+len >= addr);
} }
/* This routine copies memory from the Guest. Here we can see how useful the /*
* This routine copies memory from the Guest. Here we can see how useful the
* kill_lguest() routine we met in the Launcher can be: we return a random * kill_lguest() routine we met in the Launcher can be: we return a random
* value (all zeroes) instead of needing to return an error. */ * value (all zeroes) instead of needing to return an error.
*/
void __lgread(struct lg_cpu *cpu, void *b, unsigned long addr, unsigned bytes) void __lgread(struct lg_cpu *cpu, void *b, unsigned long addr, unsigned bytes)
{ {
if (!lguest_address_ok(cpu->lg, addr, bytes) if (!lguest_address_ok(cpu->lg, addr, bytes)
...@@ -181,9 +199,11 @@ void __lgwrite(struct lg_cpu *cpu, unsigned long addr, const void *b, ...@@ -181,9 +199,11 @@ void __lgwrite(struct lg_cpu *cpu, unsigned long addr, const void *b,
} }
/*:*/ /*:*/
/*H:030 Let's jump straight to the the main loop which runs the Guest. /*H:030
* Let's jump straight to the the main loop which runs the Guest.
* Remember, this is called by the Launcher reading /dev/lguest, and we keep * Remember, this is called by the Launcher reading /dev/lguest, and we keep
* going around and around until something interesting happens. */ * going around and around until something interesting happens.
*/
int run_guest(struct lg_cpu *cpu, unsigned long __user *user) int run_guest(struct lg_cpu *cpu, unsigned long __user *user)
{ {
/* We stop running once the Guest is dead. */ /* We stop running once the Guest is dead. */
...@@ -195,8 +215,10 @@ int run_guest(struct lg_cpu *cpu, unsigned long __user *user) ...@@ -195,8 +215,10 @@ int run_guest(struct lg_cpu *cpu, unsigned long __user *user)
if (cpu->hcall) if (cpu->hcall)
do_hypercalls(cpu); do_hypercalls(cpu);
/* It's possible the Guest did a NOTIFY hypercall to the /*
* Launcher, in which case we return from the read() now. */ * It's possible the Guest did a NOTIFY hypercall to the
* Launcher, in which case we return from the read() now.
*/
if (cpu->pending_notify) { if (cpu->pending_notify) {
if (!send_notify_to_eventfd(cpu)) { if (!send_notify_to_eventfd(cpu)) {
if (put_user(cpu->pending_notify, user)) if (put_user(cpu->pending_notify, user))
...@@ -209,29 +231,39 @@ int run_guest(struct lg_cpu *cpu, unsigned long __user *user) ...@@ -209,29 +231,39 @@ int run_guest(struct lg_cpu *cpu, unsigned long __user *user)
if (signal_pending(current)) if (signal_pending(current))
return -ERESTARTSYS; return -ERESTARTSYS;
/* Check if there are any interrupts which can be delivered now: /*
* Check if there are any interrupts which can be delivered now:
* if so, this sets up the hander to be executed when we next * if so, this sets up the hander to be executed when we next
* run the Guest. */ * run the Guest.
*/
irq = interrupt_pending(cpu, &more); irq = interrupt_pending(cpu, &more);
if (irq < LGUEST_IRQS) if (irq < LGUEST_IRQS)
try_deliver_interrupt(cpu, irq, more); try_deliver_interrupt(cpu, irq, more);
/* All long-lived kernel loops need to check with this horrible /*
* All long-lived kernel loops need to check with this horrible
* thing called the freezer. If the Host is trying to suspend, * thing called the freezer. If the Host is trying to suspend,
* it stops us. */ * it stops us.
*/
try_to_freeze(); try_to_freeze();
/* Just make absolutely sure the Guest is still alive. One of /*
* those hypercalls could have been fatal, for example. */ * Just make absolutely sure the Guest is still alive. One of
* those hypercalls could have been fatal, for example.
*/
if (cpu->lg->dead) if (cpu->lg->dead)
break; break;
/* If the Guest asked to be stopped, we sleep. The Guest's /*
* clock timer will wake us. */ * If the Guest asked to be stopped, we sleep. The Guest's
* clock timer will wake us.
*/
if (cpu->halted) { if (cpu->halted) {
set_current_state(TASK_INTERRUPTIBLE); set_current_state(TASK_INTERRUPTIBLE);
/* Just before we sleep, make sure no interrupt snuck in /*
* which we should be doing. */ * Just before we sleep, make sure no interrupt snuck in
* which we should be doing.
*/
if (interrupt_pending(cpu, &more) < LGUEST_IRQS) if (interrupt_pending(cpu, &more) < LGUEST_IRQS)
set_current_state(TASK_RUNNING); set_current_state(TASK_RUNNING);
else else
...@@ -239,8 +271,10 @@ int run_guest(struct lg_cpu *cpu, unsigned long __user *user) ...@@ -239,8 +271,10 @@ int run_guest(struct lg_cpu *cpu, unsigned long __user *user)
continue; continue;
} }
/* OK, now we're ready to jump into the Guest. First we put up /*
* the "Do Not Disturb" sign: */ * OK, now we're ready to jump into the Guest. First we put up
* the "Do Not Disturb" sign:
*/
local_irq_disable(); local_irq_disable();
/* Actually run the Guest until something happens. */ /* Actually run the Guest until something happens. */
...@@ -327,8 +361,10 @@ static void __exit fini(void) ...@@ -327,8 +361,10 @@ static void __exit fini(void)
} }
/*:*/ /*:*/
/* The Host side of lguest can be a module. This is a nice way for people to /*
* play with it. */ * The Host side of lguest can be a module. This is a nice way for people to
* play with it.
*/
module_init(init); module_init(init);
module_exit(fini); module_exit(fini);
MODULE_LICENSE("GPL"); MODULE_LICENSE("GPL");
......
/*P:500 Just as userspace programs request kernel operations through a system /*P:500
* Just as userspace programs request kernel operations through a system
* call, the Guest requests Host operations through a "hypercall". You might * call, the Guest requests Host operations through a "hypercall". You might
* notice this nomenclature doesn't really follow any logic, but the name has * notice this nomenclature doesn't really follow any logic, but the name has
* been around for long enough that we're stuck with it. As you'd expect, this * been around for long enough that we're stuck with it. As you'd expect, this
* code is basically a one big switch statement. :*/ * code is basically a one big switch statement.
:*/
/* Copyright (C) 2006 Rusty Russell IBM Corporation /* Copyright (C) 2006 Rusty Russell IBM Corporation
...@@ -28,30 +30,41 @@ ...@@ -28,30 +30,41 @@
#include <asm/pgtable.h> #include <asm/pgtable.h>
#include "lg.h" #include "lg.h"
/*H:120 This is the core hypercall routine: where the Guest gets what it wants. /*H:120
* Or gets killed. Or, in the case of LHCALL_SHUTDOWN, both. */ * This is the core hypercall routine: where the Guest gets what it wants.
* Or gets killed. Or, in the case of LHCALL_SHUTDOWN, both.
*/
static void do_hcall(struct lg_cpu *cpu, struct hcall_args *args) static void do_hcall(struct lg_cpu *cpu, struct hcall_args *args)
{ {
switch (args->arg0) { switch (args->arg0) {
case LHCALL_FLUSH_ASYNC: case LHCALL_FLUSH_ASYNC:
/* This call does nothing, except by breaking out of the Guest /*
* it makes us process all the asynchronous hypercalls. */ * This call does nothing, except by breaking out of the Guest
* it makes us process all the asynchronous hypercalls.
*/
break; break;
case LHCALL_SEND_INTERRUPTS: case LHCALL_SEND_INTERRUPTS:
/* This call does nothing too, but by breaking out of the Guest /*
* it makes us process any pending interrupts. */ * This call does nothing too, but by breaking out of the Guest
* it makes us process any pending interrupts.
*/
break; break;
case LHCALL_LGUEST_INIT: case LHCALL_LGUEST_INIT:
/* You can't get here unless you're already initialized. Don't /*
* do that. */ * You can't get here unless you're already initialized. Don't
* do that.
*/
kill_guest(cpu, "already have lguest_data"); kill_guest(cpu, "already have lguest_data");
break; break;
case LHCALL_SHUTDOWN: { case LHCALL_SHUTDOWN: {
/* Shutdown is such a trivial hypercall that we do it in four
* lines right here. */
char msg[128]; char msg[128];
/* If the lgread fails, it will call kill_guest() itself; the /*
* kill_guest() with the message will be ignored. */ * Shutdown is such a trivial hypercall that we do it in four
* lines right here.
*
* If the lgread fails, it will call kill_guest() itself; the
* kill_guest() with the message will be ignored.
*/
__lgread(cpu, msg, args->arg1, sizeof(msg)); __lgread(cpu, msg, args->arg1, sizeof(msg));
msg[sizeof(msg)-1] = '\0'; msg[sizeof(msg)-1] = '\0';
kill_guest(cpu, "CRASH: %s", msg); kill_guest(cpu, "CRASH: %s", msg);
...@@ -60,16 +73,17 @@ static void do_hcall(struct lg_cpu *cpu, struct hcall_args *args) ...@@ -60,16 +73,17 @@ static void do_hcall(struct lg_cpu *cpu, struct hcall_args *args)
break; break;
} }
case LHCALL_FLUSH_TLB: case LHCALL_FLUSH_TLB:
/* FLUSH_TLB comes in two flavors, depending on the /* FLUSH_TLB comes in two flavors, depending on the argument: */
* argument: */
if (args->arg1) if (args->arg1)
guest_pagetable_clear_all(cpu); guest_pagetable_clear_all(cpu);
else else
guest_pagetable_flush_user(cpu); guest_pagetable_flush_user(cpu);
break; break;
/* All these calls simply pass the arguments through to the right /*
* routines. */ * All these calls simply pass the arguments through to the right
* routines.
*/
case LHCALL_NEW_PGTABLE: case LHCALL_NEW_PGTABLE:
guest_new_pagetable(cpu, args->arg1); guest_new_pagetable(cpu, args->arg1);
break; break;
...@@ -112,15 +126,16 @@ static void do_hcall(struct lg_cpu *cpu, struct hcall_args *args) ...@@ -112,15 +126,16 @@ static void do_hcall(struct lg_cpu *cpu, struct hcall_args *args)
kill_guest(cpu, "Bad hypercall %li\n", args->arg0); kill_guest(cpu, "Bad hypercall %li\n", args->arg0);
} }
} }
/*:*/
/*H:124 Asynchronous hypercalls are easy: we just look in the array in the /*H:124
* Asynchronous hypercalls are easy: we just look in the array in the
* Guest's "struct lguest_data" to see if any new ones are marked "ready". * Guest's "struct lguest_data" to see if any new ones are marked "ready".
* *
* We are careful to do these in order: obviously we respect the order the * We are careful to do these in order: obviously we respect the order the
* Guest put them in the ring, but we also promise the Guest that they will * Guest put them in the ring, but we also promise the Guest that they will
* happen before any normal hypercall (which is why we check this before * happen before any normal hypercall (which is why we check this before
* checking for a normal hcall). */ * checking for a normal hcall).
*/
static void do_async_hcalls(struct lg_cpu *cpu) static void do_async_hcalls(struct lg_cpu *cpu)
{ {
unsigned int i; unsigned int i;
...@@ -133,22 +148,28 @@ static void do_async_hcalls(struct lg_cpu *cpu) ...@@ -133,22 +148,28 @@ static void do_async_hcalls(struct lg_cpu *cpu)
/* We process "struct lguest_data"s hcalls[] ring once. */ /* We process "struct lguest_data"s hcalls[] ring once. */
for (i = 0; i < ARRAY_SIZE(st); i++) { for (i = 0; i < ARRAY_SIZE(st); i++) {
struct hcall_args args; struct hcall_args args;
/* We remember where we were up to from last time. This makes /*
* We remember where we were up to from last time. This makes
* sure that the hypercalls are done in the order the Guest * sure that the hypercalls are done in the order the Guest
* places them in the ring. */ * places them in the ring.
*/
unsigned int n = cpu->next_hcall; unsigned int n = cpu->next_hcall;
/* 0xFF means there's no call here (yet). */ /* 0xFF means there's no call here (yet). */
if (st[n] == 0xFF) if (st[n] == 0xFF)
break; break;
/* OK, we have hypercall. Increment the "next_hcall" cursor, /*
* and wrap back to 0 if we reach the end. */ * OK, we have hypercall. Increment the "next_hcall" cursor,
* and wrap back to 0 if we reach the end.
*/
if (++cpu->next_hcall == LHCALL_RING_SIZE) if (++cpu->next_hcall == LHCALL_RING_SIZE)
cpu->next_hcall = 0; cpu->next_hcall = 0;
/* Copy the hypercall arguments into a local copy of /*
* the hcall_args struct. */ * Copy the hypercall arguments into a local copy of the
* hcall_args struct.
*/
if (copy_from_user(&args, &cpu->lg->lguest_data->hcalls[n], if (copy_from_user(&args, &cpu->lg->lguest_data->hcalls[n],
sizeof(struct hcall_args))) { sizeof(struct hcall_args))) {
kill_guest(cpu, "Fetching async hypercalls"); kill_guest(cpu, "Fetching async hypercalls");
...@@ -164,19 +185,25 @@ static void do_async_hcalls(struct lg_cpu *cpu) ...@@ -164,19 +185,25 @@ static void do_async_hcalls(struct lg_cpu *cpu)
break; break;
} }
/* Stop doing hypercalls if they want to notify the Launcher: /*
* it needs to service this first. */ * Stop doing hypercalls if they want to notify the Launcher:
* it needs to service this first.
*/
if (cpu->pending_notify) if (cpu->pending_notify)
break; break;
} }
} }
/* Last of all, we look at what happens first of all. The very first time the /*
* Guest makes a hypercall, we end up here to set things up: */ * Last of all, we look at what happens first of all. The very first time the
* Guest makes a hypercall, we end up here to set things up:
*/
static void initialize(struct lg_cpu *cpu) static void initialize(struct lg_cpu *cpu)
{ {
/* You can't do anything until you're initialized. The Guest knows the /*
* rules, so we're unforgiving here. */ * You can't do anything until you're initialized. The Guest knows the
* rules, so we're unforgiving here.
*/
if (cpu->hcall->arg0 != LHCALL_LGUEST_INIT) { if (cpu->hcall->arg0 != LHCALL_LGUEST_INIT) {
kill_guest(cpu, "hypercall %li before INIT", cpu->hcall->arg0); kill_guest(cpu, "hypercall %li before INIT", cpu->hcall->arg0);
return; return;
...@@ -185,32 +212,40 @@ static void initialize(struct lg_cpu *cpu) ...@@ -185,32 +212,40 @@ static void initialize(struct lg_cpu *cpu)
if (lguest_arch_init_hypercalls(cpu)) if (lguest_arch_init_hypercalls(cpu))
kill_guest(cpu, "bad guest page %p", cpu->lg->lguest_data); kill_guest(cpu, "bad guest page %p", cpu->lg->lguest_data);
/* The Guest tells us where we're not to deliver interrupts by putting /*
* the range of addresses into "struct lguest_data". */ * The Guest tells us where we're not to deliver interrupts by putting
* the range of addresses into "struct lguest_data".
*/
if (get_user(cpu->lg->noirq_start, &cpu->lg->lguest_data->noirq_start) if (get_user(cpu->lg->noirq_start, &cpu->lg->lguest_data->noirq_start)
|| get_user(cpu->lg->noirq_end, &cpu->lg->lguest_data->noirq_end)) || get_user(cpu->lg->noirq_end, &cpu->lg->lguest_data->noirq_end))
kill_guest(cpu, "bad guest page %p", cpu->lg->lguest_data); kill_guest(cpu, "bad guest page %p", cpu->lg->lguest_data);
/* We write the current time into the Guest's data page once so it can /*
* set its clock. */ * We write the current time into the Guest's data page once so it can
* set its clock.
*/
write_timestamp(cpu); write_timestamp(cpu);
/* page_tables.c will also do some setup. */ /* page_tables.c will also do some setup. */
page_table_guest_data_init(cpu); page_table_guest_data_init(cpu);
/* This is the one case where the above accesses might have been the /*
* This is the one case where the above accesses might have been the
* first write to a Guest page. This may have caused a copy-on-write * first write to a Guest page. This may have caused a copy-on-write
* fault, but the old page might be (read-only) in the Guest * fault, but the old page might be (read-only) in the Guest
* pagetable. */ * pagetable.
*/
guest_pagetable_clear_all(cpu); guest_pagetable_clear_all(cpu);
} }
/*:*/ /*:*/
/*M:013 If a Guest reads from a page (so creates a mapping) that it has never /*M:013
* If a Guest reads from a page (so creates a mapping) that it has never
* written to, and then the Launcher writes to it (ie. the output of a virtual * written to, and then the Launcher writes to it (ie. the output of a virtual
* device), the Guest will still see the old page. In practice, this never * device), the Guest will still see the old page. In practice, this never
* happens: why would the Guest read a page which it has never written to? But * happens: why would the Guest read a page which it has never written to? But
* a similar scenario might one day bite us, so it's worth mentioning. :*/ * a similar scenario might one day bite us, so it's worth mentioning.
:*/
/*H:100 /*H:100
* Hypercalls * Hypercalls
...@@ -229,17 +264,22 @@ void do_hypercalls(struct lg_cpu *cpu) ...@@ -229,17 +264,22 @@ void do_hypercalls(struct lg_cpu *cpu)
return; return;
} }
/* The Guest has initialized. /*
* The Guest has initialized.
* *
* Look in the hypercall ring for the async hypercalls: */ * Look in the hypercall ring for the async hypercalls:
*/
do_async_hcalls(cpu); do_async_hcalls(cpu);
/* If we stopped reading the hypercall ring because the Guest did a /*
* If we stopped reading the hypercall ring because the Guest did a
* NOTIFY to the Launcher, we want to return now. Otherwise we do * NOTIFY to the Launcher, we want to return now. Otherwise we do
* the hypercall. */ * the hypercall.
*/
if (!cpu->pending_notify) { if (!cpu->pending_notify) {
do_hcall(cpu, cpu->hcall); do_hcall(cpu, cpu->hcall);
/* Tricky point: we reset the hcall pointer to mark the /*
* Tricky point: we reset the hcall pointer to mark the
* hypercall as "done". We use the hcall pointer rather than * hypercall as "done". We use the hcall pointer rather than
* the trap number to indicate a hypercall is pending. * the trap number to indicate a hypercall is pending.
* Normally it doesn't matter: the Guest will run again and * Normally it doesn't matter: the Guest will run again and
...@@ -248,13 +288,16 @@ void do_hypercalls(struct lg_cpu *cpu) ...@@ -248,13 +288,16 @@ void do_hypercalls(struct lg_cpu *cpu)
* However, if we are signalled or the Guest sends I/O to the * However, if we are signalled or the Guest sends I/O to the
* Launcher, the run_guest() loop will exit without running the * Launcher, the run_guest() loop will exit without running the
* Guest. When it comes back it would try to re-run the * Guest. When it comes back it would try to re-run the
* hypercall. Finding that bug sucked. */ * hypercall. Finding that bug sucked.
*/
cpu->hcall = NULL; cpu->hcall = NULL;
} }
} }
/* This routine supplies the Guest with time: it's used for wallclock time at /*
* initial boot and as a rough time source if the TSC isn't available. */ * This routine supplies the Guest with time: it's used for wallclock time at
* initial boot and as a rough time source if the TSC isn't available.
*/
void write_timestamp(struct lg_cpu *cpu) void write_timestamp(struct lg_cpu *cpu)
{ {
struct timespec now; struct timespec now;
......
This diff is collapsed.
...@@ -60,7 +60,7 @@ struct lg_cpu { ...@@ -60,7 +60,7 @@ struct lg_cpu {
struct lguest_pages *last_pages; struct lguest_pages *last_pages;
int cpu_pgd; /* which pgd this cpu is currently using */ int cpu_pgd; /* Which pgd this cpu is currently using */
/* If a hypercall was asked for, this points to the arguments. */ /* If a hypercall was asked for, this points to the arguments. */
struct hcall_args *hcall; struct hcall_args *hcall;
...@@ -96,8 +96,11 @@ struct lguest ...@@ -96,8 +96,11 @@ struct lguest
unsigned int nr_cpus; unsigned int nr_cpus;
u32 pfn_limit; u32 pfn_limit;
/* This provides the offset to the base of guest-physical
* memory in the Launcher. */ /*
* This provides the offset to the base of guest-physical memory in the
* Launcher.
*/
void __user *mem_base; void __user *mem_base;
unsigned long kernel_address; unsigned long kernel_address;
...@@ -122,11 +125,13 @@ bool lguest_address_ok(const struct lguest *lg, ...@@ -122,11 +125,13 @@ bool lguest_address_ok(const struct lguest *lg,
void __lgread(struct lg_cpu *, void *, unsigned long, unsigned); void __lgread(struct lg_cpu *, void *, unsigned long, unsigned);
void __lgwrite(struct lg_cpu *, unsigned long, const void *, unsigned); void __lgwrite(struct lg_cpu *, unsigned long, const void *, unsigned);
/*H:035 Using memory-copy operations like that is usually inconvient, so we /*H:035
* Using memory-copy operations like that is usually inconvient, so we
* have the following helper macros which read and write a specific type (often * have the following helper macros which read and write a specific type (often
* an unsigned long). * an unsigned long).
* *
* This reads into a variable of the given type then returns that. */ * This reads into a variable of the given type then returns that.
*/
#define lgread(cpu, addr, type) \ #define lgread(cpu, addr, type) \
({ type _v; __lgread((cpu), &_v, (addr), sizeof(_v)); _v; }) ({ type _v; __lgread((cpu), &_v, (addr), sizeof(_v)); _v; })
...@@ -140,9 +145,11 @@ void __lgwrite(struct lg_cpu *, unsigned long, const void *, unsigned); ...@@ -140,9 +145,11 @@ void __lgwrite(struct lg_cpu *, unsigned long, const void *, unsigned);
int run_guest(struct lg_cpu *cpu, unsigned long __user *user); int run_guest(struct lg_cpu *cpu, unsigned long __user *user);
/* Helper macros to obtain the first 12 or the last 20 bits, this is only the /*
* Helper macros to obtain the first 12 or the last 20 bits, this is only the
* first step in the migration to the kernel types. pte_pfn is already defined * first step in the migration to the kernel types. pte_pfn is already defined
* in the kernel. */ * in the kernel.
*/
#define pgd_flags(x) (pgd_val(x) & ~PAGE_MASK) #define pgd_flags(x) (pgd_val(x) & ~PAGE_MASK)
#define pgd_pfn(x) (pgd_val(x) >> PAGE_SHIFT) #define pgd_pfn(x) (pgd_val(x) >> PAGE_SHIFT)
#define pmd_flags(x) (pmd_val(x) & ~PAGE_MASK) #define pmd_flags(x) (pmd_val(x) & ~PAGE_MASK)
......
This diff is collapsed.
This diff is collapsed.
This diff is collapsed.
This diff is collapsed.
This diff is collapsed.
/*P:900 This is the Switcher: code which sits at 0xFFC00000 astride both the /*P:900
* This is the Switcher: code which sits at 0xFFC00000 astride both the
* Host and Guest to do the low-level Guest<->Host switch. It is as simple as * Host and Guest to do the low-level Guest<->Host switch. It is as simple as
* it can be made, but it's naturally very specific to x86. * it can be made, but it's naturally very specific to x86.
* *
* You have now completed Preparation. If this has whet your appetite; if you * You have now completed Preparation. If this has whet your appetite; if you
* are feeling invigorated and refreshed then the next, more challenging stage * are feeling invigorated and refreshed then the next, more challenging stage
* can be found in "make Guest". :*/ * can be found in "make Guest".
:*/
/*M:012 Lguest is meant to be simple: my rule of thumb is that 1% more LOC must /*M:012
* Lguest is meant to be simple: my rule of thumb is that 1% more LOC must
* gain at least 1% more performance. Since neither LOC nor performance can be * gain at least 1% more performance. Since neither LOC nor performance can be
* measured beforehand, it generally means implementing a feature then deciding * measured beforehand, it generally means implementing a feature then deciding
* if it's worth it. And once it's implemented, who can say no? * if it's worth it. And once it's implemented, who can say no?
...@@ -31,11 +34,14 @@ ...@@ -31,11 +34,14 @@
* Host (which is actually really easy). * Host (which is actually really easy).
* *
* Two questions remain. Would the performance gain outweigh the complexity? * Two questions remain. Would the performance gain outweigh the complexity?
* And who would write the verse documenting it? :*/ * And who would write the verse documenting it?
:*/
/*M:011 Lguest64 handles NMI. This gave me NMI envy (until I looked at their /*M:011
* Lguest64 handles NMI. This gave me NMI envy (until I looked at their
* code). It's worth doing though, since it would let us use oprofile in the * code). It's worth doing though, since it would let us use oprofile in the
* Host when a Guest is running. :*/ * Host when a Guest is running.
:*/
/*S:100 /*S:100
* Welcome to the Switcher itself! * Welcome to the Switcher itself!
......
/* Things the lguest guest needs to know. Note: like all lguest interfaces, /*
* this is subject to wild and random change between versions. */ * Things the lguest guest needs to know. Note: like all lguest interfaces,
* this is subject to wild and random change between versions.
*/
#ifndef _LINUX_LGUEST_H #ifndef _LINUX_LGUEST_H
#define _LINUX_LGUEST_H #define _LINUX_LGUEST_H
...@@ -11,32 +13,42 @@ ...@@ -11,32 +13,42 @@
#define LG_CLOCK_MIN_DELTA 100UL #define LG_CLOCK_MIN_DELTA 100UL
#define LG_CLOCK_MAX_DELTA ULONG_MAX #define LG_CLOCK_MAX_DELTA ULONG_MAX
/*G:031 The second method of communicating with the Host is to via "struct /*G:031
* The second method of communicating with the Host is to via "struct
* lguest_data". Once the Guest's initialization hypercall tells the Host where * lguest_data". Once the Guest's initialization hypercall tells the Host where
* this is, the Guest and Host both publish information in it. :*/ * this is, the Guest and Host both publish information in it.
:*/
struct lguest_data struct lguest_data
{ {
/* 512 == enabled (same as eflags in normal hardware). The Guest /*
* changes interrupts so often that a hypercall is too slow. */ * 512 == enabled (same as eflags in normal hardware). The Guest
* changes interrupts so often that a hypercall is too slow.
*/
unsigned int irq_enabled; unsigned int irq_enabled;
/* Fine-grained interrupt disabling by the Guest */ /* Fine-grained interrupt disabling by the Guest */
DECLARE_BITMAP(blocked_interrupts, LGUEST_IRQS); DECLARE_BITMAP(blocked_interrupts, LGUEST_IRQS);
/* The Host writes the virtual address of the last page fault here, /*
* The Host writes the virtual address of the last page fault here,
* which saves the Guest a hypercall. CR2 is the native register where * which saves the Guest a hypercall. CR2 is the native register where
* this address would normally be found. */ * this address would normally be found.
*/
unsigned long cr2; unsigned long cr2;
/* Wallclock time set by the Host. */ /* Wallclock time set by the Host. */
struct timespec time; struct timespec time;
/* Interrupt pending set by the Host. The Guest should do a hypercall /*
* if it re-enables interrupts and sees this set (to X86_EFLAGS_IF). */ * Interrupt pending set by the Host. The Guest should do a hypercall
* if it re-enables interrupts and sees this set (to X86_EFLAGS_IF).
*/
int irq_pending; int irq_pending;
/* Async hypercall ring. Instead of directly making hypercalls, we can /*
* Async hypercall ring. Instead of directly making hypercalls, we can
* place them in here for processing the next time the Host wants. * place them in here for processing the next time the Host wants.
* This batching can be quite efficient. */ * This batching can be quite efficient.
*/
/* 0xFF == done (set by Host), 0 == pending (set by Guest). */ /* 0xFF == done (set by Host), 0 == pending (set by Guest). */
u8 hcall_status[LHCALL_RING_SIZE]; u8 hcall_status[LHCALL_RING_SIZE];
......
...@@ -29,8 +29,10 @@ struct lguest_device_desc { ...@@ -29,8 +29,10 @@ struct lguest_device_desc {
__u8 type; __u8 type;
/* The number of virtqueues (first in config array) */ /* The number of virtqueues (first in config array) */
__u8 num_vq; __u8 num_vq;
/* The number of bytes of feature bits. Multiply by 2: one for host /*
* features and one for Guest acknowledgements. */ * The number of bytes of feature bits. Multiply by 2: one for host
* features and one for Guest acknowledgements.
*/
__u8 feature_len; __u8 feature_len;
/* The number of bytes of the config array after virtqueues. */ /* The number of bytes of the config array after virtqueues. */
__u8 config_len; __u8 config_len;
...@@ -39,8 +41,10 @@ struct lguest_device_desc { ...@@ -39,8 +41,10 @@ struct lguest_device_desc {
__u8 config[0]; __u8 config[0];
}; };
/*D:135 This is how we expect the device configuration field for a virtqueue /*D:135
* to be laid out in config space. */ * This is how we expect the device configuration field for a virtqueue
* to be laid out in config space.
*/
struct lguest_vqconfig { struct lguest_vqconfig {
/* The number of entries in the virtio_ring */ /* The number of entries in the virtio_ring */
__u16 num; __u16 num;
...@@ -61,7 +65,9 @@ enum lguest_req ...@@ -61,7 +65,9 @@ enum lguest_req
LHREQ_EVENTFD, /* + address, fd. */ LHREQ_EVENTFD, /* + address, fd. */
}; };
/* The alignment to use between consumer and producer parts of vring. /*
* x86 pagesize for historical reasons. */ * The alignment to use between consumer and producer parts of vring.
* x86 pagesize for historical reasons.
*/
#define LGUEST_VRING_ALIGN 4096 #define LGUEST_VRING_ALIGN 4096
#endif /* _LINUX_LGUEST_LAUNCHER */ #endif /* _LINUX_LGUEST_LAUNCHER */
Markdown is supported
0%
or
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment