core.c 25 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661
  1. /*
  2. * Copyright (C) 2006, Rusty Russell <rusty@rustcorp.com.au> IBM Corporation.
  3. * Copyright (C) 2007, Jes Sorensen <jes@sgi.com> SGI.
  4. *
  5. * This program is free software; you can redistribute it and/or modify
  6. * it under the terms of the GNU General Public License as published by
  7. * the Free Software Foundation; either version 2 of the License, or
  8. * (at your option) any later version.
  9. *
  10. * This program is distributed in the hope that it will be useful, but
  11. * WITHOUT ANY WARRANTY; without even the implied warranty of
  12. * MERCHANTABILITY OR FITNESS FOR A PARTICULAR PURPOSE, GOOD TITLE or
  13. * NON INFRINGEMENT. See the GNU General Public License for more
  14. * details.
  15. *
  16. * You should have received a copy of the GNU General Public License
  17. * along with this program; if not, write to the Free Software
  18. * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
  19. */
  20. /*P:450 This file contains the x86-specific lguest code. It used to be all
  21. * mixed in with drivers/lguest/core.c but several foolhardy code slashers
  22. * wrestled most of the dependencies out to here in preparation for porting
  23. * lguest to other architectures (see what I mean by foolhardy?).
  24. *
  25. * This also contains a couple of non-obvious setup and teardown pieces which
  26. * were implemented after days of debugging pain. :*/
  27. #include <linux/kernel.h>
  28. #include <linux/start_kernel.h>
  29. #include <linux/string.h>
  30. #include <linux/console.h>
  31. #include <linux/screen_info.h>
  32. #include <linux/irq.h>
  33. #include <linux/interrupt.h>
  34. #include <linux/clocksource.h>
  35. #include <linux/clockchips.h>
  36. #include <linux/cpu.h>
  37. #include <linux/lguest.h>
  38. #include <linux/lguest_launcher.h>
  39. #include <asm/paravirt.h>
  40. #include <asm/param.h>
  41. #include <asm/page.h>
  42. #include <asm/pgtable.h>
  43. #include <asm/desc.h>
  44. #include <asm/setup.h>
  45. #include <asm/lguest.h>
  46. #include <asm/uaccess.h>
  47. #include <asm/i387.h>
  48. #include "../lg.h"
  49. static int cpu_had_pge;
  50. static struct {
  51. unsigned long offset;
  52. unsigned short segment;
  53. } lguest_entry;
  54. /* Offset from where switcher.S was compiled to where we've copied it */
  55. static unsigned long switcher_offset(void)
  56. {
  57. return SWITCHER_ADDR - (unsigned long)start_switcher_text;
  58. }
  59. /* This cpu's struct lguest_pages. */
  60. static struct lguest_pages *lguest_pages(unsigned int cpu)
  61. {
  62. return &(((struct lguest_pages *)
  63. (SWITCHER_ADDR + SHARED_SWITCHER_PAGES*PAGE_SIZE))[cpu]);
  64. }
  65. static DEFINE_PER_CPU(struct lg_cpu *, last_cpu);
  66. /*S:010
  67. * We approach the Switcher.
  68. *
  69. * Remember that each CPU has two pages which are visible to the Guest when it
  70. * runs on that CPU. This has to contain the state for that Guest: we copy the
  71. * state in just before we run the Guest.
  72. *
  73. * Each Guest has "changed" flags which indicate what has changed in the Guest
  74. * since it last ran. We saw this set in interrupts_and_traps.c and
  75. * segments.c.
  76. */
  77. static void copy_in_guest_info(struct lg_cpu *cpu, struct lguest_pages *pages)
  78. {
  79. /* Copying all this data can be quite expensive. We usually run the
  80. * same Guest we ran last time (and that Guest hasn't run anywhere else
  81. * meanwhile). If that's not the case, we pretend everything in the
  82. * Guest has changed. */
  83. if (__get_cpu_var(last_cpu) != cpu || cpu->last_pages != pages) {
  84. __get_cpu_var(last_cpu) = cpu;
  85. cpu->last_pages = pages;
  86. cpu->changed = CHANGED_ALL;
  87. }
  88. /* These copies are pretty cheap, so we do them unconditionally: */
  89. /* Save the current Host top-level page directory. */
  90. pages->state.host_cr3 = __pa(current->mm->pgd);
  91. /* Set up the Guest's page tables to see this CPU's pages (and no
  92. * other CPU's pages). */
  93. map_switcher_in_guest(cpu, pages);
  94. /* Set up the two "TSS" members which tell the CPU what stack to use
  95. * for traps which do directly into the Guest (ie. traps at privilege
  96. * level 1). */
  97. pages->state.guest_tss.sp1 = cpu->esp1;
  98. pages->state.guest_tss.ss1 = cpu->ss1;
  99. /* Copy direct-to-Guest trap entries. */
  100. if (cpu->changed & CHANGED_IDT)
  101. copy_traps(cpu, pages->state.guest_idt, default_idt_entries);
  102. /* Copy all GDT entries which the Guest can change. */
  103. if (cpu->changed & CHANGED_GDT)
  104. copy_gdt(cpu, pages->state.guest_gdt);
  105. /* If only the TLS entries have changed, copy them. */
  106. else if (cpu->changed & CHANGED_GDT_TLS)
  107. copy_gdt_tls(cpu, pages->state.guest_gdt);
  108. /* Mark the Guest as unchanged for next time. */
  109. cpu->changed = 0;
  110. }
  111. /* Finally: the code to actually call into the Switcher to run the Guest. */
  112. static void run_guest_once(struct lg_cpu *cpu, struct lguest_pages *pages)
  113. {
  114. /* This is a dummy value we need for GCC's sake. */
  115. unsigned int clobber;
  116. /* Copy the guest-specific information into this CPU's "struct
  117. * lguest_pages". */
  118. copy_in_guest_info(cpu, pages);
  119. /* Set the trap number to 256 (impossible value). If we fault while
  120. * switching to the Guest (bad segment registers or bug), this will
  121. * cause us to abort the Guest. */
  122. cpu->regs->trapnum = 256;
  123. /* Now: we push the "eflags" register on the stack, then do an "lcall".
  124. * This is how we change from using the kernel code segment to using
  125. * the dedicated lguest code segment, as well as jumping into the
  126. * Switcher.
  127. *
  128. * The lcall also pushes the old code segment (KERNEL_CS) onto the
  129. * stack, then the address of this call. This stack layout happens to
  130. * exactly match the stack layout created by an interrupt... */
  131. asm volatile("pushf; lcall *lguest_entry"
  132. /* This is how we tell GCC that %eax ("a") and %ebx ("b")
  133. * are changed by this routine. The "=" means output. */
  134. : "=a"(clobber), "=b"(clobber)
  135. /* %eax contains the pages pointer. ("0" refers to the
  136. * 0-th argument above, ie "a"). %ebx contains the
  137. * physical address of the Guest's top-level page
  138. * directory. */
  139. : "0"(pages), "1"(__pa(cpu->lg->pgdirs[cpu->cpu_pgd].pgdir))
  140. /* We tell gcc that all these registers could change,
  141. * which means we don't have to save and restore them in
  142. * the Switcher. */
  143. : "memory", "%edx", "%ecx", "%edi", "%esi");
  144. }
  145. /*:*/
  146. /*M:002 There are hooks in the scheduler which we can register to tell when we
  147. * get kicked off the CPU (preempt_notifier_register()). This would allow us
  148. * to lazily disable SYSENTER which would regain some performance, and should
  149. * also simplify copy_in_guest_info(). Note that we'd still need to restore
  150. * things when we exit to Launcher userspace, but that's fairly easy.
  151. *
  152. * We could also try using this hooks for PGE, but that might be too expensive.
  153. *
  154. * The hooks were designed for KVM, but we can also put them to good use. :*/
  155. /*H:040 This is the i386-specific code to setup and run the Guest. Interrupts
  156. * are disabled: we own the CPU. */
  157. void lguest_arch_run_guest(struct lg_cpu *cpu)
  158. {
  159. /* Remember the awfully-named TS bit? If the Guest has asked to set it
  160. * we set it now, so we can trap and pass that trap to the Guest if it
  161. * uses the FPU. */
  162. if (cpu->ts)
  163. unlazy_fpu(current);
  164. /* SYSENTER is an optimized way of doing system calls. We can't allow
  165. * it because it always jumps to privilege level 0. A normal Guest
  166. * won't try it because we don't advertise it in CPUID, but a malicious
  167. * Guest (or malicious Guest userspace program) could, so we tell the
  168. * CPU to disable it before running the Guest. */
  169. if (boot_cpu_has(X86_FEATURE_SEP))
  170. wrmsr(MSR_IA32_SYSENTER_CS, 0, 0);
  171. /* Now we actually run the Guest. It will return when something
  172. * interesting happens, and we can examine its registers to see what it
  173. * was doing. */
  174. run_guest_once(cpu, lguest_pages(raw_smp_processor_id()));
  175. /* Note that the "regs" structure contains two extra entries which are
  176. * not really registers: a trap number which says what interrupt or
  177. * trap made the switcher code come back, and an error code which some
  178. * traps set. */
  179. /* Restore SYSENTER if it's supposed to be on. */
  180. if (boot_cpu_has(X86_FEATURE_SEP))
  181. wrmsr(MSR_IA32_SYSENTER_CS, __KERNEL_CS, 0);
  182. /* If the Guest page faulted, then the cr2 register will tell us the
  183. * bad virtual address. We have to grab this now, because once we
  184. * re-enable interrupts an interrupt could fault and thus overwrite
  185. * cr2, or we could even move off to a different CPU. */
  186. if (cpu->regs->trapnum == 14)
  187. cpu->arch.last_pagefault = read_cr2();
  188. /* Similarly, if we took a trap because the Guest used the FPU,
  189. * we have to restore the FPU it expects to see.
  190. * math_state_restore() may sleep and we may even move off to
  191. * a different CPU. So all the critical stuff should be done
  192. * before this. */
  193. else if (cpu->regs->trapnum == 7)
  194. math_state_restore();
  195. }
  196. /*H:130 Now we've examined the hypercall code; our Guest can make requests.
  197. * Our Guest is usually so well behaved; it never tries to do things it isn't
  198. * allowed to, and uses hypercalls instead. Unfortunately, Linux's paravirtual
  199. * infrastructure isn't quite complete, because it doesn't contain replacements
  200. * for the Intel I/O instructions. As a result, the Guest sometimes fumbles
  201. * across one during the boot process as it probes for various things which are
  202. * usually attached to a PC.
  203. *
  204. * When the Guest uses one of these instructions, we get a trap (General
  205. * Protection Fault) and come here. We see if it's one of those troublesome
  206. * instructions and skip over it. We return true if we did. */
  207. static int emulate_insn(struct lg_cpu *cpu)
  208. {
  209. u8 insn;
  210. unsigned int insnlen = 0, in = 0, shift = 0;
  211. /* The eip contains the *virtual* address of the Guest's instruction:
  212. * guest_pa just subtracts the Guest's page_offset. */
  213. unsigned long physaddr = guest_pa(cpu, cpu->regs->eip);
  214. /* This must be the Guest kernel trying to do something, not userspace!
  215. * The bottom two bits of the CS segment register are the privilege
  216. * level. */
  217. if ((cpu->regs->cs & 3) != GUEST_PL)
  218. return 0;
  219. /* Decoding x86 instructions is icky. */
  220. insn = lgread(cpu, physaddr, u8);
  221. /* 0x66 is an "operand prefix". It means it's using the upper 16 bits
  222. of the eax register. */
  223. if (insn == 0x66) {
  224. shift = 16;
  225. /* The instruction is 1 byte so far, read the next byte. */
  226. insnlen = 1;
  227. insn = lgread(cpu, physaddr + insnlen, u8);
  228. }
  229. /* We can ignore the lower bit for the moment and decode the 4 opcodes
  230. * we need to emulate. */
  231. switch (insn & 0xFE) {
  232. case 0xE4: /* in <next byte>,%al */
  233. insnlen += 2;
  234. in = 1;
  235. break;
  236. case 0xEC: /* in (%dx),%al */
  237. insnlen += 1;
  238. in = 1;
  239. break;
  240. case 0xE6: /* out %al,<next byte> */
  241. insnlen += 2;
  242. break;
  243. case 0xEE: /* out %al,(%dx) */
  244. insnlen += 1;
  245. break;
  246. default:
  247. /* OK, we don't know what this is, can't emulate. */
  248. return 0;
  249. }
  250. /* If it was an "IN" instruction, they expect the result to be read
  251. * into %eax, so we change %eax. We always return all-ones, which
  252. * traditionally means "there's nothing there". */
  253. if (in) {
  254. /* Lower bit tells is whether it's a 16 or 32 bit access */
  255. if (insn & 0x1)
  256. cpu->regs->eax = 0xFFFFFFFF;
  257. else
  258. cpu->regs->eax |= (0xFFFF << shift);
  259. }
  260. /* Finally, we've "done" the instruction, so move past it. */
  261. cpu->regs->eip += insnlen;
  262. /* Success! */
  263. return 1;
  264. }
  265. /* Our hypercalls mechanism used to be based on direct software interrupts.
  266. * After Anthony's "Refactor hypercall infrastructure" kvm patch, we decided to
  267. * change over to using kvm hypercalls.
  268. *
  269. * KVM_HYPERCALL is actually a "vmcall" instruction, which generates an invalid
  270. * opcode fault (fault 6) on non-VT cpus, so the easiest solution seemed to be
  271. * an *emulation approach*: if the fault was really produced by an hypercall
  272. * (is_hypercall() does exactly this check), we can just call the corresponding
  273. * hypercall host implementation function.
  274. *
  275. * But these invalid opcode faults are notably slower than software interrupts.
  276. * So we implemented the *patching (or rewriting) approach*: every time we hit
  277. * the KVM_HYPERCALL opcode in Guest code, we patch it to the old "int 0x1f"
  278. * opcode, so next time the Guest calls this hypercall it will use the
  279. * faster trap mechanism.
  280. *
  281. * Matias even benchmarked it to convince you: this shows the average cycle
  282. * cost of a hypercall. For each alternative solution mentioned above we've
  283. * made 5 runs of the benchmark:
  284. *
  285. * 1) direct software interrupt: 2915, 2789, 2764, 2721, 2898
  286. * 2) emulation technique: 3410, 3681, 3466, 3392, 3780
  287. * 3) patching (rewrite) technique: 2977, 2975, 2891, 2637, 2884
  288. *
  289. * One two-line function is worth a 20% hypercall speed boost!
  290. */
  291. static void rewrite_hypercall(struct lg_cpu *cpu)
  292. {
  293. /* This are the opcodes we use to patch the Guest. The opcode for "int
  294. * $0x1f" is "0xcd 0x1f" but vmcall instruction is 3 bytes long, so we
  295. * complete the sequence with a NOP (0x90). */
  296. u8 insn[3] = {0xcd, 0x1f, 0x90};
  297. __lgwrite(cpu, guest_pa(cpu, cpu->regs->eip), insn, sizeof(insn));
  298. /* The above write might have caused a copy of that page to be made
  299. * (if it was read-only). We need to make sure the Guest has
  300. * up-to-date pagetables. As this doesn't happen often, we can just
  301. * drop them all. */
  302. guest_pagetable_clear_all(cpu);
  303. }
  304. static bool is_hypercall(struct lg_cpu *cpu)
  305. {
  306. u8 insn[3];
  307. /* This must be the Guest kernel trying to do something.
  308. * The bottom two bits of the CS segment register are the privilege
  309. * level. */
  310. if ((cpu->regs->cs & 3) != GUEST_PL)
  311. return false;
  312. /* Is it a vmcall? */
  313. __lgread(cpu, insn, guest_pa(cpu, cpu->regs->eip), sizeof(insn));
  314. return insn[0] == 0x0f && insn[1] == 0x01 && insn[2] == 0xc1;
  315. }
  316. /*H:050 Once we've re-enabled interrupts, we look at why the Guest exited. */
  317. void lguest_arch_handle_trap(struct lg_cpu *cpu)
  318. {
  319. switch (cpu->regs->trapnum) {
  320. case 13: /* We've intercepted a General Protection Fault. */
  321. /* Check if this was one of those annoying IN or OUT
  322. * instructions which we need to emulate. If so, we just go
  323. * back into the Guest after we've done it. */
  324. if (cpu->regs->errcode == 0) {
  325. if (emulate_insn(cpu))
  326. return;
  327. }
  328. break;
  329. case 14: /* We've intercepted a Page Fault. */
  330. /* The Guest accessed a virtual address that wasn't mapped.
  331. * This happens a lot: we don't actually set up most of the page
  332. * tables for the Guest at all when we start: as it runs it asks
  333. * for more and more, and we set them up as required. In this
  334. * case, we don't even tell the Guest that the fault happened.
  335. *
  336. * The errcode tells whether this was a read or a write, and
  337. * whether kernel or userspace code. */
  338. if (demand_page(cpu, cpu->arch.last_pagefault,
  339. cpu->regs->errcode))
  340. return;
  341. /* OK, it's really not there (or not OK): the Guest needs to
  342. * know. We write out the cr2 value so it knows where the
  343. * fault occurred.
  344. *
  345. * Note that if the Guest were really messed up, this could
  346. * happen before it's done the LHCALL_LGUEST_INIT hypercall, so
  347. * lg->lguest_data could be NULL */
  348. if (cpu->lg->lguest_data &&
  349. put_user(cpu->arch.last_pagefault,
  350. &cpu->lg->lguest_data->cr2))
  351. kill_guest(cpu, "Writing cr2");
  352. break;
  353. case 7: /* We've intercepted a Device Not Available fault. */
  354. /* If the Guest doesn't want to know, we already restored the
  355. * Floating Point Unit, so we just continue without telling
  356. * it. */
  357. if (!cpu->ts)
  358. return;
  359. break;
  360. case 32 ... 255:
  361. /* These values mean a real interrupt occurred, in which case
  362. * the Host handler has already been run. We just do a
  363. * friendly check if another process should now be run, then
  364. * return to run the Guest again */
  365. cond_resched();
  366. return;
  367. case LGUEST_TRAP_ENTRY:
  368. /* Our 'struct hcall_args' maps directly over our regs: we set
  369. * up the pointer now to indicate a hypercall is pending. */
  370. cpu->hcall = (struct hcall_args *)cpu->regs;
  371. return;
  372. case 6:
  373. /* kvm hypercalls trigger an invalid opcode fault (6).
  374. * We need to check if ring == GUEST_PL and
  375. * faulting instruction == vmcall. */
  376. if (is_hypercall(cpu)) {
  377. rewrite_hypercall(cpu);
  378. return;
  379. }
  380. break;
  381. }
  382. /* We didn't handle the trap, so it needs to go to the Guest. */
  383. if (!deliver_trap(cpu, cpu->regs->trapnum))
  384. /* If the Guest doesn't have a handler (either it hasn't
  385. * registered any yet, or it's one of the faults we don't let
  386. * it handle), it dies with this cryptic error message. */
  387. kill_guest(cpu, "unhandled trap %li at %#lx (%#lx)",
  388. cpu->regs->trapnum, cpu->regs->eip,
  389. cpu->regs->trapnum == 14 ? cpu->arch.last_pagefault
  390. : cpu->regs->errcode);
  391. }
  392. /* Now we can look at each of the routines this calls, in increasing order of
  393. * complexity: do_hypercalls(), emulate_insn(), maybe_do_interrupt(),
  394. * deliver_trap() and demand_page(). After all those, we'll be ready to
  395. * examine the Switcher, and our philosophical understanding of the Host/Guest
  396. * duality will be complete. :*/
  397. static void adjust_pge(void *on)
  398. {
  399. if (on)
  400. write_cr4(read_cr4() | X86_CR4_PGE);
  401. else
  402. write_cr4(read_cr4() & ~X86_CR4_PGE);
  403. }
  404. /*H:020 Now the Switcher is mapped and every thing else is ready, we need to do
  405. * some more i386-specific initialization. */
  406. void __init lguest_arch_host_init(void)
  407. {
  408. int i;
  409. /* Most of the i386/switcher.S doesn't care that it's been moved; on
  410. * Intel, jumps are relative, and it doesn't access any references to
  411. * external code or data.
  412. *
  413. * The only exception is the interrupt handlers in switcher.S: their
  414. * addresses are placed in a table (default_idt_entries), so we need to
  415. * update the table with the new addresses. switcher_offset() is a
  416. * convenience function which returns the distance between the
  417. * compiled-in switcher code and the high-mapped copy we just made. */
  418. for (i = 0; i < IDT_ENTRIES; i++)
  419. default_idt_entries[i] += switcher_offset();
  420. /*
  421. * Set up the Switcher's per-cpu areas.
  422. *
  423. * Each CPU gets two pages of its own within the high-mapped region
  424. * (aka. "struct lguest_pages"). Much of this can be initialized now,
  425. * but some depends on what Guest we are running (which is set up in
  426. * copy_in_guest_info()).
  427. */
  428. for_each_possible_cpu(i) {
  429. /* lguest_pages() returns this CPU's two pages. */
  430. struct lguest_pages *pages = lguest_pages(i);
  431. /* This is a convenience pointer to make the code fit one
  432. * statement to a line. */
  433. struct lguest_ro_state *state = &pages->state;
  434. /* The Global Descriptor Table: the Host has a different one
  435. * for each CPU. We keep a descriptor for the GDT which says
  436. * where it is and how big it is (the size is actually the last
  437. * byte, not the size, hence the "-1"). */
  438. state->host_gdt_desc.size = GDT_SIZE-1;
  439. state->host_gdt_desc.address = (long)get_cpu_gdt_table(i);
  440. /* All CPUs on the Host use the same Interrupt Descriptor
  441. * Table, so we just use store_idt(), which gets this CPU's IDT
  442. * descriptor. */
  443. store_idt(&state->host_idt_desc);
  444. /* The descriptors for the Guest's GDT and IDT can be filled
  445. * out now, too. We copy the GDT & IDT into ->guest_gdt and
  446. * ->guest_idt before actually running the Guest. */
  447. state->guest_idt_desc.size = sizeof(state->guest_idt)-1;
  448. state->guest_idt_desc.address = (long)&state->guest_idt;
  449. state->guest_gdt_desc.size = sizeof(state->guest_gdt)-1;
  450. state->guest_gdt_desc.address = (long)&state->guest_gdt;
  451. /* We know where we want the stack to be when the Guest enters
  452. * the Switcher: in pages->regs. The stack grows upwards, so
  453. * we start it at the end of that structure. */
  454. state->guest_tss.sp0 = (long)(&pages->regs + 1);
  455. /* And this is the GDT entry to use for the stack: we keep a
  456. * couple of special LGUEST entries. */
  457. state->guest_tss.ss0 = LGUEST_DS;
  458. /* x86 can have a finegrained bitmap which indicates what I/O
  459. * ports the process can use. We set it to the end of our
  460. * structure, meaning "none". */
  461. state->guest_tss.io_bitmap_base = sizeof(state->guest_tss);
  462. /* Some GDT entries are the same across all Guests, so we can
  463. * set them up now. */
  464. setup_default_gdt_entries(state);
  465. /* Most IDT entries are the same for all Guests, too.*/
  466. setup_default_idt_entries(state, default_idt_entries);
  467. /* The Host needs to be able to use the LGUEST segments on this
  468. * CPU, too, so put them in the Host GDT. */
  469. get_cpu_gdt_table(i)[GDT_ENTRY_LGUEST_CS] = FULL_EXEC_SEGMENT;
  470. get_cpu_gdt_table(i)[GDT_ENTRY_LGUEST_DS] = FULL_SEGMENT;
  471. }
  472. /* In the Switcher, we want the %cs segment register to use the
  473. * LGUEST_CS GDT entry: we've put that in the Host and Guest GDTs, so
  474. * it will be undisturbed when we switch. To change %cs and jump we
  475. * need this structure to feed to Intel's "lcall" instruction. */
  476. lguest_entry.offset = (long)switch_to_guest + switcher_offset();
  477. lguest_entry.segment = LGUEST_CS;
  478. /* Finally, we need to turn off "Page Global Enable". PGE is an
  479. * optimization where page table entries are specially marked to show
  480. * they never change. The Host kernel marks all the kernel pages this
  481. * way because it's always present, even when userspace is running.
  482. *
  483. * Lguest breaks this: unbeknownst to the rest of the Host kernel, we
  484. * switch to the Guest kernel. If you don't disable this on all CPUs,
  485. * you'll get really weird bugs that you'll chase for two days.
  486. *
  487. * I used to turn PGE off every time we switched to the Guest and back
  488. * on when we return, but that slowed the Switcher down noticibly. */
  489. /* We don't need the complexity of CPUs coming and going while we're
  490. * doing this. */
  491. get_online_cpus();
  492. if (cpu_has_pge) { /* We have a broader idea of "global". */
  493. /* Remember that this was originally set (for cleanup). */
  494. cpu_had_pge = 1;
  495. /* adjust_pge is a helper function which sets or unsets the PGE
  496. * bit on its CPU, depending on the argument (0 == unset). */
  497. on_each_cpu(adjust_pge, (void *)0, 1);
  498. /* Turn off the feature in the global feature set. */
  499. clear_cpu_cap(&boot_cpu_data, X86_FEATURE_PGE);
  500. }
  501. put_online_cpus();
  502. };
  503. /*:*/
  504. void __exit lguest_arch_host_fini(void)
  505. {
  506. /* If we had PGE before we started, turn it back on now. */
  507. get_online_cpus();
  508. if (cpu_had_pge) {
  509. set_cpu_cap(&boot_cpu_data, X86_FEATURE_PGE);
  510. /* adjust_pge's argument "1" means set PGE. */
  511. on_each_cpu(adjust_pge, (void *)1, 1);
  512. }
  513. put_online_cpus();
  514. }
  515. /*H:122 The i386-specific hypercalls simply farm out to the right functions. */
  516. int lguest_arch_do_hcall(struct lg_cpu *cpu, struct hcall_args *args)
  517. {
  518. switch (args->arg0) {
  519. case LHCALL_LOAD_GDT_ENTRY:
  520. load_guest_gdt_entry(cpu, args->arg1, args->arg2, args->arg3);
  521. break;
  522. case LHCALL_LOAD_IDT_ENTRY:
  523. load_guest_idt_entry(cpu, args->arg1, args->arg2, args->arg3);
  524. break;
  525. case LHCALL_LOAD_TLS:
  526. guest_load_tls(cpu, args->arg1);
  527. break;
  528. default:
  529. /* Bad Guest. Bad! */
  530. return -EIO;
  531. }
  532. return 0;
  533. }
  534. /*H:126 i386-specific hypercall initialization: */
  535. int lguest_arch_init_hypercalls(struct lg_cpu *cpu)
  536. {
  537. u32 tsc_speed;
  538. /* The pointer to the Guest's "struct lguest_data" is the only argument.
  539. * We check that address now. */
  540. if (!lguest_address_ok(cpu->lg, cpu->hcall->arg1,
  541. sizeof(*cpu->lg->lguest_data)))
  542. return -EFAULT;
  543. /* Having checked it, we simply set lg->lguest_data to point straight
  544. * into the Launcher's memory at the right place and then use
  545. * copy_to_user/from_user from now on, instead of lgread/write. I put
  546. * this in to show that I'm not immune to writing stupid
  547. * optimizations. */
  548. cpu->lg->lguest_data = cpu->lg->mem_base + cpu->hcall->arg1;
  549. /* We insist that the Time Stamp Counter exist and doesn't change with
  550. * cpu frequency. Some devious chip manufacturers decided that TSC
  551. * changes could be handled in software. I decided that time going
  552. * backwards might be good for benchmarks, but it's bad for users.
  553. *
  554. * We also insist that the TSC be stable: the kernel detects unreliable
  555. * TSCs for its own purposes, and we use that here. */
  556. if (boot_cpu_has(X86_FEATURE_CONSTANT_TSC) && !check_tsc_unstable())
  557. tsc_speed = tsc_khz;
  558. else
  559. tsc_speed = 0;
  560. if (put_user(tsc_speed, &cpu->lg->lguest_data->tsc_khz))
  561. return -EFAULT;
  562. /* The interrupt code might not like the system call vector. */
  563. if (!check_syscall_vector(cpu->lg))
  564. kill_guest(cpu, "bad syscall vector");
  565. return 0;
  566. }
  567. /*:*/
  568. /*L:030 lguest_arch_setup_regs()
  569. *
  570. * Most of the Guest's registers are left alone: we used get_zeroed_page() to
  571. * allocate the structure, so they will be 0. */
  572. void lguest_arch_setup_regs(struct lg_cpu *cpu, unsigned long start)
  573. {
  574. struct lguest_regs *regs = cpu->regs;
  575. /* There are four "segment" registers which the Guest needs to boot:
  576. * The "code segment" register (cs) refers to the kernel code segment
  577. * __KERNEL_CS, and the "data", "extra" and "stack" segment registers
  578. * refer to the kernel data segment __KERNEL_DS.
  579. *
  580. * The privilege level is packed into the lower bits. The Guest runs
  581. * at privilege level 1 (GUEST_PL).*/
  582. regs->ds = regs->es = regs->ss = __KERNEL_DS|GUEST_PL;
  583. regs->cs = __KERNEL_CS|GUEST_PL;
  584. /* The "eflags" register contains miscellaneous flags. Bit 1 (0x002)
  585. * is supposed to always be "1". Bit 9 (0x200) controls whether
  586. * interrupts are enabled. We always leave interrupts enabled while
  587. * running the Guest. */
  588. regs->eflags = X86_EFLAGS_IF | 0x2;
  589. /* The "Extended Instruction Pointer" register says where the Guest is
  590. * running. */
  591. regs->eip = start;
  592. /* %esi points to our boot information, at physical address 0, so don't
  593. * touch it. */
  594. /* There are a couple of GDT entries the Guest expects when first
  595. * booting. */
  596. setup_guest_gdt(cpu);
  597. }