Add a working lzma loader and use it for generating initramfs kernels to allow easily netbooting elf kernels on devices with a 4 MiB CFE size limit. Based on ar71xx's lzma-loader. Signed-off-by: Jonas Gorski <jogo@openwrt.org> SVN-Revision: 41940master
parent
21845cb45d
commit
701e2a38fe
@ -0,0 +1,45 @@ |
||||
/*
|
||||
LzmaTypes.h
|
||||
|
||||
Types for LZMA Decoder |
||||
|
||||
This file written and distributed to public domain by Igor Pavlov. |
||||
This file is part of LZMA SDK 4.40 (2006-05-01) |
||||
*/ |
||||
|
||||
#ifndef __LZMATYPES_H |
||||
#define __LZMATYPES_H |
||||
|
||||
#ifndef _7ZIP_BYTE_DEFINED |
||||
#define _7ZIP_BYTE_DEFINED |
||||
typedef unsigned char Byte; |
||||
#endif |
||||
|
||||
#ifndef _7ZIP_UINT16_DEFINED |
||||
#define _7ZIP_UINT16_DEFINED |
||||
typedef unsigned short UInt16; |
||||
#endif |
||||
|
||||
#ifndef _7ZIP_UINT32_DEFINED |
||||
#define _7ZIP_UINT32_DEFINED |
||||
#ifdef _LZMA_UINT32_IS_ULONG |
||||
typedef unsigned long UInt32; |
||||
#else |
||||
typedef unsigned int UInt32; |
||||
#endif |
||||
#endif |
||||
|
||||
/* #define _LZMA_NO_SYSTEM_SIZE_T */ |
||||
/* You can use it, if you don't want <stddef.h> */ |
||||
|
||||
#ifndef _7ZIP_SIZET_DEFINED |
||||
#define _7ZIP_SIZET_DEFINED |
||||
#ifdef _LZMA_NO_SYSTEM_SIZE_T |
||||
typedef UInt32 SizeT; |
||||
#else |
||||
#include <stddef.h> |
||||
typedef size_t SizeT; |
||||
#endif |
||||
#endif |
||||
|
||||
#endif |
@ -1,55 +0,0 @@ |
||||
/* |
||||
* LZMA compressed kernel decompressor for bcm947xx boards |
||||
* |
||||
* Copyright (C) 2005 by Oleg I. Vdovikin <oleg@cs.msu.su> |
||||
* |
||||
* 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. |
||||
* |
||||
* This program is distributed in the hope that it will be useful, |
||||
* but WITHOUT ANY WARRANTY; without even the implied warranty of |
||||
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU |
||||
* General Public License for more details. |
||||
* |
||||
* You should have received a copy of the GNU General Public License |
||||
* along with this program; if not, write to the Free Software |
||||
* Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA |
||||
* |
||||
*/ |
||||
|
||||
The code is intended to decompress kernel, being compressed using lzma utility |
||||
build using 7zip LZMA SDK. This utility is located in the LZMA_Alone directory |
||||
|
||||
decompressor code expects that your .trx file consist of three partitions: |
||||
|
||||
1) decompressor itself (this is gziped code which pmon/cfe will extract and run |
||||
on boot-up instead of real kernel) |
||||
2) LZMA compressed kernel (both streamed and regular modes are supported now) |
||||
3) Root filesystem |
||||
|
||||
Please be sure to apply the following patch for use this new trx layout (it will |
||||
allow using both new and old trx files for root filesystem lookup code) |
||||
|
||||
--- linuz/arch/mips/brcm-boards/bcm947xx/setup.c 2005-01-23 19:24:27.503322896 +0300 |
||||
+++ linux/arch/mips/brcm-boards/bcm947xx/setup.c 2005-01-23 19:29:05.237100944 +0300 |
||||
@@ -221,7 +221,9 @@ |
||||
/* Try looking at TRX header for rootfs offset */ |
||||
if (le32_to_cpu(trx->magic) == TRX_MAGIC) { |
||||
bcm947xx_parts[1].offset = off; |
||||
- if (le32_to_cpu(trx->offsets[1]) > off) |
||||
+ if (le32_to_cpu(trx->offsets[2]) > off) |
||||
+ off = le32_to_cpu(trx->offsets[2]); |
||||
+ else if (le32_to_cpu(trx->offsets[1]) > off) |
||||
off = le32_to_cpu(trx->offsets[1]); |
||||
continue; |
||||
} |
||||
|
||||
|
||||
Revision history: |
||||
0.02 Initial release |
||||
0.03 Added Mineharu Takahara <mtakahar@yahoo.com> patch to pass actual |
||||
output size to decoder (stream mode compressed input is not |
||||
a requirement anymore) |
||||
0.04 Reordered functions using lds script |
@ -0,0 +1,103 @@ |
||||
/*
|
||||
* BCM63XX specific implementation parts |
||||
* |
||||
* Copyright (C) 2014 Jonas Gorski <jogo@openwrt.org> |
||||
* |
||||
* This program is free software; you can redistribute it and/or modify it |
||||
* under the terms of the GNU General Public License version 2 as published |
||||
* by the Free Software Foundation. |
||||
*/ |
||||
|
||||
#include <stddef.h> |
||||
#include "config.h" |
||||
#include "cp0regdef.h" |
||||
|
||||
#define READREG(r) *(volatile unsigned int *)(r) |
||||
#define WRITEREG(r,v) *(volatile unsigned int *)(r) = v |
||||
|
||||
#define UART_IR_REG 0x10 |
||||
#define UART_FIFO_REG 0x14 |
||||
|
||||
unsigned long uart_base; |
||||
|
||||
static void wait_xfered(void) |
||||
{ |
||||
unsigned int val; |
||||
|
||||
do { |
||||
val = READREG(uart_base + UART_IR_REG); |
||||
if (val & (1 << 5)) |
||||
break; |
||||
} while (1); |
||||
} |
||||
|
||||
void board_putc(int ch) |
||||
{ |
||||
if (!uart_base) |
||||
return; |
||||
|
||||
wait_xfered(); |
||||
WRITEREG(uart_base + UART_FIFO_REG, ch); |
||||
wait_xfered(); |
||||
} |
||||
|
||||
#define PRID_IMP_BMIPS32_REV4 0x4000 |
||||
#define PRID_IMP_BMIPS32_REV8 0x8000 |
||||
#define PRID_IMP_BMIPS3300 0x9000 |
||||
#define PRID_IMP_BMIPS3300_ALT 0x9100 |
||||
#define PRID_IMP_BMIPS3300_BUG 0x0000 |
||||
#define PRID_IMP_BMIPS43XX 0xa000 |
||||
|
||||
void board_init(void) |
||||
{ |
||||
unsigned long prid, chipid, chipid_reg; |
||||
|
||||
prid = read_32bit_c0_register($15, 0); |
||||
|
||||
switch (prid & 0xff00) { |
||||
case PRID_IMP_BMIPS32_REV4: |
||||
case PRID_IMP_BMIPS32_REV8: |
||||
case PRID_IMP_BMIPS3300_ALT: |
||||
case PRID_IMP_BMIPS3300_BUG: |
||||
chipid_reg = 0xfffe0000; |
||||
break; |
||||
case PRID_IMP_BMIPS3300: |
||||
if ((prid & 0xff) >= 0x33) |
||||
chipid_reg = 0xb0000000; |
||||
else |
||||
chipid_reg = 0xfffe0000; |
||||
break; |
||||
case PRID_IMP_BMIPS43XX: |
||||
if ((prid & 0xff) >= 0x30) |
||||
chipid_reg = 0xb0000000; |
||||
else |
||||
chipid_reg = 0xfffe0000; |
||||
break; |
||||
default: |
||||
return; |
||||
} |
||||
|
||||
chipid = READREG(chipid_reg); |
||||
|
||||
switch (chipid >> 16) { |
||||
case 0x6318: |
||||
case 0x6328: |
||||
case 0x6358: |
||||
case 0x6362: |
||||
case 0x6368: |
||||
case 0x6369: |
||||
uart_base = chipid_reg + 0x100; |
||||
break; |
||||
case 0x6316: |
||||
case 0x6326: |
||||
uart_base = chipid_reg + 0x180; |
||||
break; |
||||
case 0x6338: |
||||
case 0x6345: |
||||
case 0x6348: |
||||
uart_base = chipid_reg + 0x300; |
||||
break; |
||||
default: |
||||
return; |
||||
} |
||||
} |
@ -0,0 +1,46 @@ |
||||
/*
|
||||
* LZMA compressed kernel loader for Atheros AR7XXX/AR9XXX based boards |
||||
* |
||||
* Copyright (C) 2011 Gabor Juhos <juhosg@openwrt.org> |
||||
* |
||||
* The cache manipulation routine has been taken from the U-Boot project. |
||||
* (C) Copyright 2003 |
||||
* Wolfgang Denk, DENX Software Engineering, <wd@denx.de> |
||||
* |
||||
* This program is free software; you can redistribute it and/or modify it |
||||
* under the terms of the GNU General Public License version 2 as published |
||||
* by the Free Software Foundation. |
||||
* |
||||
*/ |
||||
|
||||
#include "cache.h" |
||||
#include "cacheops.h" |
||||
#include "config.h" |
||||
#include "printf.h" |
||||
|
||||
#define cache_op(op,addr) \ |
||||
__asm__ __volatile__( \
|
||||
" .set push \n" \
|
||||
" .set noreorder \n" \
|
||||
" .set mips3\n\t \n" \
|
||||
" cache %0, %1 \n" \
|
||||
" .set pop \n" \
|
||||
: \
|
||||
: "i" (op), "R" (*(unsigned char *)(addr))) |
||||
|
||||
void flush_cache(unsigned long start_addr, unsigned long size) |
||||
{ |
||||
unsigned long lsize = CONFIG_CACHELINE_SIZE; |
||||
unsigned long addr = start_addr & ~(lsize - 1); |
||||
unsigned long aend = (start_addr + size + (lsize - 1)) & ~(lsize - 1); |
||||
|
||||
printf("blasting from 0x%08x to 0x%08x (0x%08x - 0x%08x)\n", start_addr, size, addr, aend); |
||||
|
||||
while (1) { |
||||
cache_op(Hit_Writeback_Inv_D, addr); |
||||
cache_op(Hit_Invalidate_I, addr); |
||||
if (addr == aend) |
||||
break; |
||||
addr += lsize; |
||||
} |
||||
} |
@ -0,0 +1,17 @@ |
||||
/*
|
||||
* LZMA compressed kernel loader for Atheros AR7XXX/AR9XXX based boards |
||||
* |
||||
* Copyright (C) 2011 Gabor Juhos <juhosg@openwrt.org> |
||||
* |
||||
* This program is free software; you can redistribute it and/or modify it |
||||
* under the terms of the GNU General Public License version 2 as published |
||||
* by the Free Software Foundation. |
||||
* |
||||
*/ |
||||
|
||||
#ifndef __CACHE_H |
||||
#define __CACHE_H |
||||
|
||||
void flush_cache(unsigned long start_addr, unsigned long size); |
||||
|
||||
#endif /* __CACHE_H */ |
@ -0,0 +1,85 @@ |
||||
/*
|
||||
* Cache operations for the cache instruction. |
||||
* |
||||
* This file is subject to the terms and conditions of the GNU General Public |
||||
* License. See the file "COPYING" in the main directory of this archive |
||||
* for more details. |
||||
* |
||||
* (C) Copyright 1996, 97, 99, 2002, 03 Ralf Baechle |
||||
* (C) Copyright 1999 Silicon Graphics, Inc. |
||||
*/ |
||||
#ifndef __ASM_CACHEOPS_H |
||||
#define __ASM_CACHEOPS_H |
||||
|
||||
/*
|
||||
* Cache Operations available on all MIPS processors with R4000-style caches |
||||
*/ |
||||
#define Index_Invalidate_I 0x00 |
||||
#define Index_Writeback_Inv_D 0x01 |
||||
#define Index_Load_Tag_I 0x04 |
||||
#define Index_Load_Tag_D 0x05 |
||||
#define Index_Store_Tag_I 0x08 |
||||
#define Index_Store_Tag_D 0x09 |
||||
#if defined(CONFIG_CPU_LOONGSON2) |
||||
#define Hit_Invalidate_I 0x00 |
||||
#else |
||||
#define Hit_Invalidate_I 0x10 |
||||
#endif |
||||
#define Hit_Invalidate_D 0x11 |
||||
#define Hit_Writeback_Inv_D 0x15 |
||||
|
||||
/*
|
||||
* R4000-specific cacheops |
||||
*/ |
||||
#define Create_Dirty_Excl_D 0x0d |
||||
#define Fill 0x14 |
||||
#define Hit_Writeback_I 0x18 |
||||
#define Hit_Writeback_D 0x19 |
||||
|
||||
/*
|
||||
* R4000SC and R4400SC-specific cacheops |
||||
*/ |
||||
#define Index_Invalidate_SI 0x02 |
||||
#define Index_Writeback_Inv_SD 0x03 |
||||
#define Index_Load_Tag_SI 0x06 |
||||
#define Index_Load_Tag_SD 0x07 |
||||
#define Index_Store_Tag_SI 0x0A |
||||
#define Index_Store_Tag_SD 0x0B |
||||
#define Create_Dirty_Excl_SD 0x0f |
||||
#define Hit_Invalidate_SI 0x12 |
||||
#define Hit_Invalidate_SD 0x13 |
||||
#define Hit_Writeback_Inv_SD 0x17 |
||||
#define Hit_Writeback_SD 0x1b |
||||
#define Hit_Set_Virtual_SI 0x1e |
||||
#define Hit_Set_Virtual_SD 0x1f |
||||
|
||||
/*
|
||||
* R5000-specific cacheops |
||||
*/ |
||||
#define R5K_Page_Invalidate_S 0x17 |
||||
|
||||
/*
|
||||
* RM7000-specific cacheops |
||||
*/ |
||||
#define Page_Invalidate_T 0x16 |
||||
|
||||
/*
|
||||
* R10000-specific cacheops |
||||
* |
||||
* Cacheops 0x02, 0x06, 0x0a, 0x0c-0x0e, 0x16, 0x1a and 0x1e are unused. |
||||
* Most of the _S cacheops are identical to the R4000SC _SD cacheops. |
||||
*/ |
||||
#define Index_Writeback_Inv_S 0x03 |
||||
#define Index_Load_Tag_S 0x07 |
||||
#define Index_Store_Tag_S 0x0B |
||||
#define Hit_Invalidate_S 0x13 |
||||
#define Cache_Barrier 0x14 |
||||
#define Hit_Writeback_Inv_S 0x17 |
||||
#define Index_Load_Data_I 0x18 |
||||
#define Index_Load_Data_D 0x19 |
||||
#define Index_Load_Data_S 0x1b |
||||
#define Index_Store_Data_I 0x1c |
||||
#define Index_Store_Data_D 0x1d |
||||
#define Index_Store_Data_S 0x1f |
||||
|
||||
#endif /* __ASM_CACHEOPS_H */ |
@ -0,0 +1,31 @@ |
||||
/*
|
||||
* LZMA compressed kernel loader for Atheros AR7XXX/AR9XXX based boards |
||||
* |
||||
* Copyright (C) 2011 Gabor Juhos <juhosg@openwrt.org> |
||||
* |
||||
* This program is free software; you can redistribute it and/or modify it |
||||
* under the terms of the GNU General Public License version 2 as published |
||||
* by the Free Software Foundation. |
||||
* |
||||
*/ |
||||
|
||||
#ifndef _CONFIG_H_ |
||||
#define _CONFIG_H_ |
||||
|
||||
#define CONFIG_ICACHE_SIZE (32 * 1024) |
||||
#define CONFIG_DCACHE_SIZE (32 * 1024) |
||||
#define CONFIG_CACHELINE_SIZE 16 |
||||
|
||||
#ifndef CONFIG_FLASH_OFFS |
||||
#define CONFIG_FLASH_OFFS 0 |
||||
#endif |
||||
|
||||
#ifndef CONFIG_FLASH_MAX |
||||
#define CONFIG_FLASH_MAX 0 |
||||
#endif |
||||
|
||||
#ifndef CONFIG_FLASH_STEP |
||||
#define CONFIG_FLASH_STEP 0x1000 |
||||
#endif |
||||
|
||||
#endif /* _CONFIG_H_ */ |
@ -0,0 +1,54 @@ |
||||
/*
|
||||
* Copyright (C) 1994, 1995, 1996, 1997, 2000, 2001 by Ralf Baechle |
||||
* |
||||
* Copyright (C) 2001, Monta Vista Software |
||||
* Author: jsun@mvista.com or jsun@junsun.net |
||||
*/ |
||||
#ifndef _cp0regdef_h_ |
||||
#define _cp0regdef_h_ |
||||
|
||||
#define CP0_INDEX $0 |
||||
#define CP0_RANDOM $1 |
||||
#define CP0_ENTRYLO0 $2 |
||||
#define CP0_ENTRYLO1 $3 |
||||
#define CP0_CONTEXT $4 |
||||
#define CP0_PAGEMASK $5 |
||||
#define CP0_WIRED $6 |
||||
#define CP0_BADVADDR $8 |
||||
#define CP0_COUNT $9 |
||||
#define CP0_ENTRYHI $10 |
||||
#define CP0_COMPARE $11 |
||||
#define CP0_STATUS $12 |
||||
#define CP0_CAUSE $13 |
||||
#define CP0_EPC $14 |
||||
#define CP0_PRID $15 |
||||
#define CP0_CONFIG $16 |
||||
#define CP0_LLADDR $17 |
||||
#define CP0_WATCHLO $18 |
||||
#define CP0_WATCHHI $19 |
||||
#define CP0_XCONTEXT $20 |
||||
#define CP0_FRAMEMASK $21 |
||||
#define CP0_DIAGNOSTIC $22 |
||||
#define CP0_PERFORMANCE $25 |
||||
#define CP0_ECC $26 |
||||
#define CP0_CACHEERR $27 |
||||
#define CP0_TAGLO $28 |
||||
#define CP0_TAGHI $29 |
||||
#define CP0_ERROREPC $30 |
||||
|
||||
#define read_32bit_c0_register(reg,sel) \ |
||||
({ int __res; \
|
||||
if (sel == 0) \
|
||||
__asm__ __volatile__( \
|
||||
"mfc0\t%0, " #reg "\n\t" \
|
||||
: "=r" (__res)); \
|
||||
else \
|
||||
__asm__ __volatile__( \
|
||||
".set\tmips32\n\t" \
|
||||
"mfc0\t%0, " #reg ", " #sel "\n\t" \
|
||||
".set mips0\n\t" \
|
||||
: "=r" (__res)); \
|
||||
__res; \
|
||||
}) |
||||
|
||||
#endif |
@ -1,175 +0,0 @@ |
||||
/*
|
||||
* LZMA compressed kernel decompressor for bcm947xx boards |
||||
* |
||||
* Copyright (C) 2005 by Oleg I. Vdovikin <oleg@cs.msu.su> |
||||
* |
||||
* 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. |
||||
* |
||||
* This program is distributed in the hope that it will be useful, |
||||
* but WITHOUT ANY WARRANTY; without even the implied warranty of |
||||
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU |
||||
* General Public License for more details. |
||||
* |
||||
* You should have received a copy of the GNU General Public License |
||||
* along with this program; if not, write to the Free Software |
||||
* Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA |
||||
* |
||||
* |
||||
* Please note, this was code based on the bunzip2 decompressor code |
||||
* by Manuel Novoa III (mjn3@codepoet.org), although the only thing left |
||||
* is an idea and part of original vendor code |
||||
* |
||||
* |
||||
* 12-Mar-2005 Mineharu Takahara <mtakahar@yahoo.com> |
||||
* pass actual output size to decoder (stream mode |
||||
* compressed input is not a requirement anymore) |
||||
* |
||||
* 24-Apr-2005 Oleg I. Vdovikin |
||||
* reordered functions using lds script, removed forward decl |
||||
* |
||||
*/ |
||||
|
||||
#include "LzmaDecode.h" |
||||
|
||||
#define BCM4710_FLASH 0x1fc00000 /* Flash */ |
||||
|
||||
#define KSEG0 0x80000000 |
||||
#define KSEG1 0xa0000000 |
||||
|
||||
#define KSEG1ADDR(a) ((((unsigned)(a)) & 0x1fffffffU) | KSEG1) |
||||
|
||||
#define Index_Invalidate_I 0x00 |
||||
#define Index_Writeback_Inv_D 0x01 |
||||
|
||||
#define cache_unroll(base,op) \ |
||||
__asm__ __volatile__( \
|
||||
".set noreorder;\n" \
|
||||
".set mips3;\n" \
|
||||
"cache %1, (%0);\n" \
|
||||
".set mips0;\n" \
|
||||
".set reorder\n" \
|
||||
: \
|
||||
: "r" (base), \
|
||||
"i" (op)); |
||||
|
||||
static __inline__ void blast_icache(unsigned long size, unsigned long lsize) |
||||
{ |
||||
unsigned long start = KSEG0; |
||||
unsigned long end = (start + size); |
||||
|
||||
while(start < end) { |
||||
cache_unroll(start,Index_Invalidate_I); |
||||
start += lsize; |
||||
} |
||||
} |
||||
|
||||
static __inline__ void blast_dcache(unsigned long size, unsigned long lsize) |
||||
{ |
||||
unsigned long start = KSEG0; |
||||
unsigned long end = (start + size); |
||||
|
||||
while(start < end) { |
||||
cache_unroll(start,Index_Writeback_Inv_D); |
||||
start += lsize; |
||||
} |
||||
} |
||||
|
||||
#define TRX_MAGIC 0x30524448 /* "HDR0" */ |
||||
|
||||
struct trx_header { |
||||
unsigned int magic; /* "HDR0" */ |
||||
unsigned int len; /* Length of file including header */ |
||||
unsigned int crc32; /* 32-bit CRC from flag_version to end of file */ |
||||
unsigned int flag_version; /* 0:15 flags, 16:31 version */ |
||||
unsigned int offsets[3]; /* Offsets of partitions from start of header */ |
||||
}; |
||||
|
||||
/* beyound the image end, size not known in advance */ |
||||
extern unsigned char workspace[]; |
||||
|
||||
unsigned int offset; |
||||
unsigned char *data; |
||||
|
||||
/* flash access should be aligned, so wrapper is used */ |
||||
/* read byte from the flash, all accesses are 32-bit aligned */ |
||||
static int read_byte(void *object, unsigned char **buffer, UInt32 *bufferSize) |
||||
{ |
||||
static unsigned int val; |
||||
|
||||
if (((unsigned int)offset % 4) == 0) { |
||||
val = *(unsigned int *)data; |
||||
data += 4; |
||||
} |
||||
|
||||
*bufferSize = 1; |
||||
*buffer = ((unsigned char *)&val) + (offset++ & 3); |
||||
|
||||
return LZMA_RESULT_OK; |
||||
} |
||||
|
||||
static __inline__ unsigned char get_byte(void) |
||||
{ |
||||
unsigned char *buffer; |
||||
UInt32 fake; |
||||
|
||||
return read_byte(0, &buffer, &fake), *buffer; |
||||
} |
||||
|
||||
/* should be the first function */ |
||||
void entry(unsigned long icache_size, unsigned long icache_lsize,
|
||||
unsigned long dcache_size, unsigned long dcache_lsize) |
||||
{ |
||||
unsigned int i; /* temp value */ |
||||
unsigned int lc; /* literal context bits */ |
||||
unsigned int lp; /* literal pos state bits */ |
||||
unsigned int pb; /* pos state bits */ |
||||
unsigned int osize; /* uncompressed size */ |
||||
|
||||
ILzmaInCallback callback; |
||||
callback.Read = read_byte; |
||||
|
||||
/* look for trx header, 32-bit data access */ |
||||
for (data = ((unsigned char *) KSEG1ADDR(BCM4710_FLASH)); |
||||
((struct trx_header *)data)->magic != TRX_MAGIC; data += 65536); |
||||
|
||||
/* compressed kernel is in the partition 0 or 1 */ |
||||
if (((struct trx_header *)data)->offsets[1] > 65536)
|
||||
data += ((struct trx_header *)data)->offsets[0]; |
||||
else |
||||
data += ((struct trx_header *)data)->offsets[1]; |
||||
|
||||
offset = 0; |
||||
|
||||
/* lzma args */ |
||||
i = get_byte(); |
||||
lc = i % 9, i = i / 9; |
||||
lp = i % 5, pb = i / 5; |
||||
|
||||
/* skip rest of the LZMA coder property */ |
||||
for (i = 0; i < 4; i++) |
||||
get_byte(); |
||||
|
||||
/* read the lower half of uncompressed size in the header */ |
||||
osize = ((unsigned int)get_byte()) + |
||||
((unsigned int)get_byte() << 8) + |
||||
((unsigned int)get_byte() << 16) + |
||||
((unsigned int)get_byte() << 24); |
||||
|
||||
/* skip rest of the header (upper half of uncompressed size) */ |
||||
for (i = 0; i < 4; i++)
|
||||
get_byte(); |
||||
|
||||
/* decompress kernel */ |
||||
if (LzmaDecode(workspace, ~0, lc, lp, pb, &callback, |
||||
(unsigned char*)LOADADDR, osize, &i) == LZMA_RESULT_OK) |
||||
{ |
||||
blast_dcache(dcache_size, dcache_lsize); |
||||
blast_icache(icache_size, icache_lsize); |
||||
|
||||
/* Jump to load address */ |
||||
((void (*)(void)) LOADADDR)(); |
||||
} |
||||
} |
@ -1,20 +0,0 @@ |
||||
OUTPUT_ARCH(mips) |
||||
ENTRY(entry) |
||||
SECTIONS { |
||||
. = BZ_TEXT_START; |
||||
.text : { |
||||
*(.text.entry) |
||||
*(.text) |
||||
*(.rodata) |
||||
} |
||||
|
||||
.data : { |
||||
*(.data) |
||||
} |
||||
|
||||
.bss : { |
||||
*(.bss) |
||||
} |
||||
|
||||
workspace = .; |
||||
} |
@ -1,155 +1,118 @@ |
||||
/* Copyright 2005 Oleg I. Vdovikin (oleg@cs.msu.su) */ |
||||
/* cache manipulation adapted from Broadcom code */ |
||||
/* idea taken from original bunzip2 decompressor code */ |
||||
/* Copyright 2004 Manuel Novoa III (mjn3@codepoet.org) */ |
||||
/* Licensed under the linux kernel's version of the GPL.*/ |
||||
/* |
||||
* LZMA compressed kernel loader for Atheros AR7XXX/AR9XXX based boards |
||||
* |
||||
* Copyright (C) 2011 Gabor Juhos <juhosg@openwrt.org>
|
||||
* |
||||
* Some parts of this code was based on the OpenWrt specific lzma-loader |
||||
* for the BCM47xx and ADM5120 based boards: |
||||
* Copyright (C) 2004 Manuel Novoa III (mjn3@codepoet.org)
|
||||
* Copyright (C) 2005 by Oleg I. Vdovikin <oleg@cs.msu.su>
|
||||
* |
||||
* This program is free software; you can redistribute it and/or modify it
|
||||
* under the terms of the GNU General Public License version 2 as published |
||||
* by the Free Software Foundation. |
||||
*/ |
||||
|
||||
#include <asm/asm.h> |
||||
#include <asm/regdef.h> |
||||
#include "cp0regdef.h" |
||||
#include "cacheops.h" |
||||
#include "config.h" |
||||
|
||||
#define KSEG0 0x80000000 |
||||
|
||||
#define C0_CONFIG $16 |
||||
#define C0_TAGLO $28 |
||||
#define C0_TAGHI $29 |
||||
|
||||
#define CONF1_DA_SHIFT 7 /* D$ associativity */ |
||||
#define CONF1_DA_MASK 0x00000380 |
||||
#define CONF1_DA_BASE 1 |
||||
#define CONF1_DL_SHIFT 10 /* D$ line size */ |
||||
#define CONF1_DL_MASK 0x00001c00 |
||||
#define CONF1_DL_BASE 2 |
||||
#define CONF1_DS_SHIFT 13 /* D$ sets/way */ |
||||
#define CONF1_DS_MASK 0x0000e000 |
||||
#define CONF1_DS_BASE 64 |
||||
#define CONF1_IA_SHIFT 16 /* I$ associativity */ |
||||
#define CONF1_IA_MASK 0x00070000 |
||||
#define CONF1_IA_BASE 1 |
||||
#define CONF1_IL_SHIFT 19 /* I$ line size */ |
||||
#define CONF1_IL_MASK 0x00380000 |
||||
#define CONF1_IL_BASE 2 |
||||
#define CONF1_IS_SHIFT 22 /* Instruction cache sets/way */ |
||||
#define CONF1_IS_MASK 0x01c00000 |
||||
#define CONF1_IS_BASE 64 |
||||
|
||||
#define Index_Invalidate_I 0x00 |
||||
#define Index_Writeback_Inv_D 0x01 |
||||
.macro ehb
|
||||
sll zero, 3 |
||||
.endm |
||||
|
||||
.text |
||||
|
||||
LEAF(startup) |
||||
.set noreorder
|
||||
.set mips32
|
||||
|
||||
/* Copy decompressor code to the right place */ |
||||
li t2, BZ_TEXT_START |
||||
add a0, t2, 0 |
||||
la a1, code_start |
||||
la a2, code_stop |
||||
$L1: |
||||
lw t0, 0(a1) |
||||
sw t0, 0(a0) |
||||
add a1, 4 |
||||
add a0, 4 |
||||
blt a1, a2, $L1 |
||||
nop |
||||
mtc0 zero, CP0_WATCHLO # clear watch registers |
||||
mtc0 zero, CP0_WATCHHI |
||||
mtc0 zero, CP0_CAUSE # clear before writing status register |
||||
|
||||
/* At this point we need to invalidate dcache and */ |
||||
/* icache before jumping to new code */ |
||||
mfc0 t0, CP0_STATUS |
||||
li t1, 0x1000001f |
||||
or t0, t1 |
||||
xori t0, 0x1f |
||||
mtc0 t0, CP0_STATUS |
||||
ehb |
||||
|
||||
1: /* Get cache sizes */ |
||||
.set mips32
|
||||
mfc0 s0,C0_CONFIG,1 |
||||
.set mips0
|
||||
mtc0 zero, CP0_COUNT |
||||
mtc0 zero, CP0_COMPARE |
||||
ehb |
||||
|
||||
la t0, __reloc_label # get linked address of label |
||||
bal __reloc_label # branch and link to label to |
||||
nop # get actual address |
||||
__reloc_label: |
||||
subu t0, ra, t0 # get reloc_delta |
||||
|
||||
li s1,CONF1_DL_MASK |
||||
and s1,s0 |
||||
beq s1,zero,nodc |
||||
beqz t0, __reloc_done # if delta is 0 we are in the right place |
||||
nop |
||||
|
||||
srl s1,CONF1_DL_SHIFT |
||||
li t0,CONF1_DL_BASE |
||||
sll s1,t0,s1 /* s1 has D$ cache line size */ |
||||
/* Copy our code to the right place */ |
||||
la t1, _code_start # get linked address of _code_start |
||||
la t2, _code_end # get linked address of _code_end |
||||
addu t0, t0, t1 # calculate actual address of _code_start |
||||
|
||||
li s2,CONF1_DA_MASK |
||||
and s2,s0 |
||||
srl s2,CONF1_DA_SHIFT |
||||
addiu s2,CONF1_DA_BASE /* s2 now has D$ associativity */ |
||||
__reloc_copy: |
||||
lw t3, 0(t0) |
||||
sw t3, 0(t1) |
||||
add t1, 4 |
||||
blt t1, t2, __reloc_copy |
||||
add t0, 4 |
||||
|
||||
li t0,CONF1_DS_MASK |
||||
and t0,s0 |
||||
srl t0,CONF1_DS_SHIFT |
||||
li s3,CONF1_DS_BASE |
||||
sll s3,s3,t0 /* s3 has D$ sets per way */ |
||||
/* flush cache */ |
||||
la t0, _code_start |
||||
la t1, _code_end |
||||
|
||||
multu s2,s3 /* sets/way * associativity */ |
||||
mflo t0 /* total cache lines */ |
||||
li t2, ~(CONFIG_CACHELINE_SIZE - 1) |
||||
and t0, t2 |
||||
and t1, t2 |
||||
li t2, CONFIG_CACHELINE_SIZE |
||||
|
||||
multu s1,t0 /* D$ linesize * lines */ |
||||
mflo s2 /* s2 is now D$ size in bytes */ |
||||
b __flush_check |
||||
nop |
||||
|
||||
/* Initilize the D$: */ |
||||
mtc0 zero,C0_TAGLO |
||||
mtc0 zero,C0_TAGHI |
||||
__flush_line: |
||||
cache Hit_Writeback_Inv_D, 0(t0) |
||||
cache Hit_Invalidate_I, 0(t0) |
||||
add t0, t2 |
||||
|
||||
li t0,KSEG0 /* Just an address for the first $ line */ |
||||
addu t1,t0,s2 /* + size of cache == end */ |
||||
__flush_check: |
||||
bne t0, t1, __flush_line |
||||
nop |
||||
|
||||
sync |
||||
|
||||
.set mips3
|
||||
1: cache Index_Writeback_Inv_D,0(t0) |
||||
.set mips0
|
||||
bne t0,t1,1b |
||||
addu t0,s1 |
||||
__reloc_done: |
||||
|
||||
nodc: |
||||
/* Now we get to do it all again for the I$ */ |
||||
/* clear bss */ |
||||
la t0, _bss_start |
||||
la t1, _bss_end |
||||
b __bss_check |
||||
nop |
||||
|
||||
move s3,zero /* just in case there is no icache */ |
||||
move s4,zero |
||||
__bss_fill: |
||||
sw zero, 0(t0) |
||||
addi t0, 4 |
||||
|
||||
li t0,CONF1_IL_MASK |
||||
and t0,s0 |
||||
beq t0,zero,noic |
||||
__bss_check: |
||||
bne t0, t1, __bss_fill |
||||
nop |
||||
|
||||
srl t0,CONF1_IL_SHIFT |
||||
li s3,CONF1_IL_BASE |
||||
sll s3,t0 /* s3 has I$ cache line size */ |
||||
|
||||
li t0,CONF1_IA_MASK |
||||
and t0,s0 |
||||
srl t0,CONF1_IA_SHIFT |
||||
addiu s4,t0,CONF1_IA_BASE /* s4 now has I$ associativity */ |
||||
|
||||
li t0,CONF1_IS_MASK |
||||
and t0,s0 |
||||
srl t0,CONF1_IS_SHIFT |
||||
li s5,CONF1_IS_BASE |
||||
sll s5,t0 /* s5 has I$ sets per way */ |
||||
|
||||
multu s4,s5 /* sets/way * associativity */ |
||||
mflo t0 /* s4 is now total cache lines */ |
||||
|
||||
multu s3,t0 /* I$ linesize * lines */ |
||||
mflo s4 /* s4 is cache size in bytes */ |
||||
|
||||
/* Initilize the I$: */ |
||||
mtc0 zero,C0_TAGLO |
||||
mtc0 zero,C0_TAGHI |
||||
|
||||
li t0,KSEG0 /* Just an address for the first $ line */ |
||||
addu t1,t0,s4 /* + size of cache == end */ |
||||
|
||||
.set mips3
|
||||
1: cache Index_Invalidate_I,0(t0) |
||||
.set mips0
|
||||
bne t0,t1,1b |
||||
addu t0,s3 |
||||
|
||||
noic: |
||||
move a0,s3 /* icache line size */ |
||||
move a1,s4 /* icache size */ |
||||
move a2,s1 /* dcache line size */ |
||||
jal t2 |
||||
move a3,s2 /* dcache size */ |
||||
/* Setup new "C" stack */ |
||||
la sp, _stack |
||||
|
||||
/* jump to the decompressor routine */ |
||||
la t0, loader_main |
||||
jr t0 |
||||
nop |
||||
|
||||
.set reorder
|
||||
END(startup) |
||||
|
@ -0,0 +1,175 @@ |
||||
/*
|
||||
* LZMA compressed kernel loader for Atheros AR7XXX/AR9XXX based boards |
||||
* |
||||
* Copyright (C) 2011 Gabor Juhos <juhosg@openwrt.org> |
||||
* |
||||
* Some parts of this code was based on the OpenWrt specific lzma-loader |
||||
* for the BCM47xx and ADM5120 based boards: |
||||
* Copyright (C) 2004 Manuel Novoa III (mjn3@codepoet.org) |
||||
* Copyright (C) 2005 Mineharu Takahara <mtakahar@yahoo.com> |
||||
* Copyright (C) 2005 by Oleg I. Vdovikin <oleg@cs.msu.su> |
||||
* |
||||
* The image_header structure has been taken from the U-Boot project. |
||||
* (C) Copyright 2008 Semihalf |
||||
* (C) Copyright 2000-2005 |
||||
* Wolfgang Denk, DENX Software Engineering, wd@denx.de. |
||||
* |
||||
* This program is free software; you can redistribute it and/or modify it |
||||
* under the terms of the GNU General Public License version 2 as published |
||||
* by the Free Software Foundation. |
||||
*/ |
||||
|
||||
#include <stddef.h> |
||||
#include <stdint.h> |
||||
|
||||
#include "config.h" |
||||
#include "cache.h" |
||||
#include "printf.h" |
||||
#include "LzmaDecode.h" |
||||
|
||||
#define KSEG0 0x80000000 |
||||
#define KSEG1 0xa0000000 |
||||
|
||||
#define KSEG1ADDR(a) ((((unsigned)(a)) & 0x1fffffffU) | KSEG1) |
||||
|
||||
#undef LZMA_DEBUG |
||||
|
||||
#ifdef LZMA_DEBUG |
||||
# define DBG(f, a...) printf(f, ## a) |
||||
#else |
||||
# define DBG(f, a...) do {} while (0) |
||||
#endif |
||||
|
||||
/* beyond the image end, size not known in advance */ |
||||
extern unsigned char workspace[]; |
||||
|
||||
|
||||
extern void board_init(void); |
||||
|
||||
static CLzmaDecoderState lzma_state; |
||||
static unsigned char *lzma_data; |
||||
static unsigned long lzma_datasize; |
||||
static unsigned long lzma_outsize; |
||||
static unsigned long kernel_la; |
||||
|
||||
static void halt(void) |
||||
{ |
||||
printf("\nSystem halted!\n"); |
||||
for(;;); |
||||
} |
||||
|
||||
static __inline__ unsigned char lzma_get_byte(void) |
||||
{ |
||||
unsigned char c; |
||||
|
||||
lzma_datasize--; |
||||
c = *lzma_data++; |
||||
|
||||
return c; |
||||
} |
||||
|
||||
static int lzma_init_props(void) |
||||
{ |
||||
unsigned char props[LZMA_PROPERTIES_SIZE]; |
||||
int res; |
||||
int i; |
||||
|
||||
/* read lzma properties */ |
||||
for (i = 0; i < LZMA_PROPERTIES_SIZE; i++) |
||||
props[i] = lzma_get_byte(); |
||||
|
||||
/* read the lower half of uncompressed size in the header */ |
||||
lzma_outsize = ((SizeT) lzma_get_byte()) + |
||||
((SizeT) lzma_get_byte() << 8) + |
||||
((SizeT) lzma_get_byte() << 16) + |
||||
((SizeT) lzma_get_byte() << 24); |
||||
|
||||
/* skip rest of the header (upper half of uncompressed size) */ |
||||
for (i = 0; i < 4; i++) |
||||
lzma_get_byte(); |
||||
|
||||
res = LzmaDecodeProperties(&lzma_state.Properties, props, |
||||
LZMA_PROPERTIES_SIZE); |
||||
return res; |
||||
} |
||||
|
||||
static int lzma_decompress(unsigned char *outStream) |
||||
{ |
||||
SizeT ip, op; |
||||
int ret; |
||||
|
||||
lzma_state.Probs = (CProb *) workspace; |
||||
|
||||
ret = LzmaDecode(&lzma_state, lzma_data, lzma_datasize, &ip, outStream, |
||||
lzma_outsize, &op); |
||||
|
||||
if (ret != LZMA_RESULT_OK) { |
||||
int i; |
||||
|
||||
DBG("LzmaDecode error %d at %08x, osize:%d ip:%d op:%d\n", |
||||
ret, lzma_data + ip, lzma_outsize, ip, op); |
||||
|
||||
for (i = 0; i < 16; i++) |
||||
DBG("%02x ", lzma_data[ip + i]); |
||||
|
||||
DBG("\n"); |
||||
} |
||||
|
||||
return ret; |
||||
} |
||||
|
||||
static void lzma_init_data(void) |
||||
{ |
||||
extern unsigned char _lzma_data_start[]; |
||||
extern unsigned char _lzma_data_end[]; |
||||
|
||||
kernel_la = LOADADDR; |
||||
lzma_data = _lzma_data_start; |
||||
lzma_datasize = _lzma_data_end - _lzma_data_start; |
||||
} |
||||
|
||||
void loader_main(unsigned long reg_a0, unsigned long reg_a1, |
||||
unsigned long reg_a2, unsigned long reg_a3) |
||||
{ |
||||
void (*kernel_entry) (unsigned long, unsigned long, unsigned long, |
||||
unsigned long); |
||||
int res; |
||||
|
||||
board_init(); |
||||
|
||||
printf("\n\nOpenWrt kernel loader for BCM63XX\n"); |
||||
printf("Copyright (C) 2011 Gabor Juhos <juhosg@openwrt.org>\n"); |
||||
printf("Copyright (C) 2014 Jonas Gorski <jogo@openwrt.org>\n"); |
||||
|
||||
lzma_init_data(); |
||||
|
||||
res = lzma_init_props(); |
||||
if (res != LZMA_RESULT_OK) { |
||||
printf("Incorrect LZMA stream properties!\n"); |
||||
halt(); |
||||
} |
||||
|
||||
printf("Decompressing kernel... "); |
||||
|
||||
res = lzma_decompress((unsigned char *) kernel_la); |
||||
if (res != LZMA_RESULT_OK) { |
||||
printf("failed, "); |
||||
switch (res) { |
||||
case LZMA_RESULT_DATA_ERROR: |
||||
printf("data error!\n"); |
||||
break; |
||||
default: |
||||
printf("unknown error %d!\n", res); |
||||
} |
||||
halt(); |
||||
} else { |
||||
printf("done!\n"); |
||||
} |
||||
|
||||
flush_cache(kernel_la, lzma_outsize); |
||||
|
||||
printf("Starting kernel at %08x...\n\n", kernel_la); |
||||
|
||||
kernel_entry = (void *) kernel_la; |
||||
kernel_entry(reg_a0, reg_a1, reg_a2, reg_a3); |
||||
} |
@ -0,0 +1,34 @@ |
||||
OUTPUT_ARCH(mips) |
||||
SECTIONS { |
||||
.text : { |
||||
_code_start = .; |
||||
*(.text) |
||||
*(.text.*) |
||||
*(.rodata) |
||||
*(.rodata.*) |
||||
*(.data.lzma) |
||||
} |
||||
|
||||
. = ALIGN(32); |
||||
.data : { |
||||
*(.data) |
||||
*(.data.*) |
||||
} |
||||
|
||||
. = ALIGN(32); |
||||
_code_end = .; |
||||
|
||||
_bss_start = .; |
||||
.bss : { |
||||
*(.bss) |
||||
*(.bss.*) |
||||
} |
||||
|
||||
. = ALIGN(32); |
||||
_bss_end = .; |
||||
|
||||
. = . + 8192; |
||||
_stack = .; |
||||
|
||||
workspace = .; |
||||
} |
@ -1,17 +0,0 @@ |
||||
OUTPUT_ARCH(mips) |
||||
ENTRY(startup) |
||||
SECTIONS { |
||||
. = TEXT_START; |
||||
.text : { |
||||
*(.text) |
||||
*(.rodata) |
||||
} |
||||
|
||||
.data : { |
||||
*(.data) |
||||
} |
||||
|
||||
.bss : { |
||||
*(.bss) |
||||
} |
||||
} |
@ -0,0 +1,10 @@ |
||||
OUTPUT_ARCH(mips) |
||||
SECTIONS { |
||||
.text : { |
||||
startup = .; |
||||
*(.text) |
||||
*(.text.*) |
||||
*(.data) |
||||
*(.data.*) |
||||
} |
||||
} |
@ -0,0 +1,8 @@ |
||||
OUTPUT_ARCH(mips) |
||||
SECTIONS { |
||||
.data.lzma : { |
||||
_lzma_data_start = .; |
||||
*(.data) |
||||
_lzma_data_end = .; |
||||
} |
||||
} |
@ -0,0 +1,350 @@ |
||||
/*
|
||||
* Copyright (C) 2001 MontaVista Software Inc. |
||||
* Author: Jun Sun, jsun@mvista.com or jsun@junsun.net |
||||
* |
||||
* 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 "printf.h" |
||||
|
||||
extern void board_putc(int ch); |
||||
|
||||
/* this is the maximum width for a variable */ |
||||
#define LP_MAX_BUF 256 |
||||
|
||||
/* macros */ |
||||
#define IsDigit(x) ( ((x) >= '0') && ((x) <= '9') ) |
||||
#define Ctod(x) ( (x) - '0') |
||||
|
||||
/* forward declaration */ |
||||
static int PrintChar(char *, char, int, int); |
||||
static int PrintString(char *, char *, int, int); |
||||
static int PrintNum(char *, unsigned long, int, int, int, int, char, int); |
||||
|
||||
/* private variable */ |
||||
static const char theFatalMsg[] = "fatal error in lp_Print!"; |
||||
|
||||
/* -*-
|
||||
* A low level printf() function. |
||||
*/ |
||||
static void |
||||
lp_Print(void (*output)(void *, char *, int), |
||||
void * arg, |
||||
char *fmt, |
||||
va_list ap) |
||||
{ |
||||
|
||||
#define OUTPUT(arg, s, l) \ |
||||
{ if (((l) < 0) || ((l) > LP_MAX_BUF)) { \
|
||||
(*output)(arg, (char*)theFatalMsg, sizeof(theFatalMsg)-1); for(;;); \
|
||||
} else { \
|
||||
(*output)(arg, s, l); \
|
||||
} \
|
||||
} |
||||
|
||||
char buf[LP_MAX_BUF]; |
||||
|
||||
char c; |
||||
char *s; |
||||
long int num; |
||||
|
||||
int longFlag; |
||||
int negFlag; |
||||
int width; |
||||
int prec; |
||||
int ladjust; |
||||
char padc; |
||||
|
||||
int length; |
||||
|
||||
for(;;) { |
||||
{ |
||||
/* scan for the next '%' */ |
||||
char *fmtStart = fmt; |
||||
while ( (*fmt != '\0') && (*fmt != '%')) { |
||||
fmt ++; |
||||
} |
||||
|
||||
/* flush the string found so far */ |
||||
OUTPUT(arg, fmtStart, fmt-fmtStart); |
||||
|
||||
/* are we hitting the end? */ |
||||
if (*fmt == '\0') break; |
||||
} |
||||
|
||||
/* we found a '%' */ |
||||
fmt ++; |
||||
|
||||
/* check for long */ |
||||
if (*fmt == 'l') { |
||||
longFlag = 1; |
||||
fmt ++; |
||||
} else { |
||||
longFlag = 0; |
||||
} |
||||
|
||||
/* check for other prefixes */ |
||||
width = 0; |
||||
prec = -1; |
||||
ladjust = 0; |
||||
padc = ' '; |
||||
|
||||
if (*fmt == '-') { |
||||
ladjust = 1; |
||||
fmt ++; |
||||
} |
||||
|
||||
if (*fmt == '0') { |
||||
padc = '0'; |
||||
fmt++; |
||||
} |
||||
|
||||
if (IsDigit(*fmt)) { |
||||
while (IsDigit(*fmt)) { |
||||
width = 10 * width + Ctod(*fmt++); |
||||
} |
||||
} |
||||
|
||||
if (*fmt == '.') { |
||||
fmt ++; |
||||
if (IsDigit(*fmt)) { |
||||
prec = 0; |
||||
while (IsDigit(*fmt)) { |
||||
prec = prec*10 + Ctod(*fmt++); |
||||
} |
||||
} |
||||
} |
||||
|
||||
|
||||
/* check format flag */ |
||||
negFlag = 0; |
||||
switch (*fmt) { |
||||
case 'b': |
||||
if (longFlag) { |
||||
num = va_arg(ap, long int); |
||||
} else { |
||||
num = va_arg(ap, int); |
||||
} |
||||
length = PrintNum(buf, num, 2, 0, width, ladjust, padc, 0); |
||||
OUTPUT(arg, buf, length); |
||||
break; |
||||
|
||||
case 'd': |
||||
case 'D': |
||||
if (longFlag) { |
||||
num = va_arg(ap, long int); |
||||
} else { |
||||
num = va_arg(ap, int); |
||||
} |
||||
if (num < 0) { |
||||
num = - num; |
||||
negFlag = 1; |
||||
} |
||||
length = PrintNum(buf, num, 10, negFlag, width, ladjust, padc, 0); |
||||
OUTPUT(arg, buf, length); |
||||
break; |
||||
|
||||
case 'o': |
||||
case 'O': |
||||
if (longFlag) { |
||||
num = va_arg(ap, long int); |
||||
} else { |
||||
num = va_arg(ap, int); |
||||
} |
||||
length = PrintNum(buf, num, 8, 0, width, ladjust, padc, 0); |
||||
OUTPUT(arg, buf, length); |
||||
break; |
||||
|
||||
case 'u': |
||||
case 'U': |
||||
if (longFlag) { |
||||
num = va_arg(ap, long int); |
||||
} else { |
||||
num = va_arg(ap, int); |
||||
} |
||||
length = PrintNum(buf, num, 10, 0, width, ladjust, padc, 0); |
||||
OUTPUT(arg, buf, length); |
||||
break; |
||||
|
||||
case 'x': |
||||
if (longFlag) { |
||||
num = va_arg(ap, long int); |
||||
} else { |
||||
num = va_arg(ap, int); |
||||
} |
||||
length = PrintNum(buf, num, 16, 0, width, ladjust, padc, 0); |
||||
OUTPUT(arg, buf, length); |
||||
break; |
||||
|
||||
case 'X': |
||||
if (longFlag) { |
||||
num = va_arg(ap, long int); |
||||
} else { |
||||
num = va_arg(ap, int); |
||||
} |
||||
length = PrintNum(buf, num, 16, 0, width, ladjust, padc, 1); |
||||
OUTPUT(arg, buf, length); |
||||
break; |
||||
|
||||
case 'c': |
||||
c = (char)va_arg(ap, int); |
||||
length = PrintChar(buf, c, width, ladjust); |
||||
OUTPUT(arg, buf, length); |
||||
break; |
||||
|
||||
case 's': |
||||
s = (char*)va_arg(ap, char *); |
||||
length = PrintString(buf, s, width, ladjust); |
||||
OUTPUT(arg, buf, length); |
||||
break; |
||||
|
||||
case '\0': |
||||
fmt --; |
||||
break; |
||||
|
||||
default: |
||||
/* output this char as it is */ |
||||
OUTPUT(arg, fmt, 1); |
||||
} /* switch (*fmt) */ |
||||
|
||||
fmt ++; |
||||
} /* for(;;) */ |
||||
|
||||
/* special termination call */ |
||||
OUTPUT(arg, "\0", 1); |
||||
} |
||||
|
||||
|
||||
/* --------------- local help functions --------------------- */ |
||||
static int |
||||
PrintChar(char * buf, char c, int length, int ladjust) |
||||
{ |
||||
int i; |
||||
|
||||
if (length < 1) length = 1; |
||||
if (ladjust) { |
||||
*buf = c; |
||||
for (i=1; i< length; i++) buf[i] = ' '; |
||||
} else { |
||||
for (i=0; i< length-1; i++) buf[i] = ' '; |
||||
buf[length - 1] = c; |
||||
} |
||||
return length; |
||||
} |
||||
|
||||
static int |
||||
PrintString(char * buf, char* s, int length, int ladjust) |
||||
{ |
||||
int i; |
||||
int len=0; |
||||
char* s1 = s; |
||||
while (*s1++) len++; |
||||
if (length < len) length = len; |
||||
|
||||
if (ladjust) { |
||||
for (i=0; i< len; i++) buf[i] = s[i]; |
||||
for (i=len; i< length; i++) buf[i] = ' '; |
||||
} else { |
||||
for (i=0; i< length-len; i++) buf[i] = ' '; |
||||
for (i=length-len; i < length; i++) buf[i] = s[i-length+len]; |
||||
} |
||||
return length; |
||||
} |
||||
|
||||
static int |
||||
PrintNum(char * buf, unsigned long u, int base, int negFlag, |
||||
int length, int ladjust, char padc, int upcase) |
||||
{ |
||||
/* algorithm :
|
||||
* 1. prints the number from left to right in reverse form. |
||||
* 2. fill the remaining spaces with padc if length is longer than |
||||
* the actual length |
||||
* TRICKY : if left adjusted, no "0" padding. |
||||
* if negtive, insert "0" padding between "0" and number. |
||||
* 3. if (!ladjust) we reverse the whole string including paddings |
||||
* 4. otherwise we only reverse the actual string representing the num. |
||||
*/ |
||||
|
||||
int actualLength =0; |
||||
char *p = buf; |
||||
int i; |
||||
|
||||
do { |
||||
int tmp = u %base; |
||||
if (tmp <= 9) { |
||||
*p++ = '0' + tmp; |
||||
} else if (upcase) { |
||||
*p++ = 'A' + tmp - 10; |
||||
} else { |
||||
*p++ = 'a' + tmp - 10; |
||||
} |
||||
u /= base; |
||||
} while (u != 0); |
||||
|
||||
if (negFlag) { |
||||
*p++ = '-'; |
||||
} |
||||
|
||||
/* figure out actual length and adjust the maximum length */ |
||||
actualLength = p - buf; |
||||
if (length < actualLength) length = actualLength; |
||||
|
||||
/* add padding */ |
||||
if (ladjust) { |
||||
padc = ' '; |
||||
} |
||||
if (negFlag && !ladjust && (padc == '0')) { |
||||
for (i = actualLength-1; i< length-1; i++) buf[i] = padc; |
||||
buf[length -1] = '-'; |
||||
} else { |
||||
for (i = actualLength; i< length; i++) buf[i] = padc; |
||||
} |
||||
|
||||
|
||||
/* prepare to reverse the string */ |
||||
{ |
||||
int begin = 0; |
||||
int end; |
||||
if (ladjust) { |
||||
end = actualLength - 1; |
||||
} else { |
||||
end = length -1; |
||||
} |
||||
|
||||
while (end > begin) { |
||||
char tmp = buf[begin]; |
||||
buf[begin] = buf[end]; |
||||
buf[end] = tmp; |
||||
begin ++; |
||||
end --; |
||||
} |
||||
} |
||||
|
||||
/* adjust the string pointer */ |
||||
return length; |
||||
} |
||||
|
||||
static void printf_output(void *arg, char *s, int l) |
||||
{ |
||||
int i; |
||||
|
||||
// special termination call
|
||||
if ((l==1) && (s[0] == '\0')) return; |
||||
|
||||
for (i=0; i< l; i++) { |
||||
board_putc(s[i]); |
||||
if (s[i] == '\n') board_putc('\r'); |
||||
} |
||||
} |
||||
|
||||
void printf(char *fmt, ...) |
||||
{ |
||||
va_list ap; |
||||
va_start(ap, fmt); |
||||
lp_Print(printf_output, 0, fmt, ap); |
||||
va_end(ap); |
||||
} |
@ -0,0 +1,18 @@ |
||||
/*
|
||||
* Copyright (C) 2001 MontaVista Software Inc. |
||||
* Author: Jun Sun, jsun@mvista.com or jsun@junsun.net |
||||
* |
||||
* 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. |
||||
* |
||||
*/ |
||||
|
||||
#ifndef _printf_h_ |
||||
#define _printf_h_ |
||||
|
||||
#include <stdarg.h> |
||||
void printf(char *fmt, ...); |
||||
|
||||
#endif /* _printf_h_ */ |
Loading…
Reference in new issue