segments.c 7.1 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177
  1. /*P:600 The x86 architecture has segments, which involve a table of descriptors
  2. * which can be used to do funky things with virtual address interpretation.
  3. * We originally used to use segments so the Guest couldn't alter the
  4. * Guest<->Host Switcher, and then we had to trim Guest segments, and restore
  5. * for userspace per-thread segments, but trim again for on userspace->kernel
  6. * transitions... This nightmarish creation was contained within this file,
  7. * where we knew not to tread without heavy armament and a change of underwear.
  8. *
  9. * In these modern times, the segment handling code consists of simple sanity
  10. * checks, and the worst you'll experience reading this code is butterfly-rash
  11. * from frolicking through its parklike serenity. :*/
  12. #include "lg.h"
  13. /*H:600
  14. * We've almost completed the Host; there's just one file to go!
  15. *
  16. * Segments & The Global Descriptor Table
  17. *
  18. * (That title sounds like a bad Nerdcore group. Not to suggest that there are
  19. * any good Nerdcore groups, but in high school a friend of mine had a band
  20. * called Joe Fish and the Chips, so there are definitely worse band names).
  21. *
  22. * To refresh: the GDT is a table of 8-byte values describing segments. Once
  23. * set up, these segments can be loaded into one of the 6 "segment registers".
  24. *
  25. * GDT entries are passed around as "struct desc_struct"s, which like IDT
  26. * entries are split into two 32-bit members, "a" and "b". One day, someone
  27. * will clean that up, and be declared a Hero. (No pressure, I'm just saying).
  28. *
  29. * Anyway, the GDT entry contains a base (the start address of the segment), a
  30. * limit (the size of the segment - 1), and some flags. Sounds simple, and it
  31. * would be, except those zany Intel engineers decided that it was too boring
  32. * to put the base at one end, the limit at the other, and the flags in
  33. * between. They decided to shotgun the bits at random throughout the 8 bytes,
  34. * like so:
  35. *
  36. * 0 16 40 48 52 56 63
  37. * [ limit part 1 ][ base part 1 ][ flags ][li][fl][base ]
  38. * mit ags part 2
  39. * part 2
  40. *
  41. * As a result, this file contains a certain amount of magic numeracy. Let's
  42. * begin.
  43. */
  44. /* There are several entries we don't let the Guest set. The TSS entry is the
  45. * "Task State Segment" which controls all kinds of delicate things. The
  46. * LGUEST_CS and LGUEST_DS entries are reserved for the Switcher, and the
  47. * the Guest can't be trusted to deal with double faults. */
  48. static int ignored_gdt(unsigned int num)
  49. {
  50. return (num == GDT_ENTRY_TSS
  51. || num == GDT_ENTRY_LGUEST_CS
  52. || num == GDT_ENTRY_LGUEST_DS
  53. || num == GDT_ENTRY_DOUBLEFAULT_TSS);
  54. }
  55. /*H:610 Once the GDT has been changed, we fix the new entries up a little. We
  56. * don't care if they're invalid: the worst that can happen is a General
  57. * Protection Fault in the Switcher when it restores a Guest segment register
  58. * which tries to use that entry. Then we kill the Guest for causing such a
  59. * mess: the message will be "unhandled trap 256". */
  60. static void fixup_gdt_table(struct lguest *lg, unsigned start, unsigned end)
  61. {
  62. unsigned int i;
  63. for (i = start; i < end; i++) {
  64. /* We never copy these ones to real GDT, so we don't care what
  65. * they say */
  66. if (ignored_gdt(i))
  67. continue;
  68. /* Segment descriptors contain a privilege level: the Guest is
  69. * sometimes careless and leaves this as 0, even though it's
  70. * running at privilege level 1. If so, we fix it here. */
  71. if ((lg->gdt[i].b & 0x00006000) == 0)
  72. lg->gdt[i].b |= (GUEST_PL << 13);
  73. /* Each descriptor has an "accessed" bit. If we don't set it
  74. * now, the CPU will try to set it when the Guest first loads
  75. * that entry into a segment register. But the GDT isn't
  76. * writable by the Guest, so bad things can happen. */
  77. lg->gdt[i].b |= 0x00000100;
  78. }
  79. }
  80. /* This routine is called at boot or modprobe time for each CPU to set up the
  81. * "constant" GDT entries for Guests running on that CPU. */
  82. void setup_default_gdt_entries(struct lguest_ro_state *state)
  83. {
  84. struct desc_struct *gdt = state->guest_gdt;
  85. unsigned long tss = (unsigned long)&state->guest_tss;
  86. /* The hypervisor segments are full 0-4G segments, privilege level 0 */
  87. gdt[GDT_ENTRY_LGUEST_CS] = FULL_EXEC_SEGMENT;
  88. gdt[GDT_ENTRY_LGUEST_DS] = FULL_SEGMENT;
  89. /* The TSS segment refers to the TSS entry for this CPU, so we cannot
  90. * copy it from the Guest. Forgive the magic flags */
  91. gdt[GDT_ENTRY_TSS].a = 0x00000067 | (tss << 16);
  92. gdt[GDT_ENTRY_TSS].b = 0x00008900 | (tss & 0xFF000000)
  93. | ((tss >> 16) & 0x000000FF);
  94. }
  95. /* This routine is called before the Guest is run for the first time. */
  96. void setup_guest_gdt(struct lguest *lg)
  97. {
  98. /* Start with full 0-4G segments... */
  99. lg->gdt[GDT_ENTRY_KERNEL_CS] = FULL_EXEC_SEGMENT;
  100. lg->gdt[GDT_ENTRY_KERNEL_DS] = FULL_SEGMENT;
  101. /* ...except the Guest is allowed to use them, so set the privilege
  102. * level appropriately in the flags. */
  103. lg->gdt[GDT_ENTRY_KERNEL_CS].b |= (GUEST_PL << 13);
  104. lg->gdt[GDT_ENTRY_KERNEL_DS].b |= (GUEST_PL << 13);
  105. }
  106. /* Like the IDT, we never simply use the GDT the Guest gives us. We set up the
  107. * GDTs for each CPU, then we copy across the entries each time we want to run
  108. * a different Guest on that CPU. */
  109. /* A partial GDT load, for the three "thead-local storage" entries. Otherwise
  110. * it's just like load_guest_gdt(). So much, in fact, it would probably be
  111. * neater to have a single hypercall to cover both. */
  112. void copy_gdt_tls(const struct lguest *lg, struct desc_struct *gdt)
  113. {
  114. unsigned int i;
  115. for (i = GDT_ENTRY_TLS_MIN; i <= GDT_ENTRY_TLS_MAX; i++)
  116. gdt[i] = lg->gdt[i];
  117. }
  118. /* This is the full version */
  119. void copy_gdt(const struct lguest *lg, struct desc_struct *gdt)
  120. {
  121. unsigned int i;
  122. /* The default entries from setup_default_gdt_entries() are not
  123. * replaced. See ignored_gdt() above. */
  124. for (i = 0; i < GDT_ENTRIES; i++)
  125. if (!ignored_gdt(i))
  126. gdt[i] = lg->gdt[i];
  127. }
  128. /* This is where the Guest asks us to load a new GDT (LHCALL_LOAD_GDT). */
  129. void load_guest_gdt(struct lguest *lg, unsigned long table, u32 num)
  130. {
  131. /* We assume the Guest has the same number of GDT entries as the
  132. * Host, otherwise we'd have to dynamically allocate the Guest GDT. */
  133. if (num > ARRAY_SIZE(lg->gdt))
  134. kill_guest(lg, "too many gdt entries %i", num);
  135. /* We read the whole thing in, then fix it up. */
  136. lgread(lg, lg->gdt, table, num * sizeof(lg->gdt[0]));
  137. fixup_gdt_table(lg, 0, ARRAY_SIZE(lg->gdt));
  138. /* Mark that the GDT changed so the core knows it has to copy it again,
  139. * even if the Guest is run on the same CPU. */
  140. lg->changed |= CHANGED_GDT;
  141. }
  142. void guest_load_tls(struct lguest *lg, unsigned long gtls)
  143. {
  144. struct desc_struct *tls = &lg->gdt[GDT_ENTRY_TLS_MIN];
  145. lgread(lg, tls, gtls, sizeof(*tls)*GDT_ENTRY_TLS_ENTRIES);
  146. fixup_gdt_table(lg, GDT_ENTRY_TLS_MIN, GDT_ENTRY_TLS_MAX+1);
  147. lg->changed |= CHANGED_GDT_TLS;
  148. }
  149. /*
  150. * With this, we have finished the Host.
  151. *
  152. * Five of the seven parts of our task are complete. You have made it through
  153. * the Bit of Despair (I think that's somewhere in the page table code,
  154. * myself).
  155. *
  156. * Next, we examine "make Switcher". It's short, but intense.
  157. */