misc.c 10.4 KB
Newer Older
L
Linus Torvalds 已提交
1 2
/*
 * misc.c
3 4
 *
 * This is a collection of several routines from gzip-1.0.3
L
Linus Torvalds 已提交
5 6 7 8 9 10 11
 * 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
 */

12 13 14 15 16
/*
 * we have to be careful, because no indirections are allowed here, and
 * paravirt_ops is a kind of one. As it will only run in baremetal anyway,
 * we just keep it from happening
 */
17
#undef CONFIG_PARAVIRT
18 19 20 21 22
#ifdef CONFIG_X86_64
#define _LINUX_STRING_H_ 1
#define __LINUX_BITMAP_H 1
#endif

L
Linus Torvalds 已提交
23
#include <linux/linkage.h>
24
#include <linux/screen_info.h>
L
Linus Torvalds 已提交
25
#include <asm/io.h>
26
#include <asm/page.h>
27
#include <asm/boot.h>
28 29 30 31 32 33 34 35 36

/* 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.
S
Simon Arlott 已提交
37
 * Worst case behaviours need to be analyzed.
38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105
 * 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.
S
Simon Arlott 已提交
106
 * 10K of actual data and 4K of bss.
107 108
 *
 */
L
Linus Torvalds 已提交
109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124

/*
 * gzip declarations
 */

#define OF(args)  args
#define STATIC static

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

typedef unsigned char  uch;
typedef unsigned short ush;
typedef unsigned long  ulg;

125 126 127 128 129 130 131
#define WSIZE 0x80000000	/* Window size must be at least 32k,
				 * and a power of two
				 * We don't actually have a window just
				 * a huge output buffer so I report
				 * a 2G windows size, as that should
				 * always be larger than our output buffer.
				 */
L
Linus Torvalds 已提交
132

133 134
static uch *inbuf;	/* input buffer */
static uch *window;	/* Sliding window buffer, (and final output buffer) */
L
Linus Torvalds 已提交
135

136 137 138
static unsigned insize;  /* valid bytes in inbuf */
static unsigned inptr;   /* index of next byte to be processed in inbuf */
static unsigned outcnt;  /* bytes in output buffer */
L
Linus Torvalds 已提交
139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184

/* gzip flag byte */
#define ASCII_FLAG   0x01 /* bit 0 set: file probably ASCII text */
#define CONTINUATION 0x02 /* bit 1 set: continuation of multi-part gzip file */
#define EXTRA_FIELD  0x04 /* bit 2 set: extra field present */
#define ORIG_NAME    0x08 /* bit 3 set: original file name present */
#define COMMENT      0x10 /* bit 4 set: file comment present */
#define ENCRYPTED    0x20 /* bit 5 set: file is encrypted */
#define RESERVED     0xC0 /* bit 6,7:   reserved */

#define get_byte()  (inptr < insize ? inbuf[inptr++] : fill_inbuf())
		
/* Diagnostic functions */
#ifdef DEBUG
#  define Assert(cond,msg) {if(!(cond)) error(msg);}
#  define Trace(x) fprintf x
#  define Tracev(x) {if (verbose) fprintf x ;}
#  define Tracevv(x) {if (verbose>1) fprintf x ;}
#  define Tracec(c,x) {if (verbose && (c)) fprintf x ;}
#  define Tracecv(c,x) {if (verbose>1 && (c)) fprintf x ;}
#else
#  define Assert(cond,msg)
#  define Trace(x)
#  define Tracev(x)
#  define Tracevv(x)
#  define Tracec(c,x)
#  define Tracecv(c,x)
#endif

static int  fill_inbuf(void);
static void flush_window(void);
static void error(char *m);
static void gzip_mark(void **);
static void gzip_release(void **);
  
/*
 * This is set up by the setup-routine at boot-time
 */
static unsigned char *real_mode; /* Pointer to real-mode data */

#define RM_EXT_MEM_K   (*(unsigned short *)(real_mode + 0x2))
#ifndef STANDARD_MEMORY_BIOS_CALL
#define RM_ALT_MEM_K   (*(unsigned long *)(real_mode + 0x1e0))
#endif
#define RM_SCREEN_INFO (*(struct screen_info *)(real_mode+0))

185
extern unsigned char input_data[];
L
Linus Torvalds 已提交
186 187 188 189 190 191 192
extern int input_len;

static long bytes_out = 0;

static void *malloc(int size);
static void free(void *where);

193 194 195
static void *memset(void *s, int c, unsigned n);
static void *memcpy(void *dest, const void *src, unsigned n);

L
Linus Torvalds 已提交
196 197
static void putstr(const char *);

198 199 200 201 202 203 204 205
#ifdef CONFIG_X86_64
#define memptr long
#else
#define memptr unsigned
#endif

static memptr free_mem_ptr;
static memptr free_mem_end_ptr;
L
Linus Torvalds 已提交
206

207 208 209
#ifdef CONFIG_X86_64
#define HEAP_SIZE             0x7000
#else
210
#define HEAP_SIZE             0x4000
211
#endif
L
Linus Torvalds 已提交
212 213 214 215 216 217

static char *vidmem = (char *)0xb8000;
static int vidport;
static int lines, cols;

#ifdef CONFIG_X86_NUMAQ
218
void *xquad_portio;
L
Linus Torvalds 已提交
219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251
#endif

#include "../../../../lib/inflate.c"

static void *malloc(int size)
{
	void *p;

	if (size <0) error("Malloc error");
	if (free_mem_ptr <= 0) error("Memory error");

	free_mem_ptr = (free_mem_ptr + 3) & ~3;	/* Align */

	p = (void *)free_mem_ptr;
	free_mem_ptr += size;

	if (free_mem_ptr >= free_mem_end_ptr)
		error("Out of memory");

	return p;
}

static void free(void *where)
{	/* Don't care */
}

static void gzip_mark(void **ptr)
{
	*ptr = (void *) free_mem_ptr;
}

static void gzip_release(void **ptr)
{
252
	free_mem_ptr = (memptr) *ptr;
L
Linus Torvalds 已提交
253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268
}
 
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] = ' ';
}

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

269
#ifdef CONFIG_X86_32
R
Rusty Russell 已提交
270 271
	if (RM_SCREEN_INFO.orig_video_mode == 0 && lines == 0 && cols == 0)
		return;
272
#endif
R
Rusty Russell 已提交
273

L
Linus Torvalds 已提交
274 275 276 277 278 279 280 281 282 283 284
	x = RM_SCREEN_INFO.orig_x;
	y = RM_SCREEN_INFO.orig_y;

	while ( ( c = *s++ ) != '\0' ) {
		if ( c == '\n' ) {
			x = 0;
			if ( ++y >= lines ) {
				scroll();
				y--;
			}
		} else {
285
			vidmem [(x + cols * y) * 2] = c;
L
Linus Torvalds 已提交
286 287 288 289 290 291 292 293 294 295 296 297 298 299
			if ( ++x >= cols ) {
				x = 0;
				if ( ++y >= lines ) {
					scroll();
					y--;
				}
			}
		}
	}

	RM_SCREEN_INFO.orig_x = x;
	RM_SCREEN_INFO.orig_y = y;

	pos = (x + cols * y) * 2;	/* Update cursor position */
300 301 302 303
	outb(14, vidport);
	outb(0xff & (pos >> 9), vidport+1);
	outb(15, vidport);
	outb(0xff & (pos >> 1), vidport+1);
L
Linus Torvalds 已提交
304 305
}

306
static void* memset(void* s, int c, unsigned n)
L
Linus Torvalds 已提交
307 308
{
	int i;
J
Jan Engelhardt 已提交
309
	char *ss = s;
L
Linus Torvalds 已提交
310 311 312 313 314

	for (i=0;i<n;i++) ss[i] = c;
	return s;
}

315
static void* memcpy(void* dest, const void* src, unsigned n)
L
Linus Torvalds 已提交
316 317
{
	int i;
J
Jan Engelhardt 已提交
318 319
	const char *s = src;
	char *d = dest;
L
Linus Torvalds 已提交
320

321 322
	for (i=0;i<n;i++) d[i] = s[i];
	return dest;
L
Linus Torvalds 已提交
323 324 325 326 327 328 329 330
}

/* ===========================================================================
 * Fill the input buffer. This is called only when the buffer is empty
 * and at least one byte is really needed.
 */
static int fill_inbuf(void)
{
331 332
	error("ran out of input data");
	return 0;
L
Linus Torvalds 已提交
333 334 335 336 337 338 339 340
}

/* ===========================================================================
 * Write the output window window[0..outcnt-1] and update crc and bytes_out.
 * (Used for the decompressed data only.)
 */
static void flush_window(void)
{
341 342 343 344 345 346 347 348 349 350 351 352 353 354 355
	/* With my window equal to my output buffer
	 * I only need to compute the crc here.
	 */
	ulg c = crc;         /* temporary variable */
	unsigned n;
	uch *in, ch;

	in = window;
	for (n = 0; n < outcnt; n++) {
		ch = *in++;
		c = crc_32_tab[((int)c ^ ch) & 0xff] ^ (c >> 8);
	}
	crc = c;
	bytes_out += (ulg)outcnt;
	outcnt = 0;
L
Linus Torvalds 已提交
356 357 358 359 360 361 362 363
}

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

I
Ingo Molnar 已提交
364 365
	while (1)
		asm("hlt");
L
Linus Torvalds 已提交
366 367
}

368
asmlinkage void decompress_kernel(void *rmode, memptr heap,
369 370
				  uch *input_data, unsigned long input_len,
				  uch *output)
L
Linus Torvalds 已提交
371 372 373 374 375 376 377 378 379 380 381 382 383 384
{
	real_mode = rmode;

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

	lines = RM_SCREEN_INFO.orig_video_lines;
	cols = RM_SCREEN_INFO.orig_video_cols;

385
	window = output;		/* Output buffer (Normally at 1M) */
386 387
	free_mem_ptr     = heap;	/* Heap */
	free_mem_end_ptr = heap + HEAP_SIZE;
388
	inbuf  = input_data;		/* Input buffer */
389 390 391
	insize = input_len;
	inptr  = 0;

392 393 394 395 396 397
#ifdef CONFIG_X86_64
	if ((ulg)output & (__KERNEL_ALIGN - 1))
		error("Destination address not 2M aligned");
	if ((ulg)output >= 0xffffffffffUL)
		error("Destination address too large");
#else
398 399
	if ((u32)output & (CONFIG_PHYSICAL_ALIGN -1))
		error("Destination address not CONFIG_PHYSICAL_ALIGN aligned");
400
	if (heap > ((-__PAGE_OFFSET-(512<<20)-1) & 0x7fffffff))
401 402
		error("Destination address too large");
#ifndef CONFIG_RELOCATABLE
403
	if ((u32)output != LOAD_PHYSICAL_ADDR)
404
		error("Wrong destination address");
405
#endif
406
#endif
L
Linus Torvalds 已提交
407 408

	makecrc();
409
	putstr("\nDecompressing Linux... ");
L
Linus Torvalds 已提交
410
	gunzip();
411
	putstr("done.\nBooting the kernel.\n");
412
	return;
L
Linus Torvalds 已提交
413
}