[mirror_ubuntu-focal-kernel.git] / arch / x86 / boot / compressed / misc.c

/*
 * misc.c
 *
 * This is a collection of several routines from gzip-1.0.3
 * adapted for Linux.
 *
 * malloc by Hannu Savolainen 1993 and Matthias Urlichs 1994
 * puts by Nick Holloway 1993, better puts by Martin Mares 1995
 * High loaded stuff by Hans Lermen & Werner Almesberger, Feb. 1996
 */

#include "misc.h"

/* WARNING!!
 * This code is compiled with -fPIC and it is relocated dynamically
 * at run time, but no relocation processing is performed.
 * This means that it is not safe to place pointers in static structures.
 */

/*
 * Getting to provable safe in place decompression is hard.
 * Worst case behaviours need to be analyzed.
 * Background information:
 *
 * The file layout is:
 *    magic[2]
 *    method[1]
 *    flags[1]
 *    timestamp[4]
 *    extraflags[1]
 *    os[1]
 *    compressed data blocks[N]
 *    crc[4] orig_len[4]
 *
 * resulting in 18 bytes of non compressed data overhead.
 *
 * Files divided into blocks
 * 1 bit (last block flag)
 * 2 bits (block type)
 *
 * 1 block occurs every 32K -1 bytes or when there 50% compression
 * has been achieved. The smallest block type encoding is always used.
 *
 * stored:
 *    32 bits length in bytes.
 *
 * fixed:
 *    magic fixed tree.
 *    symbols.
 *
 * dynamic:
 *    dynamic tree encoding.
 *    symbols.
 *
 *
 * The buffer for decompression in place is the length of the
 * uncompressed data, plus a small amount extra to keep the algorithm safe.
 * The compressed data is placed at the end of the buffer.  The output
 * pointer is placed at the start of the buffer and the input pointer
 * is placed where the compressed data starts.  Problems will occur
 * when the output pointer overruns the input pointer.
 *
 * The output pointer can only overrun the input pointer if the input
 * pointer is moving faster than the output pointer.  A condition only
 * triggered by data whose compressed form is larger than the uncompressed
 * form.
 *
 * The worst case at the block level is a growth of the compressed data
 * of 5 bytes per 32767 bytes.
 *
 * The worst case internal to a compressed block is very hard to figure.
 * The worst case can at least be boundined by having one bit that represents
 * 32764 bytes and then all of the rest of the bytes representing the very
 * very last byte.
 *
 * All of which is enough to compute an amount of extra data that is required
 * to be safe.  To avoid problems at the block level allocating 5 extra bytes
 * per 32767 bytes of data is sufficient.  To avoind problems internal to a
 * block adding an extra 32767 bytes (the worst case uncompressed block size)
 * is sufficient, to ensure that in the worst case the decompressed data for
 * block will stop the byte before the compressed data for a block begins.
 * To avoid problems with the compressed data's meta information an extra 18
 * bytes are needed.  Leading to the formula:
 *
 * extra_bytes = (uncompressed_size >> 12) + 32768 + 18 + decompressor_size.
 *
 * Adding 8 bytes per 32K is a bit excessive but much easier to calculate.
 * Adding 32768 instead of 32767 just makes for round numbers.
 * Adding the decompressor_size is necessary as it musht live after all
 * of the data as well.  Last I measured the decompressor is about 14K.
 * 10K of actual data and 4K of bss.
 *
 */

/*
 * gzip declarations
 */
#define STATIC		static

#undef memset
#undef memcpy
#define memzero(s, n)	memset((s), 0, (n))


static void error(char *m);

/*
 * This is set up by the setup-routine at boot-time
 */
struct boot_params *real_mode;		/* Pointer to real-mode data */

void *memset(void *s, int c, size_t n);
void *memcpy(void *dest, const void *src, size_t n);

#ifdef CONFIG_X86_64
#define memptr long
#else
#define memptr unsigned
#endif

static memptr free_mem_ptr;
static memptr free_mem_end_ptr;

static char *vidmem;
static int vidport;
static int lines, cols;

#ifdef CONFIG_KERNEL_GZIP
#include "../../../../lib/decompress_inflate.c"
#endif

#ifdef CONFIG_KERNEL_BZIP2
#include "../../../../lib/decompress_bunzip2.c"
#endif

#ifdef CONFIG_KERNEL_LZMA
#include "../../../../lib/decompress_unlzma.c"
#endif

#ifdef CONFIG_KERNEL_XZ
#include "../../../../lib/decompress_unxz.c"
#endif

#ifdef CONFIG_KERNEL_LZO
#include "../../../../lib/decompress_unlzo.c"
#endif

static void scroll(void)
{
	int i;

	memcpy(vidmem, vidmem + cols * 2, (lines - 1) * cols * 2);
	for (i = (lines - 1) * cols * 2; i < lines * cols * 2; i += 2)
		vidmem[i] = ' ';
}

#define XMTRDY          0x20

#define TXR             0       /*  Transmit register (WRITE) */
#define LSR             5       /*  Line Status               */
static void serial_putchar(int ch)
{
	unsigned timeout = 0xffff;

	while ((inb(early_serial_base + LSR) & XMTRDY) == 0 && --timeout)
		cpu_relax();

	outb(ch, early_serial_base + TXR);
}

void __putstr(const char *s)
{
	int x, y, pos;
	char c;

	if (early_serial_base) {
		const char *str = s;
		while (*str) {
			if (*str == '\n')
				serial_putchar('\r');
			serial_putchar(*str++);
		}
	}

	if (real_mode->screen_info.orig_video_mode == 0 &&
	    lines == 0 && cols == 0)
		return;

	x = real_mode->screen_info.orig_x;
	y = real_mode->screen_info.orig_y;

	while ((c = *s++) != '\0') {
		if (c == '\n') {
			x = 0;
			if (++y >= lines) {
				scroll();
				y--;
			}
		} else {
			vidmem[(x + cols * y) * 2] = c;
			if (++x >= cols) {
				x = 0;
				if (++y >= lines) {
					scroll();
					y--;
				}
			}
		}
	}

	real_mode->screen_info.orig_x = x;
	real_mode->screen_info.orig_y = y;

	pos = (x + cols * y) * 2;	/* Update cursor position */
	outb(14, vidport);
	outb(0xff & (pos >> 9), vidport+1);
	outb(15, vidport);
	outb(0xff & (pos >> 1), vidport+1);
}

void *memset(void *s, int c, size_t n)
{
	int i;
	char *ss = s;

	for (i = 0; i < n; i++)
		ss[i] = c;
	return s;
}
#ifdef CONFIG_X86_32
void *memcpy(void *dest, const void *src, size_t n)
{
	int d0, d1, d2;
	asm volatile(
		"rep ; movsl\n\t"
		"movl %4,%%ecx\n\t"
		"rep ; movsb\n\t"
		: "=&c" (d0), "=&D" (d1), "=&S" (d2)
		: "0" (n >> 2), "g" (n & 3), "1" (dest), "2" (src)
		: "memory");

	return dest;
}
#else
void *memcpy(void *dest, const void *src, size_t n)
{
	long d0, d1, d2;
	asm volatile(
		"rep ; movsq\n\t"
		"movq %4,%%rcx\n\t"
		"rep ; movsb\n\t"
		: "=&c" (d0), "=&D" (d1), "=&S" (d2)
		: "0" (n >> 3), "g" (n & 7), "1" (dest), "2" (src)
		: "memory");

	return dest;
}
#endif

static void error(char *x)
{
	error_putstr("\n\n");
	error_putstr(x);
	error_putstr("\n\n -- System halted");

	while (1)
		asm("hlt");
}

static void parse_elf(void *output)
{
#ifdef CONFIG_X86_64
	Elf64_Ehdr ehdr;
	Elf64_Phdr *phdrs, *phdr;
#else
	Elf32_Ehdr ehdr;
	Elf32_Phdr *phdrs, *phdr;
#endif
	void *dest;
	int i;

	memcpy(&ehdr, output, sizeof(ehdr));
	if (ehdr.e_ident[EI_MAG0] != ELFMAG0 ||
	   ehdr.e_ident[EI_MAG1] != ELFMAG1 ||
	   ehdr.e_ident[EI_MAG2] != ELFMAG2 ||
	   ehdr.e_ident[EI_MAG3] != ELFMAG3) {
		error("Kernel is not a valid ELF file");
		return;
	}

	debug_putstr("Parsing ELF... ");

	phdrs = malloc(sizeof(*phdrs) * ehdr.e_phnum);
	if (!phdrs)
		error("Failed to allocate space for phdrs");

	memcpy(phdrs, output + ehdr.e_phoff, sizeof(*phdrs) * ehdr.e_phnum);

	for (i = 0; i < ehdr.e_phnum; i++) {
		phdr = &phdrs[i];

		switch (phdr->p_type) {
		case PT_LOAD:
#ifdef CONFIG_RELOCATABLE
			dest = output;
			dest += (phdr->p_paddr - LOAD_PHYSICAL_ADDR);
#else
			dest = (void *)(phdr->p_paddr);
#endif
			memcpy(dest,
			       output + phdr->p_offset,
			       phdr->p_filesz);
			break;
		default: /* Ignore other PT_* */ break;
		}
	}

	free(phdrs);
}

asmlinkage void decompress_kernel(void *rmode, memptr heap,
				  unsigned char *input_data,
				  unsigned long input_len,
				  unsigned char *output)
{
	real_mode = rmode;

	sanitize_boot_params(real_mode);

	if (real_mode->screen_info.orig_video_mode == 7) {
		vidmem = (char *) 0xb0000;
		vidport = 0x3b4;
	} else {
		vidmem = (char *) 0xb8000;
		vidport = 0x3d4;
	}

	lines = real_mode->screen_info.orig_video_lines;
	cols = real_mode->screen_info.orig_video_cols;

	console_init();
	debug_putstr("early console in decompress_kernel\n");

	free_mem_ptr     = heap;	/* Heap */
	free_mem_end_ptr = heap + BOOT_HEAP_SIZE;

	if ((unsigned long)output & (MIN_KERNEL_ALIGN - 1))
		error("Destination address inappropriately aligned");
#ifdef CONFIG_X86_64
	if (heap > 0x3fffffffffffUL)
		error("Destination address too large");
#else
	if (heap > ((-__PAGE_OFFSET-(128<<20)-1) & 0x7fffffff))
		error("Destination address too large");
#endif
#ifndef CONFIG_RELOCATABLE
	if ((unsigned long)output != LOAD_PHYSICAL_ADDR)
		error("Wrong destination address");
#endif

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