mirror of
https://github.com/torvalds/linux.git
synced 2024-12-04 18:13:04 +00:00
2d6ffcca62
Inflate requires some dynamic memory allocation very early in the boot process and this is provided with a set of four functions: malloc/free/gzip_mark/gzip_release. The old inflate code used a mark/release strategy rather than implement free. This new version instead keeps a count on the number of outstanding allocations and when it hits zero, it resets the malloc arena. This allows removing all the mark and release implementations and unifying all the malloc/free implementations. The architecture-dependent code must define two addresses: - free_mem_ptr, the address of the beginning of the area in which allocations should be made - free_mem_end_ptr, the address of the end of the area in which allocations should be made. If set to 0, then no check is made on the number of allocations, it just grows as much as needed The architecture-dependent code can also provide an arch_decomp_wdog() function call. This function will be called several times during the decompression process, and allow to notify the watchdog that the system is still running. If an architecture provides such a call, then it must define ARCH_HAS_DECOMP_WDOG so that the generic inflate code calls arch_decomp_wdog(). Work initially done by Matt Mackall, updated to a recent version of the kernel and improved by me. [akpm@linux-foundation.org: coding-style fixes] Signed-off-by: Thomas Petazzoni <thomas.petazzoni@free-electrons.com> Cc: Matt Mackall <mpm@selenic.com> Cc: Richard Henderson <rth@twiddle.net> Cc: Ivan Kokshaysky <ink@jurassic.park.msu.ru> Cc: Mikael Starvik <mikael.starvik@axis.com> Cc: Jesper Nilsson <jesper.nilsson@axis.com> Cc: Haavard Skinnemoen <hskinnemoen@atmel.com> Cc: David Howells <dhowells@redhat.com> Cc: Ingo Molnar <mingo@elte.hu> Cc: Thomas Gleixner <tglx@linutronix.de> Cc: Andi Kleen <andi@firstfloor.org> Cc: "H. Peter Anvin" <hpa@zytor.com> Acked-by: Paul Mundt <lethal@linux-sh.org> Acked-by: Yoshinori Sato <ysato@users.sourceforge.jp> Signed-off-by: Andrew Morton <akpm@linux-foundation.org> Signed-off-by: Linus Torvalds <torvalds@linux-foundation.org>
182 lines
4.2 KiB
C
182 lines
4.2 KiB
C
/*
|
|
* arch/h8300/boot/compressed/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
|
|
*
|
|
* Adapted for h8300 by Yoshinori Sato 2006
|
|
*/
|
|
|
|
#include <asm/uaccess.h>
|
|
|
|
/*
|
|
* 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;
|
|
|
|
#define WSIZE 0x8000 /* Window size must be at least 32k, */
|
|
/* and a power of two */
|
|
|
|
static uch *inbuf; /* input buffer */
|
|
static uch window[WSIZE]; /* Sliding window buffer */
|
|
|
|
static unsigned insize = 0; /* valid bytes in inbuf */
|
|
static unsigned inptr = 0; /* index of next byte to be processed in inbuf */
|
|
static unsigned outcnt = 0; /* bytes in output buffer */
|
|
|
|
/* 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);
|
|
|
|
extern char input_data[];
|
|
extern int input_len;
|
|
|
|
static long bytes_out = 0;
|
|
static uch *output_data;
|
|
static unsigned long output_ptr = 0;
|
|
|
|
static void error(char *m);
|
|
|
|
int puts(const char *);
|
|
|
|
extern int _text; /* Defined in vmlinux.lds.S */
|
|
extern int _end;
|
|
static unsigned long free_mem_ptr;
|
|
static unsigned long free_mem_end_ptr;
|
|
|
|
#define HEAP_SIZE 0x10000
|
|
|
|
#include "../../../../lib/inflate.c"
|
|
|
|
#define SCR *((volatile unsigned char *)0xffff8a)
|
|
#define TDR *((volatile unsigned char *)0xffff8b)
|
|
#define SSR *((volatile unsigned char *)0xffff8c)
|
|
|
|
int puts(const char *s)
|
|
{
|
|
return 0;
|
|
}
|
|
|
|
void* memset(void* s, int c, size_t n)
|
|
{
|
|
int i;
|
|
char *ss = (char*)s;
|
|
|
|
for (i=0;i<n;i++) ss[i] = c;
|
|
return s;
|
|
}
|
|
|
|
void* memcpy(void* __dest, __const void* __src,
|
|
size_t __n)
|
|
{
|
|
int i;
|
|
char *d = (char *)__dest, *s = (char *)__src;
|
|
|
|
for (i=0;i<__n;i++) d[i] = s[i];
|
|
return __dest;
|
|
}
|
|
|
|
/* ===========================================================================
|
|
* 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)
|
|
{
|
|
if (insize != 0) {
|
|
error("ran out of input data");
|
|
}
|
|
|
|
inbuf = input_data;
|
|
insize = input_len;
|
|
inptr = 1;
|
|
return inbuf[0];
|
|
}
|
|
|
|
/* ===========================================================================
|
|
* 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)
|
|
{
|
|
ulg c = crc; /* temporary variable */
|
|
unsigned n;
|
|
uch *in, *out, ch;
|
|
|
|
in = window;
|
|
out = &output_data[output_ptr];
|
|
for (n = 0; n < outcnt; n++) {
|
|
ch = *out++ = *in++;
|
|
c = crc_32_tab[((int)c ^ ch) & 0xff] ^ (c >> 8);
|
|
}
|
|
crc = c;
|
|
bytes_out += (ulg)outcnt;
|
|
output_ptr += (ulg)outcnt;
|
|
outcnt = 0;
|
|
}
|
|
|
|
static void error(char *x)
|
|
{
|
|
puts("\n\n");
|
|
puts(x);
|
|
puts("\n\n -- System halted");
|
|
|
|
while(1); /* Halt */
|
|
}
|
|
|
|
#define STACK_SIZE (4096)
|
|
long user_stack [STACK_SIZE];
|
|
long* stack_start = &user_stack[STACK_SIZE];
|
|
|
|
void decompress_kernel(void)
|
|
{
|
|
output_data = 0;
|
|
output_ptr = (unsigned long)0x400000;
|
|
free_mem_ptr = (unsigned long)&_end;
|
|
free_mem_end_ptr = free_mem_ptr + HEAP_SIZE;
|
|
|
|
makecrc();
|
|
puts("Uncompressing Linux... ");
|
|
gunzip();
|
|
puts("Ok, booting the kernel.\n");
|
|
}
|