misc.c 8.8 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377
  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. static int quiet;
  104. static int debug;
  105. void *memset(void *s, int c, size_t n);
  106. void *memcpy(void *dest, const void *src, size_t n);
  107. #ifdef CONFIG_X86_64
  108. #define memptr long
  109. #else
  110. #define memptr unsigned
  111. #endif
  112. static memptr free_mem_ptr;
  113. static memptr free_mem_end_ptr;
  114. static char *vidmem;
  115. static int vidport;
  116. static int lines, cols;
  117. #ifdef CONFIG_KERNEL_GZIP
  118. #include "../../../../lib/decompress_inflate.c"
  119. #endif
  120. #ifdef CONFIG_KERNEL_BZIP2
  121. #include "../../../../lib/decompress_bunzip2.c"
  122. #endif
  123. #ifdef CONFIG_KERNEL_LZMA
  124. #include "../../../../lib/decompress_unlzma.c"
  125. #endif
  126. #ifdef CONFIG_KERNEL_XZ
  127. #include "../../../../lib/decompress_unxz.c"
  128. #endif
  129. #ifdef CONFIG_KERNEL_LZO
  130. #include "../../../../lib/decompress_unlzo.c"
  131. #endif
  132. static void scroll(void)
  133. {
  134. int i;
  135. memcpy(vidmem, vidmem + cols * 2, (lines - 1) * cols * 2);
  136. for (i = (lines - 1) * cols * 2; i < lines * cols * 2; i += 2)
  137. vidmem[i] = ' ';
  138. }
  139. #define XMTRDY 0x20
  140. #define TXR 0 /* Transmit register (WRITE) */
  141. #define LSR 5 /* Line Status */
  142. static void serial_putchar(int ch)
  143. {
  144. unsigned timeout = 0xffff;
  145. while ((inb(early_serial_base + LSR) & XMTRDY) == 0 && --timeout)
  146. cpu_relax();
  147. outb(ch, early_serial_base + TXR);
  148. }
  149. void __putstr(int error, const char *s)
  150. {
  151. int x, y, pos;
  152. char c;
  153. #ifndef CONFIG_X86_VERBOSE_BOOTUP
  154. if (!error)
  155. return;
  156. #endif
  157. if (early_serial_base) {
  158. const char *str = s;
  159. while (*str) {
  160. if (*str == '\n')
  161. serial_putchar('\r');
  162. serial_putchar(*str++);
  163. }
  164. }
  165. if (real_mode->screen_info.orig_video_mode == 0 &&
  166. lines == 0 && cols == 0)
  167. return;
  168. x = real_mode->screen_info.orig_x;
  169. y = real_mode->screen_info.orig_y;
  170. while ((c = *s++) != '\0') {
  171. if (c == '\n') {
  172. x = 0;
  173. if (++y >= lines) {
  174. scroll();
  175. y--;
  176. }
  177. } else {
  178. vidmem[(x + cols * y) * 2] = c;
  179. if (++x >= cols) {
  180. x = 0;
  181. if (++y >= lines) {
  182. scroll();
  183. y--;
  184. }
  185. }
  186. }
  187. }
  188. real_mode->screen_info.orig_x = x;
  189. real_mode->screen_info.orig_y = y;
  190. pos = (x + cols * y) * 2; /* Update cursor position */
  191. outb(14, vidport);
  192. outb(0xff & (pos >> 9), vidport+1);
  193. outb(15, vidport);
  194. outb(0xff & (pos >> 1), vidport+1);
  195. }
  196. void *memset(void *s, int c, size_t n)
  197. {
  198. int i;
  199. char *ss = s;
  200. for (i = 0; i < n; i++)
  201. ss[i] = c;
  202. return s;
  203. }
  204. #ifdef CONFIG_X86_32
  205. void *memcpy(void *dest, const void *src, size_t n)
  206. {
  207. int d0, d1, d2;
  208. asm volatile(
  209. "rep ; movsl\n\t"
  210. "movl %4,%%ecx\n\t"
  211. "rep ; movsb\n\t"
  212. : "=&c" (d0), "=&D" (d1), "=&S" (d2)
  213. : "0" (n >> 2), "g" (n & 3), "1" (dest), "2" (src)
  214. : "memory");
  215. return dest;
  216. }
  217. #else
  218. void *memcpy(void *dest, const void *src, size_t n)
  219. {
  220. long d0, d1, d2;
  221. asm volatile(
  222. "rep ; movsq\n\t"
  223. "movq %4,%%rcx\n\t"
  224. "rep ; movsb\n\t"
  225. : "=&c" (d0), "=&D" (d1), "=&S" (d2)
  226. : "0" (n >> 3), "g" (n & 7), "1" (dest), "2" (src)
  227. : "memory");
  228. return dest;
  229. }
  230. #endif
  231. static void error(char *x)
  232. {
  233. __putstr(1, "\n\n");
  234. __putstr(1, x);
  235. __putstr(1, "\n\n -- System halted");
  236. while (1)
  237. asm("hlt");
  238. }
  239. static void parse_elf(void *output)
  240. {
  241. #ifdef CONFIG_X86_64
  242. Elf64_Ehdr ehdr;
  243. Elf64_Phdr *phdrs, *phdr;
  244. #else
  245. Elf32_Ehdr ehdr;
  246. Elf32_Phdr *phdrs, *phdr;
  247. #endif
  248. void *dest;
  249. int i;
  250. memcpy(&ehdr, output, sizeof(ehdr));
  251. if (ehdr.e_ident[EI_MAG0] != ELFMAG0 ||
  252. ehdr.e_ident[EI_MAG1] != ELFMAG1 ||
  253. ehdr.e_ident[EI_MAG2] != ELFMAG2 ||
  254. ehdr.e_ident[EI_MAG3] != ELFMAG3) {
  255. error("Kernel is not a valid ELF file");
  256. return;
  257. }
  258. if (!quiet)
  259. putstr("Parsing ELF... ");
  260. phdrs = malloc(sizeof(*phdrs) * ehdr.e_phnum);
  261. if (!phdrs)
  262. error("Failed to allocate space for phdrs");
  263. memcpy(phdrs, output + ehdr.e_phoff, sizeof(*phdrs) * ehdr.e_phnum);
  264. for (i = 0; i < ehdr.e_phnum; i++) {
  265. phdr = &phdrs[i];
  266. switch (phdr->p_type) {
  267. case PT_LOAD:
  268. #ifdef CONFIG_RELOCATABLE
  269. dest = output;
  270. dest += (phdr->p_paddr - LOAD_PHYSICAL_ADDR);
  271. #else
  272. dest = (void *)(phdr->p_paddr);
  273. #endif
  274. memcpy(dest,
  275. output + phdr->p_offset,
  276. phdr->p_filesz);
  277. break;
  278. default: /* Ignore other PT_* */ break;
  279. }
  280. }
  281. }
  282. asmlinkage void decompress_kernel(void *rmode, memptr heap,
  283. unsigned char *input_data,
  284. unsigned long input_len,
  285. unsigned char *output)
  286. {
  287. real_mode = rmode;
  288. if (cmdline_find_option_bool("quiet"))
  289. quiet = 1;
  290. if (cmdline_find_option_bool("debug"))
  291. debug = 1;
  292. if (real_mode->screen_info.orig_video_mode == 7) {
  293. vidmem = (char *) 0xb0000;
  294. vidport = 0x3b4;
  295. } else {
  296. vidmem = (char *) 0xb8000;
  297. vidport = 0x3d4;
  298. }
  299. lines = real_mode->screen_info.orig_video_lines;
  300. cols = real_mode->screen_info.orig_video_cols;
  301. console_init();
  302. if (debug)
  303. putstr("early console in decompress_kernel\n");
  304. free_mem_ptr = heap; /* Heap */
  305. free_mem_end_ptr = heap + BOOT_HEAP_SIZE;
  306. if ((unsigned long)output & (MIN_KERNEL_ALIGN - 1))
  307. error("Destination address inappropriately aligned");
  308. #ifdef CONFIG_X86_64
  309. if (heap > 0x3fffffffffffUL)
  310. error("Destination address too large");
  311. #else
  312. if (heap > ((-__PAGE_OFFSET-(128<<20)-1) & 0x7fffffff))
  313. error("Destination address too large");
  314. #endif
  315. #ifndef CONFIG_RELOCATABLE
  316. if ((unsigned long)output != LOAD_PHYSICAL_ADDR)
  317. error("Wrong destination address");
  318. #endif
  319. if (!quiet)
  320. putstr("\nDecompressing Linux... ");
  321. decompress(input_data, input_len, NULL, NULL, output, NULL, error);
  322. parse_elf(output);
  323. if (!quiet)
  324. putstr("done.\nBooting the kernel.\n");
  325. return;
  326. }