misc.c 11 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443
  1. /*
  2. * misc.c
  3. *
  4. * This is a collection of several routines from gzip-1.0.3
  5. * adapted for Linux.
  6. *
  7. * malloc by Hannu Savolainen 1993 and Matthias Urlichs 1994
  8. * puts by Nick Holloway 1993, better puts by Martin Mares 1995
  9. * High loaded stuff by Hans Lermen & Werner Almesberger, Feb. 1996
  10. */
  11. #include "misc.h"
  12. /* WARNING!!
  13. * This code is compiled with -fPIC and it is relocated dynamically
  14. * at run time, but no relocation processing is performed.
  15. * This means that it is not safe to place pointers in static structures.
  16. */
  17. /*
  18. * Getting to provable safe in place decompression is hard.
  19. * Worst case behaviours need to be analyzed.
  20. * Background information:
  21. *
  22. * The file layout is:
  23. * magic[2]
  24. * method[1]
  25. * flags[1]
  26. * timestamp[4]
  27. * extraflags[1]
  28. * os[1]
  29. * compressed data blocks[N]
  30. * crc[4] orig_len[4]
  31. *
  32. * resulting in 18 bytes of non compressed data overhead.
  33. *
  34. * Files divided into blocks
  35. * 1 bit (last block flag)
  36. * 2 bits (block type)
  37. *
  38. * 1 block occurs every 32K -1 bytes or when there 50% compression
  39. * has been achieved. The smallest block type encoding is always used.
  40. *
  41. * stored:
  42. * 32 bits length in bytes.
  43. *
  44. * fixed:
  45. * magic fixed tree.
  46. * symbols.
  47. *
  48. * dynamic:
  49. * dynamic tree encoding.
  50. * symbols.
  51. *
  52. *
  53. * The buffer for decompression in place is the length of the
  54. * uncompressed data, plus a small amount extra to keep the algorithm safe.
  55. * The compressed data is placed at the end of the buffer. The output
  56. * pointer is placed at the start of the buffer and the input pointer
  57. * is placed where the compressed data starts. Problems will occur
  58. * when the output pointer overruns the input pointer.
  59. *
  60. * The output pointer can only overrun the input pointer if the input
  61. * pointer is moving faster than the output pointer. A condition only
  62. * triggered by data whose compressed form is larger than the uncompressed
  63. * form.
  64. *
  65. * The worst case at the block level is a growth of the compressed data
  66. * of 5 bytes per 32767 bytes.
  67. *
  68. * The worst case internal to a compressed block is very hard to figure.
  69. * The worst case can at least be boundined by having one bit that represents
  70. * 32764 bytes and then all of the rest of the bytes representing the very
  71. * very last byte.
  72. *
  73. * All of which is enough to compute an amount of extra data that is required
  74. * to be safe. To avoid problems at the block level allocating 5 extra bytes
  75. * per 32767 bytes of data is sufficient. To avoind problems internal to a
  76. * block adding an extra 32767 bytes (the worst case uncompressed block size)
  77. * is sufficient, to ensure that in the worst case the decompressed data for
  78. * block will stop the byte before the compressed data for a block begins.
  79. * To avoid problems with the compressed data's meta information an extra 18
  80. * bytes are needed. Leading to the formula:
  81. *
  82. * extra_bytes = (uncompressed_size >> 12) + 32768 + 18 + decompressor_size.
  83. *
  84. * Adding 8 bytes per 32K is a bit excessive but much easier to calculate.
  85. * Adding 32768 instead of 32767 just makes for round numbers.
  86. * Adding the decompressor_size is necessary as it musht live after all
  87. * of the data as well. Last I measured the decompressor is about 14K.
  88. * 10K of actual data and 4K of bss.
  89. *
  90. */
  91. /*
  92. * gzip declarations
  93. */
  94. #define STATIC static
  95. #undef memset
  96. #undef memcpy
  97. #define memzero(s, n) memset((s), 0, (n))
  98. static void error(char *m);
  99. /*
  100. * This is set up by the setup-routine at boot-time
  101. */
  102. struct boot_params *real_mode; /* Pointer to real-mode data */
  103. void *memset(void *s, int c, size_t n);
  104. void *memcpy(void *dest, const void *src, size_t n);
  105. memptr free_mem_ptr;
  106. memptr free_mem_end_ptr;
  107. static char *vidmem;
  108. static int vidport;
  109. static int lines, cols;
  110. #ifdef CONFIG_KERNEL_GZIP
  111. #include "../../../../lib/decompress_inflate.c"
  112. #endif
  113. #ifdef CONFIG_KERNEL_BZIP2
  114. #include "../../../../lib/decompress_bunzip2.c"
  115. #endif
  116. #ifdef CONFIG_KERNEL_LZMA
  117. #include "../../../../lib/decompress_unlzma.c"
  118. #endif
  119. #ifdef CONFIG_KERNEL_XZ
  120. #include "../../../../lib/decompress_unxz.c"
  121. #endif
  122. #ifdef CONFIG_KERNEL_LZO
  123. #include "../../../../lib/decompress_unlzo.c"
  124. #endif
  125. #ifdef CONFIG_KERNEL_LZ4
  126. #include "../../../../lib/decompress_unlz4.c"
  127. #endif
  128. static void scroll(void)
  129. {
  130. int i;
  131. memcpy(vidmem, vidmem + cols * 2, (lines - 1) * cols * 2);
  132. for (i = (lines - 1) * cols * 2; i < lines * cols * 2; i += 2)
  133. vidmem[i] = ' ';
  134. }
  135. #define XMTRDY 0x20
  136. #define TXR 0 /* Transmit register (WRITE) */
  137. #define LSR 5 /* Line Status */
  138. static void serial_putchar(int ch)
  139. {
  140. unsigned timeout = 0xffff;
  141. while ((inb(early_serial_base + LSR) & XMTRDY) == 0 && --timeout)
  142. cpu_relax();
  143. outb(ch, early_serial_base + TXR);
  144. }
  145. void __putstr(const char *s)
  146. {
  147. int x, y, pos;
  148. char c;
  149. if (early_serial_base) {
  150. const char *str = s;
  151. while (*str) {
  152. if (*str == '\n')
  153. serial_putchar('\r');
  154. serial_putchar(*str++);
  155. }
  156. }
  157. if (real_mode->screen_info.orig_video_mode == 0 &&
  158. lines == 0 && cols == 0)
  159. return;
  160. x = real_mode->screen_info.orig_x;
  161. y = real_mode->screen_info.orig_y;
  162. while ((c = *s++) != '\0') {
  163. if (c == '\n') {
  164. x = 0;
  165. if (++y >= lines) {
  166. scroll();
  167. y--;
  168. }
  169. } else {
  170. vidmem[(x + cols * y) * 2] = c;
  171. if (++x >= cols) {
  172. x = 0;
  173. if (++y >= lines) {
  174. scroll();
  175. y--;
  176. }
  177. }
  178. }
  179. }
  180. real_mode->screen_info.orig_x = x;
  181. real_mode->screen_info.orig_y = y;
  182. pos = (x + cols * y) * 2; /* Update cursor position */
  183. outb(14, vidport);
  184. outb(0xff & (pos >> 9), vidport+1);
  185. outb(15, vidport);
  186. outb(0xff & (pos >> 1), vidport+1);
  187. }
  188. void *memset(void *s, int c, size_t n)
  189. {
  190. int i;
  191. char *ss = s;
  192. for (i = 0; i < n; i++)
  193. ss[i] = c;
  194. return s;
  195. }
  196. #ifdef CONFIG_X86_32
  197. void *memcpy(void *dest, const void *src, size_t n)
  198. {
  199. int d0, d1, d2;
  200. asm volatile(
  201. "rep ; movsl\n\t"
  202. "movl %4,%%ecx\n\t"
  203. "rep ; movsb\n\t"
  204. : "=&c" (d0), "=&D" (d1), "=&S" (d2)
  205. : "0" (n >> 2), "g" (n & 3), "1" (dest), "2" (src)
  206. : "memory");
  207. return dest;
  208. }
  209. #else
  210. void *memcpy(void *dest, const void *src, size_t n)
  211. {
  212. long d0, d1, d2;
  213. asm volatile(
  214. "rep ; movsq\n\t"
  215. "movq %4,%%rcx\n\t"
  216. "rep ; movsb\n\t"
  217. : "=&c" (d0), "=&D" (d1), "=&S" (d2)
  218. : "0" (n >> 3), "g" (n & 7), "1" (dest), "2" (src)
  219. : "memory");
  220. return dest;
  221. }
  222. #endif
  223. static void error(char *x)
  224. {
  225. error_putstr("\n\n");
  226. error_putstr(x);
  227. error_putstr("\n\n -- System halted");
  228. while (1)
  229. asm("hlt");
  230. }
  231. #if CONFIG_X86_NEED_RELOCS
  232. static void handle_relocations(void *output, unsigned long output_len)
  233. {
  234. int *reloc;
  235. unsigned long delta, map, ptr;
  236. unsigned long min_addr = (unsigned long)output;
  237. unsigned long max_addr = min_addr + output_len;
  238. /*
  239. * Calculate the delta between where vmlinux was linked to load
  240. * and where it was actually loaded.
  241. */
  242. delta = min_addr - LOAD_PHYSICAL_ADDR;
  243. if (!delta) {
  244. debug_putstr("No relocation needed... ");
  245. return;
  246. }
  247. debug_putstr("Performing relocations... ");
  248. /*
  249. * The kernel contains a table of relocation addresses. Those
  250. * addresses have the final load address of the kernel in virtual
  251. * memory. We are currently working in the self map. So we need to
  252. * create an adjustment for kernel memory addresses to the self map.
  253. * This will involve subtracting out the base address of the kernel.
  254. */
  255. map = delta - __START_KERNEL_map;
  256. /*
  257. * Process relocations: 32 bit relocations first then 64 bit after.
  258. * Two sets of binary relocations are added to the end of the kernel
  259. * before compression. Each relocation table entry is the kernel
  260. * address of the location which needs to be updated stored as a
  261. * 32-bit value which is sign extended to 64 bits.
  262. *
  263. * Format is:
  264. *
  265. * kernel bits...
  266. * 0 - zero terminator for 64 bit relocations
  267. * 64 bit relocation repeated
  268. * 0 - zero terminator for 32 bit relocations
  269. * 32 bit relocation repeated
  270. *
  271. * So we work backwards from the end of the decompressed image.
  272. */
  273. for (reloc = output + output_len - sizeof(*reloc); *reloc; reloc--) {
  274. int extended = *reloc;
  275. extended += map;
  276. ptr = (unsigned long)extended;
  277. if (ptr < min_addr || ptr > max_addr)
  278. error("32-bit relocation outside of kernel!\n");
  279. *(uint32_t *)ptr += delta;
  280. }
  281. #ifdef CONFIG_X86_64
  282. for (reloc--; *reloc; reloc--) {
  283. long extended = *reloc;
  284. extended += map;
  285. ptr = (unsigned long)extended;
  286. if (ptr < min_addr || ptr > max_addr)
  287. error("64-bit relocation outside of kernel!\n");
  288. *(uint64_t *)ptr += delta;
  289. }
  290. #endif
  291. }
  292. #else
  293. static inline void handle_relocations(void *output, unsigned long output_len)
  294. { }
  295. #endif
  296. static void parse_elf(void *output)
  297. {
  298. #ifdef CONFIG_X86_64
  299. Elf64_Ehdr ehdr;
  300. Elf64_Phdr *phdrs, *phdr;
  301. #else
  302. Elf32_Ehdr ehdr;
  303. Elf32_Phdr *phdrs, *phdr;
  304. #endif
  305. void *dest;
  306. int i;
  307. memcpy(&ehdr, output, sizeof(ehdr));
  308. if (ehdr.e_ident[EI_MAG0] != ELFMAG0 ||
  309. ehdr.e_ident[EI_MAG1] != ELFMAG1 ||
  310. ehdr.e_ident[EI_MAG2] != ELFMAG2 ||
  311. ehdr.e_ident[EI_MAG3] != ELFMAG3) {
  312. error("Kernel is not a valid ELF file");
  313. return;
  314. }
  315. debug_putstr("Parsing ELF... ");
  316. phdrs = malloc(sizeof(*phdrs) * ehdr.e_phnum);
  317. if (!phdrs)
  318. error("Failed to allocate space for phdrs");
  319. memcpy(phdrs, output + ehdr.e_phoff, sizeof(*phdrs) * ehdr.e_phnum);
  320. for (i = 0; i < ehdr.e_phnum; i++) {
  321. phdr = &phdrs[i];
  322. switch (phdr->p_type) {
  323. case PT_LOAD:
  324. #ifdef CONFIG_RELOCATABLE
  325. dest = output;
  326. dest += (phdr->p_paddr - LOAD_PHYSICAL_ADDR);
  327. #else
  328. dest = (void *)(phdr->p_paddr);
  329. #endif
  330. memcpy(dest,
  331. output + phdr->p_offset,
  332. phdr->p_filesz);
  333. break;
  334. default: /* Ignore other PT_* */ break;
  335. }
  336. }
  337. free(phdrs);
  338. }
  339. asmlinkage void *decompress_kernel(void *rmode, memptr heap,
  340. unsigned char *input_data,
  341. unsigned long input_len,
  342. unsigned char *output,
  343. unsigned long output_len)
  344. {
  345. real_mode = rmode;
  346. sanitize_boot_params(real_mode);
  347. if (real_mode->screen_info.orig_video_mode == 7) {
  348. vidmem = (char *) 0xb0000;
  349. vidport = 0x3b4;
  350. } else {
  351. vidmem = (char *) 0xb8000;
  352. vidport = 0x3d4;
  353. }
  354. lines = real_mode->screen_info.orig_video_lines;
  355. cols = real_mode->screen_info.orig_video_cols;
  356. console_init();
  357. debug_putstr("early console in decompress_kernel\n");
  358. free_mem_ptr = heap; /* Heap */
  359. free_mem_end_ptr = heap + BOOT_HEAP_SIZE;
  360. output = choose_kernel_location(input_data, input_len,
  361. output, output_len);
  362. /* Validate memory location choices. */
  363. if ((unsigned long)output & (MIN_KERNEL_ALIGN - 1))
  364. error("Destination address inappropriately aligned");
  365. #ifdef CONFIG_X86_64
  366. if (heap > 0x3fffffffffffUL)
  367. error("Destination address too large");
  368. #else
  369. if (heap > ((-__PAGE_OFFSET-(128<<20)-1) & 0x7fffffff))
  370. error("Destination address too large");
  371. #endif
  372. #ifndef CONFIG_RELOCATABLE
  373. if ((unsigned long)output != LOAD_PHYSICAL_ADDR)
  374. error("Wrong destination address");
  375. #endif
  376. debug_putstr("\nDecompressing Linux... ");
  377. decompress(input_data, input_len, NULL, NULL, output, NULL, error);
  378. parse_elf(output);
  379. handle_relocations(output, output_len);
  380. debug_putstr("done.\nBooting the kernel.\n");
  381. return output;
  382. }