segments.c 8.8 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229
  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. /* Is the descriptor the Guest wants us to put in OK?
  45. *
  46. * The flag which Intel says must be zero: must be zero. The descriptor must
  47. * be present, (this is actually checked earlier but is here for thorougness),
  48. * and the descriptor type must be 1 (a memory segment). */
  49. static int desc_ok(const struct desc_struct *gdt)
  50. {
  51. return ((gdt->b & 0x00209000) == 0x00009000);
  52. }
  53. /* Is the segment present? (Otherwise it can't be used by the Guest). */
  54. static int segment_present(const struct desc_struct *gdt)
  55. {
  56. return gdt->b & 0x8000;
  57. }
  58. /* There are several entries we don't let the Guest set. The TSS entry is the
  59. * "Task State Segment" which controls all kinds of delicate things. The
  60. * LGUEST_CS and LGUEST_DS entries are reserved for the Switcher, and the
  61. * the Guest can't be trusted to deal with double faults. */
  62. static int ignored_gdt(unsigned int num)
  63. {
  64. return (num == GDT_ENTRY_TSS
  65. || num == GDT_ENTRY_LGUEST_CS
  66. || num == GDT_ENTRY_LGUEST_DS
  67. || num == GDT_ENTRY_DOUBLEFAULT_TSS);
  68. }
  69. /* If the Guest asks us to remove an entry from the GDT, we have to be careful.
  70. * If one of the segment registers is pointing at that entry the Switcher will
  71. * crash when it tries to reload the segment registers for the Guest.
  72. *
  73. * It doesn't make much sense for the Guest to try to remove its own code, data
  74. * or stack segments while they're in use: assume that's a Guest bug. If it's
  75. * one of the lesser segment registers using the removed entry, we simply set
  76. * that register to 0 (unusable). */
  77. static void check_segment_use(struct lguest *lg, unsigned int desc)
  78. {
  79. /* GDT entries are 8 bytes long, so we divide to get the index and
  80. * ignore the bottom bits. */
  81. if (lg->regs->gs / 8 == desc)
  82. lg->regs->gs = 0;
  83. if (lg->regs->fs / 8 == desc)
  84. lg->regs->fs = 0;
  85. if (lg->regs->es / 8 == desc)
  86. lg->regs->es = 0;
  87. if (lg->regs->ds / 8 == desc
  88. || lg->regs->cs / 8 == desc
  89. || lg->regs->ss / 8 == desc)
  90. kill_guest(lg, "Removed live GDT entry %u", desc);
  91. }
  92. /*:*/
  93. /*M:009 We wouldn't need to check for removal of in-use segments if we handled
  94. * faults in the Switcher. However, it's probably not a worthwhile
  95. * optimization. :*/
  96. /*H:610 Once the GDT has been changed, we look through the changed entries and
  97. * see if they're OK. If not, we'll call kill_guest() and the Guest will never
  98. * get to use the invalid entries. */
  99. static void fixup_gdt_table(struct lguest *lg, unsigned start, unsigned end)
  100. {
  101. unsigned int i;
  102. for (i = start; i < end; i++) {
  103. /* We never copy these ones to real GDT, so we don't care what
  104. * they say */
  105. if (ignored_gdt(i))
  106. continue;
  107. /* We could fault in switch_to_guest if they are using
  108. * a removed segment. */
  109. if (!segment_present(&lg->gdt[i])) {
  110. check_segment_use(lg, i);
  111. continue;
  112. }
  113. if (!desc_ok(&lg->gdt[i]))
  114. kill_guest(lg, "Bad GDT descriptor %i", i);
  115. /* Segment descriptors contain a privilege level: the Guest is
  116. * sometimes careless and leaves this as 0, even though it's
  117. * running at privilege level 1. If so, we fix it here. */
  118. if ((lg->gdt[i].b & 0x00006000) == 0)
  119. lg->gdt[i].b |= (GUEST_PL << 13);
  120. /* Each descriptor has an "accessed" bit. If we don't set it
  121. * now, the CPU will try to set it when the Guest first loads
  122. * that entry into a segment register. But the GDT isn't
  123. * writable by the Guest, so bad things can happen. */
  124. lg->gdt[i].b |= 0x00000100;
  125. }
  126. }
  127. /* This routine is called at boot or modprobe time for each CPU to set up the
  128. * "constant" GDT entries for Guests running on that CPU. */
  129. void setup_default_gdt_entries(struct lguest_ro_state *state)
  130. {
  131. struct desc_struct *gdt = state->guest_gdt;
  132. unsigned long tss = (unsigned long)&state->guest_tss;
  133. /* The hypervisor segments are full 0-4G segments, privilege level 0 */
  134. gdt[GDT_ENTRY_LGUEST_CS] = FULL_EXEC_SEGMENT;
  135. gdt[GDT_ENTRY_LGUEST_DS] = FULL_SEGMENT;
  136. /* The TSS segment refers to the TSS entry for this CPU, so we cannot
  137. * copy it from the Guest. Forgive the magic flags */
  138. gdt[GDT_ENTRY_TSS].a = 0x00000067 | (tss << 16);
  139. gdt[GDT_ENTRY_TSS].b = 0x00008900 | (tss & 0xFF000000)
  140. | ((tss >> 16) & 0x000000FF);
  141. }
  142. /* This routine is called before the Guest is run for the first time. */
  143. void setup_guest_gdt(struct lguest *lg)
  144. {
  145. /* Start with full 0-4G segments... */
  146. lg->gdt[GDT_ENTRY_KERNEL_CS] = FULL_EXEC_SEGMENT;
  147. lg->gdt[GDT_ENTRY_KERNEL_DS] = FULL_SEGMENT;
  148. /* ...except the Guest is allowed to use them, so set the privilege
  149. * level appropriately in the flags. */
  150. lg->gdt[GDT_ENTRY_KERNEL_CS].b |= (GUEST_PL << 13);
  151. lg->gdt[GDT_ENTRY_KERNEL_DS].b |= (GUEST_PL << 13);
  152. }
  153. /* Like the IDT, we never simply use the GDT the Guest gives us. We set up the
  154. * GDTs for each CPU, then we copy across the entries each time we want to run
  155. * a different Guest on that CPU. */
  156. /* A partial GDT load, for the three "thead-local storage" entries. Otherwise
  157. * it's just like load_guest_gdt(). So much, in fact, it would probably be
  158. * neater to have a single hypercall to cover both. */
  159. void copy_gdt_tls(const struct lguest *lg, struct desc_struct *gdt)
  160. {
  161. unsigned int i;
  162. for (i = GDT_ENTRY_TLS_MIN; i <= GDT_ENTRY_TLS_MAX; i++)
  163. gdt[i] = lg->gdt[i];
  164. }
  165. /* This is the full version */
  166. void copy_gdt(const struct lguest *lg, struct desc_struct *gdt)
  167. {
  168. unsigned int i;
  169. /* The default entries from setup_default_gdt_entries() are not
  170. * replaced. See ignored_gdt() above. */
  171. for (i = 0; i < GDT_ENTRIES; i++)
  172. if (!ignored_gdt(i))
  173. gdt[i] = lg->gdt[i];
  174. }
  175. /* This is where the Guest asks us to load a new GDT (LHCALL_LOAD_GDT). */
  176. void load_guest_gdt(struct lguest *lg, unsigned long table, u32 num)
  177. {
  178. /* We assume the Guest has the same number of GDT entries as the
  179. * Host, otherwise we'd have to dynamically allocate the Guest GDT. */
  180. if (num > ARRAY_SIZE(lg->gdt))
  181. kill_guest(lg, "too many gdt entries %i", num);
  182. /* We read the whole thing in, then fix it up. */
  183. lgread(lg, lg->gdt, table, num * sizeof(lg->gdt[0]));
  184. fixup_gdt_table(lg, 0, ARRAY_SIZE(lg->gdt));
  185. /* Mark that the GDT changed so the core knows it has to copy it again,
  186. * even if the Guest is run on the same CPU. */
  187. lg->changed |= CHANGED_GDT;
  188. }
  189. void guest_load_tls(struct lguest *lg, unsigned long gtls)
  190. {
  191. struct desc_struct *tls = &lg->gdt[GDT_ENTRY_TLS_MIN];
  192. lgread(lg, tls, gtls, sizeof(*tls)*GDT_ENTRY_TLS_ENTRIES);
  193. fixup_gdt_table(lg, GDT_ENTRY_TLS_MIN, GDT_ENTRY_TLS_MAX+1);
  194. lg->changed |= CHANGED_GDT_TLS;
  195. }
  196. /*
  197. * With this, we have finished the Host.
  198. *
  199. * Five of the seven parts of our task are complete. You have made it through
  200. * the Bit of Despair (I think that's somewhere in the page table code,
  201. * myself).
  202. *
  203. * Next, we examine "make Switcher". It's short, but intense.
  204. */