/* * BK Id: SCCS/s.ofcommon.c 1.1 07/27/01 20:24:18 trini * * Copyright (C) Paul Mackerras 1997. * * This program is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * as published by the Free Software Foundation; either version * 2 of the License, or (at your option) any later version. */#include "zlib.h"#include "nonstdio.h"#include <asm/bootinfo.h>#include <asm/page.h>extern int strcmp(const char *s1, const char *s2);extern char *avail_ram, *avail_high;extern char *end_avail;extern void claim(unsigned int virt, unsigned int size, unsigned int align);extern void pause(void);unsigned int heap_use, heap_max;struct memchunk {    unsigned int size;    struct memchunk *next;};static struct memchunk *freechunks;static void *zalloc(void *x, unsigned items, unsigned size){    void *p;    struct memchunk **mpp, *mp;    size *= items;    size = (size + 7) & -8;    heap_use += size;    if (heap_use > heap_max)	heap_max = heap_use;    for (mpp = &freechunks; (mp = *mpp) != 0; mpp = &mp->next) {	if (mp->size == size) {	    *mpp = mp->next;	    return mp;	}    }    p = avail_ram;    avail_ram += size;    if (avail_ram > avail_high)	avail_high = avail_ram;    if (avail_ram > end_avail) {	printf("oops... out of memory\n\r");	pause();    }    return p;}static void zfree(void *x, void *addr, unsigned nb){    struct memchunk *mp = addr;    nb = (nb + 7) & -8;    heap_use -= nb;    if (avail_ram == addr + nb) {	avail_ram = addr;	return;    }    mp->size = nb;    mp->next = freechunks;    freechunks = mp;}#define HEAD_CRC	2#define EXTRA_FIELD	4#define ORIG_NAME	8#define COMMENT		0x10#define RESERVED	0xe0#define DEFLATED	8void gunzip(void *dst, int dstlen, unsigned char *src, int *lenp){    z_stream s;    int r, i, flags;    /* skip header */    i = 10;    flags = src[3];    if (src[2] != DEFLATED || (flags & RESERVED) != 0) {	printf("bad gzipped data\n\r");	exit();    }    if ((flags & EXTRA_FIELD) != 0)	i = 12 + src[10] + (src[11] << 8);    if ((flags & ORIG_NAME) != 0)	while (src[i++] != 0)	    ;    if ((flags & COMMENT) != 0)	while (src[i++] != 0)	    ;    if ((flags & HEAD_CRC) != 0)	i += 2;    if (i >= *lenp) {	printf("gunzip: ran out of data in header\n\r");	exit();    }    s.zalloc = zalloc;    s.zfree = zfree;    r = inflateInit2(&s, -MAX_WBITS);    if (r != Z_OK) {	printf("inflateInit2 returned %d\n\r", r);	exit();    }    s.next_in = src + i;    s.avail_in = *lenp - i;    s.next_out = dst;    s.avail_out = dstlen;    r = inflate(&s, Z_FINISH);    if (r != Z_OK && r != Z_STREAM_END) {	printf("inflate returned %d msg: %s\n\r", r, s.msg);	exit();    }    *lenp = s.next_out - (unsigned char *) dst;    inflateEnd(&s);}/* Make a bi_rec in OF.  We need to be passed a name for BI_BOOTLOADER_ID,  * a machine type for BI_MACHTYPE, and the location where the end of the * bootloader is (PROG_START + PROG_SIZE) */void make_bi_recs(unsigned long addr, char *name, unsigned int mach,		unsigned long progend){	struct bi_record *rec;	/* leave a 1MB gap then align to the next 1MB boundary */	addr = _ALIGN(addr+ (1<<20) - 1, (1<<20));	/* oldworld machine seem very unhappy about this. -- Tom */	if (addr >= progend)		claim(addr, 0x1000, 0);	rec = (struct bi_record *)addr;	rec->tag = BI_FIRST;	rec->size = sizeof(struct bi_record);	rec = (struct bi_record *)((unsigned long)rec + rec->size);	rec->tag = BI_BOOTLOADER_ID;	sprintf( (char *)rec->data, name);	rec->size = sizeof(struct bi_record) + strlen(name) + 1;	rec = (struct bi_record *)((unsigned long)rec + rec->size);	    	rec->tag = BI_MACHTYPE;	rec->data[0] = mach;	rec->data[1] = 1;	rec->size = sizeof(struct bi_record) + 2 * sizeof(unsigned long);	rec = (struct bi_record *)((unsigned long)rec + rec->size);#ifdef SYSMAP_OFFSET	rec->tag = BI_SYSMAP;	rec->data[0] = SYSMAP_OFFSET;	rec->data[1] = SYSMAP_SIZE;	rec->size = sizeof(struct bi_record) + 2 * sizeof(unsigned long);	rec = (struct bi_record *)((unsigned long)rec + rec->size);#endif /* SYSMAP_OFFSET */		rec->tag = BI_LAST;	rec->size = sizeof(struct bi_record);	rec = (struct bi_record *)((unsigned long)rec + rec->size);}