x86: Honor 'quiet' command line option in real mode boot decompressor.
[deliverable/linux.git] / arch / x86 / boot / compressed / misc.c
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
12 /*
13 * we have to be careful, because no indirections are allowed here, and
14 * paravirt_ops is a kind of one. As it will only run in baremetal anyway,
15 * we just keep it from happening
16 */
17 #undef CONFIG_PARAVIRT
18 #ifdef CONFIG_X86_32
19 #define _ASM_DESC_H_ 1
20 #endif
21
22 #ifdef CONFIG_X86_64
23 #define _LINUX_STRING_H_ 1
24 #define __LINUX_BITMAP_H 1
25 #endif
26
27 #include <linux/linkage.h>
28 #include <linux/screen_info.h>
29 #include <linux/elf.h>
30 #include <asm/io.h>
31 #include <asm/page.h>
32 #include <asm/boot.h>
33 #include <asm/bootparam.h>
34
35 /* WARNING!!
36 * This code is compiled with -fPIC and it is relocated dynamically
37 * at run time, but no relocation processing is performed.
38 * This means that it is not safe to place pointers in static structures.
39 */
40
41 /*
42 * Getting to provable safe in place decompression is hard.
43 * Worst case behaviours need to be analyzed.
44 * Background information:
45 *
46 * The file layout is:
47 * magic[2]
48 * method[1]
49 * flags[1]
50 * timestamp[4]
51 * extraflags[1]
52 * os[1]
53 * compressed data blocks[N]
54 * crc[4] orig_len[4]
55 *
56 * resulting in 18 bytes of non compressed data overhead.
57 *
58 * Files divided into blocks
59 * 1 bit (last block flag)
60 * 2 bits (block type)
61 *
62 * 1 block occurs every 32K -1 bytes or when there 50% compression
63 * has been achieved. The smallest block type encoding is always used.
64 *
65 * stored:
66 * 32 bits length in bytes.
67 *
68 * fixed:
69 * magic fixed tree.
70 * symbols.
71 *
72 * dynamic:
73 * dynamic tree encoding.
74 * symbols.
75 *
76 *
77 * The buffer for decompression in place is the length of the
78 * uncompressed data, plus a small amount extra to keep the algorithm safe.
79 * The compressed data is placed at the end of the buffer. The output
80 * pointer is placed at the start of the buffer and the input pointer
81 * is placed where the compressed data starts. Problems will occur
82 * when the output pointer overruns the input pointer.
83 *
84 * The output pointer can only overrun the input pointer if the input
85 * pointer is moving faster than the output pointer. A condition only
86 * triggered by data whose compressed form is larger than the uncompressed
87 * form.
88 *
89 * The worst case at the block level is a growth of the compressed data
90 * of 5 bytes per 32767 bytes.
91 *
92 * The worst case internal to a compressed block is very hard to figure.
93 * The worst case can at least be boundined by having one bit that represents
94 * 32764 bytes and then all of the rest of the bytes representing the very
95 * very last byte.
96 *
97 * All of which is enough to compute an amount of extra data that is required
98 * to be safe. To avoid problems at the block level allocating 5 extra bytes
99 * per 32767 bytes of data is sufficient. To avoind problems internal to a
100 * block adding an extra 32767 bytes (the worst case uncompressed block size)
101 * is sufficient, to ensure that in the worst case the decompressed data for
102 * block will stop the byte before the compressed data for a block begins.
103 * To avoid problems with the compressed data's meta information an extra 18
104 * bytes are needed. Leading to the formula:
105 *
106 * extra_bytes = (uncompressed_size >> 12) + 32768 + 18 + decompressor_size.
107 *
108 * Adding 8 bytes per 32K is a bit excessive but much easier to calculate.
109 * Adding 32768 instead of 32767 just makes for round numbers.
110 * Adding the decompressor_size is necessary as it musht live after all
111 * of the data as well. Last I measured the decompressor is about 14K.
112 * 10K of actual data and 4K of bss.
113 *
114 */
115
116 /*
117 * gzip declarations
118 */
119
120 #define OF(args) args
121 #define STATIC static
122
123 #undef memset
124 #undef memcpy
125 #define memzero(s, n) memset((s), 0, (n))
126
127 typedef unsigned char uch;
128 typedef unsigned short ush;
129 typedef unsigned long ulg;
130
131 /*
132 * Window size must be at least 32k, and a power of two.
133 * We don't actually have a window just a huge output buffer,
134 * so we report a 2G window size, as that should always be
135 * larger than our output buffer:
136 */
137 #define WSIZE 0x80000000
138
139 /* Input buffer: */
140 static unsigned char *inbuf;
141
142 /* Sliding window buffer (and final output buffer): */
143 static unsigned char *window;
144
145 /* Valid bytes in inbuf: */
146 static unsigned insize;
147
148 /* Index of next byte to be processed in inbuf: */
149 static unsigned inptr;
150
151 /* Bytes in output buffer: */
152 static unsigned outcnt;
153
154 /* gzip flag byte */
155 #define ASCII_FLAG 0x01 /* bit 0 set: file probably ASCII text */
156 #define CONTINUATION 0x02 /* bit 1 set: continuation of multi-part gz file */
157 #define EXTRA_FIELD 0x04 /* bit 2 set: extra field present */
158 #define ORIG_NAM 0x08 /* bit 3 set: original file name present */
159 #define COMMENT 0x10 /* bit 4 set: file comment present */
160 #define ENCRYPTED 0x20 /* bit 5 set: file is encrypted */
161 #define RESERVED 0xC0 /* bit 6, 7: reserved */
162
163 #define get_byte() (inptr < insize ? inbuf[inptr++] : fill_inbuf())
164
165 /* Diagnostic functions */
166 #ifdef DEBUG
167 # define Assert(cond, msg) do { if (!(cond)) error(msg); } while (0)
168 # define Trace(x) do { fprintf x; } while (0)
169 # define Tracev(x) do { if (verbose) fprintf x ; } while (0)
170 # define Tracevv(x) do { if (verbose > 1) fprintf x ; } while (0)
171 # define Tracec(c, x) do { if (verbose && (c)) fprintf x ; } while (0)
172 # define Tracecv(c, x) do { if (verbose > 1 && (c)) fprintf x ; } while (0)
173 #else
174 # define Assert(cond, msg)
175 # define Trace(x)
176 # define Tracev(x)
177 # define Tracevv(x)
178 # define Tracec(c, x)
179 # define Tracecv(c, x)
180 #endif
181
182 static int fill_inbuf(void);
183 static void flush_window(void);
184 static void error(char *m);
185 static void gzip_mark(void **);
186 static void gzip_release(void **);
187
188 /*
189 * This is set up by the setup-routine at boot-time
190 */
191 static struct boot_params *real_mode; /* Pointer to real-mode data */
192 static int quiet;
193
194 extern unsigned char input_data[];
195 extern int input_len;
196
197 static long bytes_out;
198
199 static void *malloc(int size);
200 static void free(void *where);
201
202 static void *memset(void *s, int c, unsigned n);
203 static void *memcpy(void *dest, const void *src, unsigned n);
204
205 static void putstr(const char *);
206
207 #ifdef CONFIG_X86_64
208 #define memptr long
209 #else
210 #define memptr unsigned
211 #endif
212
213 static memptr free_mem_ptr;
214 static memptr free_mem_end_ptr;
215
216 static char *vidmem;
217 static int vidport;
218 static int lines, cols;
219
220 #ifdef CONFIG_X86_NUMAQ
221 void *xquad_portio;
222 #endif
223
224 #include "../../../../lib/inflate.c"
225
226 static void *malloc(int size)
227 {
228 void *p;
229
230 if (size < 0)
231 error("Malloc error");
232 if (free_mem_ptr <= 0)
233 error("Memory error");
234
235 free_mem_ptr = (free_mem_ptr + 3) & ~3; /* Align */
236
237 p = (void *)free_mem_ptr;
238 free_mem_ptr += size;
239
240 if (free_mem_ptr >= free_mem_end_ptr)
241 error("Out of memory");
242
243 return p;
244 }
245
246 static void free(void *where)
247 { /* Don't care */
248 }
249
250 static void gzip_mark(void **ptr)
251 {
252 *ptr = (void *) free_mem_ptr;
253 }
254
255 static void gzip_release(void **ptr)
256 {
257 free_mem_ptr = (memptr) *ptr;
258 }
259
260 static void scroll(void)
261 {
262 int i;
263
264 memcpy(vidmem, vidmem + cols * 2, (lines - 1) * cols * 2);
265 for (i = (lines - 1) * cols * 2; i < lines * cols * 2; i += 2)
266 vidmem[i] = ' ';
267 }
268
269 static void putstr(const char *s)
270 {
271 int x, y, pos;
272 char c;
273
274 #ifdef CONFIG_X86_32
275 if (real_mode->screen_info.orig_video_mode == 0 &&
276 lines == 0 && cols == 0)
277 return;
278 #endif
279
280 x = real_mode->screen_info.orig_x;
281 y = real_mode->screen_info.orig_y;
282
283 while ((c = *s++) != '\0') {
284 if (c == '\n') {
285 x = 0;
286 if (++y >= lines) {
287 scroll();
288 y--;
289 }
290 } else {
291 vidmem [(x + cols * y) * 2] = c;
292 if (++x >= cols) {
293 x = 0;
294 if (++y >= lines) {
295 scroll();
296 y--;
297 }
298 }
299 }
300 }
301
302 real_mode->screen_info.orig_x = x;
303 real_mode->screen_info.orig_y = y;
304
305 pos = (x + cols * y) * 2; /* Update cursor position */
306 outb(14, vidport);
307 outb(0xff & (pos >> 9), vidport+1);
308 outb(15, vidport);
309 outb(0xff & (pos >> 1), vidport+1);
310 }
311
312 static void *memset(void *s, int c, unsigned n)
313 {
314 int i;
315 char *ss = s;
316
317 for (i = 0; i < n; i++) ss[i] = c;
318 return s;
319 }
320
321 static void *memcpy(void *dest, const void *src, unsigned n)
322 {
323 int i;
324 const char *s = src;
325 char *d = dest;
326
327 for (i = 0; i < n; i++) d[i] = s[i];
328 return dest;
329 }
330
331 /* ===========================================================================
332 * Fill the input buffer. This is called only when the buffer is empty
333 * and at least one byte is really needed.
334 */
335 static int fill_inbuf(void)
336 {
337 error("ran out of input data");
338 return 0;
339 }
340
341 /* ===========================================================================
342 * Write the output window window[0..outcnt-1] and update crc and bytes_out.
343 * (Used for the decompressed data only.)
344 */
345 static void flush_window(void)
346 {
347 /* With my window equal to my output buffer
348 * I only need to compute the crc here.
349 */
350 unsigned long c = crc; /* temporary variable */
351 unsigned n;
352 unsigned char *in, ch;
353
354 in = window;
355 for (n = 0; n < outcnt; n++) {
356 ch = *in++;
357 c = crc_32_tab[((int)c ^ ch) & 0xff] ^ (c >> 8);
358 }
359 crc = c;
360 bytes_out += (unsigned long)outcnt;
361 outcnt = 0;
362 }
363
364 static void error(char *x)
365 {
366 putstr("\n\n");
367 putstr(x);
368 putstr("\n\n -- System halted");
369
370 while (1)
371 asm("hlt");
372 }
373
374 static void parse_elf(void *output)
375 {
376 #ifdef CONFIG_X86_64
377 Elf64_Ehdr ehdr;
378 Elf64_Phdr *phdrs, *phdr;
379 #else
380 Elf32_Ehdr ehdr;
381 Elf32_Phdr *phdrs, *phdr;
382 #endif
383 void *dest;
384 int i;
385
386 memcpy(&ehdr, output, sizeof(ehdr));
387 if (ehdr.e_ident[EI_MAG0] != ELFMAG0 ||
388 ehdr.e_ident[EI_MAG1] != ELFMAG1 ||
389 ehdr.e_ident[EI_MAG2] != ELFMAG2 ||
390 ehdr.e_ident[EI_MAG3] != ELFMAG3) {
391 error("Kernel is not a valid ELF file");
392 return;
393 }
394
395 if (!quiet)
396 putstr("Parsing ELF... ");
397
398 phdrs = malloc(sizeof(*phdrs) * ehdr.e_phnum);
399 if (!phdrs)
400 error("Failed to allocate space for phdrs");
401
402 memcpy(phdrs, output + ehdr.e_phoff, sizeof(*phdrs) * ehdr.e_phnum);
403
404 for (i = 0; i < ehdr.e_phnum; i++) {
405 phdr = &phdrs[i];
406
407 switch (phdr->p_type) {
408 case PT_LOAD:
409 #ifdef CONFIG_RELOCATABLE
410 dest = output;
411 dest += (phdr->p_paddr - LOAD_PHYSICAL_ADDR);
412 #else
413 dest = (void *)(phdr->p_paddr);
414 #endif
415 memcpy(dest,
416 output + phdr->p_offset,
417 phdr->p_filesz);
418 break;
419 default: /* Ignore other PT_* */ break;
420 }
421 }
422 }
423
424 asmlinkage void decompress_kernel(void *rmode, memptr heap,
425 unsigned char *input_data,
426 unsigned long input_len,
427 unsigned char *output)
428 {
429 real_mode = rmode;
430
431 if (real_mode->hdr.loadflags & QUIET_FLAG)
432 quiet = 1;
433
434 if (real_mode->screen_info.orig_video_mode == 7) {
435 vidmem = (char *) 0xb0000;
436 vidport = 0x3b4;
437 } else {
438 vidmem = (char *) 0xb8000;
439 vidport = 0x3d4;
440 }
441
442 lines = real_mode->screen_info.orig_video_lines;
443 cols = real_mode->screen_info.orig_video_cols;
444
445 window = output; /* Output buffer (Normally at 1M) */
446 free_mem_ptr = heap; /* Heap */
447 free_mem_end_ptr = heap + BOOT_HEAP_SIZE;
448 inbuf = input_data; /* Input buffer */
449 insize = input_len;
450 inptr = 0;
451
452 #ifdef CONFIG_X86_64
453 if ((unsigned long)output & (__KERNEL_ALIGN - 1))
454 error("Destination address not 2M aligned");
455 if ((unsigned long)output >= 0xffffffffffUL)
456 error("Destination address too large");
457 #else
458 if ((u32)output & (CONFIG_PHYSICAL_ALIGN - 1))
459 error("Destination address not CONFIG_PHYSICAL_ALIGN aligned");
460 if (heap > ((-__PAGE_OFFSET-(512<<20)-1) & 0x7fffffff))
461 error("Destination address too large");
462 #ifndef CONFIG_RELOCATABLE
463 if ((u32)output != LOAD_PHYSICAL_ADDR)
464 error("Wrong destination address");
465 #endif
466 #endif
467
468 makecrc();
469 if (!quiet)
470 putstr("\nDecompressing Linux... ");
471 gunzip();
472 parse_elf(output);
473 if (!quiet)
474 putstr("done.\nBooting the kernel.\n");
475 return;
476 }
This page took 0.056242 seconds and 5 git commands to generate.