update coreboot trunk version

Signed-off-by: Stefan Reinauer <stepan@coresystems.de>
Acked-by: Patrick Georgi <patrick.georgi@coresystems.de>


git-svn-id: svn://svn.coreboot.org/coreboot/trunk@5096 2b7e53f0-3cfb-0310-b3e9-8179ed1497e1

HOWTO/EPIA-M-howto

@@ -1,593 +0,0 @@
-
-This HOWTO contains instructions for using LinuxBIOSv2 on the VIA EPIA-M and MII 
-mini-itx based motherboards.
-
-Version 1.0 initial write for LinuxBIOSv2 by Nick Barker
-
-Using materials and inspiration from
-- EPIA HOWTO for freebios/linuxbios by Mark Wilkinson
-- Based on the K7SEM HOWTO by Brenden Bixler,
-- which is based on the Sis 630 HOWTO by Ron Minnich.
-- Getting Started with freebios2 - a mail posting by Jay Miller
-
-Unfortunately, there is a step in this HOWTO that could be hazardous. The 
-hazards include (but are not limited to)
-	1) destroying your motherboard
-	2) hurting yourself
-	3) killing yourself
-
-Because of these hazards, you must take full responsibility if you
-decide to install LinuxBIOSv2 following these procedures. Neither the
-author of this HOWTO or any organisation or individual associated with
-the LinuxBIOSv2 project can be held responsible for any adverse consequences
-of your attempt to follow these procedures.
-
-WARNING: We assume you've built kernels, know how to open up your PC,
-and how to yank the flash part out while power is on and put in a
-different part. There is NO WARRANTY, express or implied, with this
-software. In fact, if you don't know what you're doing, and you get
-careless, you're going to end up with a nice paperweight instead of a
-motherboard, an emergency room bill, or a funeral service.
-
-			YOU HAVE BEEN WARNED.
-
-Additional information available at: http://www.linuxbios.org/
-
-Linux distribution: Most modern distributions are supported. 
-                    
-Other software notes: You MUST have 'as' version 2.9.5 or later.
-                      You MUST have 'gcc' version other than 2.96.
-                      
-			  
-Pre-requisites
---------------
-
-Before you start there are a few things which you need to arrange:
-
-Since you are going to be re-programming the flash rom on the mainboard, and
-it is likely that you first few attempts / images will not be right, then
-you need a way of restoring a known working bios onto a board which is otherwise
-dead.
-
-Recommended: you might want to get a Bios Saviour (RD1-PL) - this is
-a handy little piggy-back flash chip that saves you destroying the original
-flash image. This howto assumes that you have this device, though other methods
-and devices exist for programming flash roms.
-
-LinuxBIOSv2 sends debugging output through the first serial port. You might want
-to arrange a null modem serial cable for connecting this serial port to a
-second computer running a terminal emulation program. I use 'microcom' which
-is simple and allows all output to be captured into a file for later analysis.
-The port is set up to use 115200 baud, 8bit, No parity, 1 stop bit.
-
-Under LinuxBIOSv2 you have a choice of 'payloads'. The payload is the program
-which LinuxBIOSv2 hands over to once it has finished initialising everything
-on the mainboard at boot time. The payload is included in the flash rom along
-with LinuxBIOSv2, and usually its function is to locate and load the operating
-system. The 2 most common payloads are FILO, for booting Linux off an IDE
-disk, and Etherboot for booting a diskless workstation accross a network.
-This howto assumes the use of FILO.  
-
-A vga bios image. LinuxBIOS2v2 uses the vga bios of the original Via BIOS to 
-initialise the vga. It is not directly downloadable, but you can capture it from
-a system running with the original bios, so you might as well capture it now:
-		dd if=/dev/mem of=/video.bios.bin \
-                   bs=1 count=65536 skip=790528
-
-
-Getting Going
--------------
-
-The steps for loading LinuxBIOSv2 are simple:
-1) Get Linux installed on your machine.
-2) Download and install LinuxBIOSv2 sources.
-3) Understand how to flash your rom.
-4) Download, Configure and build the FILO payload
-5) Configure and build LinuxBIOSv2.
-6) Burn the LinuxBIOSv2 image to the flash.
-7) Reset the machine -- did it work?
-
-Options Once it has booted
-  i) Speeding up the boot
- ii) Enhancing ACPI support
-iii) On EPIA-MII, booting the computer from on-board compact flash 
-
-
-Step 1) 
-	Get Linux installed on your LinuxBIOSv2 machine.
-              Don't forget to note which partition is / (/dev/hda3 etc.)
-
-
-Step 2)
-	Grab the LinuxBIOSv2 source.
-	cd to the directory you want the source tree to be.
-
-	Note: this will create a sub directory called LinuxBIOSv2 which contains
-              the LinuxBIOSv2 source code
-
-	Download the latest code for LinuxBIOSv2 from the downloads page at
-		http://www.linuxbios.org
-
-
-	having expanded the tarball, cd into the LinuxBIOSv2 directory and browse around.
-	The top level directory includes:
-
-	'src' - where all of the source files for LinuxBIOSv2 are located.
-	'targets' - where all of the platform specific configuration files
-		for each platform supported by LinuxBIOSv2 are kept, and 
-                where the build files and build process occur.
-	'util' - where various utilities required for the build process 
-		and debugging are kept.
-
-
-	Hereafter, this howto refers to directory locations relative to these directories,
-	unless an absolute pathlist is given.
-
-Step 3)
-	Whilst getting LinuxBIOSv2 going on your EPIA-M, you are almost 
-	certainly going to be re-programming the flash rom several times, and
-	there is a very high probability that at one of these stages you will
-	get a flash rom that fails to boot your mainboard into Linux.
- 
-	Before we proceed any further, it is absolutley vital that you have
-	worked out how to program the flash chip, and how you are going to
-	get back to your original bios when things go wrong. Otherwise you 
-	will end up with a very expensive paper weight as described earlier.
-
-        You can use a professional Data I/O burner, or you can be foolhardy
-	and simply re-program the flash part of a running machine. However
-	whilst getting going a BIOS SAVIOUR RD1-PL is a very inexpensive
-	but effective device for ensuring that you always have a working
-	BIOS to hand.
-
-	The bios saviour is a little device which plugs into the flash rom
-	socket of the motherboard, and the original flash rom then plugs into
-	the bios saviour. The bios saviour includes a second flash rom chip,
-	and either of these chips can be selected as the active chip by a 
-	simple supplied electrical switch mounted on flying leads. Make
-	sure that this switch is clearly visible, so that you know which
-	chip you are booting from, and which chip you are about to re-program.
-
-	Decide which chip you are going to use for LinuxBIOSv2, and which chip
-	you are going to keep the original working bios in, and mark them 
-	clearly on this switch.
-
-        In the 'util/flash_and_burn' directory is the source for the 'flash_rom'
-	utility, which is great for re-programming the flash chips on the 
-	EPIA-M / MII. Once you have built this utility:
-
-	Make sure that it can detect both flash chips on the bios saviour:
-		with switch set to chip 1 run 'flash_rom'
-		flash rom should search through a list of known flash rom
-		device types until it finds the type of the original chip
-		from your EPIA-M, and report what it has found.
-
-		with the switch set to chip 2, run 'flash_rom' again and confirm
-		that it can 'see' the second flash chip.
-
-		If your are lucky, the actual part number of the 2 chips may
-		be different, which you can use just prior to re-programming
-		a chip to make sure you are programming the right chip.
-
-	Make sure that you can read / write and verify a flash chip:
-		with switch set to 1 (original BIOS) run
-		'flash_rom -r original.rom'
-		this should read the contents of the original bios into the
-		file original.rom
-
-		confirm that the newly read file matches the original bios
-		'flash_rom -v original.rom'
-
- 		set the switch to 2 
-		confirm if you can that flash_rom 'sees' the second chip
-		'flash_rom' - and look for the detected device type
-
-		write the known good bios to the second chip with
-		'flash_rom -w original.bios'
-
-		verify that it has written correctly
-		'flash_rom -v original.rom'
-
-		with switch left at position 2, reboot the machine and make
-		sure that it comes up corectly. If it does then you now have
-		a working flash programming environment. If it does not, then
-		set the switch back to 1, reboot the machine, and investigate
-		further. 
-
-Step 4)
-	Download FILO from http://felixx.tsn.or.jp/~ts1/filo, and expand
-
-	In the FILO source directory, type 'make'
-
-	The first invocation of make builds the default Config file, which
-	should be edited to meet your needs. In particular look at the line:
-
-	"AUTOBOOT_FILE ...."
-
-	and make sure that it looks sensible for your setup. The line
-	AUTOBOOT_FILE "hda1:/vmlinuz root=/dev/hda2 console=ttyS0,115200" 
-	reads as:
-		- find a linux os image on device hda partion 1 called vmlinuz,
-		- load this image
-		- execute the image passing kernel command line parameters of:
-		      "root=/dev/hda2 console=ttyS0,115200" 
-
-	after editing Config, type 'make' again, and this will build the file
-	'filo.elf' which is the payload we will be using.
-
-	Copy this file to somewhere which the LinuxBIOSv2 makefile can easily 
-	find it. I just tend to keep it in the root directory though I'm sure
-	others will condem me for that practise:
-	'cp filo.elf /'
-
-	Make sure that you have compiled a kernel bzImage, and copied it to
-	the file location you identified in the FILO Config file.
-
-
-Step 5)
-	The next step is to create the build environment for the epia-m. This
-	step creates the appropriate makefiles and build directories for the
-	epia-m.
-
-	'cd targets'
-	'./buildtarget via/epia-m'
-
-	This step will create a subdirectory in the targets/via/epia-m
-	directory called epia-m, which is the build directory for LinuxBIOSv2.
-
-	The main configuration file for the epia-m is in 
-	'targets/via/epia-m/Config.lb'
-
-	If you need to make any changes to the configuration, for example you wish to
-	locate filo.elf in a place other than '/filo.elf', or during the more advanced
-	steps of this HOWTO, then these changes are made to this file.
-
-	You need to re-run the './buildtartegt via/epia-m' after any such change.
-
-	The directory 'targets/via/epia-m' contains other sample Config.lb files, any
-        of which can be copied through to Config.lb in order to become the current 
-	configuration.
-
-	Once you have your Config.lb set up to your needs, and the build environment
-	created with './buildtarget', it is time to build a rom image.
-
-	Change directory into the build directory 'targets/via/epia-m/epia-m'
-
-	The configuration as set up by the buildtarget process will create a LinuxBIOS
-        which is exactly 196608 bytes long, which is exactly 64K bytes short of what
-        needs to go into the 256K flash rom. The other 64K is for your vga bios
-	which is simply merged with the linuxbios image. The easiest way to make this 
-	happen is to edit the Makefile and change the line
-
-	     cat fallback/linuxbios.rom > linuxbios.rom
-
-        to
-
-             cat /video.bios.bin fallback/linuxbios.rom >linuxbios.rom
-
-	Note: the above order of merging the files together is critical 
- 
-	You will need to remember to make this change every time after you have run
-        the buildtarget program.
-	
-	Type 'make', and wait for the build process to complete.
-
-	If all went well, then you should find a file 'linuxbios.rom' in your
-	current directory. Check that it is 262144 bytes long - i.e. exactly the right 
-	size for the flash rom chip in your EPIA-M / MII.
-
-
- 
-Step 6)
-	NOTE: BE ADVISED THAT THIS STEP CAN KILL YOUR MOTHERBOARD !
-	IF YOU DO NOT HAVE A MEANS OF RECOVERING FROM FLASHING YOUR BIOS,
-	YOU MAY/WILL BE LEFT WITH A DEAD MACHINE.
-
-
-	Assuming that you are using a Bios Saviour, make sure that the switch is set
-	to the position for your LinuxBIOSv2 image.
-
-	Type 'flash_rom' to make sure it can see the flash chip, and verify its type if
-	possible.
-
-	Only once you are happy that you are about to re-programme the desired chip, type
-	'flash_rom -w linuxbios.rom', and wait the few seconds it takes to program it.
-
-	Once it has finished, verify that the chip was re-rogrammed correctly - type
-	'flash_rom -v linuxbios.rom'
-
- 
-
-Step 7) 
-	Power cycle the machine. LinuxBIOSv2 should come up in a few seconds.
-
-	With a connection to the serial port set at 115200, you should see LinuxBIOSv2
-	come up, launch FILO, and if you have a timeout set in FILO, then it may be
-	waiting for you to confirm its boot command line.
-
-	As long as you have this command line set up correctly, and an os image in the
-	right place, then FILO should proceed to boot into your Linux os.
-
-	If you do, CONGRATULATIONS ! It WORKED ! Pat yourself on the back,
-	why not try the optional steps now ?
-
-	If you don't, time to start capturing the output of the serial port
-	and talking to the linuxbios mailing list.
-
-
-Optional steps - for use only if step 7 was successfull.
-
-OK so now we have a BIOS which boots your computer fully into the operating system, and
-depending upon your needs that may be all that you want. However LinuxBIOSv2 has a few more
-tricks up its sleeve should you find yourself hungry for more.
-
-Speeding up the boot
---------------------
-
-Linuxbios sends its debugging output to the first serial port and, depending upon the amount of debug
-output selected, can be the limiting factor in the speed with which it boots your computer - regardless 
-of whether you have anything attached to the serial port.
-
-Linuxbios uses the notion of debug levels to control what is sent to the serial port. These levels
-range from 0 to 9 with 0 being the least verbose and 9 being the most verbose.
-
-These levels are defined in the Config.lb file described earlier. To reduce the output set:
-    option  MAXIMUM_CONSOLE_LOGLEVEL=8 
-    option  DEFAULT_CONSOLE_LOGLEVEL=8
-to lower values.
-
-Next you will have to run 'buildtarget' again to propagate the effects of the config change.
-Then edit your Makefile again to include your video bios in the final merging.
-
-Then run 'make clean' followed by 'make'.
- 
-
-Advanced ACPI
--------------
-
-	LinuxBIOSv2 now supports ACPI on the epia-m and epia-m II. In particular the interrupt
-	processing in Linux can be done through ACPI, and crude power management support
-	is provided. This includes software power off, and power management events from the
-	power button.
-
-	It is possible to enhance this behaviour to provide the full capabilities of the 
-	original BIOS, which includes different sleep levels and wake from these levels
-	upon certain events. This is achieved by using a 'grabbed' copy of the ACPI 
-	Differentiated System Descriptor Table or DSDT from the original BIOS.
-
-	For copyright reasons this table cannot be included with the source distribution
-	of LinuxBIOSv2.
-
-
-	You MUST have 'iasl' - Intel's ACPI Asl compiler for Unix/Linux - 
-		http://developer.intel.com/technology/iapc/acpi/downloads.htm.
-
-
-	To replace the LinuxBIOSv2 DSDT with the grabbed one from the original BIOS:
-
-		- Start the computer using the original BIOS, and make sure that you
-			have ACPI set up in the kernel that you are running
-
-		- Grab the DSDT table - 'cat /proc/acpi/dsdt >dsdt.aml'
-		- Convert to asl code - 'iasl -d dsdt.aml'          (creates dsdt.dsl)
-		- Convert it to a C hex table - 'iasl -tc dsdt.dsl' (creates dsdt.hex)
-		- Replace the file 'src/mainboard/via/epia-m/dsdt.c with dsdt.hex
-
-	Now re-build LinuxBIOSv2, re-program the flash and power cycle.
-
-	If you wish to return to the LinuxBIOSv2 DSDT, then the original file dsdt.asl can be converted
-	into a C hex file using 'iasl -tc dsdt.asl'
-
-
-
-Boot from Onboard Compact Flash (MII only)
-------------------------------------------
-
-	LinuxBIOSv2 now supports the onboard compact flash on the MII as an IDE drive,
-        and it is possible to boot directly from this drive using the following steps.
-
-	The first step is to get Filo or whatever payload you are using to recognise
-        and use this device.
-
-	In order that the pcmcia subsystem of the Linux kernel can correctly configure
-        the device later on in the boot process the CF is set up with its I/O
-	registers in a contiguous block of 16 bytes at 0x1e0 through 0x1ef. Unfortunately
-        this is not a standard IDE address which is why we need to 'fix' filo to use it.
-        (Actually it is half of the address range used by IDE4, and so we need to
-        be careful to tell the kernel not to probe that address - more on that later).
-
-	The first step is to change the filo Config file.
-	1) Comment out SUPPORT_PCI=1. This line instructs filo to search for PCI based IDE 
-           adapters only, and the CF is not attached to a PCI based IDE controller.
-	2) Add the following two lines somewhere in the Config file:
-		IDE2_CMD = 0x1e0
-		IDE2_CNTRL =0x1ec
-
-
-	The second step is to modify the file drivers/ide.c in the filo source directory.
-	Find the function 'find_ide_controller_compat' and change it to look like
-
-	static int find_ide_controller_compat(struct controller *ctrl, int index)
-	{
-		if (index >= IDE_MAX_CONTROLLERS)
-			return -1;
-	#ifdef IDE2_CMD
-		if(index == 2){
-			ctrl->cmd_base = IDE2_CMD;
-			ctrl->ctrl_base = IDE2_CNTRL;
-			return 0;
-		}
-	#endif
-		ctrl->cmd_base  = ide_base[index];
-		ctrl->ctrl_base = ide_base[index] + IDE_REG_EXTENDED_OFFSET;
-		return 0;
-	}
-	Filo will now recognise the CF as the first device on the third IDE controller 
-        (i.e. ide2), and can be referred to as 'hde'
-
-
-	The next step is to create an initrd file for your Linux kernel. What? Why?
-        The CF socket on your MII is hardwired to the PCMCIA controller and for all intents
-        and purposes it is a PCMCIA device. This means that once Linux boots it will be under
-        the control of the pcmcia manager. Now according to the pcmcia-utils documentation,
-        the pcmcia manager is intended to control and configure devices on an already
-        running system. Yet if we need the CF to be the root device, it needs to be mounted
-        very early on in the boot sequence, before the stage where pcmcia devices would normally
-        be configured. The answer is to use an initrd file to get the pcmcia manager running early
-        for the CF. If you are unfamiliar with initrd then 'man initrd' will give you more background.
-
-
-	The easiest way to create an initrd is to use the script 'mkcfinitrd' which is at the bottom
-        of this howto. This is a tailored version of the 'pcinitrd' script from the pcmcia-utils package.
-        Make sure that 'ash' is available on your system as this is the tiny shell programme used during
-        the initrd phase of booting.
-
-        It is worth mounting the initrd generated, and looking over it to make sure that
-        it contains all of the modules necessary to load and initialise the CF. It does not
-        need drivers for whatever you use in the pcmcia socket, as that can be initialised
-        later on in the boot process as before.
-
-        Finally gzip the file created, and move it alongside your kernel.
-
-	Next adjust your FILO command line to pick things up from the CF. My linux command
-	line in filo looks like:
-
-	AUTOBOOT_FILE = "hde:/vmlinuz initrd=hde:/initrd.gz root=/dev/hde console=tty0 ide4=noprobe"
-
-	The ide4=noprobe option is required to stop the kernel from probing the address used
-        by the CF. As this address is half that used as the standard address for a fifth (i.e. ide4)
-        controller, the kernel hangs whilst trying to initialise this device if this option
-        is not given.
-
-	Finally make sure that you have copied the necessary files onto your CF, and re-boot
-	your computer.
-
-
-
-******************* mkcfinitrd script **************************************
-#!/bin/sh
-#
-# Utility for constructing CF initrd for Epia-MII CF Boot
-#
-# Copyright (C) 2005 Nick Barker -- nick.barker9@btinternet.com
-#
-# Based on pcinitrd
-# Copyright (C) 1999 David A. Hinds -- dahinds@users.sourceforge.net
-
-SIZE=2400
-MODULES="pcmcia/pcmcia_core.o pcmcia/ds.o pcmcia/yenta_socket.o"
-BLK="kernel/drivers/ide/legacy/ide-cs.o"
-KERNEL=`uname -r`
-MODDIR=/lib/modules/$KERNEL
-BIN="bin/mount bin/umount sbin/insmod sbin/cardmgr"
-LIB=`ls /lib/libc.so.? | sort | tail -1`
-ETC="/etc/ld.so.cache /etc/pcmcia/config /etc/pcmcia/config.opts"
-DEV="/dev/console /dev/null /dev/ram /dev/tty1 /dev/tty2 /dev/tty3 /dev/tty4"
-MNT=/tmp/initrd.mnt
-
-# name of the initrd file to make
-TARGET=/tmp/initrd
-
-fail()
-{
-    umount $MNT
-    rmdir $MNT
-    exit 1
-}
-trap fail SIGTERM SIGINT
-
-strip_cp()
-{
-    if [ -d $3 ] ; then
-	DEST=$3/`basename $2`
-    else
-	DEST=$3
-    fi
-    strip $1 --verbose -o $DEST $2 | sed -e 's/([^ ]*)//g' || fail
-}
-
-mkdir --verbose $MNT || exit 1
-
-echo "Creating filesystem on $TARGET"
-if [ -b $TARGET ] ; then
-    rm $TARGET || fail
-fi
-
-dd if=$ROOT/dev/zero of=$TARGET bs=1k count=$SIZE
-echo "y" | mke2fs $TARGET $SIZE >/dev/null || fail
-mount --verbose -t ext2 -o loop $TARGET $MNT || fail
-
-
-rm -rf $MNT/lost+found
-echo "Creating Directories on $TARGET"
-for DIR in bin dev etc lib proc tmp mnt ; do
-    mkdir --verbose $MNT/$DIR || fail
-done
-for DIR in block misc fs net pcmcia ; do
-    mkdir --verbose $MNT/lib/$DIR || fail
-done
-
-echo "Copying Files to $TARGET"
-for F in $DEV ; do
-    cp -a --verbose /$F $MNT/dev || fail
-done
-if [ -e /dev/systty ] ; then
-    cp -a --verbose /dev/systty $MNT/dev || fail
-fi
-
-for F in $BIN ; do
-    strip_cp --strip-all /$F $MNT/bin
-done
-strip_cp --strip-all /bin/ash $MNT/bin/sh
-
-for F in $LIB ; do
-    strip_cp --strip-debug /$F $MNT/lib
-done
-cp --verbose /lib/ld-linux.so.? $MNT/lib || fail
-
-for F in $ETC ; do
-    cp --verbose /$F $MNT/etc || fail
-done
-for F in scsi network ftl ide memory serial ; do
-    touch $MNT/etc/$F ; chmod +x $MNT/etc/$F
-done
-
-for MOD in $MODULES ; do
-    strip_cp --strip-debug $MODDIR/$MOD $MNT/lib/$MOD
-done
-
-strip_cp --strip-debug $MODDIR/$BLK $MNT/lib/block/ide-cs.o
-
-echo "Creating linuxrc startup script"
-cat > $MNT/linuxrc <<- 'EOF'
-	#!/bin/sh
-	
-	mount -t proc /proc /proc
-
-	echo ""
-	echo "==== initrd: starting PCMCIA services ===="
-	echo ""
-	PC=/lib/pcmcia
-	insmod $PC/pcmcia_core.o 
-	insmod $PC/yenta_socket.o
-	insmod $PC/ds.o
-	insmod /lib/block/ide-cs.o
-	if [ "$DEBUG" != "" ] ; then V=-v ; fi
-	cardmgr $V -q -o -c /etc -m /lib -s /tmp/stab -p /tmp/pid
-	umount /proc
-	echo ""
-	
-	if [ "$DEBUG" != "" ] ; then
-	    /bin/sh < /dev/console
-	fi
-EOF
-chmod +x $MNT/linuxrc 
-
-df -P $MNT | awk '/tmp/ { printf "%dK/%dK used\n",$3,$2 }'
-umount $VERBOSE $MNT
-rmdir $MNT
-echo "Finished $TARGET"
-echo "Now gzip $TARGET to create final initrd.gz"
-exit 0
-
-*************************** end mkcfinitrd ***********************************

Makefile

@@ -0,0 +1,323 @@
+##
+## This file is part of the coreboot project.
+##
+## Copyright (C) 2008 Advanced Micro Devices, Inc.
+## Copyright (C) 2008 Uwe Hermann <uwe@hermann-uwe.de>
+## Copyright (C) 2009-2010 coresystems GmbH
+##
+## 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; version 2 of the License.
+##
+## 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., 51 Franklin St, Fifth Floor, Boston, MA  02110-1301 USA
+##
+
+$(if $(wildcard .xcompile),,$(eval $(shell bash util/xcompile/xcompile > .xcompile)))
+include .xcompile
+
+export top := $(shell pwd)
+export src := $(top)/src
+export srck := $(top)/util/kconfig
+export obj ?= $(top)/build
+export objk := $(obj)/util/kconfig
+export sconfig := $(top)/util/sconfig
+export yapps2_py := $(sconfig)/yapps2.py
+export config_g := $(sconfig)/config.g
+
+
+export KERNELVERSION      := 4.0
+export KCONFIG_AUTOHEADER := $(obj)/config.h
+export KCONFIG_AUTOCONFIG := $(obj)/auto.conf
+
+CONFIG_SHELL := sh
+KBUILD_DEFCONFIG := configs/defconfig
+UNAME_RELEASE := $(shell uname -r)
+HAVE_DOTCONFIG := $(wildcard .config)
+MAKEFLAGS += -rR --no-print-directory
+
+# Make is silent per default, but 'make V=1' will show all compiler calls.
+Q:=@
+ifneq ($(V),1)
+ifneq ($(Q),)
+.SILENT:
+endif
+endif
+
+CPP:= $(CC) -x assembler-with-cpp -DASSEMBLY -E
+HOSTCC = gcc
+HOSTCXX = g++
+HOSTCFLAGS := -I$(srck) -I$(objk) -g
+HOSTCXXFLAGS := -I$(srck) -I$(objk)
+LIBGCC_FILE_NAME := $(shell $(CC) -print-libgcc-file-name)
+
+DESTDIR = /opt
+
+DOXYGEN := doxygen
+DOXYGEN_OUTPUT_DIR := doxygen
+
+ifeq ($(strip $(HAVE_DOTCONFIG)),)
+
+all: config
+
+else
+
+include $(top)/.config
+
+ARCHDIR-$(CONFIG_ARCH_X86)    := i386
+ARCHDIR-$(CONFIG_ARCH_POWERPC) := ppc
+
+MAINBOARDDIR=$(shell echo $(CONFIG_MAINBOARD_DIR))
+export MAINBOARDDIR
+
+PLATFORM-y += src/arch/$(ARCHDIR-y) src/cpu src/mainboard/$(MAINBOARDDIR)
+TARGETS-y :=
+
+BUILD-y := src/lib src/boot src/console src/devices src/southbridge src/northbridge src/superio src/drivers util/x86emu
+BUILD-y += util/cbfstool
+BUILD-$(CONFIG_ARCH_X86) += src/pc80
+
+ifneq ($(CONFIG_LOCALVERSION),"")
+COREBOOT_EXTRA_VERSION := -$(shell echo $(CONFIG_LOCALVERSION))
+endif
+
+# The primary target needs to be here before we include the
+# other files
+
+all: coreboot
+
+
+#######################################################################
+# Build the tools
+
+CBFSTOOL:=$(obj)/util/cbfstool/cbfstool
+
+$(obj)/mainboard/$(MAINBOARDDIR)/config.py: $(yapps2_py) $(config_g) 
+	mkdir -p $(obj)/mainboard/$(MAINBOARDDIR)
+	python $(yapps2_py) $(config_g) $(obj)/mainboard/$(MAINBOARDDIR)/config.py
+
+
+# needed objects that every mainboard uses 
+# Creation of these is architecture and mainboard independent
+$(obj)/mainboard/$(MAINBOARDDIR)/static.c: $(src)/mainboard/$(MAINBOARDDIR)/devicetree.cb  $(obj)/mainboard/$(MAINBOARDDIR)/config.py
+	mkdir -p $(obj)/mainboard/$(MAINBOARDDIR)
+	(cd $(obj)/mainboard/$(MAINBOARDDIR) ; PYTHONPATH=$(top)/util/sconfig export PYTHONPATH; python config.py  $(MAINBOARDDIR) $(top) $(obj)/mainboard/$(MAINBOARDDIR))
+
+$(obj)/mainboard/$(MAINBOARDDIR)/static.o: $(obj)/mainboard/$(MAINBOARDDIR)/static.c
+#
+
+objs:=$(obj)/mainboard/$(MAINBOARDDIR)/static.o
+initobjs:=
+drivers:=
+smmobjs:=
+crt0s:=
+ldscripts:=
+types:=obj initobj driver smmobj
+includemakefiles=$(foreach type,$(2), $(eval $(type)-y:=)) $(eval subdirs-y:=) $(eval include $(1)) $(if $(strip $(3)),$(foreach type,$(2),$(eval $(type)s+=$$(patsubst src/%,$(obj)/%,$$(addprefix $(dir $(1)),$$($(type)-y)))))) $(eval subdirs+=$$(subst $(PWD)/,,$$(abspath $$(addprefix $(dir $(1)),$$(subdirs-y)))))
+evaluate_subdirs=$(eval cursubdirs:=$(subdirs)) $(eval subdirs:=) $(foreach dir,$(cursubdirs),$(eval $(call includemakefiles,$(dir)/Makefile.inc,$(types),$(1)))) $(if $(subdirs),$(eval $(call evaluate_subdirs, $(1))))
+
+# collect all object files eligible for building
+subdirs:=$(PLATFORM-y) $(BUILD-y)
+$(eval $(call evaluate_subdirs, modify))
+
+allobjs:=$(foreach var, $(addsuffix s,$(types)), $($(var)))
+alldirs:=$(sort $(abspath $(dir $(allobjs))))
+source_with_ext=$(patsubst $(obj)/%.o,src/%.$(1),$(allobjs))
+allsrc=$(wildcard $(call source_with_ext,c) $(call source_with_ext,S))
+
+POST_EVALUATION:=y
+
+# fetch rules (protected in POST_EVALUATION) that rely on the variables filled above
+subdirs:=$(PLATFORM-y) $(BUILD-y)
+$(eval $(call evaluate_subdirs))
+
+
+define objs_dsl_template
+$(obj)/$(1)%.o: src/$(1)%.asl
+	@printf "    IASL       $$(subst $$(shell pwd)/,,$$(@))\n"
+	$(CPP) -D__ACPI__ -P $(CPPFLAGS) -include $(obj)/config.h -I$(src) -I$(src)/mainboard/$(MAINBOARDDIR) $$< -o $$(basename $$@).asl
+	iasl -p $$(basename $$@) -tc $$(basename $$@).asl
+	mv $$(basename $$@).hex $$(basename $$@).c
+	$(CC) -m32 $$(CFLAGS) $$(if $$(subst dsdt,,$$(basename $$(notdir $$@))), -DAmlCode=AmlCode_$$(basename $$(notdir $$@))) -c -o $$@ $$(basename $$@).c
+endef
+
+define objs_c_template
+$(obj)/$(1)%.o: src/$(1)%.c $(obj)/build.h
+	@printf "    CC         $$(subst $$(obj)/,,$$(@))\n"
+	$(CC) -m32 $$(CFLAGS) -c -o $$@ $$<
+endef
+
+define objs_S_template
+$(obj)/$(1)%.o: src/$(1)%.S $(obj)/build.h
+	@printf "    CC         $$(subst $$(obj)/,,$$(@))\n"
+	$(CC) -m32 -DASSEMBLY $$(CFLAGS) -c -o $$@ $$<
+endef
+
+define initobjs_c_template
+$(obj)/$(1)%.o: src/$(1)%.c $(obj)/build.h
+	@printf "    CC         $$(subst $$(obj)/,,$$(@))\n"
+	$(CC) -m32 $$(CFLAGS) -c -o $$@ $$<
+endef
+
+define initobjs_S_template
+$(obj)/$(1)%.o: src/$(1)%.S $(obj)/build.h
+	@printf "    CC         $$(subst $$(obj)/,,$$(@))\n"
+	$(CC) -m32 -DASSEMBLY $$(CFLAGS) -c -o $$@ $$<
+endef
+
+define drivers_c_template
+$(obj)/$(1)%.o: src/$(1)%.c $(obj)/build.h
+	@printf "    CC         $$(subst $$(obj)/,,$$(@))\n"
+	$(CC) -m32 $$(CFLAGS) -c -o $$@ $$<
+endef
+
+define drivers_S_template
+$(obj)/$(1)%.o: src/$(1)%.S
+	@printf "    CC         $$(subst $$(obj)/,,$$(@))\n"
+	$(CC) -m32 -DASSEMBLY $$(CFLAGS) -c -o $$@ $$<
+endef
+
+define smmobjs_c_template
+$(obj)/$(1)%.o: src/$(1)%.c
+	@printf "    CC         $$(subst $$(obj)/,,$$(@))\n"
+	$(CC) -m32 $$(CFLAGS) -c -o $$@ $$<
+endef
+
+define smmobjs_S_template
+$(obj)/$(1)%.o: src/$(1)%.S
+	@printf "    CC         $$(subst $$(obj)/,,$$(@))\n"
+	$(CC) -m32 $$(CFLAGS) -c -o $$@ $$<
+endef
+
+usetemplate=$(foreach d,$(sort $(dir $($(1)))),$(eval $(call $(1)_$(2)_template,$(subst $(obj)/,,$(d)))))
+usetemplate=$(foreach d,$(sort $(dir $($(1)))),$(eval $(call $(1)_$(2)_template,$(subst $(obj)/,,$(d)))))
+$(eval $(call usetemplate,objs,dsl))
+$(eval $(call usetemplate,objs,c))
+$(eval $(call usetemplate,objs,S))
+$(eval $(call usetemplate,initobjs,c))
+$(eval $(call usetemplate,initobjs,S))
+$(eval $(call usetemplate,drivers,c))
+$(eval $(call usetemplate,drivers,S))
+$(eval $(call usetemplate,smmobjs,c))
+$(eval $(call usetemplate,smmobjs,S))
+
+printall:
+	@echo objs:=$(objs)
+	@echo initobjs:=$(initobjs)
+	@echo drivers:=$(drivers)
+	@echo smmobjs:=$(smmobjs)
+	@echo alldirs:=$(alldirs)
+	@echo allsrc=$(allsrc)
+
+OBJS     := $(patsubst %,$(obj)/%,$(TARGETS-y))
+INCLUDES := -I$(top)/src -I$(top)/src/include -I$(obj) -I$(top)/src/arch/$(ARCHDIR-y)/include 
+INCLUDES += -I$(shell $(CC) -print-search-dirs | head -n 1 | cut -d' ' -f2)include
+INCLUDES += -I$(top)/util/x86emu/include
+INCLUDES += -include $(obj)/build.h
+
+try-run= $(shell set -e; \
+TMP=".$$$$.tmp"; \
+if ($(1)) > /dev/null 2>&1; \
+then echo "$(2)"; \
+else echo "$(3)"; \
+fi; rm -rf "$$TMP")
+
+cc-option= $(call try-run,\
+$(CC) $(1) -S -xc /dev/null -o "$$TMP", $(1), $(2))
+
+STACKPROTECT += $(call cc-option, -fno-stack-protector,)
+
+CFLAGS = $(STACKPROTECT) $(INCLUDES) -Os -nostdinc
+CFLAGS += -nostdlib -Wall -Wundef -Wstrict-prototypes -Wmissing-prototypes
+CFLAGS += -Wwrite-strings -Wredundant-decls -Wno-trigraphs 
+CFLAGS += -Wstrict-aliasing -Wshadow 
+ifeq ($(CONFIG_WARNINGS_ARE_ERRORS),y)
+CFLAGS += -Werror
+endif
+CFLAGS += -fno-common -ffreestanding -fno-builtin -fomit-frame-pointer
+
+CBFS_COMPRESS_FLAG:=l
+CBFS_PAYLOAD_COMPRESS_FLAG:=
+ifeq ($(CONFIG_COMPRESSED_PAYLOAD_LZMA),y)
+CBFS_PAYLOAD_COMPRESS_FLAG:=l
+endif
+
+coreboot: prepare prepare2 $(obj)/coreboot.rom
+
+endif
+
+prepare:
+	mkdir -p $(obj)
+	mkdir -p $(obj)/util/kconfig/lxdialog
+	test -n "$(alldirs)" && mkdir -p $(alldirs) || true
+
+prepare2: $(obj)/build.h
+
+$(obj)/build.h:
+	@printf "    GEN        build.h\n"
+	rm -f $(obj)/build.h
+	printf "#define COREBOOT_VERSION \"$(KERNELVERSION)\"\n" > $(obj)/build.ht
+	printf "#define COREBOOT_EXTRA_VERSION \"$(COREBOOT_EXTRA_VERSION)\"\n" >> $(obj)/build.ht
+	printf "#define COREBOOT_BUILD \"`LANG= date`\"\n" >> $(obj)/build.ht
+	printf "\n" >> $(obj)/build.ht
+	printf "#define COREBOOT_COMPILER \"$(shell LANG= $(CC) --version | head -n1)\"\n" >> $(obj)/build.ht
+	printf "#define COREBOOT_ASSEMBLER \"$(shell LANG= $(AS) --version | head -n1)\"\n" >> $(obj)/build.ht
+	printf "#define COREBOOT_LINKER \"$(shell LANG= $(LD) --version | head -n1)\"\n" >> $(obj)/build.ht
+	printf "#define COREBOOT_COMPILE_TIME \"`LANG= date +%T`\"\n" >> $(obj)/build.ht
+	printf "#define COREBOOT_COMPILE_BY \"$(subst \,@,$(shell PATH=$$PATH:/usr/ucb whoami))\"\n" >> $(obj)/build.ht
+	printf "#define COREBOOT_COMPILE_HOST \"$(shell hostname -s)\"\n" >> $(obj)/build.ht
+	printf "#define COREBOOT_COMPILE_DOMAIN \"$(shell test `uname -s` = "Linux" && dnsdomainname || domainname)\"\n" >> $(obj)/build.ht
+	printf "#include \"config.h\"\n" >> $(obj)/build.ht
+	mv $(obj)/build.ht $(obj)/build.h
+
+doxy: doxygen
+doxygen:
+	$(DOXYGEN) Doxyfile
+
+doxyclean: doxygen-clean
+doxygen-clean:
+	rm -rf $(DOXYGEN_OUTPUT_DIR)
+
+clean: doxygen-clean
+	rm -f $(allobjs) $(obj)/coreboot* .xcompile
+	rm -rf $(obj)/bootblock* $(obj)/romstage* $(obj)/location.*
+	rm -f $(obj)/option_table.* $(obj)/crt0_includes.h $(obj)/ldscript
+	rm -f $(obj)/mainboard/$(MAINBOARDDIR)/static.c $(obj)/mainboard/$(MAINBOARDDIR)/config.py $(obj)/mainboard/$(MAINBOARDDIR)/static.dot
+	rm -f $(obj)/mainboard/$(MAINBOARDDIR)/auto.inc $(obj)/mainboard/$(MAINBOARDDIR)/crt0.s $(obj)/mainboard/$(MAINBOARDDIR)/crt0.disasm
+	rmdir -p $(alldirs) 2>/dev/null >/dev/null || true
+	$(MAKE) -C util/sconfig clean
+
+distclean: clean
+	rm -rf $(obj)
+	rm -f .config .config.old ..config.tmp .kconfig.d .tmpconfig*
+
+update:
+	dongle.py -c /dev/term/1 $(obj)/coreboot.rom EOF
+
+# This include must come _before_ the pattern rules below!
+# Order _does_ matter for pattern rules.
+include util/kconfig/Makefile
+
+$(obj)/ldoptions: $(obj)/config.h
+	awk '/^#define ([^"])* ([^"])*$$/ {gsub("\\r","",$$3); print $$2 " = " $$3 ";";}' $< > $@
+
+_OS=$(shell uname -s |cut -c-7)
+STACK=
+ifeq ($(_OS),MINGW32)
+	STACK=-Wl,--stack,16384000
+endif
+ifeq ($(_OS),CYGWIN_)
+	STACK=-Wl,--stack,16384000
+endif
+$(obj)/romcc: $(top)/util/romcc/romcc.c
+	@printf "    HOSTCC     $(subst $(obj)/,,$(@)) (this may take a while)\n"
+	$(HOSTCC) -g -O2 $(STACK) -Wall -o $@ $<
+
+.PHONY: $(PHONY) prepare prepare2 clean distclean doxygen doxy coreboot
+

NEWS

@@ -1,68 +0,0 @@
-- 2.0.0
-  - this NEWS file is neglected in favor of the svn commit logs.
-    See http://snapshots.linuxbios.org/
-- 1.1.8
-  - Store everything in arch
-- 1.1.7
-  - The configuration language has been cleaned up.  No more link keyword.
-  - Everything is now in the device tree.
-  - The static and dynamic device trees have been unified
-  - Support for setting the pci subsystem vendor and pci subsystem device has been added.
-  - 64bit resource support
-  - Generic smbus support
-- 1.1.6
-  - pnp/superio devices are now handled cleanly with very little code
-  - Initial support for finding x86 BIST errors
-  - static resource assignments can now be specified in Config.lb
-  - special VGA I/O decode now should work
-  - added generic PCI error reporting enables
-  - build_opt_tbl now generates a header that allows cmos settings to
-    be read from romcc compiled code.
-  - split IORESOURCE_SET into IORESOURCE_ASSIGNED and IORESOURCE_STORED
-  - romcc now gracesfully handles function pointers instead of dying mysteriously
-  - First regression test in amdk8/raminit_test
-- 1.1.5
-  - O2, enums, and switch statements work in romcc
-  - Support for compiling romcc on non x86 platforms
-  - new romc options -msse and -mmmx for specifying extra registers to use
-  - Bug fixes to device the device disable/enable framework and an amd8111 implementation
-  - Move the link specification to the chip specification instead of the path
-  - Allow specifying devices with internal bridges.
-  - Initial via epia support
-  - Opteron errata fixes
-- 1.1.4
-  Major restructuring of hypertransport handling.
-  Major rewerite of superio/NSC/pc87360 as a proof of concept for handling superio resources dynamically
-  Updates to hard_reset handling when resetting because of the need to change hypertransport link
-    speeds and widths. 
-    (a) No longer assume the boot is good just because we get to a hard reset point.
-    (b) Set a flag to indicate that the BIOS triggered the reset so we don't decrement the
-        boot counter.
-  Updates to arima/hdama mptable so it tracks the new bus numbers
-- 1.1.3
-  Major update of the dyanmic device tree to so it can handle
-  * subtractive resources
-  * merging with the static device tree
-  * more device types than just pci
-- 1.1.2
-  Add back in the hard_reset method from freebios1 this allows generic
-  code to reset the box.  
-  Update the hypertransport setup code to automatically optimize
-  hypertransport link widths and frequencies, and to call hard_reset
-  if necessary for the changes to go into effect.
-- 1.1.1
-  Updates to the new configuration system so it works more reliably
-  Removed a bunch of unused configuration variables
-  Removed a bunch of unused assembly code
-- 1.1.0
-  A whole bunch of random ppc and opteron work we never put a good label on
-- 1.1.0
-Intial development release of LinuxBIOS.
-Everything is thrown overboard and will be reincluded as necessary so we can
-get rid of the legacy baggage.  Since LinuxBIOS was started we have developed
-some better techniques for some things, but we still hang on to the old ways
-because some ports that we want not to break depend on them.  So we preserve
-them by preserve the 1.0.x series and keeping only the best practices for
-the 1.1.x series.  When there is a stable port this code base will
-become LinuxBIOS 2.0.x and the core will become frozen.
-

README

@@ -0,0 +1,91 @@
+-------------------------------------------------------------------------------
+coreboot README
+-------------------------------------------------------------------------------
+
+coreboot is a Free Software project aimed at replacing the proprietary
+BIOS you can find in most of today's computers.
+
+It performs just a little bit of hardware initialization and then executes
+one of many possible payloads, e.g. a Linux kernel or a bootloader.
+
+
+Payloads
+--------
+
+After the basic initialization of the hardware has been performed, any
+desired "payload" can be started by coreboot.
+
+See http://www.coreboot.org/Payloads for a list of supported payloads.
+
+
+Supported Hardware
+------------------
+
+coreboot supports a wide range of chipsets, devices, and mainboards.
+
+For details please consult:
+
+ * http://www.coreboot.org/Supported_Motherboards
+ * http://www.coreboot.org/Supported_Chipsets_and_Devices
+
+
+Build Requirements
+------------------
+
+ * gcc / g++
+ * make
+ * python
+ * perl
+
+Optional:
+
+ * doxygen (for generating/viewing documentation)
+ * iasl (for targets with ACPI support)
+ * gdb (for better debugging facilities on some targets)
+ * ncurses (for 'make menuconfig')
+
+
+Building coreboot
+-----------------
+
+Please consult http://www.coreboot.org/Documentation for details.
+
+
+Testing coreboot Without Modifying Your Hardware
+-------------------------------------------------
+
+If you want to test coreboot without any risks before you really decide
+to use it on your hardware, you can use the QEMU system emulator to run
+coreboot virtually in QEMU.
+
+Please see http://www.coreboot.org/QEMU for details.
+
+
+Website and Mailing List
+------------------------
+
+Further details on the project, a FAQ, many HOWTOs, news, development
+guidelines and more can be found on the coreboot website:
+
+  http://www.coreboot.org
+
+You can contact us directly on the coreboot mailing list:
+
+  http://www.coreboot.org/Mailinglist
+
+
+Copyright and License
+---------------------
+
+The copyright on coreboot is owned by quite a large number of individual
+developers and companies. Please check the individual source files for details.
+
+coreboot is licensed under the terms of the GNU General Public License (GPL).
+Some files are licensed under the "GPL (version 2, or any later version)",
+and some files (mostly those derived from the Linux kernel) are licensed under
+the "GPL, version 2". For some parts, which were derived from other projects,
+other (GPL-compatible) licenses may apply. Please check the individual
+source files for details.
+
+This makes the resulting coreboot images licensed under the GPL, version 2.
+

documentation/Kconfig.tex

@@ -0,0 +1,500 @@
+\documentclass[10pt,letterpaper]{article}
+\usepackage[latin1]{inputenc}
+\usepackage{amsmath}
+\usepackage{amsfonts}
+\usepackage{amssymb}
+\author{Ron Minnich}
+\title{Kconfig usage in coreboot v2}
+\begin{document}
+\section{Introduction}
+This document describes how to use Kconfig in v2. We describe our usage of Kconfig files, Makefile.inc files, when and where to use them, how to use them, and, interestingly, when and where not to use them.
+\section{Kconfig variations}
+Most Kconfig files set variables, which can be set as part of the Kconfig dialog. Not all Kconfig variables are set by the user, however; some are too dangerous. These are merely enabled by the mainboard.
+
+For variables set by the user, see src/console/Kconfig.
+
+For variables not set by the user, see src/mainboard/amd/serengeti\_cheetah/Kconfig. Users should never set such variables as the cache as ram base. These are highly mainboard dependent.
+
+Kconfig files use the source command to include subdirectories. In most cases, save for limited cases described below, subdirectories have Kconfig files. They are always sourced unconditionally.
+
+\section{Makefile and Makefile.inc}
+There is only one Makefile, at the top level. All other makefiles are included as Makefile.inc. All the next-level Makefile.inc files are selected in the top level Makefile. Directories that are platform-independent are in BUILD-y; platform-dependent (e.g. Makefile.inc's that depend on architecture) are included in PLATFORM-y.
+
+Make is not recursive. There is only one make process.
+\subsection{subdirs usage}
+Further includes of Makefile.inc, if needed, are done via subdirs-y commands. As in Linux, the subdirs can be conditional or unconditional. Conditional includes are done via subdirs-\$(CONFIG\_VARIABLE) usage; unconditional are done via subdirs-y.
+
+We define the common rules for which variation to use below.
+\subsection{object file specification}
+There are several different types of objects specified in the tree. They are:
+\begin{description}
+\item[obj]objects for the ram part of the code
+\item[driver]drivers for the ram part. Drivers are not represented in the device tree but do have a driver struct attached in the driver section.
+\item[initobj]seperately-compiled code for the ROM section of coreboot
+\end{description}
+These items are specified via the -y syntax as well. Conditional object inclusion is done via the -\$(CONFIG\_VARIABLE) syntax.
+
+\section{Example: AMD serengeti cheetah}
+\subsection{mainboard/Kconfig}
+Defines Vendor variables. Currently defined variables are:
+Sources all Kconfig files in the vendor directories.
+\input{ mainboardkconfig.tex}
+\subsection{mainboard/Makefile.inc}
+There is none at this time.
+\subsection{mainboard/$<$vendor$>$/Kconfig}
+We use the amd as a model. The only action currently taken is to source all Kconfig's in the
+subdirectories.
+\subsection{mainboard/$<$vendor$>$/Makefile.inc}
+We use amd as a model. There is currently no Makefile.inc at this level.
+\subsection{mainboard/$<$vendor$>$/$<$board$>$/Kconfig}
+The mainboard Kconfig and Makefile.inc are designed to be the heart of the build. The defines
+and rules in here determine everything about how a mainboard target is built.
+We will use serengeti\_cheetah as a model. It defines these variables.
+\input{ mainboardkconfig.tex}
+\subsection{mainboard/$<$vendor$>$/$<$board$>$/Makefile.inc}
+This is a fairly complex Makefile.inc. Because this is such a critical component, we are going to excerpt and take it piece by piece.
+Note that this is the mainboard as of August, 2009, and it may change over time.
+\subsubsection{objects}
+We define objects in the first part. The mainbard itself is a driver and included unconditionally. Other objects are conditional:
+\begin{verbatim}
+driver-y +=  mainboard.o
+
+#needed by irq_tables and mptable and acpi_tables
+obj-y += get_bus_conf.o
+obj-$(CONFIG_HAVE_MP_TABLE) += mptable.o
+obj-$(CONFIG_HAVE_PIRQ_TABLE) += irq_tables.o
+obj-$(CONFIG_HAVE_ACPI_TABLES) +=  dsdt.o
+obj-$(CONFIG_HAVE_ACPI_TABLES) +=  acpi_tables.o
+obj-$(CONFIG_HAVE_ACPI_TABLES) +=  fadt.o
+
+#./ssdt.o is in northbridge/amd/amdk8/Config.lb
+obj-$(CONFIG_ACPI_SSDTX_NUM) +=  ssdt2.o
+obj-$(CONFIG_ACPI_SSDTX_NUM) +=  ssdt3.o
+obj-$(CONFIG_HAVE_ACPI_TABLES) +=  ssdt4.o
+driver-y += ../../../drivers/i2c/i2cmux/i2cmux.o
+
+# This is part of the conversion to init-obj and away from included code.
+
+initobj-y += crt0.o
+\end{verbatim}
+\subsubsection{romcc legacy support}
+We hope to move away from romcc soon, but for now, if one is using romcc, the Makefile.inc must define
+crt0 include files (assembly code for startup, usually); and several ldscripts. These are taken directly from the
+old Config.lb. Note that these use the -y syntax and can use the ability to be included conditionally.
+\begin{verbatim}
+crt0-y += ../../../../src/cpu/x86/16bit/entry16.inc
+crt0-y += ../../../../src/cpu/x86/32bit/entry32.inc
+crt0-y += ../../../../src/cpu/x86/16bit/reset16.inc
+crt0-y += ../../../../src/arch/i386/lib/id.inc
+crt0-y += ../../../../src/cpu/amd/car/cache_as_ram.inc
+crt0-y += auto.inc
+
+ldscript-y += ../../../../src/arch/i386/init/ldscript_fallback_cbfs.lb
+ldscript-y += ../../../../src/cpu/x86/16bit/entry16.lds
+ldscript-y += ../../../../src/cpu/x86/16bit/reset16.lds
+ldscript-y += ../../../../src/arch/i386/lib/id.lds
+ldscript-y += ../../../../src/arch/i386/lib/failover.lds
+
+\end{verbatim}
+\subsubsection{POST\_EVALUATION}
+POST\_EVALUATION rules should be placed after this section:
+\begin{verbatim}
+ifdef POST_EVALUATION
+\end{verbatim}
+to ensure that the values of variables are correct.
+Here are the post-evaluation rules for this mainboard:
+\begin{verbatim}
+$(obj)/dsdt.c: $(src)/mainboard/$(MAINBOARDDIR)/dsdt.asl
+  iasl -p dsdt -tc $(src)/mainboard/$(MAINBOARDDIR)/dsdt.asl
+  mv dsdt.hex $@
+
+$(obj)/mainboard/$(MAINBOARDDIR)/dsdt.o: $(obj)/dsdt.c
+  $(CC) $(DISTRO_CFLAGS) $(CFLAGS) $(CPPFLAGS) $(DEBUG_CFLAGS) -I$(src) -I. -c $< -o $@
+
+$(obj)/ssdt2.c: $(src)/mainboard/$(MAINBOARDDIR)/dx/pci2.asl
+  iasl -p $(CURDIR)/pci2 -tc $(CONFIG_MAINBOARD)/dx/pci2.asl
+  perl -pi -e 's/AmlCode/AmlCode_ssdt2/g' pci2.hex
+  mv pci2.hex ssdt2.c
+
+$(obj)/ssdt3.c: $(src)/mainboard/$(MAINBOARDDIR)/dx/pci3.asl"
+  iasl -p $(CURDIR)/pci3 -tc $(CONFIG_MAINBOARD)/
+  perl -pi -e 's/AmlCode/AmlCode_ssdt3/g' pci3.hex
+  mv pci3.hex ssdt3.c
+  
+$(obj)/ssdt4.c: $(src)/mainboard/$(MAINBOARDDIR)/dx/pci4.asl"
+  iasl -p $(CURDIR)/pci4 -tc $(CONFIG_MAINBOARD)/dx/pci4.asl
+  perl -pi -e 's/AmlCode/AmlCode_ssdt4/g' pci4.hex
+  mv pci4.hex ssdt4.c
+
+$(obj)/mainboard/$(MAINBOARDDIR)/auto.inc: $(src)/mainboard/$(MAINBOARDDIR)/rom.c $(obj)/option_table.h
+  $(CC) $(DISTRO_CFLAGS) $(CFLAGS) $(CPPFLAGS) $(DEBUG_CFLAGS) -I$(src) -I. -c -S  $(src)/mainboard/$(MAINBOARDDIR)/rom.c -o $@
+  perl -e 's/\.rodata/.rom.data/g' -pi $@
+  perl -e 's/\.text/.section .rom.text/g' -pi $@
+
+\end{verbatim}
+The last rule is for romcc, and, again, we hope to eliminate romcc usage and this rule soon. The first set of rules concern ACPI tables.
+\subsubsection{devicetree.cb}
+Most of the old Config.lb is gone, but one piece remains: the device tree specification. This tree is still required to build a mainboard
+properly, as it defines topology and chips that can be defined no other way.
+Let's go through the tree.
+\begin{verbatim}
+chip northbridge/amd/amdk8/root_complex
+  device apic_cluster 0 on
+    chip cpu/amd/socket_F
+      device apic 0 on end
+    end
+  end
+\end{verbatim}
+This topology is always somewhat confusing to newcomers, and even to coreboot veterans.
+
+We root the tree at the pci-e {\it root complex}. There is always the question of how and where to root the tree. Over the years we
+have found that the one part that never goes away is the root complex. CPU sockets may be empty or full; but there is always a northbridge
+somewhere, since it runs memory.
+
+
+What is the APIC? Northbridges always have an Advanced Programmable Interrupt Controller, and that {\it APIC cluster} is a topological connection to the
+CPU socket. So the tree is rooted at the northbridge, which has a link to an apic cluster, and then the CPU. The CPU contains
+its own APIC, and will define any parameters needed. In this case, we have a northbridge of type
+{\it northbridge/amd/amdk8/root\_complex}, with its own apic\_cluster device which we turn on,
+which connects to a {\it cpu/amd/socket\_F},
+which has an apic, which is on.
+
+Note that we do not enumerate all CPUs, even on this SMP mainboard. The reason is they may not all be there. The CPU we define here
+is the so-called Boot Strap Processor, or BSP; the other CPUs will come along later, as the are discovered. We do not require (unlike many
+BIOSes) that the BSP be CPU 0; any CPU will do.
+\begin{verbatim}
+  device pci_domain 0 on
+    chip northbridge/amd/amdk8
+      device pci 18.0 on #  northbridge
+        #  devices on link 0, link 0 == LDT 0
+\end{verbatim}
+Here begins the pci domain, which usually starts with 0. Then there is the northbridge, which bridges to the PCI bus. On
+Opterons, certain CPU control registers are managed in PCI config space in device 18.0 (BSP), 19.0 (AP), and up.
+\begin{verbatim}
+        chip southbridge/amd/amd8132
+          # the on/off keyword is mandatory
+          device pci 0.0 on end
+          device pci 0.1 on end
+          device pci 1.0 on end
+          device pci 1.1 on end
+        end
+\end{verbatim}
+This is the 8132, a bridge to a secondary PCI bus.
+\begin{verbatim}
+        chip southbridge/amd/amd8111
+          # this "device pci 0.0" is the parent the next one
+          # PCI bridge
+          device pci 0.0 on
+            device pci 0.0 on end
+            device pci 0.1 on end
+            device pci 0.2 off end
+            device pci 1.0 off end
+          end
+\end{verbatim}
+The 8111 is a bridge to other busses and to the legacy ISA devices such as superio.
+\begin{verbatim}
+          device pci 1.0 on
+            chip superio/winbond/w83627hf
+              device pnp 2e.0 off #  Floppy
+                 io 0x60 = 0x3f0
+                irq 0x70 = 6
+                drq 0x74 = 2
+              end
+              device pnp 2e.1 off #  Parallel Port
+                 io 0x60 = 0x378
+                irq 0x70 = 7
+              end
+              device pnp 2e.2 on #  Com1
+                 io 0x60 = 0x3f8
+                irq 0x70 = 4
+              end
+              device pnp 2e.3 off #  Com2
+                 io 0x60 = 0x2f8
+                irq 0x70 = 3
+              end
+              device pnp 2e.5 on #  Keyboard
+                 io 0x60 = 0x60
+                 io 0x62 = 0x64
+                irq 0x70 = 1
+                irq 0x72 = 12
+              end
+              device pnp 2e.6 off #  CIR
+                io 0x60 = 0x100
+              end
+              device pnp 2e.7 off #  GAME_MIDI_GIPO1
+                io 0x60 = 0x220
+                io 0x62 = 0x300
+                irq 0x70 = 9
+              end
+              device pnp 2e.8 off end #  GPIO2
+              device pnp 2e.9 off end #  GPIO3
+              device pnp 2e.a off end #  ACPI
+              device pnp 2e.b on #  HW Monitor
+                  io 0x60 = 0x290
+                irq 0x70 = 5
+              end
+            end
+          end
+\end{verbatim}
+The pnp refers to the many Plug N Play devices on a superio. 2e refers to the base I/O address of the superio, and the number following the
+2e (i.e. 2e.1) is the Logical Device Number, or LDN. Each LDN has a common configuration (base, irq, etc.) and these are set by the statements under the LDN.
+\begin{verbatim}
+          device pci 1.1 on end
+          device pci 1.2 on end
+\end{verbatim}
+More devices. These statements set up placeholders in the device tree.
+\begin{verbatim}
+          device pci 1.3 on
+            chip drivers/i2c/i2cmux # pca9556 smbus mux
+              device i2c 18 on #0 pca9516 1
+                chip drivers/generic/generic #dimm 0-0-0
+                  device i2c 50 on end
+                end
+                chip drivers/generic/generic #dimm 0-0-1
+                  device i2c 51 on end
+                end
+                chip drivers/generic/generic #dimm 0-1-0
+                  device i2c 52 on end
+                end
+                chip drivers/generic/generic #dimm 0-1-1
+                  device i2c 53 on end
+                end
+              end
+              device i2c 18 on #1 pca9516 2
+                chip drivers/generic/generic #dimm 1-0-0
+                  device i2c 50 on end
+                end
+                chip drivers/generic/generic #dimm 1-0-1
+                  device i2c 51 on end
+                end
+                chip drivers/generic/generic #dimm 1-1-0
+                  device i2c 52 on end
+                end
+                chip drivers/generic/generic #dimm 1-1-1
+                  device i2c 53 on end
+                end
+                chip drivers/generic/generic #dimm 1-2-0
+                  device i2c 54 on end
+                end
+                chip drivers/generic/generic #dimm 1-2-1
+                  device i2c 55 on end
+                end
+                chip drivers/generic/generic #dimm 1-3-0
+                  device i2c 56 on end
+                end
+                chip drivers/generic/generic #dimm 1-3-1
+                  device i2c 57 on end
+                end
+              end
+            end
+          end # acpi
+\end{verbatim}
+These are the i2c devices.
+\begin{verbatim}
+          device pci 1.5 off end
+          device pci 1.6 off end
+\end{verbatim}
+More placeholders.
+\begin{verbatim}
+               register "ide0_enable" = "1"
+          register "ide1_enable" = "1"
+        end
+      end #  device pci 18.0
+
+\end{verbatim}
+These "register" commands set controls in the southbridge.
+\begin{verbatim}
+           device pci 18.0 on end
+      device pci 18.0 on end
+\end{verbatim}
+These are the other two hypertransport links.
+\begin{verbatim}
+      device pci 18.1 on end
+      device pci 18.2 on end
+      device pci 18.3 on end
+\end{verbatim}
+The 18.1 devices are, again, northbridge control for various k8 functions.
+\begin{verbatim}
+    end
+  \end{verbatim}
+That's it for the BSP I/O and HT busses. Now we begin the AP busses. Not much here.
+\begin{verbatim}
+        chip northbridge/amd/amdk8
+      device pci 19.0 on #  northbridge
+        chip southbridge/amd/amd8151
+          # the on/off keyword is mandatory
+          device pci 0.0 on end
+          device pci 1.0 on end
+        end
+      end #  device pci 19.0
+
+      device pci 19.0 on end
+      device pci 19.0 on end
+      device pci 19.1 on end
+      device pci 19.2 on end
+      device pci 19.3 on end
+    end
+
+
+\end{verbatim}
+\begin{verbatim}
+  end #pci_domain
+#  chip drivers/generic/debug
+#    device pnp 0.0 off end # chip name
+#    device pnp 0.1 on end # pci_regs_all
+#    device pnp 0.2 off end # mem
+#    device pnp 0.3 off end # cpuid
+#    device pnp 0.4 off end # smbus_regs_all
+#    device pnp 0.5 off end # dual core msr
+#    device pnp 0.6 off end # cache size
+#    device pnp 0.7 off end # tsc
+#       end
+
+end
+\end{verbatim}
+This is a trick used to debug by creating entries in the device tree.
+
+\subsection{cpu socket}
+The CPU socket is the key link from mainboard to its CPUs. Since many models of CPU can go in a socket, the mainboard mentions only
+the socket, and the socket, in turn, references the various model CPUs which can be plugged into it. The socket is thus the focus
+of all defines and Makefile controls for building the CPU components of a board.
+
+\subsubsection{ cpu/Kconfig}
+Defines variables. Current variables are:
+\input{cpukconfig.tex}
+Sources all Kconfig files in the vendor directories.
+\subsubsection{ cpu/Makefile.inc}
+Unconditionally sources all Makefile.inc in the vendor directories.
+
+\subsection{cpu/$<$vendor$>$/Kconfig}
+The only action currently taken is to source all Kconfig's in the
+subdirectories.
+\subsection{cpu/$<$vendor$>$/Makefile.inc}
+{\em Conditionally} source the socket directories.
+Example:
+\begin{verbatim}
+subdirs-$(CONFIG_CPU_AMD_SOCKET_F) += socket_F
+\end{verbatim}
+.
+CONFIG\_CPU\_AMD\_SOCKET\_F is set in a mainboard file.
+
+\subsection{cpu/$<$vendor$>$/$<$socket$>$/Kconfig}
+Set variables that relate to this {\em socket}, and {\em any models that plug into this socket}. Note that
+the socket, as much as possible, should control the models, because the models may plug into many sockets.
+Socket\_F currently sets:
+\input{socketfkconfig.tex}
+
+It sources only those Kconfigs that relate to this particular socket, i.e. not all possible models are sourced.
+
+\subsection{cpu/$<$vendor$>$/$<$model$>$/Kconfig}
+CPU Model Kconfigs only set variables, We do not expect that they will source any other Kconfig. The socket Kconfig should do that
+if needed.
+\subsection{cpu/$<$vendor$>$/$<$model$>$/Makefile.inc}
+The Makefile.inc {\em unconditionally} specifies drivers and objects to be included in the build. There is no conditional
+compilation at this point. IF a socket is included, it includes the models. If a model is included, it should include {em all}
+objects, because it is not possible to determine at build time what options may be needed for a given model CPU.
+This Makefile.inc includes no other Makefile.inc files; any inclusion should be done in the socket Makefile.inc.
+
+\subsection{northbridge}
+\subsubsection{northbridge/Kconfig}
+No variables. Source all vendor directory Kconfigs.
+\subsubsection{northbridge/Makefile.inc}
+No variables. unconditionally include all vendor Makefile.inc
+\subsubsection{northbridge/$<$vendor$>$/Kconfig}
+No variables. Source all chip directory Kconfigs.
+\subsubsection{northbridge/$<$vendor$>$/Makefile.inc}
+No variables. {\em Conditionally} include all chipset Makefile.inc. The variable
+is the name of the part, e.g.
+\begin{verbatim}
+subdirs-$(CONFIG_NORTHBRIDGE_AMD_AMDK8) += amdk8
+\end{verbatim}
+.
+\subsubsection{northbridge/$<$vendor$>$/$<$chip$>$/Kconfig}
+Typically a small number of variables. One defines the part name. Here is an example
+of the variables defined for the K8.
+\begin{verbatim}
+config NORTHBRIDGE_AMD_AMDK8
+  bool
+  default n
+
+config AGP_APERTURE_SIZE
+  hex
+  default 0x4000000
+
+config HAVE_HIGH_TABLES
+  int
+  default 1
+\end{verbatim}
+\subsubsection{northbridge/$<$vendor$>$/$<$chip$>$/Makefile.inc}
+Typically very small set of rules, and very simple.
+Since this file is already conditionally included,
+we don't need to test for the chipset CONFIG variable. We
+can therefore test other variables (which is part of the reason
+we set up conditional inclusion of this file, instead
+of unconditionally including it). Here is an example from AMD K8.
+Note that we can make a variable conditional on the ACPI tables.
+\begin{verbatim}
+driver-y += northbridge.o
+driver-y += misc_control.o
+obj-y +=  get_sblk_pci1234.o
+obj-$(CONFIG_HAVE_ACPI_TABLES) +=  amdk8_acpi.o
+\end{verbatim}
+
+\subsection{southbridge}
+\subsubsection{southbridge/Kconfig}
+No variables. Source all vendor directory Kconfigs.
+\subsubsection{southbridge/Makefile.inc}
+No variables. {\em Unconditionally} include all vendor Makefile.inc
+\subsubsection{southbridge/$<$vendor$>$/Kconfig}
+No variables. Source all chip directory Kconfigs.
+\subsubsection{southbridge/$<$vendor$>$/Makefile.inc}
+No variables. {\em Conditionally} include all chipset Makefile.inc. The variable
+is the name of the part, e.g.
+\begin{verbatim}
+subdirs-$(CONFIG_SOUTHBRIDGE_AMD_AMD8111) += amd8111
+\end{verbatim}
+.
+\subsubsection{southbridge/$<$vendor$>$/$<$chip$>$/Kconfig}
+Typically a small number of variables. One defines the part name. Here is an example
+of the variables defined for the K8.
+\begin{verbatim}
+config SOUTHBRIDGE_AMD_AMD8111
+	bool
+	default n
+
+\end{verbatim}
+\subsubsection{southbridge/$<$vendor$>$/$<$chip$>$/Makefile.inc}
+Typically very small set of rules, and very simple.
+Since this file is already conditionally included,
+we don't need to test for the chipset CONFIG variable. We
+can therefore test other variables (which is part of the reason
+we set up conditional inclusion of this file, instead
+of unconditionally including it). Here is an example from AMD 8111.
+No conditionals in this one yet. 
+\begin{verbatim}
+driver-y += amd8111.o
+driver-y += amd8111_usb.o
+driver-y += amd8111_lpc.o
+driver-y += amd8111_ide.o
+driver-y += amd8111_acpi.o
+driver-y += amd8111_usb2.o
+driver-y += amd8111_ac97.o
+driver-y += amd8111_nic.o
+driver-y += amd8111_pci.o
+driver-y += amd8111_smbus.o
+obj-y += amd8111_reset.o
+\end{verbatim}
+
+\subsubsection{vendor and part}
+\subsection{southbridge}
+\subsubsection{vendor and part}
+\subsection{superio}
+\subsection{drivers/i2c}
+This is a rather special case. There are no Kconfig files or Makefile.inc files here. They are not needed.
+To compile in one of these files, name the .o directory. E.g. in serengeti\_cheetah we have:
+\begin{verbatim}
+\end{verbatim}
+
+\subsubsection{vendor and part}
+
+\end{document}

documentation/Makefile

@@ -1,5 +1,5 @@
 #
-# Makefile for LinuxBIOS paper.
+# Makefile for coreboot paper.
 # hacked together by Stefan Reinauer <stepan@openbios.org>
 #
 
@@ -7,14 +7,29 @@ PDFLATEX=pdflatex -t a4
 
 FIGS=codeflow.pdf hypertransport.pdf
 
-all: LinuxBIOS-AMD64.pdf 
+all: LinuxBIOS-AMD64.pdf Kconfig.pdf
 
+SVG2PDF=$(shell which svg2pdf)
+INKSCAPE=$(shell which inkscape)
+CONVERT=$(shell which convert)
 
-codeflow.pdf: codeflow.eps
-	epstopdf $< -o=$@
+codeflow.pdf: codeflow.svg
+ifneq ($(strip $(SVG2PDF)),)
+	svg2pdf $< $@
+else ifneq ($(strip $(INKSCAPE)),)
+	inkscape $< --export-pdf=$@
+else ifneq ($(strip $(CONVERT)),)
+	convert $< $@
+endif
 
-hypertransport.pdf: hypertransport.eps
-	epstopdf $< -o=$@
+hypertransport.pdf: hypertransport.svg
+ifneq ($(strip $(SVG2PDF)),)
+	svg2pdf $< $@
+else ifneq ($(strip $(INKSCAPE)),)
+	inkscape $< --export-pdf=$@
+else ifneq ($(strip $(CONVERT)),)
+	convert $< $@
+endif
 
 LinuxBIOS-AMD64.toc: $(FIGS) LinuxBIOS-AMD64.tex 
 	# 2 times to make sure we have a current toc.
@@ -24,10 +39,33 @@ LinuxBIOS-AMD64.toc: $(FIGS) LinuxBIOS-AMD64.tex
 LinuxBIOS-AMD64.pdf: $(FIGS) LinuxBIOS-AMD64.tex LinuxBIOS-AMD64.toc
 	$(PDFLATEX) LinuxBIOS-AMD64.tex
 
+Kconfig.pdf: Kconfig.tex mainboardkconfig.tex cpukconfig.tex socketfkconfig.tex
+	$(PDFLATEX) $<
+
+# quick, somebody! make me a macro!
+mainboardkconfig.tex: ../src/mainboard/Kconfig
+	cat beginverbatim.tex  > $@
+	grep '^config' $< | awk '{print $2}'  >>$@
+	cat endverbatim.tex  >> $@
+
+skconfig.tex: ../src/mainboard/amd/serengeti_cheetah/Kconfig
+	cat beginverbatim.tex  > $@
+	grep '^config' $< | awk '{print $2}'  >>$@
+	cat endverbatim.tex  >> $@
+
+cpukconfig.tex: ../src/cpu/Kconfig
+	cat beginverbatim.tex  > $@
+	grep '^config' $< | awk '{print $2}'  >>$@
+	cat endverbatim.tex  >> $@
+
+socketfkconfig.tex: ../src/cpu/amd/socket_F/Kconfig
+	cat beginverbatim.tex  > $@
+	grep '^config' $< | awk '{print $2}'  >>$@
+	cat endverbatim.tex  >> $@
+
 clean:
-	rm -f *.aux *.idx *.log *.toc *.out $(FIGS)
+	rm -f *.aux *.idx *.log *.toc *.out $(FIGS) mainboardkconfig.tex skconfig.tex cpukconfig.tex socketfkconfig.tex
 
 distclean: clean
-	rm -f LinuxBIOS-AMD64.pdf
-	
-	
+	rm -f LinuxBIOS-AMD64.pdf Kconfig.pdf
+

documentation/POSTCODES

@@ -0,0 +1,26 @@
+-------------------------------------------------------------------------------
+coreboot POST Codes
+-------------------------------------------------------------------------------
+
+This is an (incomplete) list of POST codes emitted by coreboot v2.
+
+0x10 Entry into protected mode
+0x01 Entry into 'crt0.s' reset code jumps to here
+0x11 Start copying LinuxBIOS to RAM with decompression if compressed
+0x12 Copy/decompression finished jumping to RAM
+0x80 Entry into LinuxBIOS in RAM
+0x13 Entry into c_start
+0xfe Pre call to hardwaremain()
+0x39 Console is initialized
+0x40 Console boot message succeeded
+0x66 Devices have been enumerated
+0x88 Devices have been configured
+0x89 Devices have been enabled
+0xf8 Entry into elf boot
+0xf3 Jumping to payload
+
+Errors (used in several places):
+
+0xee Not supposed to get here
+0xff Elfload fail or die() called
+

documentation/RFC/chip.tex

@@ -28,7 +28,7 @@ The specification looks like this:
 chip <name> [path=<path>] ["<configuration>"]
 \end{verbatim}
 The name is in the standard LinuxBIOS form of type/vendor/name, e.g. 
-"southbridge/intel/piix4e" or "superio/ITE/it8671f". The class of the 
+"southbridge/intel/piix4e" or "superio/ite/it8671f". The class of the 
 chip is derived from the first pathname component of the name, and the chip 
 configuration is derived from the following components. 
 
@@ -50,9 +50,9 @@ each individual chip and an array of pointers to these structures.
 For each chip, there are two structures. The structures contain control 
 information for the chip, and register initialization information. The 
 names of the structures are derived by ``flattening'' the chip name, 
-as in the current linuxbios. For example, superio/ITE/xyz uses 
-two structs, one called superio_ITE_xyz_control and one called
-superio_ITE_xyz_init. The control struct is initialized from the 
+as in the current linuxbios. For example, superio/ite/xyz uses 
+two structs, one called superio_ite_xyz_control and one called
+superio_ite_xyz_init. The control struct is initialized from the 
 chip name and path information, and has a pointer to the 
 config struct. The config struct is initialized from the quote string
 

documentation/RFC/config.tex

@@ -58,7 +58,7 @@ default ::= 'default' ID '=' (``value'' | term)
 # as they are specified. To attach a superio to a southbridge, for
 # example, one would do this:
 # southbridge acer/5432 
-#   superio NSC/123 
+#   superio nsc/123 
 #   end 
 # end
 # the tool generates static initializers for this hierarchy.
@@ -173,7 +173,7 @@ A sample file:
 target x
 
 # over-ride the default rom size in the mainboard file
-option ROM_SIZE=1024*1024
+option CONFIG_ROM_SIZE=1024*1024
 mainboard amd/solo
 end
 
@@ -188,8 +188,8 @@ Sample mainboard file
 arch i386 end
 cpu k8 end
 #
-option DEBUG=1
-default USE_FALLBACK_IMAGE=1
+option CONFIG_DEBUG=1
+default CONFIG_USE_FALLBACK_IMAGE=1
 option A=(1+2)
 option B=0xa
 #
@@ -204,7 +204,7 @@ ldscript cpu/i386/entry32.lds
 ###
 ### Build our reset vector (This is where linuxBIOS is entered)
 ###
-if USE_FALLBACK_IMAGE 
+if CONFIG_USE_FALLBACK_IMAGE 
 	mainboardinit cpu/i386/reset16.inc 
 	ldscript cpu/i386/reset16.lds 
 else
@@ -214,15 +214,15 @@ end
 .
 .
 .
-if USE_FALLBACK_IMAGE mainboardinit arch/i386/lib/noop_failover.inc  end
+if CONFIG_USE_FALLBACK_IMAGE mainboardinit arch/i386/lib/noop_failover.inc  end
 #
 ###
 ### Romcc output
 ###
-#makerule ./failover.E dep "$(MAINBOARD)/failover.c" act "$(CPP) -I$(TOP)/src $(CPPFLAGS) $(MAINBOARD)/failover.c > ./failever.E"
+#makerule ./failover.E dep "$(CONFIG_MAINBOARD)/failover.c" act "$(CPP) -I$(TOP)/src $(CPPFLAGS) $(CONFIG_MAINBOARD)/failover.c > ./failever.E"
 #makerule ./failover.inc dep "./romcc ./failover.E" act "./romcc -O ./failover.E > failover.inc"
 #mainboardinit ./failover.inc
-makerule ./auto.E dep "$(MAINBOARD)/auto.c" act "$(CPP) -I$(TOP)/src -$(ROMCCPPFLAGS) $(CPPFLAGS) $(MAINBOARD)/auto.c > ./auto.E"
+makerule ./auto.E dep "$(CONFIG_MAINBOARD)/auto.c" act "$(CPP) -I$(TOP)/src -$(ROMCCPPFLAGS) $(CPPFLAGS) $(CONFIG_MAINBOARD)/auto.c > ./auto.E"
 makerule ./auto.inc dep "./romcc ./auto.E" act "./romcc -O ./auto.E > auto.inc"
 mainboardinit ./auto.inc
 #
@@ -234,7 +234,7 @@ end
 southbridge amd/amd8111
 end
 #mainboardinit arch/i386/smp/secondary.inc
-superio NSC/pc87360
+superio nsc/pc87360
 	register "com1={1} com2={0} floppy=1 lpt=1 keyboard=1"
 end
 dir /pc80
@@ -250,8 +250,8 @@ cpu k8 end
 ##object mainboard.o
 driver mainboard.o
 object static_devices.o
-if HAVE_MP_TABLE object mptable.o end
-if HAVE_PIRQ_TABLE object irq_tables.o end
+if CONFIG_HAVE_MP_TABLE object mptable.o end
+if CONFIG_HAVE_PIRQ_TABLE object irq_tables.o end
 ### Location of the DIMM EEPROMS on the SMBUS
 ### This is fixed into a narrow range by the DIMM package standard.
 ###
@@ -261,8 +261,8 @@ option SMBUS_MEM_DEVICE_INC=1
 #
 ### The linuxBIOS bootloader.
 ###
-option PAYLOAD_SIZE            = (ROM_SECTION_SIZE - ROM_IMAGE_SIZE)
-option CONFIG_ROM_STREAM_START = (0xffffffff - ROM_SIZE + ROM_SECTION_OFFSET + 1)
+option CONFIG_PAYLOAD_SIZE            = (CONFIG_ROM_SECTION_SIZE - CONFIG_ROM_IMAGE_SIZE)
+option CONFIG_ROM_PAYLOAD_START = (0xffffffff - CONFIG_ROM_SIZE + CONFIG_ROM_SECTION_OFFSET + 1)
 #
 
 \end{verbatim}
@@ -272,17 +272,17 @@ handle. Makefile.settings looks like this, for example:
 \begin{verbatim}
 TOP:=/home/rminnich/src/yapps2/freebios2
 TARGET_DIR:=x
-export MAINBOARD:=/home/rminnich/src/yapps2/freebios2/src/mainboard/amd/solo
-export ARCH:=i386
-export _RAMBASE:=0x4000
-export ROM_IMAGE_SIZE:=65535
-export PAYLOAD_SIZE:=131073
+export CONFIG_MAINBOARD:=/home/rminnich/src/yapps2/freebios2/src/mainboard/amd/solo
+export CONFIG_ARCH:=i386
+export CONFIG_RAMBASE:=0x4000
+export CONFIG_ROM_IMAGE_SIZE:=65535
+export CONFIG_PAYLOAD_SIZE:=131073
 export CONFIG_MAX_CPUS:=1
-export HEAP_SIZE:=8192
-export STACK_SIZE:=8192
-export MEMORY_HOLE:=0
-export LINUXBIOS_VERSION:=1.1.0
-export CC:=$(CROSS_COMPILE)gcc
+export CONFIG_HEAP_SIZE:=8192
+export CONFIG_STACK_SIZE:=8192
+export CONFIG_MEMORY_HOLE:=0
+export COREBOOT_VERSION:=1.1.0
+export CC:=$(CONFIG_CROSS_COMPILE)gcc
 
 \end{verbatim}
 

documentation/beginverbatim.tex

@@ -0,0 +1 @@
+\begin{verbatim}

documentation/cbfs.txt

@@ -0,0 +1,409 @@
+
+Received: from www.crouse-house.com ([199.45.160.146]
+	for coreboot@coreboot.org; Fri, 19 Dec 2008 23:11:59 +0100
+From: Jordan Crouse <jordan@cosmicpenguin.net>
+
+
+Greetings.  I apologize for the incompleteness of what I am about to 
+discuss.  I was planning on working on it leisurely, but my employment 
+circumstances changed and I've been trying to get it completed in a 
+hurry before I had to leave it behind.
+
+I've been thinking a lot about LAR lately, and ways to make it more 
+extensible and robust.  Marc and I have been trading ideas back and 
+forth for a number of months, and over time a clear idea of what I 
+wanted to do started to take shape.
+
+My goal was to add small things to LAR while retaining the overall 
+scheme.  Over time, the scheme evolved slightly, but I think you'll find 
+that it remains true to the original idea.  Below is the beginnings of 
+an architecture document - I did it in text form, but if met with 
+aclaim, it should be wikified.  This presents what I call CBFS - the 
+next generation LAR for next generation Coreboot.  Its easier to 
+describe what it is by describing what changed:
+
+A header has been added somewhere in the bootblock similar to Carl 
+Daniel's scheme.  In addition to the coreboot information, the header 
+reports the size of the ROM, the alignment of the blocks, and the offset 
+of the first component in the CBFS.   The master header provides all 
+the information LAR needs plus the magic number information flashrom needs.
+
+Each "file" (or component, as I style them) now has a type associated 
+with it. The type is used by coreboot to identify the type of file that 
+it is loading, and it can also be used by payloads to group items in the 
+CBFS by type (i.e - bayou can ask for all components that are payloads).
+
+The header on each "file" (or component, as I like to style them) has 
+been simplified - We now only store the length, the type, the checksum, 
+and the offset to the data.  The name scheme remains the same.  The 
+addtional information, which is component specific, has been moved to 
+the component itself (see below).
+
+The components are arranged in the ROM aligned along the specified 
+alignment from the master header - this is to facilitate partial re-write.
+
+Other then that, the LAR ideas remain pretty much the same.
+
+The plan for moving the metadata to the components is to allow many 
+different kinds of components, not all of which are groked by coreboot. 
+  However, there are three essential component types that are groked by 
+coreboot, and they are defined:
+
+stage - the stage is being parsed from the original ELF, and stored in 
+the ROM as a single blob of binary data.  The load address, start 
+address, compression type and length are stored in the component sub-header.
+
+payload - this is essentially SELF in different clothing - same idea as 
+SELF, with the sub-header as above.
+
+optionrom - This is in flux - right now, the optionrom is stored 
+unadulterated and uncompressed, but that is likely to be changed.
+
+Following this email are two replies containing the v3 code and a new 
+ROM tool to implement this respectively.  I told you that I was trying 
+to get this out before I disappear, and I'm not kidding - the code is 
+compile tested and not run-tested.  I hope that somebody will embrace 
+this code and take it the rest of the way, otherwise it will die a 
+pretty short death.
+
+I realize that this will start an awesome flamewar, and I'm looking 
+forward to it.  Thanks for listening to me over the years - and good 
+luck with coreboot.  When you all make a million dollars, send me a few 
+bucks, will you?
+
+Jordan
+
+Coreboot CBFS Specification
+Jordan Crouse <jordan@cosmicpenguin.net>
+
+= Introduction =
+
+This document describes the coreboot CBFS specification (from here
+referred to as CBFS).  CBFS is a scheme for managing independent chunks
+of data in a system ROM.  Though not a true filesystem, the style and
+concepts are similar.
+
+
+= Architecture =
+
+The CBFS architecture looks like the following:
+
+/---------------\ <-- Start of ROM
+| /-----------\ | --|
+| | Header    | |   |
+| |-----------| |   |
+| | Name      | |   |-- Component
+| |-----------| |   |
+| |Data       | |   |
+| |..         | |   |
+| \-----------/ | --|
+|               |
+| /-----------\ |
+| | Header    | |
+| |-----------| |
+| | Name      | |
+| |-----------| |
+| |Data       | |
+| |..         | |
+| \-----------/ |
+|               |
+| ...           |
+| /-----------\ |
+| |           | |
+| | Bootblock | |
+| | --------- | |
+| | Reset     | | <- 0xFFFFFFF0
+| \-----------/ |
+\---------------/
+
+
+The CBFS architecture consists of a binary associated with a physical
+ROM disk referred hereafter as the ROM. A number of independent of
+components, each with a  header prepended on to data are located within
+the ROM.  The components are nominally arranged sequentially, though they
+are aligned along a pre-defined boundary.
+
+The bootblock occupies the last 20k of the ROM.  Within
+the bootblock is a master header containing information about the ROM
+including the size, alignment of the components, and the offset of the
+start of the first CBFS component within the ROM.
+
+= Master Header =
+
+The master header contains essential information about the ROM that is
+used by both the CBFS implementation within coreboot at runtime as well
+as host based utilities to create and manage the ROM.  The master header
+will be located somewhere within the bootblock (last 20k of the ROM).  A
+pointer to the location of the header will be located at offset
+-4 from the end of the ROM.  This translates to address 0xFFFFFFFC on a
+normal x86 system.  The pointer will be to physical memory somewhere
+between - 0xFFFFB000 and 0xFFFFFFF0.  This makes it easier for coreboot
+to locate the header at run time.  Build time utilities will
+need to read the pointer and do the appropriate math to locate the header.
+
+The following is the structure of the master header:
+
+struct cbfs_header {
+	unsigned int magic;
+	unsigned int size;
+	unsigned int align;
+	unsigned int offset;
+};
+
+The meaning of each member is as follows:
+
+'magic' is a 32 bit number that identifies the ROM as a CBFS type.  The 
+magic
+number is 0x4F524243, which is 'ORBC' in ASCII.
+
+'size' is the size of the ROM in bytes.  Coreboot will subtract 'size' from
+0xFFFFFFFF to locate the beginning of the ROM in memory.
+
+'align' is the number of bytes that each component is aligned to within the
+ROM.  This is used to make sure that each component is aligned correctly 
+with
+regards to the erase block sizes on the ROM - allowing one to replace a
+component at runtime without disturbing the others.
+
+'offset' is the offset of the the first CBFS component (from the start of
+the ROM).  This is to allow for arbitrary space to be left at the beginning
+of the ROM for things like embedded controller firmware.
+
+= Bootblock =
+The bootblock is a mandatory component in the ROM.  It is located in the 
+last
+20k of the ROM space, and contains, among other things, the location of the
+master header and the entry point for the loader firmware.  The bootblock
+does not have a component header attached to it.
+
+= Components =
+
+CBFS components are placed in the ROM starting at 'offset' specified in
+the master header and ending at the bootblock.  Thus the total size 
+available
+for components in the ROM is (ROM size - 20k - 'offset').  Each CBFS
+component is to be aligned according to the 'align' value in the header.
+Thus, if a component of size 1052 is located at offset 0 with an 'align' 
+value
+of 1024, the next component will be located at offset 2048.
+
+Each CBFS component will be indexed with a unique ASCII string name of
+unlimited size.
+
+Each CBFS component starts with a header:
+
+struct cbfs_file {
+         char magic[8];
+         unsigned int len;
+         unsigned int type;
+         unsigned int checksum;
+         unsigned int offset;
+};
+
+'magic' is a magic value used to identify the header.  During runtime,
+coreboot will scan the ROM looking for this value.  The default magic is
+the string 'LARCHIVE'.
+
+'len' is the length of the data, not including the size of the header and
+the size of the name.
+
+'type' is a 32 bit number indicating the type of data that is attached.
+The data type is used in a number of ways, as detailed in the section
+below.
+
+'checksum' is a 32bit checksum of the entire component, including the
+header and name.
+
+'offset' is the start of the component data, based off the start of the 
+header.
+The difference between the size of the header and offset is the size of the
+component name.
+
+Immediately following the header will be the name of the component, 
+which will
+null terminated and 16 byte aligned.   The following picture shows the
+structure of the header:
+
+/--------\  <- start
+| Header |
+|--------|  <- sizeof(struct cbfs_file)
+| Name   |
+|--------|  <- 'offset'
+| Data   |
+| ...    |
+\--------/  <- start + 'offset' + 'len'
+
+== Searching Alogrithm ==
+
+To locate a specific component in the ROM, one starts at the 'offset'
+specified in the CBFS master header.  For this example, the offset will
+be 0.
+
+ From that offset, the code should search for the magic string on the
+component, jumping 'align' bytes each time.  So, assuming that 'align' is
+16, the code will search for the string 'LARCHIVE' at offset 0, 16, 32, etc.
+If the offset ever exceeds the allowable range for CBFS components, then no
+component was found.
+
+Upon recognizing a component, the software then has to search for the
+specific name of the component.  This is accomplished by comparing the
+desired name with the string on the component located at
+offset + sizeof(struct cbfs_file).  If the string matches, then the 
+component
+has been located, otherwise the software should add 'offset' + 'len' to
+the offset and resume the search for the magic value.
+
+== Data Types ==
+
+The 'type' member of struct cbfs_file is used to identify the content
+of the component data, and is used by coreboot and other
+run-time entities to make decisions about how to handle the data.
+
+There are three component types that are essential to coreboot, and so
+are defined here.
+
+=== Stages ===
+
+Stages are code loaded by coreboot during the boot process.  They are
+essential to a successful boot.   Stages are comprised of a single blob
+of binary data that is to be loaded into a particular location in memory
+and executed.   The uncompressed header contains information about how
+large the data is, and where it should be placed, and what additional memory
+needs to be cleared.
+
+Stages are assigned a component value of 0x10.  When coreboot sees this
+component type, it knows that it should pass the data to a sub-function
+that will process the stage.
+
+The following is the format of a stage component:
+
+/--------\
+| Header |
+|--------|
+| Binary |
+| ..     |
+\--------/
+
+The header is defined as:
+
+struct cbfs_stage {
+         unsigned int compression;
+         unsigned long long entry;
+         unsigned long long load;
+         unsigned int len;
+         unsigned int memlen;
+};
+
+'compression' is an integer defining how the data is compressed.  There
+are three compression types defined by this version of the standard:
+none (0x0), lzma (0x1), and nrv2b (0x02), though additional types may be
+added assuming that coreboot understands how to handle the scheme.
+
+'entry' is a 64 bit value indicating the location where  the program
+counter should jump following the loading of the stage.  This should be
+an absolute physical memory address.
+
+'load' is a 64 bit value indicating where the subsequent data should be
+loaded.  This should be an absolute physical memory address.
+
+'len' is the length of the compressed data in the component.
+
+'memlen' is the amount of memory that will be used by the component when
+it is loaded.
+
+The component data will start immediately following the header.
+
+When coreboot loads a stage, it will first zero the memory from 'load' to
+'memlen'.  It will then decompress the component data according to the
+specified scheme and place it in memory starting at 'load'.  Following that,
+it will jump execution to the address specified by 'entry'.
+Some components are designed to execute directly from the ROM - coreboot
+knows which components must do that and will act accordingly.
+
+=== Payloads ===
+
+Payloads are loaded by coreboot following the boot process.
+
+Stages are assigned a component value of 0x20.  When coreboot sees this
+component type, it knows that it should pass the data to a sub-function
+that will process the payload.  Furthermore, other run time
+applications such as 'bayou' may easily index all available payloads
+on the system by searching for the payload type.
+
+
+The following is the format of a stage component:
+
+/-----------\
+| Header    |
+| Segment 1 |
+| Segment 2 |
+| ...       |
+|-----------|
+| Binary    |
+| ..        |
+\-----------/
+
+The header is as follows:
+
+struct cbfs_payload {
+         struct cbfs_payload_segment segments;
+}
+
+The header contains a number of segments corresponding to the segments
+that need to be loaded for the payload.
+
+The following is the structure of each segment header:
+
+struct cbfs_payload_segment {
+         unsigned int type;
+         unsigned int compression;
+         unsigned int offset;
+         unsigned long long load_addr;
+         unsigned int len;
+         unsigned int mem_len;
+};
+
+'type' is the type of segment, one of the following:
+
+PAYLOAD_SEGMENT_CODE   0x45444F43   The segment contains executable code
+PAYLOAD_SEGMENT_DATA   0x41544144   The segment contains data
+PAYLOAD_SEGMENT_BSS    0x20535342   The memory speicfied by the segment
+                                     should be zeroed
+PAYLOAD_SEGMENT_PARAMS 0x41524150   The segment contains information for
+                                     the payload
+PAYLOAD_SEGMENT_ENTRY  0x52544E45   The segment contains the entry point
+		       		    for the payload
+
+'compression' is the compression scheme for the segment.  Each segment can
+be independently compressed. There are three compression types defined by
+this version of the standard: none (0x0), lzma (0x1), and nrv2b (0x02),
+though additional types may be added assuming that coreboot understands
+how to handle the scheme.
+
+'offset' is the address of the data within the component, starting from
+the component header.
+
+'load_addr' is a 64 bit value indicating where the segment should be placed
+in memory.
+
+'len' is a 32 bit value indicating the size of the segment within the
+component.
+
+'mem_len' is the size of the data when it is placed into memory.
+
+The data will located immediately following the last segment.
+
+=== Option ROMS ===
+
+The third specified component type will be Option ROMs.  Option ROMS will
+have component type '0x30'.  They will have no additional header, the
+uncompressed binary data will be located in the data portion of the
+component.
+
+=== NULL ===
+
+There is a 4th component type ,defined as NULL (0xFFFFFFFF).  This is
+the "don't care" component type.  This can be used when the component
+type is not necessary (such as when the name of the component is unique.
+i.e. option_table).  It is recommended that all components be assigned a
+unique type, but NULL can be used when the type does not matter.

documentation/codeflow.svg

@@ -0,0 +1,234 @@
+<?xml version="1.0" encoding="utf-8"?>
+<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN" "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
+<svg version="1.1" id="Layer_1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" x="0px" y="0px"
+	 width="256px" height="640px" viewBox="0 0 256 640" enable-background="new 0 0 256 640" xml:space="preserve">
+<font horiz-adv-x="1000">
+<font-face font-family="MyriadPro-Regular" units-per-em="1000" underline-position="-100" underline-thickness="50"/>
+<missing-glyph horiz-adv-x="500" d="M0,0l500,0l0,700l-500,0M250,395l-170,255l340,0M280,350l170,255l0,-510M80,50l170,255l170,-255M50,605l170,-255l-170,-255z"/>
+<glyph unicode="A" horiz-adv-x="612" d="M424,212l72,-212l93,0l-230,674l-104,0l-230,-674l90,0l70,212M203,280l66,195C283,516 293,558 303,597l2,0C315,558 325,518 340,474l67,-194z"/>
+<glyph unicode="B" horiz-adv-x="542" d="M76,2C105,-2 151,-6 211,-6C321,-6 397,14 443,57C478,89 501,134 501,192C501,292 426,345 362,360l0,3C432,388 476,445 476,511C476,564 454,604 419,630C378,664 322,679 235,679C175,679 114,673 76,664M163,606C177,609 200,612 240,612C328,612 387,580 387,502C387,437 333,388 242,388l-79,0M163,323l72,0C330,323 409,284 409,193C409,95 326,62 236,62C205,62 181,63 163,66z"/>
+<glyph unicode="C" horiz-adv-x="580" d="M529,91C494,74 440,63 386,63C223,63 128,168 128,334C128,511 233,612 391,612C447,612 494,600 526,584l22,71C525,667 471,685 388,685C179,685 36,543 36,331C36,109 178,-11 368,-11C450,-11 515,5 546,21z"/>
+<glyph unicode="D" horiz-adv-x="666" d="M76,2C120,-3 171,-6 234,-6C365,-6 469,28 533,91C595,153 630,243 630,353C630,462 595,540 534,595C475,649 386,679 261,679C192,679 129,673 76,664M163,601C186,606 220,610 265,610C449,610 539,509 538,350C538,168 438,64 251,64C217,64 185,65 163,68z"/>
+<glyph unicode="E" horiz-adv-x="492" d="M424,388l-261,0l0,213l277,0l0,73l-365,0l0,-674l380,0l0,73l-292,0l0,243l261,0z"/>
+<glyph unicode="F" horiz-adv-x="487" d="M75,0l88,0l0,305l254,0l0,72l-254,0l0,224l275,0l0,73l-363,0z"/>
+<glyph unicode="H" horiz-adv-x="652" d="M75,674l0,-674l88,0l0,316l326,0l0,-316l88,0l0,674l-88,0l0,-282l-326,0l0,282z"/>
+<glyph unicode="I" horiz-adv-x="239" d="M75,674l0,-674l88,0l0,674z"/>
+<glyph unicode="L" horiz-adv-x="472" d="M75,0l376,0l0,73l-288,0l0,601l-88,0z"/>
+<glyph unicode="M" horiz-adv-x="804" d="M660,0l86,0l-42,674l-111,0l-120,-326C443,263 419,189 401,121l-2,0C381,191 359,265 331,348l-115,326l-111,0l-47,-674l83,0l18,289C165,391 170,503 172,587l2,0C193,507 219,421 251,325l110,-321l66,0l119,327C580,424 607,509 631,587l2,0C633,504 639,390 644,296z"/>
+<glyph unicode="N" horiz-adv-x="658" d="M158,0l0,288C158,400 157,481 152,566l3,1C188,494 233,417 280,342l214,-342l88,0l0,674l-82,0l0,-282C500,287 502,205 510,115l-3,-1C476,183 436,254 387,333l-215,341l-96,0l0,-674z"/>
+<glyph unicode="O" horiz-adv-x="689" d="M348,686C168,686 36,546 36,332C36,128 160,-11 339,-11C511,-11 652,113 652,344C652,545 533,686 348,686M345,615C490,615 560,475 560,340C560,187 482,60 344,60C206,60 128,189 128,334C128,481 200,615 345,615z"/>
+<glyph unicode="P" horiz-adv-x="532" d="M76,0l87,0l0,270C183,265 207,264 233,264C318,264 392,289 439,338C473,373 491,421 491,482C491,542 468,591 432,623C392,659 329,679 243,679C173,679 118,673 76,666M163,603C178,607 207,610 245,610C340,610 404,567 404,477C404,386 340,334 235,334C206,334 182,336 163,341z"/>
+<glyph unicode="Q" horiz-adv-x="689" d="M657,-26C600,-16 527,0 460,17l0,4C572,61 652,171 652,345C652,544 533,686 349,686C167,686 36,547 36,331C36,113 172,-5 333,-11C346,-11 359,-16 374,-21C452,-48 541,-75 632,-99M344,60C206,60 128,189 128,333C128,479 200,615 347,615C490,615 560,476 560,340C560,187 482,60 344,60z"/>
+<glyph unicode="R" horiz-adv-x="538" d="M76,0l87,0l0,292l82,0C324,289 361,254 381,161C399,77 414,20 425,0l90,0C501,26 485,91 463,185C447,255 416,303 365,321l0,3C435,348 491,407 491,495C491,548 471,594 438,624C397,661 336,679 243,679C184,679 120,673 76,665M163,604C178,608 207,611 249,611C341,611 404,573 404,486C404,409 345,358 252,358l-89,0z"/>
+<glyph unicode="S" horiz-adv-x="493" d="M42,33C78,9 149,-11 214,-11C373,-11 449,80 449,184C449,283 392,338 278,382C185,418 144,449 144,512C144,558 179,613 271,613C332,613 377,594 398,581l24,71C393,669 342,685 274,685C143,685 56,607 56,502C56,408 124,350 234,310C325,276 361,239 361,177C361,109 309,62 220,62C160,62 104,81 65,106z"/>
+<glyph unicode="T" horiz-adv-x="497" d="M204,0l88,0l0,600l206,0l0,74l-499,0l0,-74l205,0z"/>
+<glyph unicode="U" horiz-adv-x="647" d="M75,674l0,-397C75,67 179,-11 317,-11C463,-11 572,73 572,280l0,394l-88,0l0,-400C484,126 419,60 320,60C230,60 163,124 163,274l0,400z"/>
+<glyph unicode="a" horiz-adv-x="482" d="M413,297C413,393 377,494 229,494C168,494 109,477 69,452l20,-59C123,416 170,429 216,429C315,430 326,357 326,318l0,-10C139,309 35,245 35,128C35,58 85,-11 183,-11C252,-11 304,23 331,61l3,0l7,-61l79,0C415,33 413,74 413,116M328,163C328,155 327,145 324,135C310,94 269,54 205,54C161,54 123,80 123,138C123,232 232,249 328,247z"/>
+<glyph unicode="b" horiz-adv-x="569" d="M73,125C73,82 71,33 69,0l75,0l5,79l2,0C188,16 244,-11 314,-11C422,-11 532,75 532,248C532,394 448,494 327,494C249,494 193,460 162,406l-2,0l0,304l-87,0M160,280C160,294 162,306 165,317C183,383 239,425 298,425C393,425 443,342 443,245C443,134 389,59 296,59C232,59 180,101 164,162C161,172 160,183 160,194z"/>
+<glyph unicode="c" horiz-adv-x="448" d="M403,83C378,72 345,60 295,60C199,60 127,129 127,241C127,341 187,424 298,424C346,424 379,412 400,401l20,67C396,481 350,494 298,494C140,494 38,385 38,236C38,88 133,-11 279,-11C344,-11 395,6 418,17z"/>
+<glyph unicode="," horiz-adv-x="207" d="M78,-117C106,-70 150,41 174,126l-98,-10C65,43 38,-64 16,-124z"/>
+<glyph unicode="d" horiz-adv-x="564" d="M403,710l0,-289l-2,0C379,459 330,494 255,494C138,494 37,396 38,235C38,88 129,-11 246,-11C325,-11 383,30 409,84l3,0l4,-84l78,0C492,33 490,82 490,125l0,585M403,203C403,189 402,177 399,165C383,100 329,60 270,60C176,60 127,141 127,239C127,345 181,425 272,425C338,425 386,379 399,324C402,313 403,298 403,287z"/>
+<glyph unicode="e" horiz-adv-x="501" d="M462,226C464,236 465,249 465,267C465,356 424,494 265,494C124,494 38,380 38,234C38,88 127,-11 276,-11C353,-11 407,6 438,20l-16,63C390,69 351,58 288,58C199,58 124,107 122,226M123,289C130,350 168,431 258,431C357,431 381,344 380,289z"/>
+<glyph unicode="h" horiz-adv-x="555" d="M73,0l88,0l0,292C161,308 162,321 167,334C184,381 228,421 285,421C368,421 397,356 397,278l0,-278l88,0l0,288C485,454 381,494 316,494C283,494 252,485 226,470C199,455 177,432 163,407l-2,0l0,303l-88,0z"/>
+<glyph unicode="-" horiz-adv-x="307" d="M30,302l0,-64l247,0l0,64z"/>
+<glyph unicode="i" horiz-adv-x="234" d="M161,0l0,484l-88,0l0,-484M117,675C84,675 62,650 62,620C62,590 83,566 115,566C150,566 171,590 171,620C171,651 149,675 117,675z"/>
+<glyph unicode="k" horiz-adv-x="469" d="M160,710l-87,0l0,-710l87,0l0,182l45,50l166,-232l108,0l-213,285l186,199l-105,0l-143,-167C190,300 174,279 162,262l-2,0z"/>
+<glyph unicode="l" horiz-adv-x="236" d="M73,0l88,0l0,710l-88,0z"/>
+<glyph unicode="m" horiz-adv-x="834" d="M73,0l86,0l0,291C159,306 161,322 166,334C180,378 221,422 275,422C342,422 376,367 376,290l0,-290l86,0l0,299C462,315 465,330 469,343C485,385 523,422 574,422C644,422 679,367 679,273l0,-273l86,0l0,284C765,452 670,494 605,494C559,494 528,482 499,460C479,445 459,425 444,397l-2,0C421,454 371,494 306,494C225,494 180,451 153,405l-3,0l-4,79l-77,0C71,444 73,404 73,353z"/>
+<glyph unicode="n" horiz-adv-x="555" d="M73,0l88,0l0,291C161,306 163,321 167,332C183,381 228,422 285,422C368,422 397,357 397,279l0,-279l88,0l0,288C485,454 381,494 314,494C234,494 178,449 154,404l-2,0l-5,80l-78,0C72,444 73,404 73,353z"/>
+<glyph unicode="o" horiz-adv-x="549" d="M278,494C145,494 38,399 38,238C38,85 140,-11 270,-11C386,-11 511,67 511,246C511,393 417,494 278,494M276,428C380,428 421,325 421,243C421,134 358,55 274,55C188,55 128,135 128,241C128,332 173,428 276,428z"/>
+<glyph unicode="p" horiz-adv-x="569" d="M73,-198l87,0l0,263l2,0C191,17 247,-11 311,-11C425,-11 532,75 532,249C532,395 444,494 326,494C247,494 189,460 154,401l-2,0l-5,83l-78,0C71,438 73,388 73,326M160,281C160,292 163,305 166,316C182,382 239,424 299,424C392,424 443,341 443,245C443,134 389,58 296,58C233,58 180,100 164,161C161,172 160,184 160,197z"/>
+<glyph unicode="(" horiz-adv-x="284" d="M195,694C132,610 65,481 64,285C64,90 132,-38 195,-121l68,0C193,-21 138,106 138,284C138,466 190,595 263,694z"/>
+<glyph unicode=")" horiz-adv-x="284" d="M88,-121C151,-37 218,91 219,287C219,483 151,612 88,694l-68,0C91,594 145,467 145,287C145,107 90,-22 20,-121z"/>
+<glyph unicode="." horiz-adv-x="207" d="M110,-11C147,-11 171,16 171,52C171,89 147,115 112,115C77,115 52,88 52,52C52,16 76,-11 110,-11z"/>
+<glyph unicode="?" horiz-adv-x="406" d="M220,192l-2,25C215,268 231,313 275,365C323,422 361,471 361,539C361,615 309,686 194,686C141,686 85,670 51,646l24,-63C100,602 140,614 176,614C239,613 271,579 271,528C271,483 246,444 201,391C151,331 133,271 139,218l2,-26M178,-11C215,-11 238,16 238,51C238,88 215,114 179,114C145,114 120,88 120,51C120,16 144,-11 178,-11z"/>
+<glyph unicode="r" horiz-adv-x="327" d="M73,0l88,0l0,258C161,272 162,287 164,299C176,365 220,411 282,411C294,411 303,411 312,409l0,83C304,493 297,494 288,494C229,494 175,453 153,388l-3,0l-4,96l-77,0C72,439 73,390 73,333z"/>
+<glyph unicode="s" horiz-adv-x="396" d="M40,23C74,3 123,-11 176,-11C289,-11 356,49 356,135C356,207 312,249 229,280C166,305 138,323 138,363C138,399 166,429 218,429C263,429 298,412 317,400l21,64C312,481 269,494 220,494C117,494 53,430 53,352C53,294 94,247 182,215C246,191 271,169 271,127C271,86 241,55 178,55C134,55 88,73 61,89z"/>
+<glyph unicode="/" horiz-adv-x="343" d="M66,-39l280,725l-69,0l-278,-725z"/>
+<glyph unicode=" " horiz-adv-x="212"/>
+<glyph unicode="t" horiz-adv-x="331" d="M93,574l0,-90l-75,0l0,-67l75,0l0,-264C93,96 103,53 127,26C148,3 181,-11 222,-11C256,-11 283,-5 300,1l-4,67C283,64 269,62 245,62C196,62 179,96 179,156l0,261l126,0l0,67l-126,0l0,116z"/>
+<glyph unicode="2" horiz-adv-x="513" d="M460,0l0,73l-291,0l0,2l51,48C357,255 444,352 444,472C444,565 385,661 245,661C171,661 106,632 62,595l28,-62C120,558 169,588 228,588C325,588 356,527 356,461C356,363 280,279 114,121l-69,-67l0,-54z"/>
+<glyph unicode="u" horiz-adv-x="551" d="M478,484l-88,0l0,-296C390,171 387,155 382,143C366,103 325,62 266,62C187,62 158,125 158,217l0,267l-88,0l0,-283C70,32 161,-11 237,-11C323,-11 375,40 397,79l2,0l5,-79l78,0C479,38 478,82 478,133z"/>
+<glyph unicode="v" horiz-adv-x="481" d="M13,484l184,-484l84,0l190,484l-92,0l-94,-271C269,168 255,128 244,88l-3,0C231,128 218,168 202,213l-95,271z"/>
+<glyph unicode="x" horiz-adv-x="463" d="M16,484l164,-237l-172,-247l97,0l70,109C194,138 210,164 226,193l2,0C245,164 261,137 280,109l72,-109l99,0l-169,250l165,234l-96,0l-67,-103C267,355 251,330 235,302l-2,0C217,329 202,353 183,380l-69,104z"/>
+<glyph unicode="y" horiz-adv-x="471" d="M9,484l178,-446C192,27 194,20 194,15C194,10 191,3 187,-6C166,-51 137,-85 113,-104C87,-126 58,-140 36,-147l22,-73C80,-216 122,-201 166,-164C226,-111 269,-27 332,139l132,345l-93,0l-96,-284C263,165 253,128 244,99l-2,0C234,128 222,166 210,198l-105,286z"/>
+<glyph unicode="z" horiz-adv-x="428" d="M18,0l392,0l0,70l-282,0l0,2C150,96 169,121 190,148l216,281l0,55l-368,0l0,-70l262,0l0,-2C278,386 258,363 236,336l-218,-285z"/>
+</font>
+
+	<g>
+	<rect y="1.152" fill="#AAAAAA" stroke="#000000" width="256" height="36.887"/>
+	<text transform="matrix(1 0 0 1 27.7441 23.7046)" font-family="'MyriadPro-Regular'" font-size="14">Enter protected mode</text>
+</g>
+<g>
+	<rect y="45.642" fill="#AAAAAA" stroke="#000000" width="256" height="43.62"/>
+	<text transform="matrix(1 0 0 1 27.7441 71.5605)" font-family="'MyriadPro-Regular'" font-size="14">non-coherent HT enumeration</text>
+</g>
+<g>
+	<rect y="98.359" fill="#AAAAAA" stroke="#000000" width="256" height="60.15"/>
+	<text transform="matrix(1 0 0 1 27.7441 132.5435)" font-family="'MyriadPro-Regular'" font-size="14">coherent HT initialization</text>
+</g>
+<g>
+	<rect y="165.983" fill="#AAAAAA" stroke="#000000" width="256" height="68.421"/>
+	<text transform="matrix(1 0 0 1 27.7441 204.3022)" font-family="'MyriadPro-Regular'" font-size="14">Fallback / Normal?</text>
+</g>
+<g>
+	<rect y="243.893" fill="#AAAAAA" stroke="#000000" width="256" height="69.173"/>
+	<text transform="matrix(1 0 0 1 27.7441 282.5879)" font-family="'MyriadPro-Regular'" font-size="14">RAM initialization</text>
+</g>
+<g>
+	<rect y="410.747" fill="#AAAAAA" stroke="#000000" width="256" height="52.632"/>
+	<text transform="matrix(1 0 0 1 27.7441 432.7725)"><tspan x="0" y="0" font-family="'MyriadPro-Regular'" font-size="14">Create external tables (coreboot table,</tspan><tspan x="0" y="16.8" font-family="'MyriadPro-Regular'" font-size="14">ACPI, MP, PIRQ, DMI)</tspan></text>
+</g>
+<g>
+	<rect y="323.526" fill="#AAAAAA" stroke="#000000" width="256" height="77.443"/>
+	<text transform="matrix(1 0 0 1 27.7441 339.3154)"><tspan x="0" y="0" font-family="'MyriadPro-Regular'" font-size="14">Resource Allocation (PCI, PCIe, I2C, SIO, </tspan><tspan x="0" y="16.8" font-family="'MyriadPro-Regular'" font-size="14">CPU, mainboard...)</tspan></text>
+	<rect x="27.744" y="362.248" fill="#BCBCBC" width="228.256" height="38.722"/>
+</g>
+<g>
+	<rect y="473.781" fill="#AAAAAA" stroke="#000000" width="256" height="80.076"/>
+	<text transform="matrix(1 0 0 1 27.7441 497.4658)" font-family="'MyriadPro-Regular'" font-size="14">ELF / Payload Loader</text>
+	<rect x="27.744" y="507.993" fill="#BCBCBC" width="228.256" height="45.864"/>
+</g>
+<g>
+	<g>
+		<g>
+			<g>
+				<g>
+					<g>
+						<g>
+							<g>
+								<polygon fill="#FFFFFF" stroke="#231F20" stroke-width="0.3876" points="113.028,31.246 130.359,46.62 132.854,44.7 
+									132.027,51.206 131.201,57.711 124.701,56.845 118.201,55.98 120.608,54.127 110.178,33.439 								"/>
+							</g>
+							<polygon fill="#231F20" points="131.101,57.636 132.228,59.101 133.828,45.178 133.062,44.181 							"/>
+							<polygon fill="#231F20" points="131.152,57.643 132.28,59.108 118.41,57.093 117.644,56.096 							"/>
+						</g>
+					</g>
+				</g>
+			</g>
+		</g>
+	</g>
+</g>
+<g>
+	<g>
+		<g>
+			<g>
+				<g>
+					<g>
+						<g>
+							<g>
+								<polygon fill="#FFFFFF" stroke="#231F20" stroke-width="0.3876" points="113.028,81.246 130.359,96.62 132.854,94.7 
+									132.027,101.206 131.201,107.711 124.701,106.845 118.201,105.98 120.608,104.127 110.178,83.439 								"/>
+							</g>
+							<polygon fill="#231F20" points="131.101,107.636 132.228,109.101 133.828,95.178 133.062,94.181 							"/>
+							<polygon fill="#231F20" points="131.152,107.643 132.28,109.108 118.41,107.093 117.644,106.096 							"/>
+						</g>
+					</g>
+				</g>
+			</g>
+		</g>
+	</g>
+</g>
+<g>
+	<g>
+		<g>
+			<g>
+				<g>
+					<g>
+						<g>
+							<g>
+								<polygon fill="#FFFFFF" stroke="#231F20" stroke-width="0.3876" points="113.028,151.586 130.359,166.961 132.854,165.041 
+									132.027,171.546 131.201,178.052 124.701,177.186 118.201,176.321 120.608,174.468 110.178,153.78 								"/>
+							</g>
+							<polygon fill="#231F20" points="131.101,177.977 132.228,179.442 133.828,165.519 133.062,164.522 							"/>
+							<polygon fill="#231F20" points="131.152,177.983 132.28,179.449 118.41,177.434 117.644,176.437 							"/>
+						</g>
+					</g>
+				</g>
+			</g>
+		</g>
+	</g>
+</g>
+<g>
+	<g>
+		<g>
+			<g>
+				<g>
+					<g>
+						<g>
+							<g>
+								<polygon fill="#FFFFFF" stroke="#231F20" stroke-width="0.3876" points="113.028,227.013 130.359,242.387 132.854,240.467 
+									132.027,246.973 131.201,253.478 124.701,252.612 118.201,251.747 120.608,249.894 110.178,229.207 								"/>
+							</g>
+							<polygon fill="#231F20" points="131.101,253.403 132.228,254.868 133.828,240.945 133.062,239.948 							"/>
+							<polygon fill="#231F20" points="131.152,253.41 132.28,254.875 118.41,252.86 117.644,251.863 							"/>
+						</g>
+					</g>
+				</g>
+			</g>
+		</g>
+	</g>
+</g>
+<g>
+	<g>
+		<g>
+			<g>
+				<g>
+					<g>
+						<g>
+							<g>
+								<polygon fill="#FFFFFF" stroke="#231F20" stroke-width="0.3876" points="113.028,303.013 130.359,318.388 132.854,316.468 
+									132.027,322.973 131.201,329.479 124.701,328.612 118.201,327.747 120.607,325.895 110.178,305.207 								"/>
+							</g>
+							<polygon fill="#231F20" points="131.101,329.404 132.228,330.868 133.829,316.945 133.062,315.948 							"/>
+							<polygon fill="#231F20" points="131.152,329.41 132.28,330.876 118.41,328.86 117.643,327.864 							"/>
+						</g>
+					</g>
+				</g>
+			</g>
+		</g>
+	</g>
+</g>
+<g>
+	<g>
+		<g>
+			<g>
+				<g>
+					<g>
+						<g>
+							<g>
+								<polygon fill="#FFFFFF" stroke="#231F20" stroke-width="0.3876" points="113.028,395.872 130.359,411.247 132.854,409.327 
+									132.027,415.833 131.201,422.338 124.701,421.473 118.201,420.606 120.608,418.754 110.178,398.066 								"/>
+							</g>
+							<polygon fill="#231F20" points="131.101,422.264 132.228,423.728 133.828,409.805 133.062,408.808 							"/>
+							<polygon fill="#231F20" points="131.152,422.27 132.28,423.735 118.41,421.72 117.644,420.724 							"/>
+						</g>
+					</g>
+				</g>
+			</g>
+		</g>
+	</g>
+</g>
+<g>
+	<g>
+		<g>
+			<g>
+				<g>
+					<g>
+						<g>
+							<g>
+								<polygon fill="#FFFFFF" stroke="#231F20" stroke-width="0.3876" points="113.028,452.152 130.359,467.528 132.854,465.608 
+									132.027,472.113 131.201,478.619 124.701,477.753 118.201,476.888 120.607,475.035 110.178,454.347 								"/>
+							</g>
+							<polygon fill="#231F20" points="131.101,478.545 132.228,480.009 133.829,466.085 133.062,465.089 							"/>
+							<polygon fill="#231F20" points="131.152,478.551 132.28,480.017 118.41,478.001 117.643,477.004 							"/>
+						</g>
+					</g>
+				</g>
+			</g>
+		</g>
+	</g>
+</g>
+<text transform="matrix(1 0 0 1 59.3232 385.7627)" font-family="'MyriadPro-Regular'" font-size="14">Drivers</text>
+<text transform="matrix(1 0 0 1 55.564 535.3789)" font-family="'MyriadPro-Regular'" font-size="14">Linux, FILO, SeaBIOS, ...</text>
+</svg>

documentation/endverbatim.tex

@@ -0,0 +1 @@
+\end{verbatim}

documentation/hypertransport.eps

@@ -1,527 +0,0 @@
-%!PS-Adobe-3.0 EPSF-3.0 
-%%BoundingBox: 0 0 174 228
-%%Pages: 0
-%%Creator: Sun Microsystems, Inc.
-%%Title: none
-%%CreationDate: none
-%%LanguageLevel: 2
-%%EndComments
-%%BeginProlog
-%%BeginResource: SDRes
-/b4_inc_state save def
-/dict_count countdictstack def
-/op_count count 1 sub def
-userdict begin
-0 setgray 0 setlinecap 1 setlinewidth 0 setlinejoin 10 setmiterlimit[] 0 setdash newpath
-/languagelevel where {pop languagelevel 1 ne {false setstrokeadjust false setoverprint} if} if
-/bdef {bind def} bind def
-/c {setrgbcolor} bdef
-/l {neg lineto} bdef
-/rl {neg rlineto} bdef
-/lc {setlinecap} bdef
-/lj {setlinejoin} bdef
-/lw {setlinewidth} bdef
-/ml {setmiterlimit} bdef
-/ld {setdash} bdef
-/m {neg moveto} bdef
-/ct {6 2 roll neg 6 2 roll neg 6 2 roll neg curveto} bdef
-/r {rotate} bdef
-/t {neg translate} bdef
-/s {scale} bdef
-/sw {show} bdef
-/gs {gsave} bdef
-/gr {grestore} bdef
-/f {findfont dup length dict begin
-{1 index /FID ne {def} {pop pop} ifelse} forall /Encoding ISOLatin1Encoding def
-currentdict end /NFont exch definefont pop /NFont findfont} bdef
-/p {closepath} bdef
-/sf {scalefont setfont} bdef
-/ef {eofill}bdef
-/pc {closepath stroke}bdef
-/ps {stroke}bdef
-/pum {matrix currentmatrix}bdef
-/pom {setmatrix}bdef
-/bs {/aString exch def /nXOfs exch def /nWidth exch def currentpoint nXOfs 0 rmoveto pum nWidth aString stringwidth pop div 1 scale aString show pom moveto} bdef
-%%EndResource
-%%EndProlog
-%%BeginSetup
-%%EndSetup
-%%Page: 1 1
-%%BeginPageSetup
-%%EndPageSetup
-pum
-0.02838 0.02838 s 
-0 -8033 t
-/tm matrix currentmatrix def
-tm setmatrix
--2275 -2118 t 
-1 1 s 
-0.753 0.753 0.753 c 3288 7132 m  2275 7132 l  2275 5104 l  4301 5104 l 
-4301 7132 l  3288 7132 l  p ef
-0 lw 1 lj 0.003 0.003 0.003 c 3288 7132 m  2275 7132 l  2275 5104 l  4301 5104 l 
-4301 7132 l  3288 7132 l  pc
-gs
-pum
-2645 6299 t
-327 -238 m  323 -357 l  312 -357 l  308 -346 300 -340 289 -340 ct 285 -340 277 -341 269 -344 ct 
-243 -353 216 -357 192 -357 ct 148 -357 104 -341 71 -312 ct 34 -279 14 -230 14 -171 ct 
-14 -122 30 -77 57 -47 ct 89 -12 138 7 190 7 ct 250 7 302 -16 334 -59 ct 325 -69 l 
-286 -31 251 -15 207 -15 ct 174 -15 144 -26 121 -46 ct 92 -72 76 -120 76 -178 ct 
-76 -274 125 -336 202 -336 ct 232 -336 259 -325 280 -304 ct 297 -287 305 -272 315 -238 ct 
-p ef
-450 -153 m  464 -152 473 -152 487 -152 ct 528 -152 557 -157 579 -170 ct 611 -187 630 -219 630 -254 ct 
-630 -276 623 -296 609 -312 ct 587 -335 541 -350 492 -350 ct 352 -350 l  352 -340 l 
-391 -335 396 -330 396 -292 ct 396 -63 l  396 -19 392 -13 352 -10 ct 352 0 l 
-500 0 l  500 -10 l  458 -11 450 -19 450 -57 ct p
-450 -312 m  450 -326 454 -330 468 -330 ct 540 -330 573 -305 573 -251 ct 573 -199 541 -173 481 -173 ct 
-470 -173 463 -174 450 -175 ct p ef
-958 -272 m  958 -326 964 -334 1007 -340 ct 1007 -350 l  885 -350 l  885 -340 l 
-926 -336 934 -325 934 -272 ct 934 -129 l  934 -93 931 -73 922 -57 ct 908 -32 874 -15 834 -15 ct 
-797 -15 771 -28 757 -53 ct 747 -70 743 -89 743 -123 ct 743 -292 l  743 -330 749 -336 792 -340 ct 
-792 -350 l  642 -350 l  642 -340 l  684 -336 690 -331 690 -292 ct 690 -127 l 
-690 -35 732 7 822 7 ct 880 7 920 -11 940 -47 ct 953 -69 958 -93 958 -134 ct p ef
-1139 -357 m  1110 -357 1088 -348 1068 -330 ct 1037 -300 1017 -239 1017 -177 ct 
-1017 -120 1035 -58 1060 -28 ct 1079 -5 1106 7 1137 7 ct 1164 7 1186 -1 1206 -20 ct 
-1236 -49 1256 -110 1256 -174 ct 1256 -283 l  1208 -357 l  p
-1137 -343 m  1182 -343 1206 -284 1206 -173 ct 1206 -62 1182 -6 1137 -6 ct 1091 -6 1068 -62 1068 -172 ct 
-1068 -285 l  1092 -343 l  p ef
-pom
-gr
-0.753 0.753 0.753 c 7182 7132 m  6169 7132 l  6169 5104 l  8195 5104 l 
-8195 7132 l  7182 7132 l  p ef
-0.003 0.003 0.003 c 7182 7132 m  6169 7132 l  6169 5104 l  8195 5104 l  8195 7132 l 
-7182 7132 l  pc
-gs
-pum
-6535 6299 t
-327 -238 m  323 -357 l  312 -357 l  308 -346 300 -340 289 -340 ct 285 -340 277 -341 269 -344 ct 
-243 -353 216 -357 192 -357 ct 148 -357 104 -341 71 -312 ct 34 -279 14 -230 14 -171 ct 
-14 -122 30 -77 57 -47 ct 89 -12 138 7 190 7 ct 250 7 302 -16 334 -59 ct 325 -69 l 
-286 -31 251 -15 207 -15 ct 174 -15 144 -26 121 -46 ct 92 -72 76 -120 76 -178 ct 
-76 -274 125 -336 202 -336 ct 232 -336 259 -325 280 -304 ct 297 -287 305 -272 315 -238 ct 
-p ef
-450 -153 m  464 -152 473 -152 487 -152 ct 528 -152 557 -157 579 -170 ct 611 -187 630 -219 630 -254 ct 
-630 -276 623 -296 609 -312 ct 587 -335 541 -350 492 -350 ct 352 -350 l  352 -340 l 
-391 -335 396 -330 396 -292 ct 396 -63 l  396 -19 392 -13 352 -10 ct 352 0 l 
-500 0 l  500 -10 l  458 -11 450 -19 450 -57 ct p
-450 -312 m  450 -326 454 -330 468 -330 ct 540 -330 573 -305 573 -251 ct 573 -199 541 -173 481 -173 ct 
-470 -173 463 -174 450 -175 ct p ef
-958 -272 m  958 -326 964 -334 1007 -340 ct 1007 -350 l  885 -350 l  885 -340 l 
-926 -336 934 -325 934 -272 ct 934 -129 l  934 -93 931 -73 922 -57 ct 908 -32 874 -15 834 -15 ct 
-797 -15 771 -28 757 -53 ct 747 -70 743 -89 743 -123 ct 743 -292 l  743 -330 749 -336 792 -340 ct 
-792 -350 l  642 -350 l  642 -340 l  684 -336 690 -331 690 -292 ct 690 -127 l 
-690 -35 732 7 822 7 ct 880 7 920 -11 940 -47 ct 953 -69 958 -93 958 -134 ct p ef
-1158 -357 m  1063 -309 l  1063 -302 l  1070 -304 1075 -306 1078 -307 ct 1087 -311 1096 -313 1101 -313 ct 
-1112 -313 1117 -305 1117 -288 ct 1117 -49 l  1117 -31 1113 -19 1104 -14 ct 1097 -10 1089 -8 1067 -7 ct 
-1067 0 l  1213 0 l  1213 -7 l  1171 -8 1163 -13 1163 -39 ct 1163 -356 l  p ef
-pom
-gr
-0.753 0.753 0.753 c 3288 4146 m  2275 4146 l  2275 2118 l  4301 2118 l 
-4301 4146 l  3288 4146 l  p ef
-0.003 0.003 0.003 c 3288 4146 m  2275 4146 l  2275 2118 l  4301 2118 l  4301 4146 l 
-3288 4146 l  pc
-gs
-pum
-2645 3309 t
-327 -238 m  323 -357 l  312 -357 l  308 -346 300 -340 289 -340 ct 285 -340 277 -341 269 -344 ct 
-243 -353 216 -357 192 -357 ct 148 -357 104 -341 71 -312 ct 34 -279 14 -230 14 -171 ct 
-14 -122 30 -77 57 -47 ct 89 -12 138 7 190 7 ct 250 7 302 -16 334 -59 ct 325 -69 l 
-286 -31 251 -15 207 -15 ct 174 -15 144 -26 121 -46 ct 92 -72 76 -120 76 -178 ct 
-76 -274 125 -336 202 -336 ct 232 -336 259 -325 280 -304 ct 297 -287 305 -272 315 -238 ct 
-p ef
-450 -153 m  464 -152 473 -152 487 -152 ct 528 -152 557 -157 579 -170 ct 611 -187 630 -219 630 -254 ct 
-630 -276 623 -296 609 -312 ct 587 -335 541 -350 492 -350 ct 352 -350 l  352 -340 l 
-391 -335 396 -330 396 -292 ct 396 -63 l  396 -19 392 -13 352 -10 ct 352 0 l 
-500 0 l  500 -10 l  458 -11 450 -19 450 -57 ct p
-450 -312 m  450 -326 454 -330 468 -330 ct 540 -330 573 -305 573 -251 ct 573 -199 541 -173 481 -173 ct 
-470 -173 463 -174 450 -175 ct p ef
-958 -272 m  958 -326 964 -334 1007 -340 ct 1007 -350 l  885 -350 l  885 -340 l 
-926 -336 934 -325 934 -272 ct 934 -129 l  934 -93 931 -73 922 -57 ct 908 -32 874 -15 834 -15 ct 
-797 -15 771 -28 757 -53 ct 747 -70 743 -89 743 -123 ct 743 -292 l  743 -330 749 -336 792 -340 ct 
-792 -350 l  642 -350 l  642 -340 l  684 -336 690 -331 690 -292 ct 690 -127 l 
-690 -35 732 7 822 7 ct 880 7 920 -11 940 -47 ct 953 -69 958 -93 958 -134 ct p ef
-1256 -72 m  1249 -75 l  1229 -44 1222 -40 1199 -40 ct 1072 -40 l  1161 -133 l 
-1208 -182 1229 -222 1229 -263 ct 1229 -316 1186 -357 1131 -357 ct 1102 -357 1074 -345 1055 -324 ct 
-1038 -306 1030 -289 1021 -252 ct 1032 -249 l  1053 -301 1072 -318 1109 -318 ct 
-1153 -318 1183 -288 1183 -243 ct 1183 -202 1159 -153 1115 -106 ct 1020 -6 l 
-1020 0 l  1227 0 l  p ef
-pom
-gr
-0.753 0.753 0.753 c 7182 4146 m  6169 4146 l  6169 2118 l  8195 2118 l 
-8195 4146 l  7182 4146 l  p ef
-0.003 0.003 0.003 c 7182 4146 m  6169 4146 l  6169 2118 l  8195 2118 l  8195 4146 l 
-7182 4146 l  pc
-gs
-pum
-6535 3309 t
-327 -238 m  323 -357 l  312 -357 l  308 -346 300 -340 289 -340 ct 285 -340 277 -341 269 -344 ct 
-243 -353 216 -357 192 -357 ct 148 -357 104 -341 71 -312 ct 34 -279 14 -230 14 -171 ct 
-14 -122 30 -77 57 -47 ct 89 -12 138 7 190 7 ct 250 7 302 -16 334 -59 ct 325 -69 l 
-286 -31 251 -15 207 -15 ct 174 -15 144 -26 121 -46 ct 92 -72 76 -120 76 -178 ct 
-76 -274 125 -336 202 -336 ct 232 -336 259 -325 280 -304 ct 297 -287 305 -272 315 -238 ct 
-p ef
-450 -153 m  464 -152 473 -152 487 -152 ct 528 -152 557 -157 579 -170 ct 611 -187 630 -219 630 -254 ct 
-630 -276 623 -296 609 -312 ct 587 -335 541 -350 492 -350 ct 352 -350 l  352 -340 l 
-391 -335 396 -330 396 -292 ct 396 -63 l  396 -19 392 -13 352 -10 ct 352 0 l 
-500 0 l  500 -10 l  458 -11 450 -19 450 -57 ct p
-450 -312 m  450 -326 454 -330 468 -330 ct 540 -330 573 -305 573 -251 ct 573 -199 541 -173 481 -173 ct 
-470 -173 463 -174 450 -175 ct p ef
-958 -272 m  958 -326 964 -334 1007 -340 ct 1007 -350 l  885 -350 l  885 -340 l 
-926 -336 934 -325 934 -272 ct 934 -129 l  934 -93 931 -73 922 -57 ct 908 -32 874 -15 834 -15 ct 
-797 -15 771 -28 757 -53 ct 747 -70 743 -89 743 -123 ct 743 -292 l  743 -330 749 -336 792 -340 ct 
-792 -350 l  642 -350 l  642 -340 l  684 -336 690 -331 690 -292 ct 690 -127 l 
-690 -35 732 7 822 7 ct 880 7 920 -11 940 -47 ct 953 -69 958 -93 958 -134 ct p ef
-1085 -174 m  1117 -174 1129 -173 1142 -168 ct 1174 -157 1195 -126 1195 -90 ct 
-1195 -46 1165 -11 1126 -11 ct 1111 -11 1101 -15 1081 -28 ct 1065 -37 1056 -41 1047 -41 ct 
-1035 -41 1027 -33 1027 -22 ct 1027 -4 1050 7 1087 7 ct 1128 7 1170 -6 1194 -28 ct 
-1219 -49 1233 -80 1233 -115 ct 1233 -142 1225 -167 1209 -184 ct 1199 -195 1189 -202 1165 -212 ct 
-1202 -236 1215 -256 1215 -285 ct 1215 -327 1181 -357 1133 -357 ct 1106 -357 1083 -348 1064 -331 ct 
-1048 -317 1040 -303 1028 -271 ct 1036 -269 l  1058 -308 1082 -325 1115 -325 ct 
-1149 -325 1173 -302 1173 -269 ct 1173 -250 1165 -231 1152 -217 ct 1136 -202 1121 -194 1085 -181 ct 
-p ef
-pom
-gr
-0.753 0.753 0.753 c 7182 10118 m  6169 10118 l  6169 8090 l  8195 8090 l 
-8195 10118 l  7182 10118 l  p ef
-0.003 0.003 0.003 c 7182 10118 m  6169 10118 l  6169 8090 l  8195 8090 l  8195 10118 l 
-7182 10118 l  pc
-gs
-pum
-6852 8945 t
-236 -357 m  225 -357 l  223 -345 217 -339 208 -339 ct 203 -339 194 -341 185 -345 ct 
-165 -353 146 -357 129 -357 ct 106 -357 83 -348 65 -333 ct 47 -316 37 -294 37 -267 ct 
-37 -224 60 -195 120 -163 ct 158 -143 185 -122 198 -102 ct 203 -95 206 -84 206 -71 ct 
-206 -35 179 -11 141 -11 ct 94 -11 60 -40 34 -105 ct 22 -105 l  38 6 l  49 6 l 
-50 -3 56 -10 64 -10 ct 70 -10 79 -8 89 -4 ct 109 3 130 7 151 7 ct 212 7 259 -34 259 -88 ct 
-259 -132 230 -166 160 -204 ct 105 -234 83 -258 83 -286 ct 83 -315 105 -335 138 -335 ct 
-161 -335 184 -325 202 -306 ct 219 -289 226 -276 234 -244 ct 248 -244 l  p ef
-300 -350 m  300 -340 l  344 -337 350 -331 350 -292 ct 350 -57 l  350 -18 343 -11 300 -10 ct 
-300 0 l  476 0 l  517 0 555 -11 575 -29 ct 594 -46 604 -69 604 -95 ct 604 -118 595 -139 578 -155 ct 
-562 -169 548 -175 514 -184 ct 541 -190 552 -196 565 -207 ct 578 -219 586 -238 586 -260 ct 
-586 -319 539 -350 448 -350 ct p
-404 -172 m  456 -172 480 -169 499 -161 ct 529 -149 543 -128 543 -94 ct 543 -66 532 -45 511 -33 ct 
-494 -23 472 -19 438 -19 ct 412 -19 404 -24 404 -41 ct p
-404 -193 m  404 -314 l  404 -325 408 -330 416 -330 ct 439 -330 l  500 -330 532 -305 532 -258 ct 
-532 -216 504 -193 454 -193 ct p ef
-pom
-pum
-6455 9607 t
-156 -357 m  116 -332 101 -318 81 -294 ct 43 -248 25 -195 25 -133 ct 25 -66 44 -14 91 39 ct 
-113 65 126 76 154 93 ct 160 85 l  118 51 103 33 89 -6 ct 76 -41 70 -82 70 -134 ct 
-70 -190 77 -233 92 -266 ct 106 -299 122 -318 160 -349 ct p ef
-338 -196 m  390 -224 409 -246 409 -282 ct 409 -325 371 -357 318 -357 ct 260 -357 217 -322 217 -274 ct 
-217 -239 227 -224 283 -175 ct 226 -132 214 -115 214 -79 ct 214 -28 256 7 316 7 ct 
-379 7 420 -27 420 -82 ct 420 -122 l  402 -148 l  p
-328 -141 m  367 -114 380 -95 380 -65 ct 380 -31 356 -7 322 -7 ct 281 -7 254 -38 254 -84 ct 
-254 -117 266 -140 297 -165 ct p
-323 -205 m  275 -236 256 -260 256 -290 ct 256 -321 280 -342 314 -342 ct 350 -342 372 -319 372 -283 ct 
-372 -252 357 -229 327 -208 ct 325 -207 l  325 -207 l  p ef
-603 -357 m  508 -309 l  508 -302 l  515 -304 520 -306 523 -307 ct 532 -311 541 -313 546 -313 ct 
-557 -313 562 -305 562 -288 ct 562 -49 l  562 -31 558 -19 549 -14 ct 542 -10 534 -8 512 -7 ct 
-512 0 l  658 0 l  658 -7 l  616 -8 608 -13 608 -39 ct 608 -356 l  p ef
-867 -357 m  772 -309 l  772 -302 l  779 -304 784 -306 787 -307 ct 796 -311 805 -313 810 -313 ct 
-821 -313 826 -305 826 -288 ct 826 -49 l  826 -31 822 -19 813 -14 ct 806 -10 798 -8 776 -7 ct 
-776 0 l  922 0 l  922 -7 l  880 -8 872 -13 872 -39 ct 872 -356 l  p ef
-1132 -357 m  1037 -309 l  1037 -302 l  1044 -304 1049 -306 1052 -307 ct 1061 -311 1070 -313 1075 -313 ct 
-1086 -313 1091 -305 1091 -288 ct 1091 -49 l  1091 -31 1087 -19 1078 -14 ct 1071 -10 1063 -8 1041 -7 ct 
-1041 0 l  1187 0 l  1187 -7 l  1145 -8 1137 -13 1137 -39 ct 1137 -356 l  p ef
-1264 93 m  1303 68 1319 54 1338 30 ct 1376 -15 1394 -68 1394 -130 ct 1394 -198 1375 -249 1328 -303 ct 
-1306 -329 1293 -340 1265 -357 ct 1259 -349 l  1301 -315 1315 -297 1330 -257 ct 
-1343 -222 1349 -181 1349 -129 ct 1349 -74 1342 -30 1328 2 ct 1313 35 1297 54 1259 85 ct 
-p ef
-pom
-gr
-0.753 0.753 0.753 c 3288 10118 m  2275 10118 l  2275 8090 l  4301 8090 l 
-4301 10118 l  3288 10118 l  p ef
-0.003 0.003 0.003 c 3288 10118 m  2275 10118 l  2275 8090 l  4301 8090 l  4301 10118 l 
-3288 10118 l  pc
-gs
-pum
-2593 8945 t
-106 -153 m  120 -152 129 -152 143 -152 ct 184 -152 213 -157 235 -170 ct 267 -187 286 -219 286 -254 ct 
-286 -276 279 -296 265 -312 ct 243 -335 197 -350 148 -350 ct 8 -350 l  8 -340 l 
-47 -335 52 -330 52 -292 ct 52 -63 l  52 -19 48 -13 8 -10 ct 8 0 l  156 0 l  156 -10 l 
-114 -11 106 -19 106 -57 ct p
-106 -312 m  106 -326 110 -330 124 -330 ct 196 -330 229 -305 229 -251 ct 229 -199 197 -173 137 -173 ct 
-126 -173 119 -174 106 -175 ct p ef
-618 -238 m  614 -357 l  603 -357 l  599 -346 591 -340 580 -340 ct 576 -340 568 -341 560 -344 ct 
-534 -353 507 -357 483 -357 ct 439 -357 395 -341 362 -312 ct 325 -279 305 -230 305 -171 ct 
-305 -122 321 -77 348 -47 ct 380 -12 429 7 481 7 ct 541 7 593 -16 625 -59 ct 616 -69 l 
-577 -31 542 -15 498 -15 ct 465 -15 435 -26 412 -46 ct 383 -72 367 -120 367 -178 ct 
-367 -274 416 -336 493 -336 ct 523 -336 550 -325 571 -304 ct 588 -287 596 -272 606 -238 ct 
-p ef
-695 -57 m  695 -17 688 -11 644 -10 ct 644 0 l  801 0 l  801 -10 l  758 -11 749 -19 749 -57 ct 
-749 -292 l  749 -331 757 -338 801 -340 ct 801 -350 l  644 -350 l  644 -340 l 
-689 -337 695 -331 695 -292 ct p ef
-840 -135 m  840 -102 l  970 -102 l  970 -135 l  p ef
-1373 -350 m  1247 -350 l  1247 -340 l  1275 -339 1284 -335 1284 -323 ct 1284 -315 1278 -305 1263 -286 ct 
-1203 -213 l  1181 -244 l  1148 -289 1136 -312 1136 -324 ct 1136 -334 1144 -339 1161 -339 ct 
-1176 -340 l  1176 -350 l  1016 -350 l  1016 -340 l  1051 -338 1060 -330 1112 -257 ct 
-1170 -172 l  1087 -70 l  1039 -14 1037 -12 1010 -10 ct 1010 0 l  1133 0 l 
-1133 -10 l  1102 -12 1093 -16 1093 -28 ct 1093 -36 1101 -49 1120 -74 ct 1183 -152 l 
-1234 -78 l  1251 -52 1261 -34 1261 -26 ct 1261 -16 1252 -11 1234 -11 ct 1232 -11 1226 -10 1220 -10 ct 
-1220 0 l  1377 0 l  1377 -10 l  1349 -13 1341 -18 1318 -49 ct 1217 -194 l 
-1294 -290 l  1328 -331 1339 -338 1373 -340 ct p ef
-pom
-pum
-2566 9607 t
-156 -357 m  116 -332 101 -318 81 -294 ct 43 -248 25 -195 25 -133 ct 25 -66 44 -14 91 39 ct 
-113 65 126 76 154 93 ct 160 85 l  118 51 103 33 89 -6 ct 76 -41 70 -82 70 -134 ct 
-70 -190 77 -233 92 -266 ct 106 -299 122 -318 160 -349 ct p ef
-338 -196 m  390 -224 409 -246 409 -282 ct 409 -325 371 -357 318 -357 ct 260 -357 217 -322 217 -274 ct 
-217 -239 227 -224 283 -175 ct 226 -132 214 -115 214 -79 ct 214 -28 256 7 316 7 ct 
-379 7 420 -27 420 -82 ct 420 -122 l  402 -148 l  p
-328 -141 m  367 -114 380 -95 380 -65 ct 380 -31 356 -7 322 -7 ct 281 -7 254 -38 254 -84 ct 
-254 -117 266 -140 297 -165 ct p
-323 -205 m  275 -236 256 -260 256 -290 ct 256 -321 280 -342 314 -342 ct 350 -342 372 -319 372 -283 ct 
-372 -252 357 -229 327 -208 ct 325 -207 l  325 -207 l  p ef
-603 -357 m  508 -309 l  508 -302 l  515 -304 520 -306 523 -307 ct 532 -311 541 -313 546 -313 ct 
-557 -313 562 -305 562 -288 ct 562 -49 l  562 -31 558 -19 549 -14 ct 542 -10 534 -8 512 -7 ct 
-512 0 l  658 0 l  658 -7 l  616 -8 608 -13 608 -39 ct 608 -356 l  p ef
-794 -174 m  826 -174 838 -173 851 -168 ct 883 -157 904 -126 904 -90 ct 904 -46 874 -11 835 -11 ct 
-820 -11 810 -15 790 -28 ct 774 -37 765 -41 756 -41 ct 744 -41 736 -33 736 -22 ct 
-736 -4 759 7 796 7 ct 837 7 879 -6 903 -28 ct 928 -49 942 -80 942 -115 ct 942 -142 934 -167 918 -184 ct 
-908 -195 898 -202 874 -212 ct 911 -236 924 -256 924 -285 ct 924 -327 890 -357 842 -357 ct 
-815 -357 792 -348 773 -331 ct 757 -317 749 -303 737 -271 ct 745 -269 l  767 -308 791 -325 824 -325 ct 
-858 -325 882 -302 882 -269 ct 882 -250 874 -231 861 -217 ct 845 -202 830 -194 794 -181 ct 
-p ef
-1132 -357 m  1037 -309 l  1037 -302 l  1044 -304 1049 -306 1052 -307 ct 1061 -311 1070 -313 1075 -313 ct 
-1086 -313 1091 -305 1091 -288 ct 1091 -49 l  1091 -31 1087 -19 1078 -14 ct 1071 -10 1063 -8 1041 -7 ct 
-1041 0 l  1187 0 l  1187 -7 l  1145 -8 1137 -13 1137 -39 ct 1137 -356 l  p ef
-1264 93 m  1303 68 1319 54 1338 30 ct 1376 -15 1394 -68 1394 -130 ct 1394 -198 1375 -249 1328 -303 ct 
-1306 -329 1293 -340 1265 -357 ct 1259 -349 l  1301 -315 1315 -297 1330 -257 ct 
-1343 -222 1349 -181 1349 -129 ct 1349 -74 1342 -30 1328 2 ct 1313 35 1297 54 1259 85 ct 
-p ef
-pom
-gr
-3288 7132 m  3288 8090 l  ps
-4301 9104 m  6169 9104 l  ps
-4301 6118 m  6169 6118 l  ps
-3288 5104 m  3288 4146 l  ps
-7182 5104 m  7182 4146 l  ps
-6169 3132 m  4301 3132 l  ps
-gs
-pum
-3360 7489 t
-161 -49 m  156 -38 152 -31 148 -27 ct 138 -16 123 -11 99 -11 ct 80 -11 l  60 -11 56 -12 56 -22 ct 
-56 -155 l  56 -175 60 -179 82 -181 ct 82 -186 l  3 -186 l  3 -181 l  24 -179 27 -175 27 -155 ct 
-27 -30 l  27 -11 23 -6 3 -5 ct 3 0 l  155 0 l  168 -49 l  p ef
-214 -30 m  214 -10 210 -6 189 -5 ct 189 0 l  269 0 l  302 0 331 -9 349 -25 ct 
-367 -41 378 -66 378 -94 ct 378 -119 369 -141 354 -157 ct 335 -176 304 -186 265 -186 ct 
-189 -186 l  189 -181 l  211 -179 214 -176 214 -155 ct p
-243 -165 m  243 -174 246 -176 257 -176 ct 282 -176 300 -171 313 -162 ct 335 -146 347 -122 347 -92 ct 
-347 -58 335 -35 313 -22 ct 298 -13 282 -10 257 -10 ct 246 -10 243 -12 243 -22 ct 
-p ef
-468 -174 m  468 -33 l  468 -9 465 -6 442 -5 ct 442 0 l  524 0 l  524 -5 l 
-501 -6 497 -10 497 -30 ct 497 -174 l  512 -174 l  544 -174 550 -169 557 -138 ct 
-564 -138 l  562 -186 l  403 -186 l  401 -138 l  408 -138 l  415 -169 421 -174 453 -174 ct 
-p ef
-653 -190 m  638 -190 626 -185 615 -175 ct 599 -160 588 -127 588 -94 ct 588 -64 598 -31 611 -15 ct 
-621 -2 636 3 652 3 ct 666 3 679 0 689 -10 ct 705 -26 716 -58 716 -93 ct 716 -150 l 
-690 -190 l  p
-652 -183 m  676 -183 689 -151 689 -92 ct 689 -33 676 -3 652 -3 ct 628 -3 615 -33 615 -92 ct 
-615 -152 l  628 -183 l  p ef
-pom
-gr
-gs
-pum
-5424 6484 t
-161 -49 m  156 -38 152 -31 148 -27 ct 138 -16 123 -11 99 -11 ct 80 -11 l  60 -11 56 -12 56 -22 ct 
-56 -155 l  56 -175 60 -179 82 -181 ct 82 -186 l  3 -186 l  3 -181 l  24 -179 27 -175 27 -155 ct 
-27 -30 l  27 -11 23 -6 3 -5 ct 3 0 l  155 0 l  168 -49 l  p ef
-214 -30 m  214 -10 210 -6 189 -5 ct 189 0 l  269 0 l  302 0 331 -9 349 -25 ct 
-367 -41 378 -66 378 -94 ct 378 -119 369 -141 354 -157 ct 335 -176 304 -186 265 -186 ct 
-189 -186 l  189 -181 l  211 -179 214 -176 214 -155 ct p
-243 -165 m  243 -174 246 -176 257 -176 ct 282 -176 300 -171 313 -162 ct 335 -146 347 -122 347 -92 ct 
-347 -58 335 -35 313 -22 ct 298 -13 282 -10 257 -10 ct 246 -10 243 -12 243 -22 ct 
-p ef
-468 -174 m  468 -33 l  468 -9 465 -6 442 -5 ct 442 0 l  524 0 l  524 -5 l 
-501 -6 497 -10 497 -30 ct 497 -174 l  512 -174 l  544 -174 550 -169 557 -138 ct 
-564 -138 l  562 -186 l  403 -186 l  401 -138 l  408 -138 l  415 -169 421 -174 453 -174 ct 
-p ef
-653 -190 m  638 -190 626 -185 615 -175 ct 599 -160 588 -127 588 -94 ct 588 -64 598 -31 611 -15 ct 
-621 -2 636 3 652 3 ct 666 3 679 0 689 -10 ct 705 -26 716 -58 716 -93 ct 716 -150 l 
-690 -190 l  p
-652 -183 m  676 -183 689 -151 689 -92 ct 689 -33 676 -3 652 -3 ct 628 -3 615 -33 615 -92 ct 
-615 -152 l  628 -183 l  p ef
-pom
-gr
-gs
-pum
-7302 4446 t
-161 -49 m  156 -38 152 -31 148 -27 ct 138 -16 123 -11 99 -11 ct 80 -11 l  60 -11 56 -12 56 -22 ct 
-56 -155 l  56 -175 60 -179 82 -181 ct 82 -186 l  3 -186 l  3 -181 l  24 -179 27 -175 27 -155 ct 
-27 -30 l  27 -11 23 -6 3 -5 ct 3 0 l  155 0 l  168 -49 l  p ef
-214 -30 m  214 -10 210 -6 189 -5 ct 189 0 l  269 0 l  302 0 331 -9 349 -25 ct 
-367 -41 378 -66 378 -94 ct 378 -119 369 -141 354 -157 ct 335 -176 304 -186 265 -186 ct 
-189 -186 l  189 -181 l  211 -179 214 -176 214 -155 ct p
-243 -165 m  243 -174 246 -176 257 -176 ct 282 -176 300 -171 313 -162 ct 335 -146 347 -122 347 -92 ct 
-347 -58 335 -35 313 -22 ct 298 -13 282 -10 257 -10 ct 246 -10 243 -12 243 -22 ct 
-p ef
-468 -174 m  468 -33 l  468 -9 465 -6 442 -5 ct 442 0 l  524 0 l  524 -5 l 
-501 -6 497 -10 497 -30 ct 497 -174 l  512 -174 l  544 -174 550 -169 557 -138 ct 
-564 -138 l  562 -186 l  403 -186 l  401 -138 l  408 -138 l  415 -169 421 -174 453 -174 ct 
-p ef
-653 -190 m  638 -190 626 -185 615 -175 ct 599 -160 588 -127 588 -94 ct 588 -64 598 -31 611 -15 ct 
-621 -2 636 3 652 3 ct 666 3 679 0 689 -10 ct 705 -26 716 -58 716 -93 ct 716 -150 l 
-690 -190 l  p
-652 -183 m  676 -183 689 -151 689 -92 ct 689 -33 676 -3 652 -3 ct 628 -3 615 -33 615 -92 ct 
-615 -152 l  628 -183 l  p ef
-pom
-gr
-gs
-pum
-3413 4473 t
-161 -49 m  156 -38 152 -31 148 -27 ct 138 -16 123 -11 99 -11 ct 80 -11 l  60 -11 56 -12 56 -22 ct 
-56 -155 l  56 -175 60 -179 82 -181 ct 82 -186 l  3 -186 l  3 -181 l  24 -179 27 -175 27 -155 ct 
-27 -30 l  27 -11 23 -6 3 -5 ct 3 0 l  155 0 l  168 -49 l  p ef
-214 -30 m  214 -10 210 -6 189 -5 ct 189 0 l  269 0 l  302 0 331 -9 349 -25 ct 
-367 -41 378 -66 378 -94 ct 378 -119 369 -141 354 -157 ct 335 -176 304 -186 265 -186 ct 
-189 -186 l  189 -181 l  211 -179 214 -176 214 -155 ct p
-243 -165 m  243 -174 246 -176 257 -176 ct 282 -176 300 -171 313 -162 ct 335 -146 347 -122 347 -92 ct 
-347 -58 335 -35 313 -22 ct 298 -13 282 -10 257 -10 ct 246 -10 243 -12 243 -22 ct 
-p ef
-468 -174 m  468 -33 l  468 -9 465 -6 442 -5 ct 442 0 l  524 0 l  524 -5 l 
-501 -6 497 -10 497 -30 ct 497 -174 l  512 -174 l  544 -174 550 -169 557 -138 ct 
-564 -138 l  562 -186 l  403 -186 l  401 -138 l  408 -138 l  415 -169 421 -174 453 -174 ct 
-p ef
-653 -190 m  638 -190 626 -185 615 -175 ct 599 -160 588 -127 588 -94 ct 588 -64 598 -31 611 -15 ct 
-621 -2 636 3 652 3 ct 666 3 679 0 689 -10 ct 705 -26 716 -58 716 -93 ct 716 -150 l 
-690 -190 l  p
-652 -183 m  676 -183 689 -151 689 -92 ct 689 -33 676 -3 652 -3 ct 628 -3 615 -33 615 -92 ct 
-615 -152 l  628 -183 l  p ef
-pom
-gr
-gs
-pum
-4418 3467 t
-161 -49 m  156 -38 152 -31 148 -27 ct 138 -16 123 -11 99 -11 ct 80 -11 l  60 -11 56 -12 56 -22 ct 
-56 -155 l  56 -175 60 -179 82 -181 ct 82 -186 l  3 -186 l  3 -181 l  24 -179 27 -175 27 -155 ct 
-27 -30 l  27 -11 23 -6 3 -5 ct 3 0 l  155 0 l  168 -49 l  p ef
-214 -30 m  214 -10 210 -6 189 -5 ct 189 0 l  269 0 l  302 0 331 -9 349 -25 ct 
-367 -41 378 -66 378 -94 ct 378 -119 369 -141 354 -157 ct 335 -176 304 -186 265 -186 ct 
-189 -186 l  189 -181 l  211 -179 214 -176 214 -155 ct p
-243 -165 m  243 -174 246 -176 257 -176 ct 282 -176 300 -171 313 -162 ct 335 -146 347 -122 347 -92 ct 
-347 -58 335 -35 313 -22 ct 298 -13 282 -10 257 -10 ct 246 -10 243 -12 243 -22 ct 
-p ef
-468 -174 m  468 -33 l  468 -9 465 -6 442 -5 ct 442 0 l  524 0 l  524 -5 l 
-501 -6 497 -10 497 -30 ct 497 -174 l  512 -174 l  544 -174 550 -169 557 -138 ct 
-564 -138 l  562 -186 l  403 -186 l  401 -138 l  408 -138 l  415 -169 421 -174 453 -174 ct 
-p ef
-664 -190 m  613 -164 l  613 -161 l  616 -162 619 -163 620 -164 ct 625 -166 630 -167 633 -167 ct 
-639 -167 642 -163 642 -153 ct 642 -26 l  642 -16 639 -10 635 -7 ct 631 -5 627 -4 615 -4 ct 
-615 0 l  693 0 l  693 -4 l  670 -4 666 -7 666 -20 ct 666 -190 l  p ef
-pom
-gr
-gs
-pum
-2513 5002 t
-161 -49 m  156 -38 152 -31 148 -27 ct 138 -16 123 -11 99 -11 ct 80 -11 l  60 -11 56 -12 56 -22 ct 
-56 -155 l  56 -175 60 -179 82 -181 ct 82 -186 l  3 -186 l  3 -181 l  24 -179 27 -175 27 -155 ct 
-27 -30 l  27 -11 23 -6 3 -5 ct 3 0 l  155 0 l  168 -49 l  p ef
-214 -30 m  214 -10 210 -6 189 -5 ct 189 0 l  269 0 l  302 0 331 -9 349 -25 ct 
-367 -41 378 -66 378 -94 ct 378 -119 369 -141 354 -157 ct 335 -176 304 -186 265 -186 ct 
-189 -186 l  189 -181 l  211 -179 214 -176 214 -155 ct p
-243 -165 m  243 -174 246 -176 257 -176 ct 282 -176 300 -171 313 -162 ct 335 -146 347 -122 347 -92 ct 
-347 -58 335 -35 313 -22 ct 298 -13 282 -10 257 -10 ct 246 -10 243 -12 243 -22 ct 
-p ef
-468 -174 m  468 -33 l  468 -9 465 -6 442 -5 ct 442 0 l  524 0 l  524 -5 l 
-501 -6 497 -10 497 -30 ct 497 -174 l  512 -174 l  544 -174 550 -169 557 -138 ct 
-564 -138 l  562 -186 l  403 -186 l  401 -138 l  408 -138 l  415 -169 421 -174 453 -174 ct 
-p ef
-715 -38 m  712 -40 l  701 -23 698 -21 685 -21 ct 618 -21 l  665 -71 l  690 -97 701 -118 701 -140 ct 
-701 -168 678 -190 649 -190 ct 633 -190 619 -184 608 -173 ct 599 -163 595 -154 590 -134 ct 
-596 -133 l  607 -160 618 -169 637 -169 ct 661 -169 677 -153 677 -130 ct 677 -108 664 -81 640 -56 ct 
-590 -3 l  590 0 l  700 0 l  p ef
-pom
-gr
-gs
-pum
-5397 3044 t
-161 -49 m  156 -38 152 -31 148 -27 ct 138 -16 123 -11 99 -11 ct 80 -11 l  60 -11 56 -12 56 -22 ct 
-56 -155 l  56 -175 60 -179 82 -181 ct 82 -186 l  3 -186 l  3 -181 l  24 -179 27 -175 27 -155 ct 
-27 -30 l  27 -11 23 -6 3 -5 ct 3 0 l  155 0 l  168 -49 l  p ef
-214 -30 m  214 -10 210 -6 189 -5 ct 189 0 l  269 0 l  302 0 331 -9 349 -25 ct 
-367 -41 378 -66 378 -94 ct 378 -119 369 -141 354 -157 ct 335 -176 304 -186 265 -186 ct 
-189 -186 l  189 -181 l  211 -179 214 -176 214 -155 ct p
-243 -165 m  243 -174 246 -176 257 -176 ct 282 -176 300 -171 313 -162 ct 335 -146 347 -122 347 -92 ct 
-347 -58 335 -35 313 -22 ct 298 -13 282 -10 257 -10 ct 246 -10 243 -12 243 -22 ct 
-p ef
-468 -174 m  468 -33 l  468 -9 465 -6 442 -5 ct 442 0 l  524 0 l  524 -5 l 
-501 -6 497 -10 497 -30 ct 497 -174 l  512 -174 l  544 -174 550 -169 557 -138 ct 
-564 -138 l  562 -186 l  403 -186 l  401 -138 l  408 -138 l  415 -169 421 -174 453 -174 ct 
-p ef
-664 -190 m  613 -164 l  613 -161 l  616 -162 619 -163 620 -164 ct 625 -166 630 -167 633 -167 ct 
-639 -167 642 -163 642 -153 ct 642 -26 l  642 -16 639 -10 635 -7 ct 631 -5 627 -4 615 -4 ct 
-615 0 l  693 0 l  693 -4 l  670 -4 666 -7 666 -20 ct 666 -190 l  p ef
-pom
-gr
-gs
-pum
-6376 5028 t
-161 -49 m  156 -38 152 -31 148 -27 ct 138 -16 123 -11 99 -11 ct 80 -11 l  60 -11 56 -12 56 -22 ct 
-56 -155 l  56 -175 60 -179 82 -181 ct 82 -186 l  3 -186 l  3 -181 l  24 -179 27 -175 27 -155 ct 
-27 -30 l  27 -11 23 -6 3 -5 ct 3 0 l  155 0 l  168 -49 l  p ef
-214 -30 m  214 -10 210 -6 189 -5 ct 189 0 l  269 0 l  302 0 331 -9 349 -25 ct 
-367 -41 378 -66 378 -94 ct 378 -119 369 -141 354 -157 ct 335 -176 304 -186 265 -186 ct 
-189 -186 l  189 -181 l  211 -179 214 -176 214 -155 ct p
-243 -165 m  243 -174 246 -176 257 -176 ct 282 -176 300 -171 313 -162 ct 335 -146 347 -122 347 -92 ct 
-347 -58 335 -35 313 -22 ct 298 -13 282 -10 257 -10 ct 246 -10 243 -12 243 -22 ct 
-p ef
-468 -174 m  468 -33 l  468 -9 465 -6 442 -5 ct 442 0 l  524 0 l  524 -5 l 
-501 -6 497 -10 497 -30 ct 497 -174 l  512 -174 l  544 -174 550 -169 557 -138 ct 
-564 -138 l  562 -186 l  403 -186 l  401 -138 l  408 -138 l  415 -169 421 -174 453 -174 ct 
-p ef
-664 -190 m  613 -164 l  613 -161 l  616 -162 619 -163 620 -164 ct 625 -166 630 -167 633 -167 ct 
-639 -167 642 -163 642 -153 ct 642 -26 l  642 -16 639 -10 635 -7 ct 631 -5 627 -4 615 -4 ct 
-615 0 l  693 0 l  693 -4 l  670 -4 666 -7 666 -20 ct 666 -190 l  p ef
-pom
-gr
-gs
-pum
-4524 6060 t
-161 -49 m  156 -38 152 -31 148 -27 ct 138 -16 123 -11 99 -11 ct 80 -11 l  60 -11 56 -12 56 -22 ct 
-56 -155 l  56 -175 60 -179 82 -181 ct 82 -186 l  3 -186 l  3 -181 l  24 -179 27 -175 27 -155 ct 
-27 -30 l  27 -11 23 -6 3 -5 ct 3 0 l  155 0 l  168 -49 l  p ef
-214 -30 m  214 -10 210 -6 189 -5 ct 189 0 l  269 0 l  302 0 331 -9 349 -25 ct 
-367 -41 378 -66 378 -94 ct 378 -119 369 -141 354 -157 ct 335 -176 304 -186 265 -186 ct 
-189 -186 l  189 -181 l  211 -179 214 -176 214 -155 ct p
-243 -165 m  243 -174 246 -176 257 -176 ct 282 -176 300 -171 313 -162 ct 335 -146 347 -122 347 -92 ct 
-347 -58 335 -35 313 -22 ct 298 -13 282 -10 257 -10 ct 246 -10 243 -12 243 -22 ct 
-p ef
-468 -174 m  468 -33 l  468 -9 465 -6 442 -5 ct 442 0 l  524 0 l  524 -5 l 
-501 -6 497 -10 497 -30 ct 497 -174 l  512 -174 l  544 -174 550 -169 557 -138 ct 
-564 -138 l  562 -186 l  403 -186 l  401 -138 l  408 -138 l  415 -169 421 -174 453 -174 ct 
-p ef
-664 -190 m  613 -164 l  613 -161 l  616 -162 619 -163 620 -164 ct 625 -166 630 -167 633 -167 ct 
-639 -167 642 -163 642 -153 ct 642 -26 l  642 -16 639 -10 635 -7 ct 631 -5 627 -4 615 -4 ct 
-615 0 l  693 0 l  693 -4 l  670 -4 666 -7 666 -20 ct 666 -190 l  p ef
-pom
-gr
-1.000 0.003 0.003 c 4303 6248 m  4229 6248 4169 6187 4169 6113 ct 4169 6039 4229 5978 4303 5978 ct 
-4377 5978 4437 6039 4437 6113 ct 4437 6187 4377 6248 4303 6248 ct 4303 6248 l 
-p ef
-0.003 0.003 0.003 c 4303 6248 m  4229 6248 4169 6187 4169 6113 ct 4169 6039 4229 5978 4303 5978 ct 
-4377 5978 4437 6039 4437 6113 ct 4437 6187 4377 6248 4303 6248 ct 4303 6248 l 
-pc
-1.000 0.003 0.003 c 7216 5229 m  7142 5229 7082 5169 7082 5095 ct 7082 5021 7142 4961 7216 4961 ct 
-7290 4961 7350 5021 7350 5095 ct 7350 5169 7290 5229 7216 5229 ct 7216 5229 l 
-p ef
-0.003 0.003 0.003 c 7216 5229 m  7142 5229 7082 5169 7082 5095 ct 7082 5021 7142 4961 7216 4961 ct 
-7290 4961 7350 5021 7350 5095 ct 7350 5169 7290 5229 7216 5229 ct 7216 5229 l 
-pc
-1.000 0.003 0.003 c 6179 3279 m  6105 3279 6045 3219 6045 3145 ct 6045 3071 6105 3011 6179 3011 ct 
-6253 3011 6313 3071 6313 3145 ct 6313 3219 6253 3279 6179 3279 ct 6179 3279 l 
-p ef
-0.003 0.003 0.003 c 6179 3279 m  6105 3279 6045 3219 6045 3145 ct 6045 3071 6105 3011 6179 3011 ct 
-6253 3011 6313 3071 6313 3145 ct 6313 3219 6253 3279 6179 3279 ct 6179 3279 l 
-pc
-tm setmatrix
-0 0 t 
-1 1 s 
-0 8033 t 
-pom
-count op_count sub {pop} repeat countdictstack dict_count sub {end} repeat b4_inc_state restore
-%%PageTrailer
-%%Trailer
-%%EOF

documentation/hypertransport.svg

@@ -0,0 +1,59 @@
+<?xml version="1.0" encoding="utf-8"?>
+<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN" "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
+<svg version="1.1" id="Layer_1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" x="0px" y="0px"
+	 width="256px" height="512px" viewBox="0 0 256 512" enable-background="new 0 0 256 512" xml:space="preserve">
+<font horiz-adv-x="2048">
+<font-face font-family="ArialMT" units-per-em="2048" underline-position="-217" underline-thickness="150"/>
+<missing-glyph horiz-adv-x="1536" d="M256,0l0,1280l1024,0l0,-1280M288,32l960,0l0,1216l-960,0z"/>
+<glyph unicode=" " horiz-adv-x="569"/>
+<glyph unicode="(" horiz-adv-x="682" d="M479,-431C380,-306 296,-159 227,9C158,177 124,351 124,531C124,690 150,842 201,987C261,1156 354,1324 479,1491l129,0C527,1352 474,1253 448,1194C407,1102 375,1006 352,906C323,781 309,656 309,530C309,209 409,-111 608,-431z"/>
+<glyph unicode=")" horiz-adv-x="682" d="M253,-431l-129,0C323,-111 423,209 423,530C423,655 409,780 380,903C357,1003 326,1099 285,1191C259,1251 205,1351 124,1491l129,0C378,1324 471,1156 531,987C582,842 608,690 608,531C608,351 574,177 505,9C436,-159 352,-306 253,-431z"/>
+<glyph unicode="-" horiz-adv-x="682" d="M65,440l0,181l553,0l0,-181z"/>
+<glyph unicode="0" horiz-adv-x="1139" d="M85,723C85,896 103,1036 139,1142C174,1247 227,1329 298,1386C368,1443 456,1472 563,1472C642,1472 711,1456 770,1425C829,1393 878,1347 917,1288C956,1228 986,1155 1008,1070C1030,984 1041,868 1041,723C1041,551 1023,412 988,307C953,201 900,119 830,62C759,4 670,-25 563,-25C422,-25 311,26 230,127C133,249 85,448 85,723M270,723C270,482 298,322 355,243C411,163 480,123 563,123C646,123 715,163 772,243C828,323 856,483 856,723C856,964 828,1125 772,1204C715,1283 645,1323 561,1323C478,1323 412,1288 363,1218C301,1129 270,964 270,723z"/>
+<glyph unicode="1" horiz-adv-x="1139" d="M763,0l-180,0l0,1147C540,1106 483,1064 413,1023C342,982 279,951 223,930l0,174C324,1151 412,1209 487,1276C562,1343 616,1409 647,1472l116,0z"/>
+<glyph unicode="2" horiz-adv-x="1139" d="M1031,173l0,-173l-969,0C61,43 68,85 83,125C108,191 147,256 202,320C256,384 334,458 437,542C596,673 704,776 760,853C816,929 844,1001 844,1069C844,1140 819,1201 768,1250C717,1299 650,1323 568,1323C481,1323 412,1297 360,1245C308,1193 282,1121 281,1029l-185,19C109,1186 156,1291 239,1364C322,1436 433,1472 572,1472C713,1472 824,1433 906,1355C988,1277 1029,1180 1029,1065C1029,1006 1017,949 993,892C969,835 929,776 874,713C818,650 725,564 596,455C488,364 419,303 388,271C357,238 332,206 312,173z"/>
+<glyph unicode="3" horiz-adv-x="1139" d="M86,387l180,24C287,309 322,236 372,191C421,146 482,123 553,123C638,123 709,152 768,211C826,270 855,342 855,429C855,512 828,580 774,634C720,687 651,714 568,714C534,714 492,707 441,694l20,158C473,851 483,850 490,850C567,850 636,870 697,910C758,950 789,1012 789,1095C789,1161 767,1216 722,1259C677,1302 620,1324 549,1324C479,1324 421,1302 374,1258C327,1214 297,1148 284,1060l-180,32C126,1213 176,1306 254,1373C332,1439 429,1472 545,1472C625,1472 699,1455 766,1421C833,1386 885,1339 921,1280C956,1221 974,1158 974,1091C974,1028 957,970 923,918C889,866 839,825 772,794C859,774 926,733 974,670C1022,607 1046,528 1046,433C1046,305 999,197 906,108C813,19 695,-26 552,-26C423,-26 317,12 232,89C147,166 98,265 86,387z"/>
+<glyph unicode="8" horiz-adv-x="1139" d="M362,795C287,822 232,861 196,912C160,963 142,1023 142,1094C142,1201 180,1290 257,1363C334,1436 436,1472 563,1472C691,1472 794,1435 872,1361C950,1286 989,1196 989,1089C989,1021 971,962 936,912C900,861 846,822 773,795C863,766 932,718 979,653C1026,588 1049,510 1049,419C1049,294 1005,188 916,103C827,18 711,-25 566,-25C421,-25 305,18 216,104C127,189 83,296 83,424C83,519 107,599 156,664C204,728 273,772 362,795M326,1100C326,1031 348,974 393,930C438,886 496,864 567,864C636,864 693,886 738,930C782,973 804,1027 804,1090C804,1156 781,1212 736,1257C690,1302 633,1324 565,1324C496,1324 439,1302 394,1258C349,1214 326,1161 326,1100M268,423C268,372 280,322 305,274C329,226 365,189 413,163C461,136 513,123 568,123C654,123 725,151 781,206C837,261 865,332 865,417C865,504 836,575 779,632C721,689 649,717 562,717C477,717 407,689 352,633C296,577 268,507 268,423z"/>
+<glyph unicode="B" horiz-adv-x="1366" d="M150,0l0,1466l550,0C812,1466 902,1451 970,1422C1037,1392 1090,1346 1129,1285C1167,1223 1186,1158 1186,1091C1186,1028 1169,969 1135,914C1101,859 1050,814 981,780C1070,754 1138,710 1186,647C1233,584 1257,510 1257,425C1257,356 1243,293 1214,234C1185,175 1149,129 1106,97C1063,65 1010,41 946,25C881,8 802,0 709,0M344,850l317,0C747,850 809,856 846,867C895,882 933,906 958,940C983,974 995,1017 995,1068C995,1117 983,1160 960,1197C937,1234 903,1259 860,1273C817,1286 742,1293 637,1293l-293,0M344,173l365,0C772,173 816,175 841,180C886,188 923,201 953,220C983,239 1008,266 1027,302C1046,337 1056,378 1056,425C1056,480 1042,527 1014,568C986,608 947,636 898,653C848,669 776,677 683,677l-339,0z"/>
+<glyph unicode="C" horiz-adv-x="1479" d="M1204,514l194,-49C1357,306 1284,184 1179,101C1073,17 944,-25 791,-25C633,-25 505,7 406,72C307,136 231,229 180,351C128,473 102,604 102,744C102,897 131,1030 190,1144C248,1257 331,1344 439,1403C546,1462 665,1491 794,1491C941,1491 1064,1454 1164,1379C1264,1304 1334,1199 1373,1064l-191,-45C1148,1126 1099,1203 1034,1252C969,1301 888,1325 790,1325C677,1325 583,1298 508,1244C432,1190 379,1118 348,1027C317,936 302,842 302,745C302,620 320,512 357,419C393,326 449,256 526,210C603,164 686,141 775,141C884,141 976,172 1051,235C1126,298 1177,391 1204,514z"/>
+<glyph unicode="D" horiz-adv-x="1479" d="M158,0l0,1466l505,0C777,1466 864,1459 924,1445C1008,1426 1080,1391 1139,1340C1216,1275 1274,1191 1313,1090C1351,988 1370,872 1370,741C1370,630 1357,531 1331,445C1305,359 1272,288 1231,232C1190,175 1146,131 1098,99C1049,66 991,42 923,25C854,8 776,0 687,0M352,173l313,0C762,173 838,182 893,200C948,218 991,243 1024,276C1070,322 1106,384 1132,462C1157,539 1170,633 1170,744C1170,897 1145,1015 1095,1098C1044,1180 983,1235 911,1263C859,1283 775,1293 660,1293l-308,0z"/>
+<glyph unicode="I" horiz-adv-x="569" d="M191,0l0,1466l194,0l0,-1466z"/>
+<glyph unicode="L" horiz-adv-x="1139" d="M150,0l0,1466l194,0l0,-1293l722,0l0,-173z"/>
+<glyph unicode="P" horiz-adv-x="1366" d="M158,0l0,1466l553,0C808,1466 883,1461 934,1452C1006,1440 1066,1417 1115,1384C1164,1350 1203,1303 1233,1242C1262,1181 1277,1115 1277,1042C1277,917 1237,812 1158,726C1079,639 935,596 728,596l-376,0l0,-596M352,769l379,0C856,769 945,792 998,839C1051,886 1077,951 1077,1036C1077,1097 1062,1150 1031,1194C1000,1237 959,1266 908,1280C875,1289 815,1293 727,1293l-375,0z"/>
+<glyph unicode="S" horiz-adv-x="1366" d="M92,471l183,16C284,414 304,354 336,307C367,260 416,222 483,193C550,164 625,149 708,149C782,149 847,160 904,182C961,204 1003,234 1031,273C1058,311 1072,353 1072,398C1072,444 1059,484 1032,519C1005,553 961,582 900,605C861,620 774,644 639,677C504,709 410,739 356,768C286,805 234,850 200,905C165,959 148,1020 148,1087C148,1161 169,1230 211,1295C253,1359 314,1408 395,1441C476,1474 565,1491 664,1491C773,1491 869,1474 952,1439C1035,1404 1098,1352 1143,1284C1188,1216 1212,1139 1215,1053l-186,-14C1019,1132 985,1202 928,1249C870,1296 785,1320 672,1320C555,1320 469,1299 416,1256C362,1213 335,1161 335,1100C335,1047 354,1004 392,970C429,936 527,901 685,866C842,830 950,799 1009,772C1094,733 1157,683 1198,623C1239,562 1259,493 1259,414C1259,336 1237,263 1192,194C1147,125 1083,71 1000,33C916,-6 822,-25 717,-25C584,-25 473,-6 384,33C294,72 224,130 173,208C122,285 95,373 92,471z"/>
+<glyph unicode="T" horiz-adv-x="1251" d="M531,0l0,1293l-483,0l0,173l1162,0l0,-173l-485,0l0,-1293z"/>
+<glyph unicode="U" horiz-adv-x="1479" d="M1120,1466l194,0l0,-847C1314,472 1297,355 1264,268C1231,181 1171,111 1084,57C997,2 882,-25 741,-25C604,-25 491,-1 404,46C317,93 254,162 217,252C180,341 161,464 161,619l0,847l194,0l0,-846C355,493 367,399 391,339C414,278 455,232 513,199C570,166 641,150 724,150C867,150 968,182 1029,247C1090,312 1120,436 1120,620z"/>
+<glyph unicode="X" horiz-adv-x="1366" d="M9,0l567,764l-500,702l231,0l266,-376C628,1012 668,952 691,910C724,963 762,1019 807,1077l295,389l211,0l-515,-691l555,-775l-240,0l-369,523C723,553 702,586 680,621C647,568 624,531 610,511l-368,-511z"/>
+</font>
+
+	<rect x="7.465" y="10.627" fill="#A0A0A0" stroke="#000000" width="80.473" height="80.473"/>
+<rect x="150.491" y="10.923" fill="#A0A0A0" stroke="#000000" width="80.474" height="80.178"/>
+<rect x="8.479" y="129.379" fill="#A0A0A0" stroke="#000000" width="80.473" height="80.473"/>
+<rect x="150.491" y="129.674" fill="#A0A0A0" stroke="#000000" width="80.474" height="80.178"/>
+<rect x="8.479" y="241.805" fill="#A0A0A0" stroke="#000000" width="80.473" height="80.473"/>
+<rect x="150.491" y="242.1" fill="#A0A0A0" stroke="#000000" width="80.474" height="80.177"/>
+<line fill="none" stroke="#000000" x1="48.716" y1="91.101" x2="48.716" y2="129.379"/>
+<line fill="none" stroke="#000000" x1="88.953" y1="50.864" x2="150.491" y2="51.012"/>
+<line fill="none" stroke="#000000" x1="88.953" y1="169.763" x2="150.491" y2="169.763"/>
+<line fill="none" stroke="#000000" x1="190.729" y1="91.101" x2="190.729" y2="129.379"/>
+<line fill="none" stroke="#000000" x1="48.716" y1="209.852" x2="48.716" y2="241.805"/>
+<line fill="none" stroke="#000000" x1="88.953" y1="282.189" x2="150.491" y2="282.189"/>
+<text transform="matrix(1 0 0 1 23.6948 57.3003)" font-family="'ArialMT'" font-size="18">CPU2</text>
+<text transform="matrix(1 0 0 1 22.3374 174.46)" font-family="'ArialMT'" font-size="18">CPU0</text>
+<text transform="matrix(1 0 0 1 169.082 55.1167)" font-family="'ArialMT'" font-size="18">CPU3</text>
+<text transform="matrix(1 0 0 1 169.082 175.8271)" font-family="'ArialMT'" font-size="18">CPU1</text>
+<text transform="matrix(1 0 0 1 22.6807 277.1895)"><tspan x="0" y="0" font-family="'ArialMT'" font-size="18">PCI-X</tspan><tspan x="0" y="21.601" font-family="'ArialMT'" font-size="18">(8131)</tspan></text>
+<text transform="matrix(1 0 0 1 169.082 275.1895)"><tspan x="0" y="0" font-family="'ArialMT'" font-size="18">  SB</tspan><tspan x="0" y="21.6" font-family="'ArialMT'" font-size="18">(8111)</tspan></text>
+<text transform="matrix(1 0 0 1 93.0947 63.8721)" font-family="'ArialMT'" font-size="10">LDT1</text>
+<text transform="matrix(1 0 0 1 124.5088 46.7715)" font-family="'ArialMT'" font-size="10">LDT1</text>
+<text transform="matrix(1 0 0 1 196.6982 102.9844)" font-family="'ArialMT'" font-size="10">LDT0</text>
+<text transform="matrix(1 0 0 1 161.1953 126.0615)" font-family="'ArialMT'" font-size="10">LDT1</text>
+<text transform="matrix(1 0 0 1 22.3374 126.0615)" font-family="'ArialMT'" font-size="10">LDT2</text>
+<text transform="matrix(1 0 0 1 55.2783 103.5767)" font-family="'ArialMT'" font-size="10">LDT0</text>
+<text transform="matrix(1 0 0 1 52.9111 221.3276)" font-family="'ArialMT'" font-size="10">LDT0</text>
+<text transform="matrix(1 0 0 1 93.0947 181.6719)" font-family="'ArialMT'" font-size="10">LDT1</text>
+<text transform="matrix(1 0 0 1 124.5088 166.2979)" font-family="'ArialMT'" font-size="10">LDT0</text>
+<ellipse fill="#FF0606" cx="150.491" cy="51.012" rx="4.438" ry="4.563"/>
+<ellipse fill="#FF0606" cx="88.953" cy="169.763" rx="4.438" ry="4.563"/>
+<ellipse fill="#FF0606" cx="190.729" cy="129.379" rx="4.438" ry="4.563"/>
+</svg>

payloads/bayou/Makefile

@@ -0,0 +1,67 @@
+##
+## This file is part of the bayou project.
+##
+## Copyright (C) 2008 Advanced Micro Devices, Inc.
+##
+## 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.
+##
+## 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., 51 Franklin St, Fifth Floor, Boston, MA  02110-1301 USA
+##
+
+CONFIG_LZMA=y
+CONFIG_NRV2B=y
+CONFIG_BUILTIN_LAR=y
+
+PBUILDER_CONFIG=bayou.xml
+BUILTIN_LAR=builtin.lar
+
+LIBPAYLOAD_DIR := ../libpayload
+
+CC=gcc
+
+FFLAGS-y=
+FFLAGS-$(CONFIG_BUILTIN_LAR) += -DCONFIG_BUILTIN_LAR
+FFLAGS-$(CONFIG_LZMA) += -DCONFIG_LZMA
+FFLAGS-$(CONFIG_NRV2B) += -DCONFIG_NRV2B
+
+OBJECTS-y=main.o payload.o config.o menu.o self.o
+OBJECTS-$(CONFIG_LZMA) += lzma.o
+OBJECTS-$(CONFIG_NRV2B) += nrv2b.o
+OBJECTS-$(CONFIG_BUILTIN_LAR) += builtin-lar.o
+
+CFLAGS= -Wall -Werror -Os $(FFLAGS-y)
+LDFLAGS=-Wl,-T,bayou.ldscript -static
+LIBGCC=$(shell $(CC) -m32 -print-libgcc-file-name)
+
+LPCC=$(LIBPAYLOAD_DIR)/bin/lpgcc
+
+bayou.elf: $(OBJECTS-y)
+	$(LPCC) $(LDFLAGS) -m32 -o $@ $(OBJECTS-y)
+	@ strip $@
+
+builtin-lar.o: $(BUILTIN_LAR)
+	@ objcopy -I binary -B i386 -O elf32-i386 $(BUILTIN_LAR) $@
+
+builtin.lar: util/pbuilder/pbuilder
+	@ rm -f $@
+	util/pbuilder/pbuilder -c $(PBUILDER_CONFIG) create $@
+
+util/pbuilder/pbuilder:
+	make -C util/pbuilder
+
+%.o: %.c
+	$(LPCC) $(CFLAGS) -c -o $@ $<
+
+clean:
+	rm -f *.o bayou.elf builtin.lar
+	make -C util/pbuilder clean
+

payloads/bayou/bayou.h

@@ -0,0 +1,87 @@
+/*
+ * This file is part of the bayou project.
+ *
+ * Copyright (C) 2008 Advanced Micro Devices, Inc.
+ *
+ * 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.
+ *
+ * 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., 51 Franklin St, Fifth Floor, Boston, MA  02110-1301 USA
+ */
+
+#ifndef BAYOU_H_
+#define BAYOU_H_
+
+#include <libpayload.h>
+
+#define BAYOU_MAX_ENTRIES 10
+
+struct bpt_config {
+	u32 id;
+	u8 timeout;
+	u8 entries;
+	u8 padding[10];
+};
+
+struct bpt_pentry {
+	u8 index;
+	u8 parent;
+	u8 type;
+	u8 flags;
+	u8 title[64];
+	u8 nlen;
+};
+
+#define BPT_ID            0x30545042
+#define BPT_TYPE_CHOOSER  0x01
+#define BPT_TYPE_CHAIN    0x02
+#define BPT_TYPE_SUBCHAIN 0x03
+
+#define BPT_FLAG_DEFAULT  0x01
+#define BPT_FLAG_NOSHOW   0x02
+
+enum bayou_params {
+	BAYOU_PARAM_NAME = 0,
+	BAYOU_PARAM_LIST,
+	BAYOU_PARAM_DESC,
+	BAYOU_PARAMS_COUNT
+};
+
+struct payload {
+	struct bpt_pentry pentry;
+	struct larstat stat;
+	u8 *fptr;
+	char *params[BAYOU_PARAMS_COUNT];
+};
+
+struct bayoucfg {
+	u8 timeout;
+	int n_entries;
+	struct payload entries[BAYOU_MAX_ENTRIES];
+};
+
+extern struct bayoucfg bayoucfg;
+
+int verify_self(u8 *ptr);
+int self_get_params(u8 *fptr, u8 **params);
+int self_load_and_run(struct payload *p, int *ret);
+
+void menu(void);
+
+void run_payload(struct payload *p);
+char *payload_get_name(struct payload *p);
+struct payload *payload_get_default(void);
+void run_payload_timeout(struct payload *p, int timeout);
+void payload_parse_params(struct payload *pload, u8 *params, int len);
+
+int get_configuration(struct LAR *lar);
+
+#endif

payloads/bayou/bayou.ldscript

@@ -0,0 +1,87 @@
+/*
+ * This file is part of the bayou project.
+ *
+ * Copyright (C) 2008 Advanced Micro Devices, Inc.
+ *
+ * Redistribution and use in source and binary forms, with or without
+ * modification, are permitted provided that the following conditions
+ * are met:
+ * 1. Redistributions of source code must retain the above copyright
+ *    notice, this list of conditions and the following disclaimer.
+ * 2. Redistributions in binary form must reproduce the above copyright
+ *    notice, this list of conditions and the following disclaimer in the
+ *    documentation and/or other materials provided with the distribution.
+ * 3. The name of the author may not be used to endorse or promote products
+ *    derived from this software without specific prior written permission.
+ *
+ * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
+ * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+ * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+ * ARE DISCLAIMED.  IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
+ * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
+ * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
+ * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
+ * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
+ * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
+ * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
+ * SUCH DAMAGE.
+ */
+
+BASE_ADDRESS = 0x19000;
+
+OUTPUT_FORMAT(elf32-i386)
+OUTPUT_ARCH(i386)
+
+ENTRY(_entry)
+
+HEAP_SIZE = 16384;
+STACK_SIZE = 16384;
+
+SECTIONS
+{
+	. = BASE_ADDRESS;
+
+	. = ALIGN(16);
+	_start = .;
+
+	.text : {
+		*(.text._entry)
+		*(.text)
+		*(.text.*)
+	}
+
+	.rodata : {
+		*(.rodata)
+		*(.rodata.*)
+	}
+
+	.data : {
+		*(.data)
+		*(.data.*)
+	}
+
+	_edata = .;
+
+	.bss : {
+		*(.bss)
+		*(.bss.*)
+		*(COMMON)
+
+		/* Stack and heap */
+
+		. = ALIGN(16);
+		_heap = .;
+		. += HEAP_SIZE;
+		. = ALIGN(16);
+		_eheap = .;
+
+		_estack = .;
+		. += STACK_SIZE;
+		. = ALIGN(16);
+		_stack = .;
+	}
+
+	_end = .;
+
+	/DISCARD/ : { *(.comment) *(.note) *(.note.*) }
+}

payloads/bayou/bayou.xml.example

@@ -0,0 +1,42 @@
+<!--
+## This file is part of the bayou project.
+##
+## Copyright (C) 2008 Advanced Micro Devices, Inc.
+##
+## 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.
+##
+## 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., 51 Franklin St, Fifth Floor, Boston, MA  02110-1301 USA
+-->
+
+<!-- Sample Bayou config file. Adapt as needed, then rename to bayou.xml. -->
+
+<BayouConfig>
+  <global>
+    <timeout>10</timeout>
+  </global>
+  <payloads>
+    <payload type="chain" flags="default">
+      <title>Default Chain</title>
+      <chain>
+	<file>payloads/passwd.elf</file>
+	<lar>passwd</lar>
+      </chain>      
+      <chain>
+	<file>payloads/coreinfo.elf</file>
+      </chain>
+    </payload>    
+    <payload type="chooser">
+      <file>payloads/coreinfo.elf</file>
+    </payload>
+  </payloads>
+</BayouConfig>
+

payloads/bayou/config.c

@@ -0,0 +1,165 @@
+/*
+ * This file is part of the bayou project.
+ *
+ * Copyright (C) 2008 Advanced Micro Devices, Inc.
+ *
+ * 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.
+ *
+ * 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., 51 Franklin St, Fifth Floor, Boston, MA  02110-1301 USA
+ */
+
+#include "bayou.h"
+
+struct bayoucfg bayoucfg;
+
+static int add_payload(struct LAR *lar, struct larent *larent)
+{
+	struct payload *payload;
+	int plen;
+	u8 *params = NULL;
+	u8 *fptr;
+
+	if (bayoucfg.n_entries == BAYOU_MAX_ENTRIES)
+		return -1;
+
+	payload = &bayoucfg.entries[bayoucfg.n_entries];
+
+	if (strncmp((char *)larent->name, "payload/", 8))
+		return -1;
+
+	if (larstat(lar, (const char *)larent->name, &payload->stat))
+		return -1;
+
+	/* Make sure the LAR entry is valid. */
+	if (!lfverify(lar, (const char *)larent->name))
+		return -1;
+
+	/* Get a pointer to the start of the file. */
+	fptr = larfptr(lar, (const char *)larent->name);
+
+	if (fptr == NULL)
+		return -1;
+
+	if (!verify_self(fptr))
+		return -1;
+
+	payload->pentry.index = bayoucfg.n_entries;
+	payload->pentry.parent = 0;
+	payload->pentry.type = BPT_TYPE_CHOOSER;
+	payload->pentry.flags = 0;
+
+	plen = self_get_params(fptr, &params);
+	payload_parse_params(payload, params, plen);
+
+	payload->fptr = fptr;
+
+	bayoucfg.n_entries++;
+
+	return 0;
+}
+
+static int lar_walk_files(struct LAR *lar,
+			  int (*cb) (struct LAR *, struct larent *))
+{
+	struct larent *larent;
+	int ret = 0;
+
+	rewindlar(lar);
+
+	while ((larent = readlar(lar)) != NULL) {
+		if ((ret = cb(lar, larent)))
+			break;
+	}
+
+	return ret;
+}
+
+/**
+ * If reading the bayou_payload_table fails for some reason, then construct
+ * a dummy table. All valid payloads in the lar are added as chooser items.
+ */
+static void build_dummy_table(struct LAR *lar)
+{
+	bayoucfg.timeout = 0xFF;
+	bayoucfg.n_entries = 0;
+
+	lar_walk_files(lar, add_payload);
+}
+
+int get_configuration(struct LAR *lar)
+{
+	struct larstat stat;
+	struct bpt_config *bptcfg;
+	u8 *fptr, *ptr;
+	int i;
+
+	/*
+	 * If bayou_payload_table doesn't exist, then dummy up
+	 * a table from the LAR contents.
+	 */
+	if (larstat(lar, "bayou_payload_table", &stat) ||
+	    !lfverify(lar, "bayou_payload_table"))
+		build_dummy_table(lar);
+
+	/* Open up the BPT and get the creamy goodness within. */
+
+	fptr = larfptr(lar, "bayou_payload_table");
+
+	if (fptr == NULL)
+		build_dummy_table(lar);
+
+	bptcfg = (struct bpt_config *)fptr;
+	bayoucfg.timeout = bptcfg->timeout;
+
+	bayoucfg.n_entries = bptcfg->entries;
+
+	if (bayoucfg.n_entries > BAYOU_MAX_ENTRIES) {
+		printf("W:  Limiting the number of entries to %d\n",
+		       BAYOU_MAX_ENTRIES);
+		bayoucfg.n_entries = BAYOU_MAX_ENTRIES;
+	}
+
+	ptr = fptr + sizeof(struct bpt_config);
+
+	for (i = 0; i < bayoucfg.n_entries; i++) {
+		struct bpt_pentry *entry = (struct bpt_pentry *)ptr;
+		struct payload *p = &(bayoucfg.entries[i]);
+		int plen;
+		u8 *params = NULL;
+
+		memcpy(&p->pentry, entry, sizeof(struct bpt_pentry));
+
+		if (entry->type != BPT_TYPE_CHAIN) {
+			char *lname = (char *)ptr + sizeof(struct bpt_pentry);
+
+			if (larstat(lar, (const char *)lname, &p->stat))
+				build_dummy_table(lar);
+
+			if (!lfverify(lar, (const char *)lname))
+				build_dummy_table(lar);
+
+			fptr = larfptr(lar, (const char *)lname);
+
+			if (verify_self(fptr))
+				p->fptr = fptr;
+			else
+				build_dummy_table(lar);
+
+			plen = self_get_params(fptr, &params);
+			payload_parse_params(p, params, plen);
+		}
+
+		ptr += sizeof(struct bpt_pentry) + entry->nlen;
+	}
+
+	return 0;
+}

payloads/bayou/lzma.c

@@ -0,0 +1,43 @@
+/*
+
+Coreboot interface to memory-saving variant of LZMA decoder
+
+(C)opyright 2006 Carl-Daniel Hailfinger
+Released under the GNU GPL v2 or later
+
+Parts of this file are based on C/7zip/Compress/LZMA_C/LzmaTest.c from the LZMA
+SDK 4.42, which is written and distributed to public domain by Igor Pavlov.
+
+*/
+
+#include <libpayload.h>
+#include "lzmadecode.c"
+
+unsigned long ulzma(u8 *src, u8 *dst)
+{
+	unsigned char properties[LZMA_PROPERTIES_SIZE];
+	UInt32 outSize;
+	SizeT inProcessed;
+	SizeT outProcessed;
+	int res;
+	CLzmaDecoderState state;
+	SizeT mallocneeds;
+	unsigned char scratchpad[15980];
+
+	memcpy(properties, src, LZMA_PROPERTIES_SIZE);
+	outSize = *(UInt32 *)(src + LZMA_PROPERTIES_SIZE);
+	if (LzmaDecodeProperties(&state.Properties, properties, LZMA_PROPERTIES_SIZE) != LZMA_RESULT_OK) {
+		printf("Incorrect stream properties\n");
+	}
+	mallocneeds = (LzmaGetNumProbs(&state.Properties) * sizeof(CProb));
+	if (mallocneeds > 15980) {
+		printf("Decoder scratchpad too small!\n");
+	}
+	state.Probs = (CProb *)scratchpad;
+	res = LzmaDecode(&state, src + LZMA_PROPERTIES_SIZE + 8, (SizeT)0xffffffff, &inProcessed,
+		dst, outSize, &outProcessed);
+	if (res != 0) {
+		printf("Decoding error = %d\n", res);
+	}
+	return outSize;
+}

payloads/bayou/lzmadecode.c

@@ -0,0 +1,398 @@
+/*
+  LzmaDecode.c
+  LZMA Decoder (optimized for Speed version)
+  
+  LZMA SDK 4.40 Copyright (c) 1999-2006 Igor Pavlov (2006-05-01)
+  http://www.7-zip.org/
+
+  LZMA SDK is licensed under two licenses:
+  1) GNU Lesser General Public License (GNU LGPL)
+  2) Common Public License (CPL)
+  It means that you can select one of these two licenses and 
+  follow rules of that license.
+
+  SPECIAL EXCEPTION:
+  Igor Pavlov, as the author of this Code, expressly permits you to 
+  statically or dynamically link your Code (or bind by name) to the 
+  interfaces of this file without subjecting your linked Code to the 
+  terms of the CPL or GNU LGPL. Any modifications or additions 
+  to this file, however, are subject to the LGPL or CPL terms.
+*/
+
+#include "lzmadecode.h"
+
+#define kNumTopBits 24
+#define kTopValue ((UInt32)1 << kNumTopBits)
+
+#define kNumBitModelTotalBits 11
+#define kBitModelTotal (1 << kNumBitModelTotalBits)
+#define kNumMoveBits 5
+
+#define RC_READ_BYTE (*Buffer++)
+
+#define RC_INIT2 Code = 0; Range = 0xFFFFFFFF; \
+  { int i; for(i = 0; i < 5; i++) { RC_TEST; Code = (Code << 8) | RC_READ_BYTE; }}
+
+
+#define RC_TEST { if (Buffer == BufferLim) return LZMA_RESULT_DATA_ERROR; }
+
+#define RC_INIT(buffer, bufferSize) Buffer = buffer; BufferLim = buffer + bufferSize; RC_INIT2
+ 
+
+#define RC_NORMALIZE if (Range < kTopValue) { RC_TEST; Range <<= 8; Code = (Code << 8) | RC_READ_BYTE; }
+
+#define IfBit0(p) RC_NORMALIZE; bound = (Range >> kNumBitModelTotalBits) * *(p); if (Code < bound)
+#define UpdateBit0(p) Range = bound; *(p) += (kBitModelTotal - *(p)) >> kNumMoveBits;
+#define UpdateBit1(p) Range -= bound; Code -= bound; *(p) -= (*(p)) >> kNumMoveBits;
+
+#define RC_GET_BIT2(p, mi, A0, A1) IfBit0(p) \
+  { UpdateBit0(p); mi <<= 1; A0; } else \
+  { UpdateBit1(p); mi = (mi + mi) + 1; A1; } 
+  
+#define RC_GET_BIT(p, mi) RC_GET_BIT2(p, mi, ; , ;)               
+
+#define RangeDecoderBitTreeDecode(probs, numLevels, res) \
+  { int i = numLevels; res = 1; \
+  do { CProb *p = probs + res; RC_GET_BIT(p, res) } while(--i != 0); \
+  res -= (1 << numLevels); }
+
+
+#define kNumPosBitsMax 4
+#define kNumPosStatesMax (1 << kNumPosBitsMax)
+
+#define kLenNumLowBits 3
+#define kLenNumLowSymbols (1 << kLenNumLowBits)
+#define kLenNumMidBits 3
+#define kLenNumMidSymbols (1 << kLenNumMidBits)
+#define kLenNumHighBits 8
+#define kLenNumHighSymbols (1 << kLenNumHighBits)
+
+#define LenChoice 0
+#define LenChoice2 (LenChoice + 1)
+#define LenLow (LenChoice2 + 1)
+#define LenMid (LenLow + (kNumPosStatesMax << kLenNumLowBits))
+#define LenHigh (LenMid + (kNumPosStatesMax << kLenNumMidBits))
+#define kNumLenProbs (LenHigh + kLenNumHighSymbols) 
+
+
+#define kNumStates 12
+#define kNumLitStates 7
+
+#define kStartPosModelIndex 4
+#define kEndPosModelIndex 14
+#define kNumFullDistances (1 << (kEndPosModelIndex >> 1))
+
+#define kNumPosSlotBits 6
+#define kNumLenToPosStates 4
+
+#define kNumAlignBits 4
+#define kAlignTableSize (1 << kNumAlignBits)
+
+#define kMatchMinLen 2
+
+#define IsMatch 0
+#define IsRep (IsMatch + (kNumStates << kNumPosBitsMax))
+#define IsRepG0 (IsRep + kNumStates)
+#define IsRepG1 (IsRepG0 + kNumStates)
+#define IsRepG2 (IsRepG1 + kNumStates)
+#define IsRep0Long (IsRepG2 + kNumStates)
+#define PosSlot (IsRep0Long + (kNumStates << kNumPosBitsMax))
+#define SpecPos (PosSlot + (kNumLenToPosStates << kNumPosSlotBits))
+#define Align (SpecPos + kNumFullDistances - kEndPosModelIndex)
+#define LenCoder (Align + kAlignTableSize)
+#define RepLenCoder (LenCoder + kNumLenProbs)
+#define Literal (RepLenCoder + kNumLenProbs)
+
+#if Literal != LZMA_BASE_SIZE
+StopCompilingDueBUG
+#endif
+
+int LzmaDecodeProperties(CLzmaProperties *propsRes, const unsigned char *propsData, int size)
+{
+  unsigned char prop0;
+  if (size < LZMA_PROPERTIES_SIZE)
+    return LZMA_RESULT_DATA_ERROR;
+  prop0 = propsData[0];
+  if (prop0 >= (9 * 5 * 5))
+    return LZMA_RESULT_DATA_ERROR;
+  {
+    for (propsRes->pb = 0; prop0 >= (9 * 5); propsRes->pb++, prop0 -= (9 * 5));
+    for (propsRes->lp = 0; prop0 >= 9; propsRes->lp++, prop0 -= 9);
+    propsRes->lc = prop0;
+    /*
+    unsigned char remainder = (unsigned char)(prop0 / 9);
+    propsRes->lc = prop0 % 9;
+    propsRes->pb = remainder / 5;
+    propsRes->lp = remainder % 5;
+    */
+  }
+
+  return LZMA_RESULT_OK;
+}
+
+#define kLzmaStreamWasFinishedId (-1)
+
+int LzmaDecode(CLzmaDecoderState *vs,
+    const unsigned char *inStream, SizeT inSize, SizeT *inSizeProcessed,
+    unsigned char *outStream, SizeT outSize, SizeT *outSizeProcessed)
+{
+  CProb *p = vs->Probs;
+  SizeT nowPos = 0;
+  Byte previousByte = 0;
+  UInt32 posStateMask = (1 << (vs->Properties.pb)) - 1;
+  UInt32 literalPosMask = (1 << (vs->Properties.lp)) - 1;
+  int lc = vs->Properties.lc;
+
+
+  int state = 0;
+  UInt32 rep0 = 1, rep1 = 1, rep2 = 1, rep3 = 1;
+  int len = 0;
+  const Byte *Buffer;
+  const Byte *BufferLim;
+  UInt32 Range;
+  UInt32 Code;
+
+  *inSizeProcessed = 0;
+  *outSizeProcessed = 0;
+
+  {
+    UInt32 i;
+    UInt32 numProbs = Literal + ((UInt32)LZMA_LIT_SIZE << (lc + vs->Properties.lp));
+    for (i = 0; i < numProbs; i++)
+      p[i] = kBitModelTotal >> 1;
+  }
+  
+  RC_INIT(inStream, inSize);
+
+
+  while(nowPos < outSize)
+  {
+    CProb *prob;
+    UInt32 bound;
+    int posState = (int)(
+        (nowPos 
+        )
+        & posStateMask);
+
+    prob = p + IsMatch + (state << kNumPosBitsMax) + posState;
+    IfBit0(prob)
+    {
+      int symbol = 1;
+      UpdateBit0(prob)
+      prob = p + Literal + (LZMA_LIT_SIZE * 
+        (((
+        (nowPos 
+        )
+        & literalPosMask) << lc) + (previousByte >> (8 - lc))));
+
+      if (state >= kNumLitStates)
+      {
+        int matchByte;
+        matchByte = outStream[nowPos - rep0];
+        do
+        {
+          int bit;
+          CProb *probLit;
+          matchByte <<= 1;
+          bit = (matchByte & 0x100);
+          probLit = prob + 0x100 + bit + symbol;
+          RC_GET_BIT2(probLit, symbol, if (bit != 0) break, if (bit == 0) break)
+        }
+        while (symbol < 0x100);
+      }
+      while (symbol < 0x100)
+      {
+        CProb *probLit = prob + symbol;
+        RC_GET_BIT(probLit, symbol)
+      }
+      previousByte = (Byte)symbol;
+
+      outStream[nowPos++] = previousByte;
+      if (state < 4) state = 0;
+      else if (state < 10) state -= 3;
+      else state -= 6;
+    }
+    else             
+    {
+      UpdateBit1(prob);
+      prob = p + IsRep + state;
+      IfBit0(prob)
+      {
+        UpdateBit0(prob);
+        rep3 = rep2;
+        rep2 = rep1;
+        rep1 = rep0;
+        state = state < kNumLitStates ? 0 : 3;
+        prob = p + LenCoder;
+      }
+      else
+      {
+        UpdateBit1(prob);
+        prob = p + IsRepG0 + state;
+        IfBit0(prob)
+        {
+          UpdateBit0(prob);
+          prob = p + IsRep0Long + (state << kNumPosBitsMax) + posState;
+          IfBit0(prob)
+          {
+            UpdateBit0(prob);
+            
+            if (nowPos == 0)
+              return LZMA_RESULT_DATA_ERROR;
+            
+            state = state < kNumLitStates ? 9 : 11;
+            previousByte = outStream[nowPos - rep0];
+            outStream[nowPos++] = previousByte;
+
+            continue;
+          }
+          else
+          {
+            UpdateBit1(prob);
+          }
+        }
+        else
+        {
+          UInt32 distance;
+          UpdateBit1(prob);
+          prob = p + IsRepG1 + state;
+          IfBit0(prob)
+          {
+            UpdateBit0(prob);
+            distance = rep1;
+          }
+          else 
+          {
+            UpdateBit1(prob);
+            prob = p + IsRepG2 + state;
+            IfBit0(prob)
+            {
+              UpdateBit0(prob);
+              distance = rep2;
+            }
+            else
+            {
+              UpdateBit1(prob);
+              distance = rep3;
+              rep3 = rep2;
+            }
+            rep2 = rep1;
+          }
+          rep1 = rep0;
+          rep0 = distance;
+        }
+        state = state < kNumLitStates ? 8 : 11;
+        prob = p + RepLenCoder;
+      }
+      {
+        int numBits, offset;
+        CProb *probLen = prob + LenChoice;
+        IfBit0(probLen)
+        {
+          UpdateBit0(probLen);
+          probLen = prob + LenLow + (posState << kLenNumLowBits);
+          offset = 0;
+          numBits = kLenNumLowBits;
+        }
+        else
+        {
+          UpdateBit1(probLen);
+          probLen = prob + LenChoice2;
+          IfBit0(probLen)
+          {
+            UpdateBit0(probLen);
+            probLen = prob + LenMid + (posState << kLenNumMidBits);
+            offset = kLenNumLowSymbols;
+            numBits = kLenNumMidBits;
+          }
+          else
+          {
+            UpdateBit1(probLen);
+            probLen = prob + LenHigh;
+            offset = kLenNumLowSymbols + kLenNumMidSymbols;
+            numBits = kLenNumHighBits;
+          }
+        }
+        RangeDecoderBitTreeDecode(probLen, numBits, len);
+        len += offset;
+      }
+
+      if (state < 4)
+      {
+        int posSlot;
+        state += kNumLitStates;
+        prob = p + PosSlot +
+            ((len < kNumLenToPosStates ? len : kNumLenToPosStates - 1) << 
+            kNumPosSlotBits);
+        RangeDecoderBitTreeDecode(prob, kNumPosSlotBits, posSlot);
+        if (posSlot >= kStartPosModelIndex)
+        {
+          int numDirectBits = ((posSlot >> 1) - 1);
+          rep0 = (2 | ((UInt32)posSlot & 1));
+          if (posSlot < kEndPosModelIndex)
+          {
+            rep0 <<= numDirectBits;
+            prob = p + SpecPos + rep0 - posSlot - 1;
+          }
+          else
+          {
+            numDirectBits -= kNumAlignBits;
+            do
+            {
+              RC_NORMALIZE
+              Range >>= 1;
+              rep0 <<= 1;
+              if (Code >= Range)
+              {
+                Code -= Range;
+                rep0 |= 1;
+              }
+            }
+            while (--numDirectBits != 0);
+            prob = p + Align;
+            rep0 <<= kNumAlignBits;
+            numDirectBits = kNumAlignBits;
+          }
+          {
+            int i = 1;
+            int mi = 1;
+            do
+            {
+              CProb *prob3 = prob + mi;
+              RC_GET_BIT2(prob3, mi, ; , rep0 |= i);
+              i <<= 1;
+            }
+            while(--numDirectBits != 0);
+          }
+        }
+        else
+          rep0 = posSlot;
+        if (++rep0 == (UInt32)(0))
+        {
+          /* it's for stream version */
+          len = kLzmaStreamWasFinishedId;
+          break;
+        }
+      }
+
+      len += kMatchMinLen;
+      if (rep0 > nowPos)
+        return LZMA_RESULT_DATA_ERROR;
+
+
+      do
+      {
+        previousByte = outStream[nowPos - rep0];
+        len--;
+        outStream[nowPos++] = previousByte;
+      }
+      while(len != 0 && nowPos < outSize);
+    }
+  }
+  RC_NORMALIZE;
+
+
+  *inSizeProcessed = (SizeT)(Buffer - inStream);
+  *outSizeProcessed = nowPos;
+  return LZMA_RESULT_OK;
+}

payloads/bayou/lzmadecode.h

@@ -0,0 +1,67 @@
+/* 
+  LzmaDecode.h
+  LZMA Decoder interface
+
+  LZMA SDK 4.40 Copyright (c) 1999-2006 Igor Pavlov (2006-05-01)
+  http://www.7-zip.org/
+
+  LZMA SDK is licensed under two licenses:
+  1) GNU Lesser General Public License (GNU LGPL)
+  2) Common Public License (CPL)
+  It means that you can select one of these two licenses and 
+  follow rules of that license.
+
+  SPECIAL EXCEPTION:
+  Igor Pavlov, as the author of this code, expressly permits you to 
+  statically or dynamically link your code (or bind by name) to the 
+  interfaces of this file without subjecting your linked code to the 
+  terms of the CPL or GNU LGPL. Any modifications or additions 
+  to this file, however, are subject to the LGPL or CPL terms.
+*/
+
+#ifndef LZMADECODE_H
+#define LZMADECODE_H
+
+typedef unsigned char Byte;
+typedef unsigned short UInt16;
+typedef unsigned int UInt32;
+typedef UInt32 SizeT;
+
+#define CProb UInt16
+
+#define LZMA_RESULT_OK 0
+#define LZMA_RESULT_DATA_ERROR 1
+
+
+#define LZMA_BASE_SIZE 1846
+#define LZMA_LIT_SIZE 768
+
+#define LZMA_PROPERTIES_SIZE 5
+
+typedef struct _CLzmaProperties
+{
+  int lc;
+  int lp;
+  int pb;
+}CLzmaProperties;
+
+int LzmaDecodeProperties(CLzmaProperties *propsRes, const unsigned char *propsData, int size);
+
+#define LzmaGetNumProbs(Properties) (LZMA_BASE_SIZE + (LZMA_LIT_SIZE << ((Properties)->lc + (Properties)->lp)))
+
+#define kLzmaNeedInitId (-2)
+
+typedef struct _CLzmaDecoderState
+{
+  CLzmaProperties Properties;
+  CProb *Probs;
+
+
+} CLzmaDecoderState;
+
+
+int LzmaDecode(CLzmaDecoderState *vs,
+    const unsigned char *inStream, SizeT inSize, SizeT *inSizeProcessed,
+    unsigned char *outStream, SizeT outSize, SizeT *outSizeProcessed);
+
+#endif /* LZMADECODE_H */

payloads/bayou/main.c

@@ -0,0 +1,70 @@
+/*
+ * This file is part of the bayou project.
+ *
+ * Copyright (C) 2008 Advanced Micro Devices, Inc.
+ *
+ * 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.
+ *
+ * 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., 51 Franklin St, Fifth Floor, Boston, MA  02110-1301 USA
+ */
+
+#include "bayou.h"
+
+static void print_banner(void)
+{
+	printf("\e[H\e[JBayou Payload Chooser v0.3\n");
+}
+
+int main(void)
+{
+	extern unsigned long _binary_builtin_lar_start;
+	struct LAR *lar;
+
+	print_banner();
+
+	lar = openlar((void *)&_binary_builtin_lar_start);
+
+	if (lar == NULL) {
+		printf("[CHOOSER]: Unable to scan the attached LAR file\n");
+		return -1;
+	}
+
+	get_configuration(lar);
+
+	if (bayoucfg.n_entries == 0) {
+		printf("[CHOOSER]:  No payloads were found in the LAR\n");
+		return -1;
+	}
+
+	/*
+	 * If timeout == 0xFF, then show the menu immediately.
+	 * If timeout is zero, then find and run the default item immediately.
+	 * If there is no default item, then show the menu.
+	 * If timeout is anything else, then show a message and wait for a
+	 * keystroke. If there is no keystroke in time then run the default.
+	 * If there is no default then show the menu.
+	 */
+	if (bayoucfg.timeout != 0xFF) {
+		struct payload *d = payload_get_default();
+
+		if (d != NULL) {
+			if (bayoucfg.timeout == 0)
+				run_payload(d);
+			else
+				run_payload_timeout(d, bayoucfg.timeout);
+		}
+	}
+
+	menu();
+
+	return 0;
+}

payloads/bayou/menu.c

@@ -0,0 +1,156 @@
+/*
+ * This file is part of the bayou project.
+ *
+ * Copyright (C) 2008 Advanced Micro Devices, Inc.
+ *
+ * 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.
+ *
+ * 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., 51 Franklin St, Fifth Floor, Boston, MA  02110-1301 USA
+ */
+
+#include <libpayload.h>
+#include <curses.h>
+#include "bayou.h"
+
+#define SCREEN_X 80
+#define SCREEN_Y 25
+
+static int menu_width = 0;
+static struct payload *mpayloads[BAYOU_MAX_ENTRIES];
+static int m_entries = 0;
+static unsigned int selected = 0;
+static WINDOW *menuwin, *status;
+
+void create_menu(void)
+{
+	int i;
+
+	for (i = 0; i < bayoucfg.n_entries; i++) {
+		struct payload *p = &(bayoucfg.entries[i]);
+		char *name;
+
+		if ((p->pentry.parent != 0) ||
+		    (p->pentry.flags & BPT_FLAG_NOSHOW))
+			continue;
+
+		mpayloads[m_entries++] = p;
+
+		name = payload_get_name(p);
+
+		if (strlen(name) > menu_width)
+			menu_width = strlen(name);
+	}
+
+	menu_width += 4;
+
+	if (menu_width < 30)
+		menu_width = 30;
+
+	menuwin = newwin(m_entries + 3, menu_width,
+			 (SCREEN_Y - (m_entries + 3)) / 2,
+			 (SCREEN_X - menu_width) / 2);
+}
+
+void draw_menu(void)
+{
+	struct payload *s;
+	int i;
+
+	wattrset(menuwin, COLOR_PAIR(3));
+	wclear(menuwin);
+	wborder(menuwin, ACS_VLINE, ACS_VLINE, ACS_HLINE, ACS_HLINE,
+		ACS_ULCORNER, ACS_URCORNER, ACS_LLCORNER, ACS_LRCORNER);
+
+	wattrset(menuwin, COLOR_PAIR(4) | A_BOLD);
+	mvwprintw(menuwin, 0, (menu_width - 17) / 2, " Payload Chooser ");
+
+	wattrset(menuwin, COLOR_PAIR(3));
+
+	for (i = 0; i < m_entries; i++) {
+		char *name = payload_get_name(mpayloads[i]);
+		int col = (menu_width - (2 + strlen(name))) / 2;
+
+		if (i == selected)
+			wattrset(menuwin, COLOR_PAIR(5) | A_BOLD);
+		else
+			wattrset(menuwin, COLOR_PAIR(3));
+
+		mvwprintw(menuwin, 2 + i, col, name);
+	}
+
+	s = mpayloads[selected];
+
+	wclear(status);
+
+	if (s->params[BAYOU_PARAM_DESC] != NULL) {
+		char buf[66];
+		int len = strnlen(s->params[BAYOU_PARAM_DESC], 65);
+
+		snprintf(buf, 65, s->params[BAYOU_PARAM_DESC]);
+		buf[65] = 0;
+
+		mvwprintw(status, 0, (80 - len) / 2, buf);
+	}
+
+	wrefresh(menuwin);
+	wrefresh(status);
+}
+
+void loop(void)
+{
+	int key;
+
+	while (1) {
+		key = getch();
+
+		if (key == ERR)
+			continue;
+
+		if (key == KEY_DOWN)
+			selected = (selected + 1) % m_entries;
+		else if (key == KEY_UP)
+			selected = (selected - 1) % m_entries;
+		else if (key == KEY_ENTER) {
+			run_payload(mpayloads[selected]);
+			clear();
+			refresh();
+		} else
+			continue;
+
+		draw_menu();
+	}
+}
+
+void menu(void)
+{
+	initscr();
+
+	init_pair(1, COLOR_WHITE, COLOR_RED);
+	init_pair(2, COLOR_BLACK, COLOR_WHITE);
+	init_pair(3, COLOR_BLACK, COLOR_WHITE);
+	init_pair(4, COLOR_CYAN, COLOR_WHITE);
+	init_pair(5, COLOR_WHITE, COLOR_RED);
+
+	wattrset(stdscr, COLOR_PAIR(1));
+	wclear(stdscr);
+
+	status = newwin(1, 80, 24, 0);
+	wattrset(status, COLOR_PAIR(2));
+	wclear(status);
+
+	refresh();
+
+	create_menu();
+	draw_menu();
+
+	loop();
+}

payloads/bayou/nrv2b.c

@@ -0,0 +1,87 @@
+#include <libpayload.h>
+
+// This GETBIT is supposed to work on little endian 
+// 32bit systems. The algorithm will definitely need
+// some fixing on other systems, but it might not be
+// a problem since the nrv2b binary behaves the same..
+
+#ifndef ENDIAN
+#define ENDIAN   0
+#endif
+#ifndef BITSIZE
+#define BITSIZE 32
+#endif
+
+#define GETBIT_8(bb, src, ilen) \
+    (((bb = bb & 0x7f ? bb*2 : ((unsigned)src[ilen++]*2+1)) >> 8) & 1)
+
+#define GETBIT_LE16(bb, src, ilen) \
+    (bb*=2,bb&0xffff ? (bb>>16)&1 : (ilen+=2,((bb=(src[ilen-2]+src[ilen-1]*256u)*2+1)>>16)&1))
+#define GETBIT_LE32(bb, src, ilen) \
+    (bc > 0 ? ((bb>>--bc)&1) : (bc=31,\
+    bb=*(const u32 *)((src)+ilen),ilen+=4,(bb>>31)&1))
+
+#if ENDIAN == 0 && BITSIZE == 8
+#define GETBIT(bb, src, ilen) GETBIT_8(bb, src, ilen)
+#endif
+#if ENDIAN == 0 && BITSIZE == 16
+#define GETBIT(bb, src, ilen) GETBIT_LE16(bb, src, ilen)
+#endif
+#if ENDIAN == 0 && BITSIZE == 32
+#define GETBIT(bb, src, ilen) GETBIT_LE32(bb, src, ilen)
+#endif
+
+unsigned long unrv2b(u8 *src, u8 *dst, unsigned long *ilen_p)
+{
+	unsigned long ilen = 0, olen = 0, last_m_off = 1;
+	u32 bb = 0;
+	unsigned bc = 0;
+	const u8 *m_pos;
+
+	// skip length
+	src += 4;
+	/* FIXME: check olen with the length stored in first 4 bytes */	
+
+	for (;;) {
+		unsigned int m_off, m_len;
+		while (GETBIT(bb, src, ilen)) {
+			dst[olen++] = src[ilen++];
+		}
+
+		m_off = 1;
+		do {
+			m_off = m_off * 2 + GETBIT(bb, src, ilen);
+		} while (!GETBIT(bb, src, ilen));
+		if (m_off == 2) {
+			m_off = last_m_off;
+		} else {
+			m_off = (m_off - 3) * 256 + src[ilen++];
+			if (m_off == 0xffffffffU)
+				break;
+			last_m_off = ++m_off;
+		}
+
+		m_len = GETBIT(bb, src, ilen);
+		m_len = m_len * 2 + GETBIT(bb, src, ilen);
+		if (m_len == 0) {
+			m_len++;
+			do {
+				m_len = m_len * 2 + GETBIT(bb, src, ilen);
+			} while (!GETBIT(bb, src, ilen));
+			m_len += 2;
+		}
+		m_len += (m_off > 0xd00);
+
+		m_pos = dst + olen - m_off;
+		dst[olen++] = *m_pos++;
+		do {
+			dst[olen++] = *m_pos++;
+		} while (--m_len > 0);
+	}
+
+	*ilen_p = ilen;
+
+	return olen;
+
+}
+

payloads/bayou/payload.c

@@ -0,0 +1,111 @@
+/*
+ * This file is part of the bayou project.
+ *
+ * Copyright (C) 2008 Advanced Micro Devices, Inc.
+ *
+ * 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.
+ *
+ * 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., 51 Franklin St, Fifth Floor, Boston, MA  02110-1301 USA
+ */
+
+#include "bayou.h"
+
+#define TIMEOUT_MESSAGE "Press ESC for the menu (%2d)...\r"
+#define TIMEOUT_KEY     '\033'
+
+void run_payload(struct payload *p)
+{
+	int ret, i;
+
+	/* For chooser entries, just run the payload. */
+	if (p->pentry.type == BPT_TYPE_CHOOSER) {
+		self_load_and_run(p, &ret);
+		return;
+	}
+
+	/* For chained entries, run all the sub-chain items. */
+	for (i = 0; i < bayoucfg.n_entries; i++) {
+		struct payload *s = &(bayoucfg.entries[i]);
+
+		if (s->pentry.parent == p->pentry.index)
+			self_load_and_run(s, &ret);
+	}
+}
+
+char *payload_get_name(struct payload *p)
+{
+	if (p->pentry.type == BPT_TYPE_CHAIN)
+		return (char *)p->pentry.title;
+	else if (p->pentry.type == BPT_TYPE_CHOOSER) {
+		if (p->pentry.title[0] != 0)
+			return (char *)p->pentry.title;
+		return p->params[BAYOU_PARAM_DESC];
+	}
+
+	return NULL;
+}
+
+struct payload *payload_get_default(void)
+{
+	int i;
+
+	for (i = 0; i < bayoucfg.n_entries; i++) {
+		struct payload *s = &(bayoucfg.entries[i]);
+
+		if (s->pentry.parent == 0 && s->pentry.flags & BPT_FLAG_DEFAULT)
+			return s;
+	}
+
+	return NULL;
+}
+
+void run_payload_timeout(struct payload *p, int timeout)
+{
+	int t, ch, tval;
+
+	for (t = timeout; t >= 0; t--) {
+		printf(TIMEOUT_MESSAGE, t);
+
+		tval = 1000;
+		ch = getchar_timeout(&tval);
+
+		if (ch == TIMEOUT_KEY)
+			return;
+	}
+
+	run_payload(p);
+}
+
+void payload_parse_params(struct payload *pload, u8 *params, int len)
+{
+	char *ptr = (char *)params;
+	int i = 0;
+
+	if (ptr == NULL)
+		return;
+
+	while (ptr < ((char *)params + len)) {
+
+		if (!strncmp(ptr, "name=", 5)) {
+			pload->params[BAYOU_PARAM_NAME] = ptr + 5;
+		} else if (!strncmp(ptr, "desc=", 5)) {
+			pload->params[BAYOU_PARAM_DESC] = ptr + 5;
+		} else if (!strncmp(ptr, "listname=", 9)) {
+			pload->params[BAYOU_PARAM_LIST] = ptr + 9;
+		}
+
+		ptr += strnlen(ptr, len - i);
+
+		if (ptr < ((char *)params + len) && *ptr == 0)
+			ptr++;
+	}
+}

payloads/bayou/self.c

@@ -0,0 +1,147 @@
+/*
+ * This file is part of the bayou project.
+ *
+ * Copyright (C) 2008 Advanced Micro Devices, Inc.
+ *
+ * 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.
+ *
+ * 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., 51 Franklin St, Fifth Floor, Boston, MA  02110-1301 USA
+ */
+
+#include "bayou.h"
+#include "self.h"
+
+static int nop_decompress(void *dst, void *src, int len)
+{
+	memcpy(dst, src, len);
+	return len;
+}
+
+#ifdef CONFIG_LZMA
+extern int ulzma(u8 *, u8 *);
+
+static int lzma_decompress(void *dst, void *src, int len)
+{
+	return ulzma((u8 *) src, (u8 *) dst);
+}
+#endif
+
+#ifdef CONFIG_NRV2B
+extern int unrv2b(u8 *, u8 *, unsigned long *);
+
+static int nrv2b_decompress(void *dst, void *src, int len)
+{
+	unsigned long l = (u32) len;
+	return unrv2b(src, dst, &l);
+}
+#endif
+
+static int zeros_decompress(void *dst, void *src, int len)
+{
+	memset(dst, 0, len);
+	return len;
+}
+
+int self_get_params(u8 *fptr, u8 **params)
+{
+	struct self_segment *seg = (struct self_segment *)fptr;
+
+	while (seg->type != SELF_TYPE_ENTRY) {
+		if (seg->type == 0)
+			return -1;
+
+		if (seg->type == SELF_TYPE_PARAMS) {
+			*params = (u8 *) (fptr + seg->offset);
+			return seg->len;
+		}
+
+		seg++;
+	}
+
+	*params = NULL;
+
+	return 0;
+}
+
+int verify_self(u8 *ptr)
+{
+	struct self_segment *seg = (struct self_segment *)ptr;
+
+	switch (seg->type) {
+	case SELF_TYPE_CODE:
+	case SELF_TYPE_DATA:
+	case SELF_TYPE_BSS:
+	case SELF_TYPE_PARAMS:
+	case SELF_TYPE_ENTRY:
+		return 1;
+	}
+
+	return 0;
+}
+
+int self_load_and_run(struct payload *p, int *ret)
+{
+	struct self_segment *seg = (struct self_segment *)p->fptr;
+	int (*dcmp) (void *, void *, int);
+	int dlen;
+
+	switch (p->stat.compression) {
+#ifdef CONFIG_LZMA
+	case ALGO_LZMA:
+		dcmp = lzma_decompress;
+		break;
+#endif
+#ifdef CONFIG_NRV2B
+	case ALGO_NRV2B:
+		dcmp = nrv2b_decompress;
+		break;
+#endif
+	case ALGO_ZEROES:
+		dcmp = zeros_decompress;
+		break;
+	case ALGO_NONE:
+		dcmp = nop_decompress;
+	default:
+		printf("E: Unsupported decompression type\n");
+		return -1;
+	}
+
+	while (1) {
+		u32 laddr = (u32) (seg->load_addr & 0xFFFFFFFF);
+
+		switch (seg->type) {
+		case SELF_TYPE_CODE:
+		case SELF_TYPE_DATA:
+			dlen = dcmp((void *)laddr,
+				    (void *)p->fptr + seg->offset, seg->len);
+
+			if (dlen < seg->mem_len) {
+				memset((void *)(laddr + dlen), 0,
+				       seg->mem_len - dlen);
+			}
+			break;
+
+		case SELF_TYPE_BSS:
+			memset((void *)laddr, 0, seg->len);
+			break;
+		case SELF_TYPE_ENTRY:
+			*ret = exec(laddr, 0, NULL);
+			return 0;
+		default:
+			break;
+		}
+
+		seg++;
+	}
+
+	return -1;
+}

payloads/bayou/self.h

@@ -0,0 +1,44 @@
+/*
+ * This file is part of the bayou project.
+ *
+ * Copyright (C) 2008 Advanced Micro Devices, Inc.
+ *
+ * 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.
+ *
+ * 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., 51 Franklin St, Fifth Floor, Boston, MA  02110-1301 USA
+ */
+
+#ifndef SELF_H_
+#define SELF_H_
+
+#include <libpayload.h>
+
+struct self_segment {
+	u32 type;
+	u32 offset;
+	u64 load_addr;
+	u32 len;
+	u32 mem_len;
+};
+
+struct self {
+	struct larstat stat;
+	void *fptr;
+};
+
+#define SELF_TYPE_CODE   0x45444F43
+#define SELF_TYPE_DATA   0x41544144
+#define SELF_TYPE_BSS    0x20535342
+#define SELF_TYPE_PARAMS 0x41524150
+#define SELF_TYPE_ENTRY  0x52544E45
+
+#endif

payloads/bayou/util/pbuilder/Makefile

@@ -0,0 +1,67 @@
+##
+## This file is part of the bayou project.
+##
+## Copyright (C) 2008 Advanced Micro Devices, Inc.
+##
+## 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.
+##
+## 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., 51 Franklin St, Fifth Floor, Boston, MA  02110-1301 USA
+##
+
+CC=gcc
+PBUILDOBJS := config.o create.o show.o main.o
+INCLUDES := -Iliblar/
+CFLAGS=-Wall -Werror -g
+
+all: pbuilder
+
+LZMA_OBJ := lzma/LZMAEncoder.o lzma/LZInWindow.o lzma/RangeCoderBit.o
+LZMA_OBJ += lzma/StreamUtils.o lzma/OutBuffer.o lzma/Alloc.o lzma/CRC.o
+LZMA_OBJ += lzma/lzma-compress.o
+
+lzma/lzma-compress.o: lzma/minilzma.cc
+	g++ -o $@ -c -DCOMPACT $<
+
+lzma/%.o: lzma/C/7zip/Compress/LZMA/%.cpp
+	g++ -o $@ -c $<
+
+lzma/%.o: lzma/C/7zip/Compress/LZ/%.cpp
+	g++ -o $@ -c $<
+
+lzma/%.o: lzma/C/7zip/Compress/RangeCoder/%.cpp
+	g++ -o $@ -c $<
+
+lzma/%.o: lzma/C/7zip/Decompress/%.cpp
+	g++ -o $@ -c $<
+
+lzma/%.o: lzma/C/7zip/Common/%.cpp
+	g++ -o $@ -c $<
+
+lzma/%.o: lzma/C/Common/%.cpp
+	g++ -o $@ -c $<
+
+lzma/%.o: lzma/%.cc
+	g++ -o $@ -c $<
+
+pbuilder: $(PBUILDOBJS) $(LZMA_OBJ) liblar/liblar.a
+	$(CXX) -o $@ $(PBUILDOBJS) $(LZMA_OBJ) -L ./liblar -llar -lexpat
+
+liblar/liblar.a:
+	make -C liblar
+
+%.o: %.c
+	$(CC) -c $(CFLAGS) $(INCLUDES) -o $@ $<
+
+clean:
+	rm -f pbuilder *.o lzma/*.o
+	make -C liblar clean
+

payloads/bayou/util/pbuilder/config.c

@@ -0,0 +1,265 @@
+/*
+ * This file is part of the bayou project.
+ *
+ * Copyright (C) 2008 Advanced Micro Devices, Inc.
+ *
+ * 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.
+ *
+ * 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., 51 Franklin St, Fifth Floor, Boston, MA  02110-1301 USA
+ */
+
+#define _GNU_SOURCE
+
+#include <stdlib.h>
+#include <string.h>
+#include <expat.h>
+#include <ctype.h>
+#include "pbuilder.h"
+
+#define STATE_NONE                   0x00
+#define STATE_BAYOUCONFIG            0x01
+#define STATE_GLOBAL                 0x02
+#define STATE_GLOBAL_TIMEOUT         0x03
+#define STATE_PAYLOADS               0x04
+#define STATE_PAYLOAD                0x05
+#define STATE_PAYLOAD_TITLE          0x06
+#define STATE_PAYLOAD_FILE           0x07
+#define STATE_PAYLOAD_LARNAME        0x08
+#define STATE_PAYLOAD_CHAIN          0x09
+#define STATE_PAYLOAD_CHAIN_FILE     0x0A
+#define STATE_PAYLOAD_CHAIN_LARNAME  0x0B
+
+static struct userdata {
+	struct config *config;
+	struct pentry *payload;
+	struct pentry *chain;
+	int state;
+} userdata;
+
+static char buffer[8192];
+
+static struct {
+	char *element;
+	int pstate;
+	int state;
+} states[] = {
+	{"BayouConfig", STATE_NONE, STATE_BAYOUCONFIG},
+	{"global", STATE_BAYOUCONFIG, STATE_GLOBAL},
+	{"timeout", STATE_GLOBAL, STATE_GLOBAL_TIMEOUT},
+	{"payloads", STATE_BAYOUCONFIG, STATE_PAYLOADS},
+	{"payload", STATE_PAYLOADS, STATE_PAYLOAD},
+	{"title", STATE_PAYLOAD, STATE_PAYLOAD_TITLE},
+	{"lar", STATE_PAYLOAD, STATE_PAYLOAD_LARNAME},
+	{"file", STATE_PAYLOAD, STATE_PAYLOAD_FILE},
+	{"chain", STATE_PAYLOAD, STATE_PAYLOAD_CHAIN},
+	{"file", STATE_PAYLOAD_CHAIN, STATE_PAYLOAD_CHAIN_FILE},
+	{"lar", STATE_PAYLOAD_CHAIN, STATE_PAYLOAD_CHAIN_LARNAME},
+	{NULL},
+};
+
+static struct pentry *newPayload(struct config *config)
+{
+	struct pentry **tmp, *ret;
+
+	tmp = realloc(config->entries,
+		      (config->n_entries + 1) * sizeof(struct pentry *));
+
+	if (tmp == NULL)
+		return NULL;
+
+	config->entries = tmp;
+
+	ret = config->entries[config->n_entries] = calloc(sizeof(*ret), 1);
+
+	if (ret == NULL)
+		return NULL;
+
+	/* Yes, I want this to be ++config->n_entries (the index is 1 based). */
+	ret->index = ++config->n_entries;
+
+	return ret;
+}
+
+static void parseFlags(struct pentry *entry, const char *flags)
+{
+	char *p = (char *)flags;
+	char *n;
+
+	while (*p) {
+		n = strchr(p, ',');
+
+		if (n)
+			*(n++) = 0;
+
+		if (!strcmp(p, "default"))
+			entry->flags |= BPT_FLAG_DEFAULT;
+		else if (!strcmp(p, "nolist"))
+			entry->flags |= BPT_FLAG_NOSHOW;
+		else
+			warn("W: Unknown payload flag %s\n", p);
+
+		if (!n)
+			break;
+
+		for (p = n; *p && isspace(*p); p++) ;
+	}
+}
+
+static struct pentry *addPayload(struct config *config, const char **attr)
+{
+	struct pentry *ret = newPayload(config);
+	int i = 0;
+
+	if (ret == NULL)
+		die("E: Could not allocate memory for a new payload\n");
+
+	while (attr[i] != NULL) {
+		if (!strcmp(attr[i], "type")) {
+			if (!strcmp(attr[i + 1], "chain"))
+				ret->type = BPT_TYPE_CHAIN;
+			else if (!strcmp(attr[i + 1], "chooser"))
+				ret->type = BPT_TYPE_CHOOSER;
+			else
+				die("E: Invalid payload type %s\n",
+				    attr[i + 1]);
+		} else if (!strcmp(attr[i], "flags"))
+			parseFlags(ret, attr[i + 1]);
+
+		i += 2;
+	}
+
+	return ret;
+}
+
+static struct pentry *addChain(struct config *config, struct pentry *parent)
+{
+	struct pentry *ret = newPayload(config);
+
+	if (ret == NULL)
+		die("E: Could not allocate memory for a new payload\n");
+
+	ret->parent = parent->index;
+	ret->type = BPT_TYPE_SUBCHAIN;
+
+	return ret;
+}
+
+static void start(void *data, const char *el, const char **attr)
+{
+	int i;
+	struct userdata *d = (struct userdata *)data;
+
+	for (i = 0; states[i].element != NULL; i++) {
+		if (d->state != states[i].pstate)
+			continue;
+
+		if (!strcmp(el, states[i].element)) {
+			d->state = states[i].state;
+			break;
+		}
+	}
+
+	if (states[i].element == NULL)
+		die("E: Unknown element %s\n", el);
+
+	if (d->state == STATE_PAYLOAD)
+		d->payload = addPayload(d->config, attr);
+
+	if (d->state == STATE_PAYLOAD_CHAIN)
+		d->chain = addChain(d->config, d->payload);
+}
+
+static void data(void *data, const char *val, int len)
+{
+	struct userdata *d = (struct userdata *)data;
+	int l;
+
+	switch (d->state) {
+	case STATE_GLOBAL_TIMEOUT:
+		d->config->timeout = atoi(val);
+		break;
+	case STATE_PAYLOAD_TITLE:
+		l = sizeof(d->payload->title) - 1 > len ?
+		    len : sizeof(d->payload->title) - 1;
+
+		strncpy((char *)d->payload->title, (char *)val, l);
+		d->payload->title[l] = '\0';
+		break;
+	case STATE_PAYLOAD_FILE:
+		d->payload->file = strndup(val, len);
+		break;
+	case STATE_PAYLOAD_LARNAME:
+		d->payload->larname = strndup(val, len);
+		break;
+	case STATE_PAYLOAD_CHAIN_FILE:
+		d->chain->file = strndup(val, len);
+		break;
+	case STATE_PAYLOAD_CHAIN_LARNAME:
+		d->chain->larname = strndup(val, len);
+		break;
+	default:
+		break;
+	}
+}
+
+static void end(void *data, const char *el)
+{
+	struct userdata *d = (struct userdata *)data;
+	int i;
+
+	if (d->state == STATE_PAYLOAD_CHAIN)
+		d->chain = NULL;
+
+	if (d->state == STATE_PAYLOAD)
+		d->payload = NULL;
+
+	for (i = 0; states[i].element != NULL; i++) {
+		if (d->state != states[i].state)
+			continue;
+
+		if (!strcmp(el, states[i].element)) {
+			d->state = states[i].pstate;
+			break;
+		}
+	}
+
+	if (states[i].element == NULL)
+		die("E:  Unable to find the reverse state for %s\n", el);
+}
+
+void parseconfig(FILE *stream, struct config *config)
+{
+	XML_Parser p = XML_ParserCreate(NULL);
+	int eof = 0;
+
+	if (p == NULL)
+		die("E: Could not create the parser\n");
+
+	XML_SetElementHandler(p, start, end);
+	XML_SetCharacterDataHandler(p, data);
+
+	userdata.config = config;
+
+	XML_SetUserData(p, &userdata);
+
+	while (!eof) {
+		int len = fread(buffer, 1, 8192, stream);
+
+		eof = feof(stream);
+
+		if (ferror(stream))
+			die("E: Error reading the stream\n");
+
+		if (!XML_Parse(p, buffer, len, eof))
+			die("E: Error parsing the XML data\n");
+	}
+}

payloads/bayou/util/pbuilder/create.c

@@ -0,0 +1,200 @@
+/*
+ * This file is part of the bayou project.
+ *
+ * Copyright (C) 2008 Advanced Micro Devices, Inc.
+ *
+ * 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.
+ *
+ * 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., 51 Franklin St, Fifth Floor, Boston, MA  02110-1301 USA
+ */
+
+#include <stdlib.h>
+#include <string.h>
+#include <unistd.h>
+#include <fcntl.h>
+#include <libgen.h>
+#include "liblar.h"
+#include "pbuilder.h"
+
+void do_lzma_compress(char *in, int in_len, char *out, int *out_len);
+
+int add_bpt_to_lar(struct LAR *lar, struct config *config)
+{
+	char *buffer;
+	int ret, i, len = sizeof(struct bpt_config);
+	struct bpt_config *cfg;
+	struct LARAttr attr;
+	char *ptr;
+
+	for (i = 0; i < config->n_entries; i++) {
+		len += sizeof(struct bpt_pentry);
+
+		if (config->entries[i]->type != BPT_TYPE_CHAIN)
+			len += ((strlen(config->entries[i]->larname)
+				+ 15) & ~0x0F);
+	}
+
+	buffer = calloc(len, 1);
+
+	if (buffer == NULL)
+		return -1;
+
+	cfg = (struct bpt_config *)buffer;
+
+	cfg->id = BPT_ID;
+	cfg->timeout = config->timeout;
+	cfg->entries = config->n_entries;
+
+	ptr = buffer + sizeof(struct bpt_config);
+
+	for (i = 0; i < config->n_entries; i++) {
+		int nlen = 0;
+		struct bpt_pentry *pentry = (struct bpt_pentry *)ptr;
+
+		pentry->index = config->entries[i]->index;
+		pentry->parent = config->entries[i]->parent;
+		pentry->type = config->entries[i]->type;
+		pentry->flags = config->entries[i]->flags;
+
+		strncpy((char *)pentry->title,
+			(char *)config->entries[i]->title,
+			sizeof(pentry->title));
+
+		if (config->entries[i]->type != BPT_TYPE_CHAIN) {
+			nlen = strlen(config->entries[i]->larname);
+			nlen = (nlen + 15) & ~0x0F;
+
+			strcpy((char *)(ptr + sizeof(struct bpt_pentry)),
+			       config->entries[i]->larname);
+
+			pentry->nlen = nlen;
+		}
+
+		ptr += sizeof(struct bpt_pentry);
+
+		if (config->entries[i]->type != BPT_TYPE_CHAIN)
+			ptr += nlen;
+	}
+
+	LAR_SetAttrs(&attr, "bayou_payload_table", ALGO_NONE);
+
+	ret = LAR_AppendBuffer(lar, (unsigned char *)buffer, len, &attr);
+	free(buffer);
+	return ret;
+}
+
+struct lfile {
+	char *file;
+	char *larname;
+};
+
+int n_lfiles;
+
+int create_lar_from_config(const char *input, const char *output)
+{
+	struct config config;
+	FILE *stream;
+	struct LAR *lar;
+	struct LARAttr attr;
+	int i, j, ret = -1;
+	struct lfile *lfiles;
+
+	stream = fopen(input, "r");
+
+	if (stream == NULL) {
+		warn("E:  Couldn't open %s for reading\n", input);
+		return -1;
+	}
+
+	memset(&config, 0, sizeof(config));
+
+	parseconfig(stream, &config);
+	fclose(stream);
+
+	lar = LAR_Create(output);
+
+	if (lar == NULL) {
+		warn("E:  Couldn't create a new lar file\n");
+		return -1;
+	}
+
+	LAR_SetCompressionFuncs(lar, ALGO_LZMA, do_lzma_compress, NULL);
+
+	lfiles = calloc(sizeof(struct lfile), config.n_entries);
+
+	if (lfiles == NULL) {
+		warn("E: Couldn't allocate memory: %m\n");
+		return -1;
+	}
+
+	for (i = 0; i < config.n_entries; i++) {
+		/* Master chain entries don't have files associated with them. */
+		if (config.entries[i]->type == BPT_TYPE_CHAIN)
+			continue;
+
+		if (access(config.entries[i]->file, R_OK)) {
+			warn("E:  Could not find file %s\n",
+			     config.entries[i]->file);
+
+			goto err;
+		}
+
+		if (config.entries[i]->larname == NULL) {
+			config.entries[i]->larname =
+			    strdup(basename(config.entries[i]->file));
+
+			if (config.entries[i]->larname == NULL) {
+				warn("E: Could not allocate memory for the default name\n");
+				goto err;
+			}
+		}
+
+		/*
+		 * Add the file to the list of files to add to the LAR - skip
+		 * any duplicates, but be on the lookout for the same LAR name
+		 * attached to a different file.
+		 */
+		for (j = 0; j < n_lfiles; j++) {
+			if (!strcmp(lfiles[j].larname,
+				    config.entries[i]->larname)) {
+				if (strcmp(lfiles[j].file,
+					   config.entries[i]->file)) {
+					warn("E:  LAR name '%s' has already been used\n", config.entries[i]->larname);
+					goto err;
+				}
+				break;
+			}
+		}
+
+		if (j == n_lfiles) {
+			lfiles[n_lfiles].file = config.entries[i]->file;
+			lfiles[n_lfiles++].larname = config.entries[i]->larname;
+		}
+	}
+
+	/* Add all the files to the LAR. */
+	for (i = 0; i < n_lfiles; i++) {
+		LAR_SetAttrs(&attr, lfiles[i].larname, ALGO_LZMA);
+
+		if (LAR_AppendFile(lar, lfiles[i].file, &attr)) {
+			warn("E: Could not add %s to the LAR\n",
+			     lfiles[i].file);
+			goto err;
+		}
+	}
+
+	ret = add_bpt_to_lar(lar, &config);
+
+err:
+	LAR_Close(lar);
+	return ret;
+}

payloads/bayou/util/pbuilder/liblar/Makefile

@@ -0,0 +1,31 @@
+##
+## This file is part of the bayou project.
+##
+## Copyright (C) 2008 Advanced Micro Devices, Inc.
+##
+## 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.
+##
+## 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., 51 Franklin St, Fifth Floor, Boston, MA  02110-1301 USA
+##
+
+CC = gcc
+LAROBJS = self.o lib.o
+CFLAGS = -g -Wall
+
+liblar.a: $(LAROBJS)
+	ar rc $@ $(LAROBJS)
+
+%.o: %.c
+	$(CC) -c $(CFLAGS) -o $@ $<
+
+clean:
+	rm -f liblar.a *.o

payloads/bayou/util/pbuilder/liblar/lar.h

@@ -0,0 +1,95 @@
+/*
+ * lar - lightweight archiver
+ *
+ * Copyright (C) 2006 coresystems GmbH
+ * (Written by Stefan Reinauer <stepan@coresystems.de> for coresystems GmbH)
+ * Copyright (C) 2007 Patrick Georgi <patrick@georgi-clan.de>
+ *
+ * This file is dual-licensed. You can choose between:
+ *   - The GNU GPL, version 2, as published by the Free Software Foundation
+ *   - The revised BSD license (without advertising clause)
+ *
+ * ---------------------------------------------------------------------------
+ * 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; version 2 of the License.
+ *
+ * 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., 51 Franklin St, Fifth Floor, Boston, MA, 02110-1301 USA
+ * ---------------------------------------------------------------------------
+ * Redistribution and use in source and binary forms, with or without
+ * modification, are permitted provided that the following conditions
+ * are met:
+ * 1. Redistributions of source code must retain the above copyright
+ *    notice, this list of conditions and the following disclaimer.
+ * 2. Redistributions in binary form must reproduce the above copyright
+ *    notice, this list of conditions and the following disclaimer in the
+ *    documentation and/or other materials provided with the distribution.
+ * 3. The name of the author may not be used to endorse or promote products
+ *    derived from this software without specific prior written permission.
+ *
+ * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
+ * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+ * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+ * ARE DISCLAIMED.  IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
+ * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
+ * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
+ * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
+ * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
+ * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
+ * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
+ * SUCH DAMAGE.
+ * ---------------------------------------------------------------------------
+ */
+
+#include <stdio.h>
+#include <stdint.h>
+
+#define MAGIC "LARCHIVE"
+#define MAX_PATHLEN 1024
+#define BOOTBLOCK_SIZE 20480
+
+#define BOOTBLOCK_NAME "bootblock"
+#define BOOTBLOCK_NAME_LEN 16
+
+typedef uint64_t u64;
+typedef int64_t s64;
+typedef uint32_t u32;
+typedef int32_t s32;
+typedef uint8_t u8;
+
+/* NOTE -- This and the coreboot lar.h may NOT be in sync. Be careful. */
+struct lar_header {
+	char magic[8];
+	u32 len;
+	u32 reallen;
+	u32 checksum;
+	u32 compchecksum;
+	/* Filenames are limited to 2^31-1-sizeof(lar_header)-1 bytes.
+	 * "Nobody will ever need more than 640k" */
+	u32 offset;
+	/* Compression:
+	 * 0 = no compression
+	 * 1 = lzma
+	 * 2 = nrv2b
+	 * 3 = zeroes
+	 */
+	u32 compression;
+	u64 entry;
+	u64 loadaddress;
+};
+
+enum compalgo {
+	ALGO_NONE = 0,
+	ALGO_LZMA = 1,
+	ALGO_NRV2B = 2,
+	ALGO_ZEROES = 3,
+	/* invalid should always be the last entry. */
+	ALGO_INVALID
+};

payloads/bayou/util/pbuilder/liblar/lib.c

@@ -0,0 +1,461 @@
+/*
+ * This file is part of the bayou project.
+ *
+ * Copyright (C) 2008 Advanced Micro Devices, Inc.
+ *
+ * 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.
+ *
+ * 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., 51 Franklin St, Fifth Floor, Boston, MA  02110-1301 USA
+ */
+
+#include <stdio.h>
+#include <stdlib.h>
+#include <string.h>
+#include <fcntl.h>
+#include <unistd.h>
+#include <sys/stat.h>
+#include <sys/mman.h>
+#include <arpa/inet.h>
+
+#include "liblar.h"
+#include "self.h"
+
+static int lar_compress(struct LAR *lar, int algo, char *src, char *dst,
+			int len)
+{
+	int ret;
+
+	if (!lar->cfuncs[algo])
+		return -1;
+
+	lar->cfuncs[algo] (src, len, dst, &ret);
+	return ret;
+}
+
+static int lar_decompress(struct LAR *lar, int algo, char *src, char *dst,
+			  int slen, int dlen)
+{
+	if (!lar->dfuncs[algo])
+		return -1;
+
+	lar->dfuncs[algo] (src, slen, dst, dlen);
+	return dlen;
+}
+
+static struct LARHeader *lar_get_header(struct LAR *lar, const char *filename)
+{
+	char *buffer;
+	int offset = 0;
+	struct LARHeader *lheader = NULL;
+	struct lar_header *header;
+
+	printf("Getting %s\n", filename);
+
+	buffer = malloc(sizeof(struct lar_header) + MAX_PATHLEN);
+
+	if (buffer == NULL)
+		return NULL;
+
+	while (1) {
+		int ret;
+
+		if (lseek(lar->fd, offset, SEEK_SET) == -1)
+			goto err;
+
+		ret = read(lar->fd, buffer, sizeof(struct lar_header));
+
+		if (ret <= 0)
+			goto err;
+
+		header = (struct lar_header *)buffer;
+
+		if (strncmp(header->magic, MAGIC, sizeof(MAGIC)))
+			goto err;
+
+		ret = read(lar->fd, buffer + sizeof(struct lar_header),
+			   ntohl(header->offset) - sizeof(struct lar_header));
+
+		if (ret <= 0)
+			goto err;
+
+		if (!strcmp(buffer + sizeof(struct lar_header), filename))
+			break;
+
+		offset += ntohl(header->offset) +
+		    ((ntohl(header->len) + 15) & ~0xF);
+	}
+
+	lheader = calloc(sizeof(struct LARHeader), 1);
+
+	if (lheader == NULL)
+		goto err;
+
+	lheader->hoffset = offset;
+	lheader->offset = offset + ntohl(header->offset);
+
+	lheader->reallen = ntohl(header->reallen);
+	lheader->len = ntohl(header->len);
+
+	lheader->loadaddress = ntohl(header->loadaddress);
+	lheader->compression = ntohl(header->compression);
+	lheader->entry = ntohl(header->entry);
+	lheader->checksum = ntohl(header->checksum);
+
+err:
+	free(buffer);
+	return lheader;
+}
+
+static int LAR_AppendBlob(struct LAR *lar, unsigned char *buffer,
+			  int len, int rlen, struct LARAttr *attr)
+{
+	int nlen, nsize, lsize, i;
+	struct lar_header *header;
+	u8 *lptr;
+	u32 csum = 0;
+
+	if (attr == NULL)
+		return -1;
+
+	nlen = strlen(attr->name) + 1;
+
+	if (nlen > MAX_PATHLEN - 1)
+		nlen = MAX_PATHLEN - 1;
+
+	nsize = (nlen + 15) & ~0xF;
+
+	lsize = sizeof(struct lar_header) + nsize + len;
+	lptr = calloc(lsize + 1, 1);
+
+	if (lptr == NULL)
+		return -1;
+
+	header = (struct lar_header *)lptr;
+
+	memcpy(header->magic, MAGIC, 8);
+	header->reallen = htonl(rlen);
+	header->len = htonl(len);
+	header->offset = htonl(lsize - len);
+	header->loadaddress = htonl(attr->loadaddr);
+	header->compression = htonl(attr->compression);
+	header->entry = htonl(attr->entry);
+
+	strncpy(((char *)header) + sizeof(struct lar_header), attr->name, nlen);
+
+	for (i = 0; i < sizeof(struct lar_header) + nsize; i += 4)
+		csum += *((u32 *) (lptr + i));
+
+	for (i = 0; i < len; i += 4) {
+		/*
+		 * The checksum needs to include the 16 byte padding at
+		 * the end of the data before the next lar header. The
+		 * problem is that the padding isn't going to be in the
+		 * buffer, and if we try to read off the end of the buffer,
+		 * we are just asking for trouble. So account for the
+		 * situation where the datalen is not a multiple of four
+		 * and get a safe value to add into the checksum.
+		 * The rest of the padding will be zero, and can be safely
+		 * ignored here.
+		 */
+		if ((len - i) < 4) {
+			u32 val = 0;
+			int t;
+
+			for (t = 0; t < (len - i); t++)
+				val |= *((u8 *) buffer + (i + t)) << (t * 8);
+			csum += val;
+		} else
+			csum += *((u32 *) (buffer + i));
+	}
+
+	header->checksum = (u32) (~0 - csum);
+
+	lseek(lar->fd, 0, SEEK_END);
+
+	/* FIXME: Error check here. */
+
+	write(lar->fd, header, sizeof(struct lar_header) + nsize);
+	write(lar->fd, buffer, len);
+
+	/* Add in padding to the next 16 byte boundary. */
+	if (lsize & 0xF) {
+		int i;
+		char null = '\0';
+
+		for (i = lsize & 0xF; i < 0x10; i++)
+			write(lar->fd, &null, 1);
+	}
+
+	return 0;
+}
+
+int LAR_AppendBuffer(struct LAR *lar, unsigned char *buffer, int len,
+		     struct LARAttr *attr)
+{
+	unsigned char *tbuf;
+	int rlen, ret = -1;
+
+	if (attr->compression == ALGO_NONE)
+		return LAR_AppendBlob(lar, buffer, len, len, attr);
+
+	tbuf = malloc(len);
+
+	if (tbuf == NULL)
+		return -1;
+
+	rlen = lar_compress(lar, attr->compression, (char *)buffer,
+			    (char *)tbuf, len);
+
+	if (rlen > 0)
+		ret = LAR_AppendBlob(lar, tbuf, rlen, len, attr);
+
+	free(tbuf);
+	return ret;
+}
+
+int LAR_AppendSelf(struct LAR *lar, const char *filename, struct LARAttr *attr)
+{
+	unsigned char *buffer;
+	int len = elf_to_self(filename, &buffer,
+			      lar->cfuncs[attr->compression]);
+	int ret;
+
+	if (len == -1)
+		return -1;
+
+	ret = LAR_AppendBlob(lar, buffer, len, len, attr);
+	free(buffer);
+
+	return ret;
+}
+
+int LAR_AppendFile(struct LAR *lar, const char *filename, struct LARAttr *attr)
+{
+	int fd;
+	struct stat s;
+	char *filep;
+	int ret;
+
+	if (iself((char *)filename))
+		return LAR_AppendSelf(lar, filename, attr);
+
+	fd = open(filename, O_RDONLY);
+
+	if (fd == -1)
+		return -1;
+
+	if (fstat(fd, &s))
+		return -1;
+
+	filep = (char *)mmap(0, s.st_size, PROT_READ, MAP_SHARED, fd, 0);
+
+	if (filep == MAP_FAILED)
+		return -1;
+
+	ret = LAR_AppendBuffer(lar, (unsigned char *)filep, s.st_size, attr);
+
+	munmap(filep, s.st_size);
+	return ret;
+}
+
+int LAR_DeleteFile(struct LAR *lar, const char *filename)
+{
+	struct LARHeader *header = lar_get_header(lar, filename);
+	int len, ret = -1;
+	char *filep, *buffer;
+
+	if (header == NULL)
+		return -1;
+
+	buffer = malloc(4096);
+	if (buffer == NULL)
+		return -1;
+
+	len = header->offset + header->len;
+
+	/* First, map the space and zero it out. */
+
+	filep = (char *)mmap(0, len, PROT_READ, MAP_SHARED, lar->fd,
+			     header->hoffset);
+
+	if (filep == MAP_FAILED)
+		return -1;
+
+	memset(filep, 0, len);
+	munmap(filep, len);
+
+	/* Now move the rest of the LAR into place. */
+	/* FIXME: This does not account for the bootblock! */
+
+	int dst = header->hoffset;
+	int src = header->hoffset + len;
+
+	while (1) {
+		int l, w;
+
+		if (lseek(lar->fd, src, SEEK_SET))
+			goto err;
+
+		l = read(lar->fd, buffer, 8192);
+
+		if (l == -1)
+			goto err;
+		if (l == 0)
+			goto err;
+		if (lseek(lar->fd, dst, SEEK_SET))
+			goto err;
+
+		w = write(lar->fd, buffer, l);
+
+		if (w <= 0)
+			goto err;
+
+		dst += w;
+		src += w;
+	}
+
+	ret = 0;
+
+err:
+	free(buffer);
+	return ret;
+}
+
+void LAR_CloseFile(struct LARFile *file)
+{
+	if (file != NULL) {
+		if (file->buffer != NULL)
+			free(file->buffer);
+		free(file);
+	}
+}
+
+struct LARFile *LAR_MapFile(struct LAR *lar, const char *filename)
+{
+	struct LARFile *file;
+	struct LARHeader *header = lar_get_header(lar, filename);
+	char *filep;
+	int ret;
+
+	if (header == NULL)
+		return NULL;
+
+	file = calloc(sizeof(struct LARFile), 1);
+
+	if (file == NULL)
+		return NULL;
+
+	file->len = header->reallen;
+	file->buffer = calloc(header->reallen, 1);
+
+	if (file->buffer == NULL)
+		goto err;
+
+	/*
+	 * The offset needs to be a multiple of PAGE_SIZE, so just mmap
+	 * from offset 0, its easier then doing the math.
+	 */
+
+	filep = mmap(0, header->offset + header->len,
+		     PROT_READ, MAP_SHARED, lar->fd, 0);
+
+	if (filep == MAP_FAILED) {
+		printf("Map failed: %m\n");
+		goto err;
+	}
+
+	if (header->compression != ALGO_NONE) {
+		ret = lar_decompress(lar, header->compression,
+				     filep + header->offset, file->buffer,
+				     header->len, header->reallen);
+	} else {
+		memcpy(file->buffer, filep + header->offset, header->len);
+		ret = header->len;
+	}
+
+	munmap(filep, header->offset + header->len);
+
+	if (ret == header->reallen)
+		return file;
+
+err:
+	if (file->buffer)
+		free(file->buffer);
+
+	free(file);
+	return NULL;
+}
+
+int LAR_SetCompressionFuncs(struct LAR *lar, int algo,
+			    LAR_CompFunc cfunc, LAR_DecompFunc dfunc)
+{
+
+	if (algo >= ALGO_INVALID)
+		return -1;
+
+	lar->cfuncs[algo] = cfunc;
+	lar->dfuncs[algo] = dfunc;
+
+	return 0;
+}
+
+void LAR_Close(struct LAR *lar)
+{
+	if (lar != NULL) {
+		if (lar->fd)
+			close(lar->fd);
+
+		free(lar);
+	}
+}
+
+struct LAR *LAR_Open(const char *filename)
+{
+	struct LAR *lar = calloc(sizeof(struct LAR), 1);
+
+	if (lar == NULL)
+		return NULL;
+
+	lar->fd = open(filename, O_RDWR);
+
+	if (lar->fd > 0)
+		return lar;
+
+	free(lar);
+	return NULL;
+}
+
+struct LAR *LAR_Create(const char *filename)
+{
+	struct LAR *lar = calloc(sizeof(struct LAR), 1);
+
+	if (lar == NULL)
+		return NULL;
+
+	lar->fd = open(filename, O_RDWR | O_CREAT | O_TRUNC, S_IRUSR | S_IWUSR);
+
+	if (lar->fd > 0)
+		return lar;
+
+	free(lar);
+	return NULL;
+}
+
+void LAR_SetAttrs(struct LARAttr *attrs, char *name, int algo)
+{
+	if (attrs == NULL)
+		return;
+
+	memset(attrs, 0, sizeof(*attrs));
+	snprintf(attrs->name, sizeof(attrs->name) - 1, name);
+	attrs->compression = algo;
+}

payloads/bayou/util/pbuilder/liblar/liblar.h

@@ -0,0 +1,75 @@
+/*
+ * This file is part of the bayou project.
+ *
+ * Copyright (C) 2008 Advanced Micro Devices, Inc.
+ *
+ * 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.
+ *
+ * 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., 51 Franklin St, Fifth Floor, Boston, MA  02110-1301 USA
+ */
+
+#ifndef _LIBLAR_H_
+#define _LIBLAR_H_
+
+#include <stdio.h>
+#include <stdlib.h>
+#include <string.h>
+#include "lar.h"
+
+typedef void (*LAR_CompFunc) (char *, int, char *, int *);
+typedef void (*LAR_DecompFunc) (char *, int, char *, int);
+
+struct LAR {
+	int fd;
+	LAR_CompFunc cfuncs[ALGO_INVALID];
+	LAR_DecompFunc dfuncs[ALGO_INVALID];
+};
+
+struct LARHeader {
+	u32 len;
+	u32 reallen;
+	u32 checksum;
+	u32 compression;
+	u64 loadaddress;
+	u64 entry;
+	/* These are the offsets within the file. */
+	unsigned int offset;
+	unsigned int hoffset;
+};
+
+struct LARAttr {
+	char name[MAX_PATHLEN];
+	u64 loadaddr;
+	int compression;
+	u64 entry;
+};
+
+struct LARFile {
+	int len;
+	char *buffer;
+};
+
+int LAR_AppendBuffer(struct LAR *lar, unsigned char *buffer, int len,
+		     struct LARAttr *attr);
+int LAR_AppendSelf(struct LAR *lar, const char *filename, struct LARAttr *attr);
+int LAR_AppendFile(struct LAR *lar, const char *filename, struct LARAttr *attr);
+int LAR_DeleteFile(struct LAR *lar, const char *filename);
+void LAR_CloseFile(struct LARFile *file);
+struct LARFile *LAR_MapFile(struct LAR *lar, const char *filename);
+int LAR_SetCompressionFuncs(struct LAR *lar, int algo,
+			    LAR_CompFunc cfunc, LAR_DecompFunc dfunc);
+void LAR_Close(struct LAR *lar);
+struct LAR *LAR_Open(const char *filename);
+struct LAR *LAR_Create(const char *filename);
+void LAR_SetAttrs(struct LARAttr *attrs, char *name, int algo);
+
+#endif

payloads/bayou/util/pbuilder/liblar/self.c

@@ -0,0 +1,206 @@
+/*
+ * This file is part of the bayou project.
+ *
+ * Copyright (C) 2008 Advanced Micro Devices, Inc.
+ *
+ * Includes code from util/lar from coreboot-v3
+ *
+ * Copyright (C) 2006-2007 coresystems GmbH
+ * Copyright (C) 2007 Patrick Georgi <patrick@georgi-clan.de>
+ * Copyright (C) 2007 Advanced Micro Devices, Inc.
+ *
+ * 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.
+ *
+ * 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.
+ */
+
+#include <stdio.h>
+#include <string.h>
+#include <stdlib.h>
+#include <sys/stat.h>
+#include <elf.h>
+#include <sys/mman.h>
+#include <unistd.h>
+#include <fcntl.h>
+#include <stdint.h>
+
+typedef uint64_t u64;
+typedef int64_t s64;
+typedef uint32_t u32;
+typedef int32_t s32;
+typedef uint8_t u8;
+
+#include "self.h"
+
+int elf_to_self(const char *filename, unsigned char **buffer,
+		void (*compress) (char *, int, char *, int *))
+{
+	struct stat s;
+	Elf32_Phdr *phdr;
+	Elf32_Ehdr *ehdr;
+	Elf32_Shdr *shdr;
+	void *filep;
+	char *header, *strtab;
+	unsigned char *sptr;
+	int headers, segments = 1, isize = 0, osize = 0, doffset = 0, fd, i;
+	struct self_segment *segs;
+
+	if (stat(filename, &s)) {
+		printf("Unable to stat %s: %m\n", filename);
+		return -1;
+	}
+
+	fd = open(filename, O_RDONLY);
+
+	if (fd == -1) {
+		printf("Unable to open %s: %m\n", filename);
+		return -1;
+	}
+
+	/* Map the file so that we can easily parse it. */
+	filep = (void *)
+	    mmap(0, s.st_size, PROT_READ, MAP_SHARED, fd, 0);
+
+	if (filep == MAP_FAILED) {
+		close(fd);
+		return -1;
+	}
+
+	ehdr = (Elf32_Ehdr *) filep;
+	headers = ehdr->e_phnum;
+	header = (char *)ehdr;
+
+	phdr = (Elf32_Phdr *) & (header[ehdr->e_phoff]);
+	shdr = (Elf32_Shdr *) & (header[ehdr->e_shoff]);
+
+	strtab = &header[shdr[ehdr->e_shstrndx].sh_offset];
+
+	/* Count number of headers - look for the .notes.pinfo section. */
+	for (i = 0; i < ehdr->e_shnum; i++) {
+		char *name;
+
+		if (i == ehdr->e_shstrndx)
+			continue;
+
+		if (shdr[i].sh_size == 0)
+			continue;
+
+		name = (char *)(strtab + shdr[i].sh_name);
+
+		if (!strcmp(name, ".note.pinfo"))
+			segments++;
+	}
+
+	/*
+	 * Now, regular headers - we only care about PT_LOAD headers,
+	 * because thats what we're actually going to load.
+	 */
+	for (i = 0; i < headers; i++) {
+		if (phdr[i].p_type != PT_LOAD)
+			continue;
+
+		/* Empty segments are never interesting. */
+		if (phdr[i].p_memsz == 0)
+			continue;
+
+		isize += phdr[i].p_filesz;
+		segments++;
+	}
+
+	/* Allocate a block of memory to store the SELF in. */
+	sptr = calloc((segments * sizeof(struct self_segment)) + isize, 1);
+	doffset = (segments * sizeof(struct self_segment));
+
+	if (sptr == NULL)
+		goto err;
+
+	segs = (struct self_segment *)sptr;
+	segments = 0;
+
+	for (i = 0; i < ehdr->e_shnum; i++) {
+		char *name;
+
+		if (i == ehdr->e_shstrndx)
+			continue;
+
+		if (shdr[i].sh_size == 0)
+			continue;
+
+		name = (char *)(strtab + shdr[i].sh_name);
+
+		if (!strcmp(name, ".note.pinfo")) {
+			segs[segments].type = SELF_TYPE_PARAMS;
+			segs[segments].load_addr = 0;
+			segs[segments].len = (u32) shdr[i].sh_size;
+			segs[segments].offset = doffset;
+
+			memcpy((unsigned long *)(sptr + doffset),
+			       &header[shdr[i].sh_offset], shdr[i].sh_size);
+
+			doffset += segs[segments].len;
+			osize += segs[segments].len;
+
+			segments++;
+		}
+	}
+
+	for (i = 0; i < headers; i++) {
+		if (phdr[i].p_type != PT_LOAD)
+			continue;
+
+		if (phdr[i].p_memsz == 0)
+			continue;
+
+		segs[segments].type = SELF_TYPE_DATA;
+		segs[segments].load_addr = (u64) phdr[i].p_paddr;
+		segs[segments].mem_len = (u32) phdr[i].p_memsz;
+		segs[segments].offset = doffset;
+
+		compress((char *)&header[phdr[i].p_offset],
+			 phdr[i].p_filesz,
+			 (char *)(sptr + doffset), (int *)&segs[segments].len);
+
+		doffset += segs[segments].len;
+		osize += segs[segments].len;
+
+		segments++;
+	}
+
+	segs[segments].type = SELF_TYPE_ENTRY;
+	segs[segments++].load_addr = (unsigned long long)ehdr->e_entry;
+
+	*buffer = sptr;
+
+	munmap(filep, s.st_size);
+	close(fd);
+
+	return (segments * sizeof(struct self_segment)) + osize;
+
+err:
+	munmap(filep, s.st_size);
+	close(fd);
+
+	return -1;
+}
+
+int iself(char *filename)
+{
+	Elf32_Ehdr ehdr;
+	int fd = open(filename, O_RDONLY);
+	int ret = 0;
+
+	if (fd == -1)
+		return 0;
+
+	if (read(fd, &ehdr, sizeof(ehdr)) == sizeof(ehdr))
+		ret = !memcmp(ehdr.e_ident, ELFMAG, 4);
+
+	close(fd);
+
+	return ret;
+}

payloads/bayou/util/pbuilder/liblar/self.h

@@ -0,0 +1,42 @@
+/*
+ * This file is part of the bayou project.
+ *
+ * Copyright (C) 2008 Advanced Micro Devices, Inc.
+ *
+ * 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.
+ *
+ * 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., 51 Franklin St, Fifth Floor, Boston, MA  02110-1301 USA
+ */
+
+#ifndef SELF_H_
+#define SELF_H_
+
+struct self_segment {
+	u32 type;
+	u32 offset;
+	u64 load_addr;
+	u32 len;
+	u32 mem_len;
+};
+
+#define SELF_TYPE_CODE   0x45444F43
+#define SELF_TYPE_DATA   0x41544144
+#define SELF_TYPE_BSS    0x20535342
+#define SELF_TYPE_PARAMS 0x41524150
+#define SELF_TYPE_ENTRY  0x52544E45
+
+int elf_to_self(const char *filename, unsigned char **buffer,
+		void (*compress) (char *, int, char *, int *));
+
+int iself(char *filename);
+
+#endif

payloads/bayou/util/pbuilder/lzma/C/7zip/Common/InBuffer.h

@@ -0,0 +1,76 @@
+// InBuffer.h
+
+#ifndef __INBUFFER_H
+#define __INBUFFER_H
+
+#include "../IStream.h"
+#include "../../Common/MyCom.h"
+
+#ifndef _NO_EXCEPTIONS
+class CInBufferException
+{
+public:
+  HRESULT ErrorCode;
+  CInBufferException(HRESULT errorCode): ErrorCode(errorCode) {}
+};
+#endif
+
+class CInBuffer
+{
+  Byte *_buffer;
+  Byte *_bufferLimit;
+  Byte *_bufferBase;
+  CMyComPtr<ISequentialInStream> _stream;
+  UInt64 _processedSize;
+  UInt32 _bufferSize;
+  bool _wasFinished;
+
+  bool ReadBlock();
+  Byte ReadBlock2();
+
+public:
+  #ifdef _NO_EXCEPTIONS
+  HRESULT ErrorCode;
+  #endif
+
+  CInBuffer();
+  ~CInBuffer() { Free(); }
+
+  bool Create(UInt32 bufferSize);
+  void Free();
+  
+  void SetStream(ISequentialInStream *stream);
+  void Init();
+  void ReleaseStream() { _stream.Release(); }
+
+  bool ReadByte(Byte &b)
+  {
+    if(_buffer >= _bufferLimit)
+      if(!ReadBlock())
+        return false;
+    b = *_buffer++;
+    return true;
+  }
+  Byte ReadByte()
+  {
+    if(_buffer >= _bufferLimit)
+      return ReadBlock2();
+    return *_buffer++;
+  }
+  void ReadBytes(void *data, UInt32 size, UInt32 &processedSize)
+  {
+    for(processedSize = 0; processedSize < size; processedSize++)
+      if (!ReadByte(((Byte *)data)[processedSize]))
+        return;
+  }
+  bool ReadBytes(void *data, UInt32 size)
+  {
+    UInt32 processedSize;
+    ReadBytes(data, size, processedSize);
+    return (processedSize == size);
+  }
+  UInt64 GetProcessedSize() const { return _processedSize + (_buffer - _bufferBase); }
+  bool WasFinished() const { return _wasFinished; }
+};
+
+#endif

payloads/bayou/util/pbuilder/lzma/C/7zip/Common/OutBuffer.cpp

@@ -0,0 +1,116 @@
+// OutByte.cpp
+
+#include "StdAfx.h"
+
+#include "OutBuffer.h"
+
+#include "../../Common/Alloc.h"
+
+bool COutBuffer::Create(UInt32 bufferSize)
+{
+  const UInt32 kMinBlockSize = 1;
+  if (bufferSize < kMinBlockSize)
+    bufferSize = kMinBlockSize;
+  if (_buffer != 0 && _bufferSize == bufferSize)
+    return true;
+  Free();
+  _bufferSize = bufferSize;
+  _buffer = (Byte *)::MidAlloc(bufferSize);
+  return (_buffer != 0);
+}
+
+void COutBuffer::Free()
+{
+  ::MidFree(_buffer);
+  _buffer = 0;
+}
+
+void COutBuffer::SetStream(ISequentialOutStream *stream)
+{
+  _stream = stream;
+}
+
+void COutBuffer::Init()
+{
+  _streamPos = 0;
+  _limitPos = _bufferSize;
+  _pos = 0;
+  _processedSize = 0;
+  _overDict = false;
+  #ifdef _NO_EXCEPTIONS
+  ErrorCode = S_OK;
+  #endif
+}
+
+UInt64 COutBuffer::GetProcessedSize() const
+{ 
+  UInt64 res = _processedSize + _pos - _streamPos;
+  if (_streamPos > _pos) 
+    res += _bufferSize;
+  return res;
+}
+
+
+HRESULT COutBuffer::FlushPart()
+{
+  // _streamPos < _bufferSize
+  UInt32 size = (_streamPos >= _pos) ? (_bufferSize - _streamPos) : (_pos - _streamPos);
+  HRESULT result = S_OK;
+  #ifdef _NO_EXCEPTIONS
+  result = ErrorCode;
+  #endif
+  if (_buffer2 != 0)
+  {
+    memmove(_buffer2, _buffer + _streamPos, size);
+    _buffer2 += size;
+  }
+
+  if (_stream != 0
+      #ifdef _NO_EXCEPTIONS
+      && (ErrorCode == S_OK)
+      #endif
+     )
+  {
+    UInt32 processedSize = 0;
+    result = _stream->Write(_buffer + _streamPos, size, &processedSize);
+    size = processedSize;
+  }
+  _streamPos += size;
+  if (_streamPos == _bufferSize)
+    _streamPos = 0;
+  if (_pos == _bufferSize)
+  {
+    _overDict = true;
+    _pos = 0;
+  }
+  _limitPos = (_streamPos > _pos) ? _streamPos : _bufferSize;
+  _processedSize += size;
+  return result;
+}
+
+HRESULT COutBuffer::Flush()
+{
+  #ifdef _NO_EXCEPTIONS
+  if (ErrorCode != S_OK)
+    return ErrorCode;
+  #endif
+
+  while(_streamPos != _pos)
+  {
+    HRESULT result = FlushPart();
+    if (result != S_OK)
+      return result;
+  }
+  return S_OK;
+}
+
+void COutBuffer::FlushWithCheck()
+{
+  HRESULT result = FlushPart();
+  #ifdef _NO_EXCEPTIONS
+  ErrorCode = result;
+  #else
+  if (result != S_OK)
+    throw COutBufferException(result);
+  #endif
+}

payloads/bayou/util/pbuilder/lzma/C/7zip/Common/OutBuffer.h

@@ -0,0 +1,64 @@
+// OutBuffer.h
+
+#ifndef __OUTBUFFER_H
+#define __OUTBUFFER_H
+
+#include "../IStream.h"
+#include "../../Common/MyCom.h"
+
+#ifndef _NO_EXCEPTIONS
+struct COutBufferException
+{
+  HRESULT ErrorCode;
+  COutBufferException(HRESULT errorCode): ErrorCode(errorCode) {}
+};
+#endif
+
+class COutBuffer
+{
+protected:
+  Byte *_buffer;
+  UInt32 _pos;
+  UInt32 _limitPos;
+  UInt32 _streamPos;
+  UInt32 _bufferSize;
+  CMyComPtr<ISequentialOutStream> _stream;
+  UInt64 _processedSize;
+  Byte  *_buffer2;
+  bool _overDict;
+
+  HRESULT FlushPart();
+  void FlushWithCheck();
+public:
+  #ifdef _NO_EXCEPTIONS
+  HRESULT ErrorCode;
+  #endif
+
+  COutBuffer(): _buffer(0), _pos(0), _stream(0), _buffer2(0) {}
+  ~COutBuffer() { Free(); }
+  
+  bool Create(UInt32 bufferSize);
+  void Free();
+
+  void SetMemStream(Byte *buffer) { _buffer2 = buffer; }
+  void SetStream(ISequentialOutStream *stream);
+  void Init();
+  HRESULT Flush();
+  void ReleaseStream() {  _stream.Release(); }
+
+  void WriteByte(Byte b)
+  {
+    _buffer[_pos++] = b;
+    if(_pos == _limitPos)
+      FlushWithCheck();
+  }
+  void WriteBytes(const void *data, size_t size)
+  {
+    for (size_t i = 0; i < size; i++)
+      WriteByte(((const Byte *)data)[i]);
+  }
+
+  UInt64 GetProcessedSize() const;
+};
+
+#endif

payloads/bayou/util/pbuilder/lzma/C/7zip/Common/StdAfx.h

@@ -0,0 +1,9 @@
+// StdAfx.h
+
+#ifndef __STDAFX_H
+#define __STDAFX_H
+
+#include "../../Common/MyWindows.h"
+#include "../../Common/NewHandler.h"
+
+#endif 

payloads/bayou/util/pbuilder/lzma/C/7zip/Common/StreamUtils.cpp

@@ -0,0 +1,44 @@
+// StreamUtils.cpp
+
+#include "StdAfx.h"
+
+#include "../../Common/MyCom.h"
+#include "StreamUtils.h"
+
+HRESULT ReadStream(ISequentialInStream *stream, void *data, UInt32 size, UInt32 *processedSize)
+{
+  if (processedSize != 0)
+    *processedSize = 0;
+  while(size != 0)
+  {
+    UInt32 processedSizeLoc; 
+    HRESULT res = stream->Read(data, size, &processedSizeLoc);
+    if (processedSize != 0)
+      *processedSize += processedSizeLoc;
+    data = (Byte *)((Byte *)data + processedSizeLoc);
+    size -= processedSizeLoc;
+    RINOK(res);
+    if (processedSizeLoc == 0)
+      return S_OK;
+  }
+  return S_OK;
+}
+
+HRESULT WriteStream(ISequentialOutStream *stream, const void *data, UInt32 size, UInt32 *processedSize)
+{
+  if (processedSize != 0)
+    *processedSize = 0;
+  while(size != 0)
+  {
+    UInt32 processedSizeLoc; 
+    HRESULT res = stream->Write(data, size, &processedSizeLoc);
+    if (processedSize != 0)
+      *processedSize += processedSizeLoc;
+    data = (const void *)((const Byte *)data + processedSizeLoc);
+    size -= processedSizeLoc;
+    RINOK(res);
+    if (processedSizeLoc == 0)
+      break;
+  }
+  return S_OK;
+}

payloads/bayou/util/pbuilder/lzma/C/7zip/Common/StreamUtils.h

@@ -0,0 +1,11 @@
+// StreamUtils.h
+
+#ifndef __STREAMUTILS_H
+#define __STREAMUTILS_H
+
+#include "../IStream.h"
+
+HRESULT ReadStream(ISequentialInStream *stream, void *data, UInt32 size, UInt32 *processedSize);
+HRESULT WriteStream(ISequentialOutStream *stream, const void *data, UInt32 size, UInt32 *processedSize);
+
+#endif

payloads/bayou/util/pbuilder/lzma/C/7zip/Compress/LZ/BinTree/BinTree.h

@@ -0,0 +1,54 @@
+// BinTree.h
+
+#include "../LZInWindow.h"
+#include "../IMatchFinder.h"
+ 
+namespace BT_NAMESPACE {
+
+typedef UInt32 CIndex;
+const UInt32 kMaxValForNormalize = (UInt32(1) << 31) - 1;
+
+class CMatchFinder: 
+  public IMatchFinder,
+  public CLZInWindow,
+  public CMyUnknownImp,
+  public IMatchFinderSetNumPasses
+{
+  UInt32 _cyclicBufferPos;
+  UInt32 _cyclicBufferSize; // it must be historySize + 1
+  UInt32 _matchMaxLen;
+  CIndex *_hash;
+  CIndex *_son;
+  UInt32 _hashMask;
+  UInt32 _cutValue;
+  UInt32 _hashSizeSum;
+
+  void Normalize();
+  void FreeThisClassMemory();
+  void FreeMemory();
+
+  MY_UNKNOWN_IMP
+
+  STDMETHOD(SetStream)(ISequentialInStream *inStream);
+  STDMETHOD_(void, ReleaseStream)();
+  STDMETHOD(Init)();
+  HRESULT MovePos();
+  STDMETHOD_(Byte, GetIndexByte)(Int32 index);
+  STDMETHOD_(UInt32, GetMatchLen)(Int32 index, UInt32 back, UInt32 limit);
+  STDMETHOD_(UInt32, GetNumAvailableBytes)();
+  STDMETHOD_(const Byte *, GetPointerToCurrentPos)();
+  STDMETHOD_(Int32, NeedChangeBufferPos)(UInt32 numCheckBytes);
+  STDMETHOD_(void, ChangeBufferPos)();
+
+  STDMETHOD(Create)(UInt32 historySize, UInt32 keepAddBufferBefore, 
+      UInt32 matchMaxLen, UInt32 keepAddBufferAfter);
+  STDMETHOD(GetMatches)(UInt32 *distances);
+  STDMETHOD(Skip)(UInt32 num);
+
+public:
+  CMatchFinder();
+  virtual ~CMatchFinder();
+  virtual void SetNumPasses(UInt32 numPasses) { _cutValue = numPasses; }
+};
+
+}

payloads/bayou/util/pbuilder/lzma/C/7zip/Compress/LZ/BinTree/BinTree2.h

@@ -0,0 +1,12 @@
+// BinTree2.h
+
+#ifndef __BINTREE2_H
+#define __BINTREE2_H
+
+#define BT_NAMESPACE NBT2
+
+#include "BinTreeMain.h"
+
+#undef BT_NAMESPACE
+
+#endif

payloads/bayou/util/pbuilder/lzma/C/7zip/Compress/LZ/BinTree/BinTree3.h

@@ -0,0 +1,16 @@
+// BinTree3.h
+
+#ifndef __BINTREE3_H
+#define __BINTREE3_H
+
+#define BT_NAMESPACE NBT3
+
+#define HASH_ARRAY_2
+
+#include "BinTreeMain.h"
+
+#undef HASH_ARRAY_2
+
+#undef BT_NAMESPACE
+
+#endif

payloads/bayou/util/pbuilder/lzma/C/7zip/Compress/LZ/BinTree/BinTree4.h

@@ -0,0 +1,18 @@
+// BinTree4.h
+
+#ifndef __BINTREE4_H
+#define __BINTREE4_H
+
+#define BT_NAMESPACE NBT4
+
+#define HASH_ARRAY_2
+#define HASH_ARRAY_3
+
+#include "BinTreeMain.h"
+
+#undef HASH_ARRAY_2
+#undef HASH_ARRAY_3
+
+#undef BT_NAMESPACE
+
+#endif

payloads/bayou/util/pbuilder/lzma/C/7zip/Compress/LZ/BinTree/BinTreeMain.h

@@ -0,0 +1,531 @@
+// BinTreeMain.h
+
+#include "../../../../Common/Defs.h"
+#include "../../../../Common/CRC.h"
+#include "../../../../Common/Alloc.h"
+
+#include "BinTree.h"
+
+// #include <xmmintrin.h>
+// It's for prefetch
+// But prefetch doesn't give big gain in K8.
+
+namespace BT_NAMESPACE {
+
+#ifdef HASH_ARRAY_2
+  static const UInt32 kHash2Size = 1 << 10;
+  #define kNumHashDirectBytes 0
+  #ifdef HASH_ARRAY_3
+    static const UInt32 kNumHashBytes = 4;
+    static const UInt32 kHash3Size = 1 << 16;
+  #else
+    static const UInt32 kNumHashBytes = 3;
+  #endif
+  static const UInt32 kHashSize = 0;
+  static const UInt32 kMinMatchCheck = kNumHashBytes;
+  static const UInt32 kStartMaxLen = 1;
+#else
+  #ifdef HASH_ZIP 
+    #define kNumHashDirectBytes 0
+    static const UInt32 kNumHashBytes = 3;
+    static const UInt32 kHashSize = 1 << 16;
+    static const UInt32 kMinMatchCheck = kNumHashBytes;
+    static const UInt32 kStartMaxLen = 1;
+  #else
+    #define kNumHashDirectBytes 2
+    static const UInt32 kNumHashBytes = 2;
+    static const UInt32 kHashSize = 1 << (8 * kNumHashBytes);
+    static const UInt32 kMinMatchCheck = kNumHashBytes + 1;
+    static const UInt32 kStartMaxLen = 1;
+  #endif
+#endif
+
+#ifdef HASH_ARRAY_2
+#ifdef HASH_ARRAY_3
+static const UInt32 kHash3Offset = kHash2Size;
+#endif
+#endif
+
+static const UInt32 kFixHashSize = 0
+    #ifdef HASH_ARRAY_2
+    + kHash2Size
+    #ifdef HASH_ARRAY_3
+    + kHash3Size
+    #endif
+    #endif
+    ;
+
+CMatchFinder::CMatchFinder():
+  _hash(0)
+{
+}
+
+void CMatchFinder::FreeThisClassMemory()
+{
+  BigFree(_hash);
+  _hash = 0;
+}
+
+void CMatchFinder::FreeMemory()
+{
+  FreeThisClassMemory();
+  CLZInWindow::Free();
+}
+
+CMatchFinder::~CMatchFinder()
+{ 
+  FreeMemory();
+}
+
+STDMETHODIMP CMatchFinder::Create(UInt32 historySize, UInt32 keepAddBufferBefore, 
+    UInt32 matchMaxLen, UInt32 keepAddBufferAfter)
+{
+  if (historySize > kMaxValForNormalize - 256)
+  {
+    FreeMemory();
+    return E_INVALIDARG;
+  }
+  _cutValue = 
+  #ifdef _HASH_CHAIN
+    8 + (matchMaxLen >> 2);
+  #else
+    16 + (matchMaxLen >> 1);
+  #endif
+  UInt32 sizeReserv = (historySize + keepAddBufferBefore + 
+      matchMaxLen + keepAddBufferAfter) / 2 + 256;
+  if (CLZInWindow::Create(historySize + keepAddBufferBefore, 
+      matchMaxLen + keepAddBufferAfter, sizeReserv))
+  {
+    _matchMaxLen = matchMaxLen;
+    UInt32 newCyclicBufferSize = historySize + 1;
+    if (_hash != 0 && newCyclicBufferSize == _cyclicBufferSize)
+      return S_OK;
+    FreeThisClassMemory();
+    _cyclicBufferSize = newCyclicBufferSize; // don't change it
+
+    UInt32 hs = kHashSize;
+
+    #ifdef HASH_ARRAY_2
+    hs = historySize - 1;
+    hs |= (hs >> 1);
+    hs |= (hs >> 2);
+    hs |= (hs >> 4);
+    hs |= (hs >> 8);
+    hs >>= 1;
+    hs |= 0xFFFF;
+    if (hs > (1 << 24))
+    {
+      #ifdef HASH_ARRAY_3
+      hs >>= 1;
+      #else
+      hs = (1 << 24) - 1;
+      #endif
+    }
+    _hashMask = hs;
+    hs++;
+    #endif
+    _hashSizeSum = hs + kFixHashSize;
+    UInt32 numItems = _hashSizeSum + _cyclicBufferSize
+    #ifndef _HASH_CHAIN
+     * 2
+    #endif
+    ;
+    size_t sizeInBytes = (size_t)numItems * sizeof(CIndex);
+    if (sizeInBytes / sizeof(CIndex) != numItems)
+      return E_OUTOFMEMORY;
+    _hash = (CIndex *)BigAlloc(sizeInBytes);
+    _son = _hash + _hashSizeSum;
+    if (_hash != 0)
+      return S_OK;
+  }
+  FreeMemory();
+  return E_OUTOFMEMORY;
+}
+
+static const UInt32 kEmptyHashValue = 0;
+
+STDMETHODIMP CMatchFinder::SetStream(ISequentialInStream *stream)
+{
+  CLZInWindow::SetStream(stream);
+  return S_OK;
+}
+
+STDMETHODIMP CMatchFinder::Init()
+{
+  RINOK(CLZInWindow::Init());
+  for(UInt32 i = 0; i < _hashSizeSum; i++)
+    _hash[i] = kEmptyHashValue;
+  _cyclicBufferPos = 0;
+  ReduceOffsets(-1);
+  return S_OK;
+}
+
+STDMETHODIMP_(void) CMatchFinder::ReleaseStream()
+{ 
+  // ReleaseStream(); 
+}
+
+#ifdef HASH_ARRAY_2
+#ifdef HASH_ARRAY_3
+
+#define HASH_CALC { \
+  UInt32 temp = CCRC::Table[cur[0]] ^ cur[1]; \
+  hash2Value = temp & (kHash2Size - 1); \
+  hash3Value = (temp ^ (UInt32(cur[2]) << 8)) & (kHash3Size - 1); \
+  hashValue = (temp ^ (UInt32(cur[2]) << 8) ^ (CCRC::Table[cur[3]] << 5)) & _hashMask; }
+  
+#else // no HASH_ARRAY_3
+#define HASH_CALC { \
+  UInt32 temp = CCRC::Table[cur[0]] ^ cur[1]; \
+  hash2Value = temp & (kHash2Size - 1); \
+  hashValue = (temp ^ (UInt32(cur[2]) << 8)) & _hashMask; }
+#endif // HASH_ARRAY_3
+#else // no HASH_ARRAY_2
+#ifdef HASH_ZIP 
+inline UInt32 Hash(const Byte *pointer)
+{
+  return ((UInt32(pointer[0]) << 8) ^ CCRC::Table[pointer[1]] ^ pointer[2]) & (kHashSize - 1);
+}
+#else // no HASH_ZIP 
+inline UInt32 Hash(const Byte *pointer)
+{
+  return pointer[0] ^ (UInt32(pointer[1]) << 8);
+}
+#endif // HASH_ZIP
+#endif // HASH_ARRAY_2
+
+STDMETHODIMP CMatchFinder::GetMatches(UInt32 *distances)
+{
+  UInt32 lenLimit;
+  if (_pos + _matchMaxLen <= _streamPos)
+    lenLimit = _matchMaxLen;
+  else
+  {
+    lenLimit = _streamPos - _pos;
+    if(lenLimit < kMinMatchCheck)
+    {
+      distances[0] = 0;
+      return MovePos(); 
+    }
+  }
+
+  int offset = 1;
+
+  UInt32 matchMinPos = (_pos > _cyclicBufferSize) ? (_pos - _cyclicBufferSize) : 0;
+  const Byte *cur = _buffer + _pos;
+
+  UInt32 maxLen = kStartMaxLen; // to avoid items for len < hashSize;
+
+  #ifdef HASH_ARRAY_2
+  UInt32 hash2Value;
+  #ifdef HASH_ARRAY_3
+  UInt32 hash3Value;
+  #endif
+  UInt32 hashValue;
+  HASH_CALC;
+  #else
+  UInt32 hashValue = Hash(cur);
+  #endif
+
+  UInt32 curMatch = _hash[kFixHashSize + hashValue];
+  #ifdef HASH_ARRAY_2
+  UInt32 curMatch2 = _hash[hash2Value];
+  #ifdef HASH_ARRAY_3
+  UInt32 curMatch3 = _hash[kHash3Offset + hash3Value];
+  #endif
+  _hash[hash2Value] = _pos;
+  if(curMatch2 > matchMinPos)
+    if (_buffer[curMatch2] == cur[0])
+    {
+      distances[offset++] = maxLen = 2;
+      distances[offset++] = _pos - curMatch2 - 1;
+    }
+
+  #ifdef HASH_ARRAY_3
+  _hash[kHash3Offset + hash3Value] = _pos;
+  if(curMatch3 > matchMinPos)
+    if (_buffer[curMatch3] == cur[0])
+    {
+      if (curMatch3 == curMatch2)
+        offset -= 2;
+      distances[offset++] = maxLen = 3;
+      distances[offset++] = _pos - curMatch3 - 1;
+      curMatch2 = curMatch3;
+    }
+  #endif
+  if (offset != 1 && curMatch2 == curMatch)
+  {
+    offset -= 2;
+    maxLen = kStartMaxLen;
+  }
+  #endif
+
+  _hash[kFixHashSize + hashValue] = _pos;
+
+  CIndex *son = _son;
+
+  #ifdef _HASH_CHAIN
+  son[_cyclicBufferPos] = curMatch;
+  #else
+  CIndex *ptr0 = son + (_cyclicBufferPos << 1) + 1;
+  CIndex *ptr1 = son + (_cyclicBufferPos << 1);
+
+  UInt32 len0, len1;
+  len0 = len1 = kNumHashDirectBytes;
+  #endif
+
+  #if kNumHashDirectBytes != 0
+  if(curMatch > matchMinPos)
+  {
+    if (_buffer[curMatch + kNumHashDirectBytes] != cur[kNumHashDirectBytes])
+    {
+      distances[offset++] = maxLen = kNumHashDirectBytes;
+      distances[offset++] = _pos - curMatch - 1;
+    }
+  }
+  #endif
+  UInt32 count = _cutValue;
+  while(true)
+  {
+    if(curMatch <= matchMinPos || count-- == 0)
+    {
+      #ifndef _HASH_CHAIN
+      *ptr0 = *ptr1 = kEmptyHashValue;
+      #endif
+      break;
+    }
+    UInt32 delta = _pos - curMatch;
+    UInt32 cyclicPos = (delta <= _cyclicBufferPos) ?
+        (_cyclicBufferPos - delta):
+        (_cyclicBufferPos - delta + _cyclicBufferSize);
+    CIndex *pair = son + 
+    #ifdef _HASH_CHAIN
+      cyclicPos;
+    #else
+      (cyclicPos << 1);
+    #endif
+    
+    // _mm_prefetch((const char *)pair, _MM_HINT_T0);
+    
+    const Byte *pb = _buffer + curMatch;
+    UInt32 len = 
+    #ifdef _HASH_CHAIN
+    kNumHashDirectBytes;
+    if (pb[maxLen] == cur[maxLen])
+    #else
+    MyMin(len0, len1);
+    #endif
+    if (pb[len] == cur[len])
+    {
+      while(++len != lenLimit)
+        if (pb[len] != cur[len])
+          break;
+      if (maxLen < len)
+      {
+        distances[offset++] = maxLen = len;
+        distances[offset++] = delta - 1;
+        if (len == lenLimit)
+        {
+          #ifndef _HASH_CHAIN
+          *ptr1 = pair[0];
+          *ptr0 = pair[1];
+          #endif
+          break;
+        }
+      }
+    }
+    #ifdef _HASH_CHAIN
+    curMatch = *pair;
+    #else
+    if (pb[len] < cur[len])
+    {
+      *ptr1 = curMatch;
+      ptr1 = pair + 1;
+      curMatch = *ptr1;
+      len1 = len;
+    }
+    else
+    {
+      *ptr0 = curMatch;
+      ptr0 = pair;
+      curMatch = *ptr0;
+      len0 = len;
+    }
+    #endif
+  }
+  distances[0] = offset - 1;
+  if (++_cyclicBufferPos == _cyclicBufferSize)
+    _cyclicBufferPos = 0;
+  RINOK(CLZInWindow::MovePos());
+  if (_pos == kMaxValForNormalize)
+    Normalize();
+  return S_OK;
+}
+
+STDMETHODIMP CMatchFinder::Skip(UInt32 num)
+{
+  do
+  {
+  #ifdef _HASH_CHAIN
+  if (_streamPos - _pos < kNumHashBytes)
+  {
+    RINOK(MovePos()); 
+    continue;
+  }
+  #else
+  UInt32 lenLimit;
+  if (_pos + _matchMaxLen <= _streamPos)
+    lenLimit = _matchMaxLen;
+  else
+  {
+    lenLimit = _streamPos - _pos;
+    if(lenLimit < kMinMatchCheck)
+    {
+      RINOK(MovePos());
+      continue;
+    }
+  }
+  UInt32 matchMinPos = (_pos > _cyclicBufferSize) ? (_pos - _cyclicBufferSize) : 0;
+  #endif
+  const Byte *cur = _buffer + _pos;
+
+  #ifdef HASH_ARRAY_2
+  UInt32 hash2Value;
+  #ifdef HASH_ARRAY_3
+  UInt32 hash3Value;
+  UInt32 hashValue;
+  HASH_CALC;
+  _hash[kHash3Offset + hash3Value] = _pos;
+  #else
+  UInt32 hashValue;
+  HASH_CALC;
+  #endif
+  _hash[hash2Value] = _pos;
+  #else
+  UInt32 hashValue = Hash(cur);
+  #endif
+
+  UInt32 curMatch = _hash[kFixHashSize + hashValue];
+  _hash[kFixHashSize + hashValue] = _pos;
+
+  #ifdef _HASH_CHAIN
+  _son[_cyclicBufferPos] = curMatch;
+  #else
+  CIndex *son = _son;
+  CIndex *ptr0 = son + (_cyclicBufferPos << 1) + 1;
+  CIndex *ptr1 = son + (_cyclicBufferPos << 1);
+
+  UInt32 len0, len1;
+  len0 = len1 = kNumHashDirectBytes;
+  UInt32 count = _cutValue;
+  while(true)
+  {
+    if(curMatch <= matchMinPos || count-- == 0)
+    {
+      *ptr0 = *ptr1 = kEmptyHashValue;
+      break;
+    }
+    
+    UInt32 delta = _pos - curMatch;
+    UInt32 cyclicPos = (delta <= _cyclicBufferPos) ?
+      (_cyclicBufferPos - delta):
+      (_cyclicBufferPos - delta + _cyclicBufferSize);
+    CIndex *pair = son + (cyclicPos << 1);
+    
+    // _mm_prefetch((const char *)pair, _MM_HINT_T0);
+    
+    const Byte *pb = _buffer + curMatch;
+    UInt32 len = MyMin(len0, len1);
+    
+    if (pb[len] == cur[len])
+    {
+      while(++len != lenLimit)
+        if (pb[len] != cur[len])
+          break;
+      if (len == lenLimit)
+      {
+        *ptr1 = pair[0];
+        *ptr0 = pair[1];
+        break;
+      }
+    }
+    if (pb[len] < cur[len])
+    {
+      *ptr1 = curMatch;
+      ptr1 = pair + 1;
+      curMatch = *ptr1;
+      len1 = len;
+    }
+    else
+    {
+      *ptr0 = curMatch;
+      ptr0 = pair;
+      curMatch = *ptr0;
+      len0 = len;
+    }
+  }
+  #endif
+  if (++_cyclicBufferPos == _cyclicBufferSize)
+    _cyclicBufferPos = 0;
+  RINOK(CLZInWindow::MovePos());
+  if (_pos == kMaxValForNormalize)
+    Normalize();
+  }
+  while(--num != 0);
+  return S_OK;
+}
+
+void CMatchFinder::Normalize()
+{
+  UInt32 subValue = _pos - _cyclicBufferSize;
+  CIndex *items = _hash;
+  UInt32 numItems = (_hashSizeSum + _cyclicBufferSize 
+    #ifndef _HASH_CHAIN
+     * 2
+    #endif
+    );
+  for (UInt32 i = 0; i < numItems; i++)
+  {
+    UInt32 value = items[i];
+    if (value <= subValue)
+      value = kEmptyHashValue;
+    else
+      value -= subValue;
+    items[i] = value;
+  }
+  ReduceOffsets(subValue);
+}
+
+HRESULT CMatchFinder::MovePos()
+{
+  if (++_cyclicBufferPos == _cyclicBufferSize)
+    _cyclicBufferPos = 0;
+  RINOK(CLZInWindow::MovePos());
+  if (_pos == kMaxValForNormalize)
+    Normalize();
+  return S_OK;
+}
+
+STDMETHODIMP_(Byte) CMatchFinder::GetIndexByte(Int32 index)
+  { return CLZInWindow::GetIndexByte(index); }
+
+STDMETHODIMP_(UInt32) CMatchFinder::GetMatchLen(Int32 index, 
+    UInt32 back, UInt32 limit)
+  { return CLZInWindow::GetMatchLen(index, back, limit); }
+
+STDMETHODIMP_(UInt32) CMatchFinder::GetNumAvailableBytes()
+  { return CLZInWindow::GetNumAvailableBytes(); }
+
+STDMETHODIMP_(const Byte *) CMatchFinder::GetPointerToCurrentPos()
+  { return CLZInWindow::GetPointerToCurrentPos(); }
+
+STDMETHODIMP_(Int32) CMatchFinder::NeedChangeBufferPos(UInt32 numCheckBytes)
+  { return CLZInWindow::NeedMove(numCheckBytes) ? 1: 0; }
+
+STDMETHODIMP_(void) CMatchFinder::ChangeBufferPos()
+  { CLZInWindow::MoveBlock();}
+
+#undef HASH_CALC
+#undef kNumHashDirectBytes
+ 
+}

payloads/bayou/util/pbuilder/lzma/C/7zip/Compress/LZ/HashChain/HC4.h

@@ -0,0 +1,19 @@
+// HC4.h
+
+#ifndef __HC4_H
+#define __HC4_H
+
+#define BT_NAMESPACE NHC4
+
+#define HASH_ARRAY_2
+#define HASH_ARRAY_3
+
+#include "HCMain.h"
+
+#undef HASH_ARRAY_2
+#undef HASH_ARRAY_3
+
+#undef BT_NAMESPACE
+
+#endif
+

payloads/bayou/util/pbuilder/lzma/C/7zip/Compress/LZ/HashChain/HCMain.h

@@ -0,0 +1,6 @@
+// HCMain.h
+
+#define _HASH_CHAIN
+#include "../BinTree/BinTreeMain.h"
+#undef _HASH_CHAIN
+

payloads/bayou/util/pbuilder/lzma/C/7zip/Compress/LZ/IMatchFinder.h

@@ -0,0 +1,33 @@
+// MatchFinders/IMatchFinder.h
+
+#ifndef __IMATCHFINDER_H
+#define __IMATCHFINDER_H
+
+struct IInWindowStream: public IUnknown
+{
+  STDMETHOD(SetStream)(ISequentialInStream *inStream) PURE;
+  STDMETHOD_(void, ReleaseStream)() PURE;
+  STDMETHOD(Init)() PURE;
+  STDMETHOD_(Byte, GetIndexByte)(Int32 index) PURE;
+  STDMETHOD_(UInt32, GetMatchLen)(Int32 index, UInt32 distance, UInt32 limit) PURE;
+  STDMETHOD_(UInt32, GetNumAvailableBytes)() PURE;
+  STDMETHOD_(const Byte *, GetPointerToCurrentPos)() PURE;
+  STDMETHOD_(Int32, NeedChangeBufferPos)(UInt32 numCheckBytes) PURE;
+  STDMETHOD_(void, ChangeBufferPos)() PURE;
+};
+ 
+struct IMatchFinder: public IInWindowStream
+{
+  STDMETHOD(Create)(UInt32 historySize, UInt32 keepAddBufferBefore, 
+      UInt32 matchMaxLen, UInt32 keepAddBufferAfter) PURE;
+  STDMETHOD(GetMatches)(UInt32 *distances) PURE;
+  STDMETHOD(Skip)(UInt32 num) PURE;
+};
+
+struct IMatchFinderSetNumPasses
+{
+  //virtual ~IMatchFinderSetNumPasses(){}
+  virtual void SetNumPasses(UInt32 numPasses) PURE;
+};
+
+#endif

payloads/bayou/util/pbuilder/lzma/C/7zip/Compress/LZ/LZInWindow.cpp

@@ -0,0 +1,105 @@
+// LZInWindow.cpp
+
+#include "StdAfx.h"
+
+#include "LZInWindow.h"
+#include "../../../Common/MyCom.h"
+#include "../../../Common/Alloc.h"
+
+void CLZInWindow::Free()
+{
+  ::BigFree(_bufferBase);
+  _bufferBase = 0;
+}
+
+bool CLZInWindow::Create(UInt32 keepSizeBefore, UInt32 keepSizeAfter, UInt32 keepSizeReserv)
+{
+  _keepSizeBefore = keepSizeBefore;
+  _keepSizeAfter = keepSizeAfter;
+  UInt32 blockSize = keepSizeBefore + keepSizeAfter + keepSizeReserv;
+  if (_bufferBase == 0 || _blockSize != blockSize)
+  {
+    Free();
+    _blockSize = blockSize;
+    if (_blockSize != 0)
+      _bufferBase = (Byte *)::BigAlloc(_blockSize);
+  }
+  _pointerToLastSafePosition = _bufferBase + _blockSize - keepSizeAfter;
+  if (_blockSize == 0)
+    return true;
+  return (_bufferBase != 0);
+}
+
+void CLZInWindow::SetStream(ISequentialInStream *stream)
+{
+  _stream = stream;
+}
+
+HRESULT CLZInWindow::Init()
+{
+  _buffer = _bufferBase;
+  _pos = 0;
+  _streamPos = 0;
+  _streamEndWasReached = false;
+  return ReadBlock();
+}
+
+/*
+void CLZInWindow::ReleaseStream()
+{
+  _stream.Release();
+}
+*/
+
+///////////////////////////////////////////
+// ReadBlock
+
+// In State:
+//   (_buffer + _streamPos) <= (_bufferBase + _blockSize)
+// Out State:
+//   _posLimit <= _blockSize - _keepSizeAfter;
+//   if(_streamEndWasReached == false):
+//     _streamPos >= _pos + _keepSizeAfter
+//     _posLimit = _streamPos - _keepSizeAfter;
+//   else
+//          
+  
+HRESULT CLZInWindow::ReadBlock()
+{
+  if(_streamEndWasReached)
+    return S_OK;
+  while(true)
+  {
+    UInt32 size = (UInt32)(_bufferBase - _buffer) + _blockSize - _streamPos;
+    if(size == 0)
+      return S_OK;
+    UInt32 numReadBytes;
+    RINOK(_stream->Read(_buffer + _streamPos, size, &numReadBytes));
+    if(numReadBytes == 0)
+    {
+      _posLimit = _streamPos;
+      const Byte *pointerToPostion = _buffer + _posLimit;
+      if(pointerToPostion > _pointerToLastSafePosition)
+        _posLimit = (UInt32)(_pointerToLastSafePosition - _buffer);
+      _streamEndWasReached = true;
+      return S_OK;
+    }
+    _streamPos += numReadBytes;
+    if(_streamPos >= _pos + _keepSizeAfter)
+    {
+      _posLimit = _streamPos - _keepSizeAfter;
+      return S_OK;
+    }
+  }
+}
+
+void CLZInWindow::MoveBlock()
+{
+  UInt32 offset = (UInt32)(_buffer - _bufferBase) + _pos - _keepSizeBefore;
+  // we need one additional byte, since MovePos moves on 1 byte.
+  if (offset > 0)
+    offset--; 
+  UInt32 numBytes = (UInt32)(_buffer - _bufferBase) + _streamPos -  offset;
+  memmove(_bufferBase, _bufferBase + offset, numBytes);
+  _buffer -= offset;
+}

payloads/bayou/util/pbuilder/lzma/C/7zip/Compress/LZ/LZInWindow.h

@@ -0,0 +1,87 @@
+// LZInWindow.h
+
+#ifndef __LZ_IN_WINDOW_H
+#define __LZ_IN_WINDOW_H
+
+#include "../../IStream.h"
+
+class CLZInWindow
+{
+  Byte *_bufferBase; // pointer to buffer with data
+  ISequentialInStream *_stream;
+  UInt32 _posLimit;  // offset (from _buffer) when new block reading must be done
+  bool _streamEndWasReached; // if (true) then _streamPos shows real end of stream
+  const Byte *_pointerToLastSafePosition;
+protected:
+  Byte  *_buffer;   // Pointer to virtual Buffer begin
+  UInt32 _blockSize;  // Size of Allocated memory block
+  UInt32 _pos;             // offset (from _buffer) of curent byte
+  UInt32 _keepSizeBefore;  // how many BYTEs must be kept in buffer before _pos
+  UInt32 _keepSizeAfter;   // how many BYTEs must be kept buffer after _pos
+  UInt32 _streamPos;   // offset (from _buffer) of first not read byte from Stream
+
+  void MoveBlock();
+  HRESULT ReadBlock();
+  void Free();
+public:
+  CLZInWindow(): _bufferBase(0) {}
+  virtual ~CLZInWindow() { Free(); }
+
+  // keepSizeBefore + keepSizeAfter + keepSizeReserv < 4G)
+  bool Create(UInt32 keepSizeBefore, UInt32 keepSizeAfter, UInt32 keepSizeReserv = (1<<17));
+
+  void SetStream(ISequentialInStream *stream);
+  HRESULT Init();
+  // void ReleaseStream();
+
+  Byte *GetBuffer() const { return _buffer; }
+
+  const Byte *GetPointerToCurrentPos() const { return _buffer + _pos; }
+
+  HRESULT MovePos()
+  {
+    _pos++;
+    if (_pos > _posLimit)
+    {
+      const Byte *pointerToPostion = _buffer + _pos;
+      if(pointerToPostion > _pointerToLastSafePosition)
+        MoveBlock();
+      return ReadBlock();
+    }
+    else
+      return S_OK;
+  }
+  Byte GetIndexByte(Int32 index) const  {  return _buffer[(size_t)_pos + index]; }
+
+  // index + limit have not to exceed _keepSizeAfter;
+  // -2G <= index < 2G
+  UInt32 GetMatchLen(Int32 index, UInt32 distance, UInt32 limit) const
+  {  
+    if(_streamEndWasReached)
+      if ((_pos + index) + limit > _streamPos)
+        limit = _streamPos - (_pos + index);
+    distance++;
+    const Byte *pby = _buffer + (size_t)_pos + index;
+    UInt32 i;
+    for(i = 0; i < limit && pby[i] == pby[(size_t)i - distance]; i++);
+    return i;
+  }
+
+  UInt32 GetNumAvailableBytes() const { return _streamPos - _pos; }
+
+  void ReduceOffsets(Int32 subValue)
+  {
+    _buffer += subValue;
+    _posLimit -= subValue;
+    _pos -= subValue;
+    _streamPos -= subValue;
+  }
+
+  bool NeedMove(UInt32 numCheckBytes)
+  {
+    UInt32 reserv = _pointerToLastSafePosition - (_buffer + _pos);
+    return (reserv <= numCheckBytes);
+  }
+};
+
+#endif

payloads/bayou/util/pbuilder/lzma/C/7zip/Compress/LZ/StdAfx.h

@@ -0,0 +1,6 @@
+// StdAfx.h
+
+#ifndef __STDAFX_H
+#define __STDAFX_H
+
+#endif 

payloads/bayou/util/pbuilder/lzma/C/7zip/Compress/LZMA/LZMA.h

@@ -0,0 +1,82 @@
+// LZMA.h
+
+#ifndef __LZMA_H
+#define __LZMA_H
+
+namespace NCompress {
+namespace NLZMA {
+
+const UInt32 kNumRepDistances = 4;
+
+const int kNumStates = 12;
+
+const Byte kLiteralNextStates[kNumStates] = {0, 0, 0, 0, 1, 2, 3, 4,  5,  6,   4, 5};
+const Byte kMatchNextStates[kNumStates]   = {7, 7, 7, 7, 7, 7, 7, 10, 10, 10, 10, 10};
+const Byte kRepNextStates[kNumStates]     = {8, 8, 8, 8, 8, 8, 8, 11, 11, 11, 11, 11};
+const Byte kShortRepNextStates[kNumStates]= {9, 9, 9, 9, 9, 9, 9, 11, 11, 11, 11, 11};
+
+class CState
+{
+public:
+  Byte Index;
+  void Init() { Index = 0; }
+  void UpdateChar() { Index = kLiteralNextStates[Index]; }
+  void UpdateMatch() { Index = kMatchNextStates[Index]; }
+  void UpdateRep() { Index = kRepNextStates[Index]; }
+  void UpdateShortRep() { Index = kShortRepNextStates[Index]; }
+  bool IsCharState() const { return Index < 7; }
+};
+
+const int kNumPosSlotBits = 6; 
+const int kDicLogSizeMin = 0; 
+const int kDicLogSizeMax = 32; 
+const int kDistTableSizeMax = kDicLogSizeMax * 2; 
+
+const UInt32 kNumLenToPosStates = 4;
+
+inline UInt32 GetLenToPosState(UInt32 len)
+{
+  len -= 2;
+  if (len < kNumLenToPosStates)
+    return len;
+  return kNumLenToPosStates - 1;
+}
+
+namespace NLength {
+
+const int kNumPosStatesBitsMax = 4;
+const UInt32 kNumPosStatesMax = (1 << kNumPosStatesBitsMax);
+
+const int kNumPosStatesBitsEncodingMax = 4;
+const UInt32 kNumPosStatesEncodingMax = (1 << kNumPosStatesBitsEncodingMax);
+
+const int kNumLowBits = 3;
+const int kNumMidBits = 3;
+const int kNumHighBits = 8;
+const UInt32 kNumLowSymbols = 1 << kNumLowBits;
+const UInt32 kNumMidSymbols = 1 << kNumMidBits;
+const UInt32 kNumSymbolsTotal = kNumLowSymbols + kNumMidSymbols + (1 << kNumHighBits);
+
+}
+
+const UInt32 kMatchMinLen = 2;
+const UInt32 kMatchMaxLen = kMatchMinLen + NLength::kNumSymbolsTotal - 1;
+
+const int kNumAlignBits = 4;
+const UInt32 kAlignTableSize = 1 << kNumAlignBits;
+const UInt32 kAlignMask = (kAlignTableSize - 1);
+
+const UInt32 kStartPosModelIndex = 4;
+const UInt32 kEndPosModelIndex = 14;
+const UInt32 kNumPosModels = kEndPosModelIndex - kStartPosModelIndex;
+
+const UInt32 kNumFullDistances = 1 << (kEndPosModelIndex / 2);
+
+const int kNumLitPosStatesBitsEncodingMax = 4;
+const int kNumLitContextBitsMax = 8;
+
+const int kNumMoveBits = 5;
+
+}}
+
+#endif

payloads/bayou/util/pbuilder/lzma/C/7zip/Compress/LZMA/LZMAEncoder.h

@@ -0,0 +1,411 @@
+// LZMA/Encoder.h
+
+#ifndef __LZMA_ENCODER_H
+#define __LZMA_ENCODER_H
+
+#include "../../../Common/MyCom.h"
+#include "../../../Common/Alloc.h"
+#include "../../ICoder.h"
+#include "../LZ/IMatchFinder.h"
+#include "../RangeCoder/RangeCoderBitTree.h"
+
+#include "LZMA.h"
+
+namespace NCompress {
+namespace NLZMA {
+
+typedef NRangeCoder::CBitEncoder<kNumMoveBits> CMyBitEncoder;
+
+class CBaseState
+{
+protected:
+  CState _state;
+  Byte _previousByte;
+  UInt32 _repDistances[kNumRepDistances];
+  void Init()
+  {
+    _state.Init();
+    _previousByte = 0;
+    for(UInt32 i = 0 ; i < kNumRepDistances; i++)
+      _repDistances[i] = 0;
+  }
+};
+
+struct COptimal
+{
+  CState State;
+
+  bool Prev1IsChar;
+  bool Prev2;
+
+  UInt32 PosPrev2;
+  UInt32 BackPrev2;     
+
+  UInt32 Price;    
+  UInt32 PosPrev;         // posNext;
+  UInt32 BackPrev;     
+  UInt32 Backs[kNumRepDistances];
+  void MakeAsChar() { BackPrev = UInt32(-1); Prev1IsChar = false; }
+  void MakeAsShortRep() { BackPrev = 0; ; Prev1IsChar = false; }
+  bool IsShortRep() { return (BackPrev == 0); }
+};
+
+
+extern Byte g_FastPos[1 << 11];
+inline UInt32 GetPosSlot(UInt32 pos)
+{
+  if (pos < (1 << 11))
+    return g_FastPos[pos];
+  if (pos < (1 << 21))
+    return g_FastPos[pos >> 10] + 20;
+  return g_FastPos[pos >> 20] + 40;
+}
+
+inline UInt32 GetPosSlot2(UInt32 pos)
+{
+  if (pos < (1 << 17))
+    return g_FastPos[pos >> 6] + 12;
+  if (pos < (1 << 27))
+    return g_FastPos[pos >> 16] + 32;
+  return g_FastPos[pos >> 26] + 52;
+}
+
+const UInt32 kIfinityPrice = 0xFFFFFFF;
+
+const UInt32 kNumOpts = 1 << 12;
+
+
+class CLiteralEncoder2
+{
+  CMyBitEncoder _encoders[0x300];
+public:
+  void Init()
+  {
+    for (int i = 0; i < 0x300; i++)
+      _encoders[i].Init();
+  }
+  void Encode(NRangeCoder::CEncoder *rangeEncoder, Byte symbol);
+  void EncodeMatched(NRangeCoder::CEncoder *rangeEncoder, Byte matchByte, Byte symbol);
+  UInt32 GetPrice(bool matchMode, Byte matchByte, Byte symbol) const;
+};
+
+class CLiteralEncoder
+{
+  CLiteralEncoder2 *_coders;
+  int _numPrevBits;
+  int _numPosBits;
+  UInt32 _posMask;
+public:
+  CLiteralEncoder(): _coders(0) {}
+  ~CLiteralEncoder()  { Free(); }
+  void Free()
+  { 
+    MyFree(_coders);
+    _coders = 0;
+  }
+  bool Create(int numPosBits, int numPrevBits)
+  {
+    if (_coders == 0 || (numPosBits + numPrevBits) != (_numPrevBits + _numPosBits))
+    {
+      Free();
+      UInt32 numStates = 1 << (numPosBits + numPrevBits);
+      _coders = (CLiteralEncoder2 *)MyAlloc(numStates * sizeof(CLiteralEncoder2));
+    }
+    _numPosBits = numPosBits;
+    _posMask = (1 << numPosBits) - 1;
+    _numPrevBits = numPrevBits;
+    return (_coders != 0);
+  }
+  void Init()
+  {
+    UInt32 numStates = 1 << (_numPrevBits + _numPosBits);
+    for (UInt32 i = 0; i < numStates; i++)
+      _coders[i].Init();
+  }
+  CLiteralEncoder2 *GetSubCoder(UInt32 pos, Byte prevByte)
+    { return &_coders[((pos & _posMask) << _numPrevBits) + (prevByte >> (8 - _numPrevBits))]; }
+};
+
+namespace NLength {
+
+class CEncoder
+{
+  CMyBitEncoder _choice;
+  CMyBitEncoder _choice2;
+  NRangeCoder::CBitTreeEncoder<kNumMoveBits, kNumLowBits> _lowCoder[kNumPosStatesEncodingMax];
+  NRangeCoder::CBitTreeEncoder<kNumMoveBits, kNumMidBits> _midCoder[kNumPosStatesEncodingMax];
+  NRangeCoder::CBitTreeEncoder<kNumMoveBits, kNumHighBits> _highCoder;
+public:
+  void Init(UInt32 numPosStates);
+  void Encode(NRangeCoder::CEncoder *rangeEncoder, UInt32 symbol, UInt32 posState);
+  void SetPrices(UInt32 posState, UInt32 numSymbols, UInt32 *prices) const;
+};
+
+const UInt32 kNumSpecSymbols = kNumLowSymbols + kNumMidSymbols;
+
+class CPriceTableEncoder: public CEncoder
+{
+  UInt32 _prices[kNumPosStatesEncodingMax][kNumSymbolsTotal];
+  UInt32 _tableSize;
+  UInt32 _counters[kNumPosStatesEncodingMax];
+public:
+  void SetTableSize(UInt32 tableSize) { _tableSize = tableSize;  }
+  UInt32 GetPrice(UInt32 symbol, UInt32 posState) const { return _prices[posState][symbol]; }
+  void UpdateTable(UInt32 posState)
+  {
+    SetPrices(posState, _tableSize, _prices[posState]);
+    _counters[posState] = _tableSize;
+  }
+  void UpdateTables(UInt32 numPosStates)
+  {
+    for (UInt32 posState = 0; posState < numPosStates; posState++)
+      UpdateTable(posState);
+  }
+  void Encode(NRangeCoder::CEncoder *rangeEncoder, UInt32 symbol, UInt32 posState, bool updatePrice)
+  {
+    CEncoder::Encode(rangeEncoder, symbol, posState);
+    if (updatePrice)
+      if (--_counters[posState] == 0)
+        UpdateTable(posState);
+  }
+};
+
+}
+
+class CEncoder : 
+  public ICompressCoder,
+  public ICompressSetOutStream,
+  public ICompressSetCoderProperties,
+  public ICompressWriteCoderProperties,
+  public CBaseState,
+  public CMyUnknownImp
+{
+  COptimal _optimum[kNumOpts];
+  CMyComPtr<IMatchFinder> _matchFinder; // test it
+  NRangeCoder::CEncoder _rangeEncoder;
+
+  CMyBitEncoder _isMatch[kNumStates][NLength::kNumPosStatesEncodingMax];
+  CMyBitEncoder _isRep[kNumStates];
+  CMyBitEncoder _isRepG0[kNumStates];
+  CMyBitEncoder _isRepG1[kNumStates];
+  CMyBitEncoder _isRepG2[kNumStates];
+  CMyBitEncoder _isRep0Long[kNumStates][NLength::kNumPosStatesEncodingMax];
+
+  NRangeCoder::CBitTreeEncoder<kNumMoveBits, kNumPosSlotBits> _posSlotEncoder[kNumLenToPosStates];
+
+  CMyBitEncoder _posEncoders[kNumFullDistances - kEndPosModelIndex];
+  NRangeCoder::CBitTreeEncoder<kNumMoveBits, kNumAlignBits> _posAlignEncoder;
+  
+  NLength::CPriceTableEncoder _lenEncoder;
+  NLength::CPriceTableEncoder _repMatchLenEncoder;
+
+  CLiteralEncoder _literalEncoder;
+
+  UInt32 _matchDistances[kMatchMaxLen * 2 + 2 + 1];
+
+  bool _fastMode;
+  // bool _maxMode;
+  UInt32 _numFastBytes;
+  UInt32 _longestMatchLength;    
+  UInt32 _numDistancePairs;
+
+  UInt32 _additionalOffset;
+
+  UInt32 _optimumEndIndex;
+  UInt32 _optimumCurrentIndex;
+
+  bool _longestMatchWasFound;
+
+  UInt32 _posSlotPrices[kNumLenToPosStates][kDistTableSizeMax];
+  
+  UInt32 _distancesPrices[kNumLenToPosStates][kNumFullDistances];
+
+  UInt32 _alignPrices[kAlignTableSize];
+  UInt32 _alignPriceCount;
+
+  UInt32 _distTableSize;
+
+  UInt32 _posStateBits;
+  UInt32 _posStateMask;
+  UInt32 _numLiteralPosStateBits;
+  UInt32 _numLiteralContextBits;
+
+  UInt32 _dictionarySize;
+
+  UInt32 _dictionarySizePrev;
+  UInt32 _numFastBytesPrev;
+
+  UInt32 _matchPriceCount;
+  UInt64 nowPos64;
+  bool _finished;
+  ISequentialInStream *_inStream;
+
+  UInt32 _matchFinderCycles;
+  int _matchFinderIndex;
+  #ifdef COMPRESS_MF_MT
+  bool _multiThread;
+  #endif
+
+  bool _writeEndMark;
+
+  bool _needReleaseMFStream;
+
+  IMatchFinderSetNumPasses *setMfPasses;
+
+  void ReleaseMatchFinder()
+  {
+    setMfPasses = 0;
+    _matchFinder.Release();
+  }
+  
+  HRESULT ReadMatchDistances(UInt32 &len, UInt32 &numDistancePairs);
+
+  HRESULT MovePos(UInt32 num);
+  UInt32 GetRepLen1Price(CState state, UInt32 posState) const
+  {
+    return _isRepG0[state.Index].GetPrice0() +
+        _isRep0Long[state.Index][posState].GetPrice0();
+  }
+  
+  UInt32 GetPureRepPrice(UInt32 repIndex, CState state, UInt32 posState) const
+  {
+    UInt32 price;
+    if(repIndex == 0)
+    {
+      price = _isRepG0[state.Index].GetPrice0();
+      price += _isRep0Long[state.Index][posState].GetPrice1();
+    }
+    else
+    {
+      price = _isRepG0[state.Index].GetPrice1();
+      if (repIndex == 1)
+        price += _isRepG1[state.Index].GetPrice0();
+      else
+      {
+        price += _isRepG1[state.Index].GetPrice1();
+        price += _isRepG2[state.Index].GetPrice(repIndex - 2);
+      }
+    }
+    return price;
+  }
+  UInt32 GetRepPrice(UInt32 repIndex, UInt32 len, CState state, UInt32 posState) const
+  {
+    return _repMatchLenEncoder.GetPrice(len - kMatchMinLen, posState) +
+        GetPureRepPrice(repIndex, state, posState);
+  }
+  /*
+  UInt32 GetPosLen2Price(UInt32 pos, UInt32 posState) const
+  {
+    if (pos >= kNumFullDistances)
+      return kIfinityPrice;
+    return _distancesPrices[0][pos] + _lenEncoder.GetPrice(0, posState);
+  }
+  UInt32 GetPosLen3Price(UInt32 pos, UInt32 len, UInt32 posState) const
+  {
+    UInt32 price;
+    UInt32 lenToPosState = GetLenToPosState(len);
+    if (pos < kNumFullDistances)
+      price = _distancesPrices[lenToPosState][pos];
+    else
+      price = _posSlotPrices[lenToPosState][GetPosSlot2(pos)] + 
+          _alignPrices[pos & kAlignMask];
+    return price + _lenEncoder.GetPrice(len - kMatchMinLen, posState);
+  }
+  */
+  UInt32 GetPosLenPrice(UInt32 pos, UInt32 len, UInt32 posState) const
+  {
+    UInt32 price;
+    UInt32 lenToPosState = GetLenToPosState(len);
+    if (pos < kNumFullDistances)
+      price = _distancesPrices[lenToPosState][pos];
+    else
+      price = _posSlotPrices[lenToPosState][GetPosSlot2(pos)] + 
+          _alignPrices[pos & kAlignMask];
+    return price + _lenEncoder.GetPrice(len - kMatchMinLen, posState);
+  }
+
+  UInt32 Backward(UInt32 &backRes, UInt32 cur);
+  HRESULT GetOptimum(UInt32 position, UInt32 &backRes, UInt32 &lenRes);
+  HRESULT GetOptimumFast(UInt32 position, UInt32 &backRes, UInt32 &lenRes);
+
+  void FillDistancesPrices();
+  void FillAlignPrices();
+    
+  void ReleaseMFStream()
+  {
+    if (_matchFinder && _needReleaseMFStream)
+    {
+      _matchFinder->ReleaseStream();
+      _needReleaseMFStream = false;
+    }
+  }
+
+  void ReleaseStreams()
+  {
+    ReleaseMFStream();
+    ReleaseOutStream();
+  }
+
+  HRESULT Flush(UInt32 nowPos);
+  class CCoderReleaser
+  {
+    CEncoder *_coder;
+  public:
+    CCoderReleaser(CEncoder *coder): _coder(coder) {}
+    ~CCoderReleaser()
+    {
+      _coder->ReleaseStreams();
+    }
+  };
+  friend class CCoderReleaser;
+
+  void WriteEndMarker(UInt32 posState);
+
+public:
+  CEncoder();
+  void SetWriteEndMarkerMode(bool writeEndMarker)
+    { _writeEndMark= writeEndMarker; }
+
+  HRESULT Create();
+
+  MY_UNKNOWN_IMP3(
+      ICompressSetOutStream,
+      ICompressSetCoderProperties,
+      ICompressWriteCoderProperties
+      )
+    
+  HRESULT Init();
+  
+  // ICompressCoder interface
+  HRESULT SetStreams(ISequentialInStream *inStream,
+      ISequentialOutStream *outStream,
+      const UInt64 *inSize, const UInt64 *outSize);
+  HRESULT CodeOneBlock(UInt64 *inSize, UInt64 *outSize, Int32 *finished);
+
+  HRESULT CodeReal(ISequentialInStream *inStream,
+      ISequentialOutStream *outStream, 
+      const UInt64 *inSize, const UInt64 *outSize,
+      ICompressProgressInfo *progress);
+
+  // ICompressCoder interface
+  STDMETHOD(Code)(ISequentialInStream *inStream,
+      ISequentialOutStream *outStream, 
+      const UInt64 *inSize, const UInt64 *outSize,
+      ICompressProgressInfo *progress);
+
+  // ICompressSetCoderProperties2
+  STDMETHOD(SetCoderProperties)(const PROPID *propIDs, 
+      const PROPVARIANT *properties, UInt32 numProperties);
+  
+  // ICompressWriteCoderProperties
+  STDMETHOD(WriteCoderProperties)(ISequentialOutStream *outStream);
+
+  STDMETHOD(SetOutStream)(ISequentialOutStream *outStream);
+  STDMETHOD(ReleaseOutStream)();
+
+  virtual ~CEncoder() {}
+};
+
+}}
+
+#endif

payloads/bayou/util/pbuilder/lzma/C/7zip/Compress/LZMA/StdAfx.h

@@ -0,0 +1,8 @@
+// StdAfx.h
+
+#ifndef __STDAFX_H
+#define __STDAFX_H
+
+#include "../../../Common/MyWindows.h"
+
+#endif

payloads/bayou/util/pbuilder/lzma/C/7zip/Compress/RangeCoder/RangeCoder.h

@@ -0,0 +1,205 @@
+// Compress/RangeCoder/RangeCoder.h
+
+#ifndef __COMPRESS_RANGECODER_H
+#define __COMPRESS_RANGECODER_H
+
+#include "../../Common/InBuffer.h"
+#include "../../Common/OutBuffer.h"
+
+namespace NCompress {
+namespace NRangeCoder {
+
+const int kNumTopBits = 24;
+const UInt32 kTopValue = (1 << kNumTopBits);
+
+class CEncoder
+{
+  UInt32 _cacheSize;
+  Byte _cache;
+public:
+  UInt64 Low;
+  UInt32 Range;
+  COutBuffer Stream;
+  bool Create(UInt32 bufferSize) { return Stream.Create(bufferSize); }
+
+  void SetStream(ISequentialOutStream *stream) { Stream.SetStream(stream); }
+  void Init()
+  {
+    Stream.Init();
+    Low = 0;
+    Range = 0xFFFFFFFF;
+    _cacheSize = 1;
+    _cache = 0;
+  }
+
+  void FlushData()
+  {
+    // Low += 1; 
+    for(int i = 0; i < 5; i++)
+      ShiftLow();
+  }
+
+  HRESULT FlushStream() { return Stream.Flush();  }
+
+  void ReleaseStream() { Stream.ReleaseStream(); }
+
+  void Encode(UInt32 start, UInt32 size, UInt32 total)
+  {
+    Low += start * (Range /= total);
+    Range *= size;
+    while (Range < kTopValue)
+    {
+      Range <<= 8;
+      ShiftLow();
+    }
+  }
+
+  void ShiftLow()
+  {
+    if ((UInt32)Low < (UInt32)0xFF000000 || (int)(Low >> 32) != 0) 
+    {
+      Byte temp = _cache;
+      do
+      {
+        Stream.WriteByte((Byte)(temp + (Byte)(Low >> 32)));
+        temp = 0xFF;
+      }
+      while(--_cacheSize != 0);
+      _cache = (Byte)((UInt32)Low >> 24);                      
+    } 
+    _cacheSize++;                               
+    Low = (UInt32)Low << 8;                           
+  }
+  
+  void EncodeDirectBits(UInt32 value, int numTotalBits)
+  {
+    for (int i = numTotalBits - 1; i >= 0; i--)
+    {
+      Range >>= 1;
+      if (((value >> i) & 1) == 1)
+        Low += Range;
+      if (Range < kTopValue)
+      {
+        Range <<= 8;
+        ShiftLow();
+      }
+    }
+  }
+
+  void EncodeBit(UInt32 size0, UInt32 numTotalBits, UInt32 symbol)
+  {
+    UInt32 newBound = (Range >> numTotalBits) * size0;
+    if (symbol == 0)
+      Range = newBound;
+    else
+    {
+      Low += newBound;
+      Range -= newBound;
+    }
+    while (Range < kTopValue)
+    {
+      Range <<= 8;
+      ShiftLow();
+    }
+  }
+
+  UInt64 GetProcessedSize() {  return Stream.GetProcessedSize() + _cacheSize + 4; }
+};
+
+class CDecoder
+{
+public:
+  CInBuffer Stream;
+  UInt32 Range;
+  UInt32 Code;
+  bool Create(UInt32 bufferSize) { return Stream.Create(bufferSize); }
+
+  void Normalize()
+  {
+    while (Range < kTopValue)
+    {
+      Code = (Code << 8) | Stream.ReadByte();
+      Range <<= 8;
+    }
+  }
+  
+  void SetStream(ISequentialInStream *stream) { Stream.SetStream(stream); }
+  void Init()
+  {
+    Stream.Init();
+    Code = 0;
+    Range = 0xFFFFFFFF;
+    for(int i = 0; i < 5; i++)
+      Code = (Code << 8) | Stream.ReadByte();
+  }
+
+  void ReleaseStream() { Stream.ReleaseStream(); }
+
+  UInt32 GetThreshold(UInt32 total)
+  {
+    return (Code) / ( Range /= total);
+  }
+
+  void Decode(UInt32 start, UInt32 size)
+  {
+    Code -= start * Range;
+    Range *= size;
+    Normalize();
+  }
+
+  UInt32 DecodeDirectBits(int numTotalBits)
+  {
+    UInt32 range = Range;
+    UInt32 code = Code;        
+    UInt32 result = 0;
+    for (int i = numTotalBits; i != 0; i--)
+    {
+      range >>= 1;
+      /*
+      result <<= 1;
+      if (code >= range)
+      {
+        code -= range;
+        result |= 1;
+      }
+      */
+      UInt32 t = (code - range) >> 31;
+      code -= range & (t - 1);
+      result = (result << 1) | (1 - t);
+
+      if (range < kTopValue)
+      {
+        code = (code << 8) | Stream.ReadByte();
+        range <<= 8; 
+      }
+    }
+    Range = range;
+    Code = code;
+    return result;
+  }
+
+  UInt32 DecodeBit(UInt32 size0, UInt32 numTotalBits)
+  {
+    UInt32 newBound = (Range >> numTotalBits) * size0;
+    UInt32 symbol;
+    if (Code < newBound)
+    {
+      symbol = 0;
+      Range = newBound;
+    }
+    else
+    {
+      symbol = 1;
+      Code -= newBound;
+      Range -= newBound;
+    }
+    Normalize();
+    return symbol;
+  }
+
+  UInt64 GetProcessedSize() {return Stream.GetProcessedSize(); }
+};
+
+}}
+
+#endif

payloads/bayou/util/pbuilder/lzma/C/7zip/Compress/RangeCoder/RangeCoderBit.cpp

@@ -0,0 +1,80 @@
+// Compress/RangeCoder/RangeCoderBit.cpp
+
+#include "StdAfx.h"
+
+#include "RangeCoderBit.h"
+
+namespace NCompress {
+namespace NRangeCoder {
+
+UInt32 CPriceTables::ProbPrices[kBitModelTotal >> kNumMoveReducingBits];
+static CPriceTables g_PriceTables;
+
+CPriceTables::CPriceTables() { Init(); }
+
+void CPriceTables::Init()
+{
+  const int kNumBits = (kNumBitModelTotalBits - kNumMoveReducingBits);
+  for(int i = kNumBits - 1; i >= 0; i--)
+  {
+    UInt32 start = 1 << (kNumBits - i - 1);
+    UInt32 end = 1 << (kNumBits - i);
+    for (UInt32 j = start; j < end; j++)
+      ProbPrices[j] = (i << kNumBitPriceShiftBits) + 
+          (((end - j) << kNumBitPriceShiftBits) >> (kNumBits - i - 1));
+  }
+
+  /*
+  // simplest: bad solution
+  for(UInt32 i = 1; i < (kBitModelTotal >> kNumMoveReducingBits) - 1; i++)
+    ProbPrices[i] = kBitPrice;
+  */
+  
+  /*
+  const double kDummyMultMid = (1.0 / kBitPrice) / 2;
+  const double kDummyMultMid = 0;
+  // float solution
+  double ln2 = log(double(2));
+  double lnAll = log(double(kBitModelTotal >> kNumMoveReducingBits));
+  for(UInt32 i = 1; i < (kBitModelTotal >> kNumMoveReducingBits) - 1; i++)
+    ProbPrices[i] = UInt32((fabs(lnAll - log(double(i))) / ln2 + kDummyMultMid) * kBitPrice);
+  */
+  
+  /*
+  // experimental, slow, solution:
+  for(UInt32 i = 1; i < (kBitModelTotal >> kNumMoveReducingBits) - 1; i++)
+  {
+    const int kCyclesBits = 5;
+    const UInt32 kCycles = (1 << kCyclesBits);
+
+    UInt32 range = UInt32(-1);
+    UInt32 bitCount = 0;
+    for (UInt32 j = 0; j < kCycles; j++)
+    {
+      range >>= (kNumBitModelTotalBits - kNumMoveReducingBits);
+      range *= i;
+      while(range < (1 << 31))
+      {
+        range <<= 1;
+        bitCount++;
+      }
+    }
+    bitCount <<= kNumBitPriceShiftBits;
+    range -= (1 << 31);
+    for (int k = kNumBitPriceShiftBits - 1; k >= 0; k--)
+    {
+      range <<= 1;
+      if (range > (1 << 31))
+      {
+        bitCount += (1 << k);
+        range -= (1 << 31);
+      }
+    }
+    ProbPrices[i] = (bitCount 
+      // + (1 << (kCyclesBits - 1))
+      ) >> kCyclesBits;
+  }
+  */
+}
+
+}}

payloads/bayou/util/pbuilder/lzma/C/7zip/Compress/RangeCoder/RangeCoderBit.h

@@ -0,0 +1,120 @@
+// Compress/RangeCoder/RangeCoderBit.h
+
+#ifndef __COMPRESS_RANGECODER_BIT_H
+#define __COMPRESS_RANGECODER_BIT_H
+
+#include "RangeCoder.h"
+
+namespace NCompress {
+namespace NRangeCoder {
+
+const int kNumBitModelTotalBits  = 11;
+const UInt32 kBitModelTotal = (1 << kNumBitModelTotalBits);
+
+const int kNumMoveReducingBits = 2;
+
+const int kNumBitPriceShiftBits = 6;
+const UInt32 kBitPrice = 1 << kNumBitPriceShiftBits;
+
+class CPriceTables
+{
+public:
+  static UInt32 ProbPrices[kBitModelTotal >> kNumMoveReducingBits];
+  static void Init();
+  CPriceTables();
+};
+
+template <int numMoveBits>
+class CBitModel
+{
+public:
+  UInt32 Prob;
+  void UpdateModel(UInt32 symbol)
+  {
+    /*
+    Prob -= (Prob + ((symbol - 1) & ((1 << numMoveBits) - 1))) >> numMoveBits;
+    Prob += (1 - symbol) << (kNumBitModelTotalBits - numMoveBits);
+    */
+    if (symbol == 0)
+      Prob += (kBitModelTotal - Prob) >> numMoveBits;
+    else
+      Prob -= (Prob) >> numMoveBits;
+  }
+public:
+  void Init() { Prob = kBitModelTotal / 2; }
+};
+
+template <int numMoveBits>
+class CBitEncoder: public CBitModel<numMoveBits>
+{
+public:
+  void Encode(CEncoder *encoder, UInt32 symbol)
+  {
+    /*
+    encoder->EncodeBit(this->Prob, kNumBitModelTotalBits, symbol);
+    this->UpdateModel(symbol);
+    */
+    UInt32 newBound = (encoder->Range >> kNumBitModelTotalBits) * this->Prob;
+    if (symbol == 0)
+    {
+      encoder->Range = newBound;
+      this->Prob += (kBitModelTotal - this->Prob) >> numMoveBits;
+    }
+    else
+    {
+      encoder->Low += newBound;
+      encoder->Range -= newBound;
+      this->Prob -= (this->Prob) >> numMoveBits;
+    }
+    if (encoder->Range < kTopValue)
+    {
+      encoder->Range <<= 8;
+      encoder->ShiftLow();
+    }
+  }
+  UInt32 GetPrice(UInt32 symbol) const
+  {
+    return CPriceTables::ProbPrices[
+      (((this->Prob - symbol) ^ ((-(int)symbol))) & (kBitModelTotal - 1)) >> kNumMoveReducingBits];
+  }
+  UInt32 GetPrice0() const { return CPriceTables::ProbPrices[this->Prob >> kNumMoveReducingBits]; }
+  UInt32 GetPrice1() const { return CPriceTables::ProbPrices[(kBitModelTotal - this->Prob) >> kNumMoveReducingBits]; }
+};
+
+
+template <int numMoveBits>
+class CBitDecoder: public CBitModel<numMoveBits>
+{
+public:
+  UInt32 Decode(CDecoder *decoder)
+  {
+    UInt32 newBound = (decoder->Range >> kNumBitModelTotalBits) * this->Prob;
+    if (decoder->Code < newBound)
+    {
+      decoder->Range = newBound;
+      this->Prob += (kBitModelTotal - this->Prob) >> numMoveBits;
+      if (decoder->Range < kTopValue)
+      {
+        decoder->Code = (decoder->Code << 8) | decoder->Stream.ReadByte();
+        decoder->Range <<= 8;
+      }
+      return 0;
+    }
+    else
+    {
+      decoder->Range -= newBound;
+      decoder->Code -= newBound;
+      this->Prob -= (this->Prob) >> numMoveBits;
+      if (decoder->Range < kTopValue)
+      {
+        decoder->Code = (decoder->Code << 8) | decoder->Stream.ReadByte();
+        decoder->Range <<= 8;
+      }
+      return 1;
+    }
+  }
+};
+
+}}
+
+#endif

payloads/bayou/util/pbuilder/lzma/C/7zip/Compress/RangeCoder/RangeCoderBitTree.h

@@ -0,0 +1,161 @@
+// Compress/RangeCoder/RangeCoderBitTree.h
+
+#ifndef __COMPRESS_RANGECODER_BIT_TREE_H
+#define __COMPRESS_RANGECODER_BIT_TREE_H
+
+#include "RangeCoderBit.h"
+#include "RangeCoderOpt.h"
+
+namespace NCompress {
+namespace NRangeCoder {
+
+template <int numMoveBits, int NumBitLevels>
+class CBitTreeEncoder
+{
+  CBitEncoder<numMoveBits> Models[1 << NumBitLevels];
+public:
+  void Init()
+  {
+    for(UInt32 i = 1; i < (1 << NumBitLevels); i++)
+      Models[i].Init();
+  }
+  void Encode(CEncoder *rangeEncoder, UInt32 symbol)
+  {
+    UInt32 modelIndex = 1;
+    for (int bitIndex = NumBitLevels; bitIndex != 0 ;)
+    {
+      bitIndex--;
+      UInt32 bit = (symbol >> bitIndex) & 1;
+      Models[modelIndex].Encode(rangeEncoder, bit);
+      modelIndex = (modelIndex << 1) | bit;
+    }
+  };
+  void ReverseEncode(CEncoder *rangeEncoder, UInt32 symbol)
+  {
+    UInt32 modelIndex = 1;
+    for (int i = 0; i < NumBitLevels; i++)
+    {
+      UInt32 bit = symbol & 1;
+      Models[modelIndex].Encode(rangeEncoder, bit);
+      modelIndex = (modelIndex << 1) | bit;
+      symbol >>= 1;
+    }
+  }
+  UInt32 GetPrice(UInt32 symbol) const
+  {
+    symbol |= (1 << NumBitLevels);
+    UInt32 price = 0;
+    while (symbol != 1)
+    {
+      price += Models[symbol >> 1].GetPrice(symbol & 1);
+      symbol >>= 1;
+    }
+    return price;
+  }
+  UInt32 ReverseGetPrice(UInt32 symbol) const
+  {
+    UInt32 price = 0;
+    UInt32 modelIndex = 1;
+    for (int i = NumBitLevels; i != 0; i--)
+    {
+      UInt32 bit = symbol & 1;
+      symbol >>= 1;
+      price += Models[modelIndex].GetPrice(bit);
+      modelIndex = (modelIndex << 1) | bit;
+    }
+    return price;
+  }
+};
+
+template <int numMoveBits, int NumBitLevels>
+class CBitTreeDecoder
+{
+  CBitDecoder<numMoveBits> Models[1 << NumBitLevels];
+public:
+  void Init()
+  {
+    for(UInt32 i = 1; i < (1 << NumBitLevels); i++)
+      Models[i].Init();
+  }
+  UInt32 Decode(CDecoder *rangeDecoder)
+  {
+    UInt32 modelIndex = 1;
+    RC_INIT_VAR
+    for(int bitIndex = NumBitLevels; bitIndex != 0; bitIndex--)
+    {
+      // modelIndex = (modelIndex << 1) + Models[modelIndex].Decode(rangeDecoder);
+      RC_GETBIT(numMoveBits, Models[modelIndex].Prob, modelIndex)
+    }
+    RC_FLUSH_VAR
+    return modelIndex - (1 << NumBitLevels);
+  };
+  UInt32 ReverseDecode(CDecoder *rangeDecoder)
+  {
+    UInt32 modelIndex = 1;
+    UInt32 symbol = 0;
+    RC_INIT_VAR
+    for(int bitIndex = 0; bitIndex < NumBitLevels; bitIndex++)
+    {
+      // UInt32 bit = Models[modelIndex].Decode(rangeDecoder);
+      // modelIndex <<= 1;
+      // modelIndex += bit;
+      // symbol |= (bit << bitIndex);
+      RC_GETBIT2(numMoveBits, Models[modelIndex].Prob, modelIndex, ; , symbol |= (1 << bitIndex))
+    }
+    RC_FLUSH_VAR
+    return symbol;
+  }
+};
+
+template <int numMoveBits>
+void ReverseBitTreeEncode(CBitEncoder<numMoveBits> *Models, 
+    CEncoder *rangeEncoder, int NumBitLevels, UInt32 symbol)
+{
+  UInt32 modelIndex = 1;
+  for (int i = 0; i < NumBitLevels; i++)
+  {
+    UInt32 bit = symbol & 1;
+    Models[modelIndex].Encode(rangeEncoder, bit);
+    modelIndex = (modelIndex << 1) | bit;
+    symbol >>= 1;
+  }
+}
+
+template <int numMoveBits>
+UInt32 ReverseBitTreeGetPrice(CBitEncoder<numMoveBits> *Models, 
+    UInt32 NumBitLevels, UInt32 symbol)
+{
+  UInt32 price = 0;
+  UInt32 modelIndex = 1;
+  for (int i = NumBitLevels; i != 0; i--)
+  {
+    UInt32 bit = symbol & 1;
+    symbol >>= 1;
+    price += Models[modelIndex].GetPrice(bit);
+    modelIndex = (modelIndex << 1) | bit;
+  }
+  return price;
+}
+
+template <int numMoveBits>
+UInt32 ReverseBitTreeDecode(CBitDecoder<numMoveBits> *Models, 
+    CDecoder *rangeDecoder, int NumBitLevels)
+{
+  UInt32 modelIndex = 1;
+  UInt32 symbol = 0;
+  RC_INIT_VAR
+  for(int bitIndex = 0; bitIndex < NumBitLevels; bitIndex++)
+  {
+    // UInt32 bit = Models[modelIndex].Decode(rangeDecoder);
+    // modelIndex <<= 1;
+    // modelIndex += bit;
+    // symbol |= (bit << bitIndex);
+    RC_GETBIT2(numMoveBits, Models[modelIndex].Prob, modelIndex, ; , symbol |= (1 << bitIndex))
+  }
+  RC_FLUSH_VAR
+  return symbol;
+}
+
+}}
+
+#endif

payloads/bayou/util/pbuilder/lzma/C/7zip/Compress/RangeCoder/RangeCoderOpt.h

@@ -0,0 +1,31 @@
+// Compress/RangeCoder/RangeCoderOpt.h
+
+#ifndef __COMPRESS_RANGECODER_OPT_H
+#define __COMPRESS_RANGECODER_OPT_H
+
+#define RC_INIT_VAR \
+  UInt32 range = rangeDecoder->Range; \
+  UInt32 code = rangeDecoder->Code;        
+
+#define RC_FLUSH_VAR \
+  rangeDecoder->Range = range; \
+  rangeDecoder->Code = code;
+
+#define RC_NORMALIZE \
+  if (range < NCompress::NRangeCoder::kTopValue) \
+    { code = (code << 8) | rangeDecoder->Stream.ReadByte(); range <<= 8; }
+
+#define RC_GETBIT2(numMoveBits, prob, mi, A0, A1) \
+  { UInt32 bound = (range >> NCompress::NRangeCoder::kNumBitModelTotalBits) * prob; \
+  if (code < bound) \
+  { A0; range = bound; \
+    prob += (NCompress::NRangeCoder::kBitModelTotal - prob) >> numMoveBits; \
+    mi <<= 1; } \
+  else \
+  { A1; range -= bound; code -= bound; prob -= (prob) >> numMoveBits; \
+    mi = (mi + mi) + 1; }} \
+  RC_NORMALIZE
+
+#define RC_GETBIT(numMoveBits, prob, mi) RC_GETBIT2(numMoveBits, prob, mi, ; , ;)
+
+#endif

payloads/bayou/util/pbuilder/lzma/C/7zip/Compress/RangeCoder/StdAfx.h

@@ -0,0 +1,6 @@
+// StdAfx.h
+
+#ifndef __STDAFX_H
+#define __STDAFX_H
+
+#endif

payloads/bayou/util/pbuilder/lzma/C/7zip/Decompress/LzmaDecode.c

@@ -0,0 +1,588 @@
+/*
+  LzmaDecode.c
+  LZMA Decoder (optimized for Speed version)
+  
+  LZMA SDK 4.22 Copyright (c) 1999-2005 Igor Pavlov (2005-06-10)
+  http://www.7-zip.org/
+
+  LZMA SDK is licensed under two licenses:
+  1) GNU Lesser General Public License (GNU LGPL)
+  2) Common Public License (CPL)
+  It means that you can select one of these two licenses and 
+  follow rules of that license.
+
+  SPECIAL EXCEPTION:
+  Igor Pavlov, as the author of this Code, expressly permits you to 
+  statically or dynamically link your Code (or bind by name) to the 
+  interfaces of this file without subjecting your linked Code to the 
+  terms of the CPL or GNU LGPL. Any modifications or additions 
+  to this file, however, are subject to the LGPL or CPL terms.
+*/
+
+#include "LzmaDecode.h"
+
+#ifndef Byte
+#define Byte unsigned char
+#endif
+
+#define kNumTopBits 24
+#define kTopValue ((UInt32)1 << kNumTopBits)
+
+#define kNumBitModelTotalBits 11
+#define kBitModelTotal (1 << kNumBitModelTotalBits)
+#define kNumMoveBits 5
+
+#define RC_READ_BYTE (*Buffer++)
+
+#define RC_INIT2 Code = 0; Range = 0xFFFFFFFF; \
+  { int i; for(i = 0; i < 5; i++) { RC_TEST; Code = (Code << 8) | RC_READ_BYTE; }}
+
+#ifdef _LZMA_IN_CB
+
+#define RC_TEST { if (Buffer == BufferLim) \
+  { SizeT size; int result = InCallback->Read(InCallback, &Buffer, &size); if (result != LZMA_RESULT_OK) return result; \
+  BufferLim = Buffer + size; if (size == 0) return LZMA_RESULT_DATA_ERROR; }}
+
+#define RC_INIT Buffer = BufferLim = 0; RC_INIT2
+
+#else
+
+#define RC_TEST { if (Buffer == BufferLim) return LZMA_RESULT_DATA_ERROR; }
+
+#define RC_INIT(buffer, bufferSize) Buffer = buffer; BufferLim = buffer + bufferSize; RC_INIT2
+ 
+#endif
+
+#define RC_NORMALIZE if (Range < kTopValue) { RC_TEST; Range <<= 8; Code = (Code << 8) | RC_READ_BYTE; }
+
+#define IfBit0(p) RC_NORMALIZE; bound = (Range >> kNumBitModelTotalBits) * *(p); if (Code < bound)
+#define UpdateBit0(p) Range = bound; *(p) += (kBitModelTotal - *(p)) >> kNumMoveBits;
+#define UpdateBit1(p) Range -= bound; Code -= bound; *(p) -= (*(p)) >> kNumMoveBits;
+
+#define RC_GET_BIT2(p, mi, A0, A1) IfBit0(p) \
+  { UpdateBit0(p); mi <<= 1; A0; } else \
+  { UpdateBit1(p); mi = (mi + mi) + 1; A1; } 
+  
+#define RC_GET_BIT(p, mi) RC_GET_BIT2(p, mi, ; , ;)               
+
+#define RangeDecoderBitTreeDecode(probs, numLevels, res) \
+  { int i = numLevels; res = 1; \
+  do { CProb *p = probs + res; RC_GET_BIT(p, res) } while(--i != 0); \
+  res -= (1 << numLevels); }
+
+
+#define kNumPosBitsMax 4
+#define kNumPosStatesMax (1 << kNumPosBitsMax)
+
+#define kLenNumLowBits 3
+#define kLenNumLowSymbols (1 << kLenNumLowBits)
+#define kLenNumMidBits 3
+#define kLenNumMidSymbols (1 << kLenNumMidBits)
+#define kLenNumHighBits 8
+#define kLenNumHighSymbols (1 << kLenNumHighBits)
+
+#define LenChoice 0
+#define LenChoice2 (LenChoice + 1)
+#define LenLow (LenChoice2 + 1)
+#define LenMid (LenLow + (kNumPosStatesMax << kLenNumLowBits))
+#define LenHigh (LenMid + (kNumPosStatesMax << kLenNumMidBits))
+#define kNumLenProbs (LenHigh + kLenNumHighSymbols) 
+
+
+#define kNumStates 12
+#define kNumLitStates 7
+
+#define kStartPosModelIndex 4
+#define kEndPosModelIndex 14
+#define kNumFullDistances (1 << (kEndPosModelIndex >> 1))
+
+#define kNumPosSlotBits 6
+#define kNumLenToPosStates 4
+
+#define kNumAlignBits 4
+#define kAlignTableSize (1 << kNumAlignBits)
+
+#define kMatchMinLen 2
+
+#define IsMatch 0
+#define IsRep (IsMatch + (kNumStates << kNumPosBitsMax))
+#define IsRepG0 (IsRep + kNumStates)
+#define IsRepG1 (IsRepG0 + kNumStates)
+#define IsRepG2 (IsRepG1 + kNumStates)
+#define IsRep0Long (IsRepG2 + kNumStates)
+#define PosSlot (IsRep0Long + (kNumStates << kNumPosBitsMax))
+#define SpecPos (PosSlot + (kNumLenToPosStates << kNumPosSlotBits))
+#define Align (SpecPos + kNumFullDistances - kEndPosModelIndex)
+#define LenCoder (Align + kAlignTableSize)
+#define RepLenCoder (LenCoder + kNumLenProbs)
+#define Literal (RepLenCoder + kNumLenProbs)
+
+#if Literal != LZMA_BASE_SIZE
+StopCompilingDueBUG
+#endif
+
+int LzmaDecodeProperties(CLzmaProperties *propsRes, const unsigned char *propsData, int size)
+{
+  unsigned char prop0;
+  if (size < LZMA_PROPERTIES_SIZE)
+    return LZMA_RESULT_DATA_ERROR;
+  prop0 = propsData[0];
+  if (prop0 >= (9 * 5 * 5))
+    return LZMA_RESULT_DATA_ERROR;
+  {
+    for (propsRes->pb = 0; prop0 >= (9 * 5); propsRes->pb++, prop0 -= (9 * 5));
+    for (propsRes->lp = 0; prop0 >= 9; propsRes->lp++, prop0 -= 9);
+    propsRes->lc = prop0;
+    /*
+    unsigned char remainder = (unsigned char)(prop0 / 9);
+    propsRes->lc = prop0 % 9;
+    propsRes->pb = remainder / 5;
+    propsRes->lp = remainder % 5;
+    */
+  }
+
+  #ifdef _LZMA_OUT_READ
+  {
+    int i;
+    propsRes->DictionarySize = 0;
+    for (i = 0; i < 4; i++)
+      propsRes->DictionarySize += (UInt32)(propsData[1 + i]) << (i * 8);
+    if (propsRes->DictionarySize == 0)
+      propsRes->DictionarySize = 1;
+  }
+  #endif
+  return LZMA_RESULT_OK;
+}
+
+#define kLzmaStreamWasFinishedId (-1)
+
+int LzmaDecode(CLzmaDecoderState *vs,
+    #ifdef _LZMA_IN_CB
+    ILzmaInCallback *InCallback,
+    #else
+    const unsigned char *inStream, SizeT inSize, SizeT *inSizeProcessed,
+    #endif
+    unsigned char *outStream, SizeT outSize, SizeT *outSizeProcessed)
+{
+  CProb *p = vs->Probs;
+  SizeT nowPos = 0;
+  Byte previousByte = 0;
+  UInt32 posStateMask = (1 << (vs->Properties.pb)) - 1;
+  UInt32 literalPosMask = (1 << (vs->Properties.lp)) - 1;
+  int lc = vs->Properties.lc;
+
+  #ifdef _LZMA_OUT_READ
+  
+  UInt32 Range = vs->Range;
+  UInt32 Code = vs->Code;
+  #ifdef _LZMA_IN_CB
+  const Byte *Buffer = vs->Buffer;
+  const Byte *BufferLim = vs->BufferLim;
+  #else
+  const Byte *Buffer = inStream;
+  const Byte *BufferLim = inStream + inSize;
+  #endif
+  int state = vs->State;
+  UInt32 rep0 = vs->Reps[0], rep1 = vs->Reps[1], rep2 = vs->Reps[2], rep3 = vs->Reps[3];
+  int len = vs->RemainLen;
+  UInt32 globalPos = vs->GlobalPos;
+  UInt32 distanceLimit = vs->DistanceLimit;
+
+  Byte *dictionary = vs->Dictionary;
+  UInt32 dictionarySize = vs->Properties.DictionarySize;
+  UInt32 dictionaryPos = vs->DictionaryPos;
+
+  Byte tempDictionary[4];
+
+  #ifndef _LZMA_IN_CB
+  *inSizeProcessed = 0;
+  #endif
+  *outSizeProcessed = 0;
+  if (len == kLzmaStreamWasFinishedId)
+    return LZMA_RESULT_OK;
+
+  if (dictionarySize == 0)
+  {
+    dictionary = tempDictionary;
+    dictionarySize = 1;
+    tempDictionary[0] = vs->TempDictionary[0];
+  }
+
+  if (len == kLzmaNeedInitId)
+  {
+    {
+      UInt32 numProbs = Literal + ((UInt32)LZMA_LIT_SIZE << (lc + vs->Properties.lp));
+      UInt32 i;
+      for (i = 0; i < numProbs; i++)
+        p[i] = kBitModelTotal >> 1; 
+      rep0 = rep1 = rep2 = rep3 = 1;
+      state = 0;
+      globalPos = 0;
+      distanceLimit = 0;
+      dictionaryPos = 0;
+      dictionary[dictionarySize - 1] = 0;
+      #ifdef _LZMA_IN_CB
+      RC_INIT;
+      #else
+      RC_INIT(inStream, inSize);
+      #endif
+    }
+    len = 0;
+  }
+  while(len != 0 && nowPos < outSize)
+  {
+    UInt32 pos = dictionaryPos - rep0;
+    if (pos >= dictionarySize)
+      pos += dictionarySize;
+    outStream[nowPos++] = dictionary[dictionaryPos] = dictionary[pos];
+    if (++dictionaryPos == dictionarySize)
+      dictionaryPos = 0;
+    len--;
+  }
+  if (dictionaryPos == 0)
+    previousByte = dictionary[dictionarySize - 1];
+  else
+    previousByte = dictionary[dictionaryPos - 1];
+
+  #else /* if !_LZMA_OUT_READ */
+
+  int state = 0;
+  UInt32 rep0 = 1, rep1 = 1, rep2 = 1, rep3 = 1;
+  int len = 0;
+  const Byte *Buffer;
+  const Byte *BufferLim;
+  UInt32 Range;
+  UInt32 Code;
+
+  #ifndef _LZMA_IN_CB
+  *inSizeProcessed = 0;
+  #endif
+  *outSizeProcessed = 0;
+
+  {
+    UInt32 i;
+    UInt32 numProbs = Literal + ((UInt32)LZMA_LIT_SIZE << (lc + vs->Properties.lp));
+    for (i = 0; i < numProbs; i++)
+      p[i] = kBitModelTotal >> 1;
+  }
+  
+  #ifdef _LZMA_IN_CB
+  RC_INIT;
+  #else
+  RC_INIT(inStream, inSize);
+  #endif
+
+  #endif /* _LZMA_OUT_READ */
+
+  while(nowPos < outSize)
+  {
+    CProb *prob;
+    UInt32 bound;
+    int posState = (int)(
+        (nowPos 
+        #ifdef _LZMA_OUT_READ
+        + globalPos
+        #endif
+        )
+        & posStateMask);
+
+    prob = p + IsMatch + (state << kNumPosBitsMax) + posState;
+    IfBit0(prob)
+    {
+      int symbol = 1;
+      UpdateBit0(prob)
+      prob = p + Literal + (LZMA_LIT_SIZE * 
+        (((
+        (nowPos 
+        #ifdef _LZMA_OUT_READ
+        + globalPos
+        #endif
+        )
+        & literalPosMask) << lc) + (previousByte >> (8 - lc))));
+
+      if (state >= kNumLitStates)
+      {
+        int matchByte;
+        #ifdef _LZMA_OUT_READ
+        UInt32 pos = dictionaryPos - rep0;
+        if (pos >= dictionarySize)
+          pos += dictionarySize;
+        matchByte = dictionary[pos];
+        #else
+        matchByte = outStream[nowPos - rep0];
+        #endif
+        do
+        {
+          int bit;
+          CProb *probLit;
+          matchByte <<= 1;
+          bit = (matchByte & 0x100);
+          probLit = prob + 0x100 + bit + symbol;
+          RC_GET_BIT2(probLit, symbol, if (bit != 0) break, if (bit == 0) break)
+        }
+        while (symbol < 0x100);
+      }
+      while (symbol < 0x100)
+      {
+        CProb *probLit = prob + symbol;
+        RC_GET_BIT(probLit, symbol)
+      }
+      previousByte = (Byte)symbol;
+
+      outStream[nowPos++] = previousByte;
+      #ifdef _LZMA_OUT_READ
+      if (distanceLimit < dictionarySize)
+        distanceLimit++;
+
+      dictionary[dictionaryPos] = previousByte;
+      if (++dictionaryPos == dictionarySize)
+        dictionaryPos = 0;
+      #endif
+      if (state < 4) state = 0;
+      else if (state < 10) state -= 3;
+      else state -= 6;
+    }
+    else             
+    {
+      UpdateBit1(prob);
+      prob = p + IsRep + state;
+      IfBit0(prob)
+      {
+        UpdateBit0(prob);
+        rep3 = rep2;
+        rep2 = rep1;
+        rep1 = rep0;
+        state = state < kNumLitStates ? 0 : 3;
+        prob = p + LenCoder;
+      }
+      else
+      {
+        UpdateBit1(prob);
+        prob = p + IsRepG0 + state;
+        IfBit0(prob)
+        {
+          UpdateBit0(prob);
+          prob = p + IsRep0Long + (state << kNumPosBitsMax) + posState;
+          IfBit0(prob)
+          {
+            #ifdef _LZMA_OUT_READ
+            UInt32 pos;
+            #endif
+            UpdateBit0(prob);
+            
+            #ifdef _LZMA_OUT_READ
+            if (distanceLimit == 0)
+            #else
+            if (nowPos == 0)
+            #endif
+              return LZMA_RESULT_DATA_ERROR;
+            
+            state = state < kNumLitStates ? 9 : 11;
+            #ifdef _LZMA_OUT_READ
+            pos = dictionaryPos - rep0;
+            if (pos >= dictionarySize)
+              pos += dictionarySize;
+            previousByte = dictionary[pos];
+            dictionary[dictionaryPos] = previousByte;
+            if (++dictionaryPos == dictionarySize)
+              dictionaryPos = 0;
+            #else
+            previousByte = outStream[nowPos - rep0];
+            #endif
+            outStream[nowPos++] = previousByte;
+            #ifdef _LZMA_OUT_READ
+            if (distanceLimit < dictionarySize)
+              distanceLimit++;
+            #endif
+
+            continue;
+          }
+          else
+          {
+            UpdateBit1(prob);
+          }
+        }
+        else
+        {
+          UInt32 distance;
+          UpdateBit1(prob);
+          prob = p + IsRepG1 + state;
+          IfBit0(prob)
+          {
+            UpdateBit0(prob);
+            distance = rep1;
+          }
+          else 
+          {
+            UpdateBit1(prob);
+            prob = p + IsRepG2 + state;
+            IfBit0(prob)
+            {
+              UpdateBit0(prob);
+              distance = rep2;
+            }
+            else
+            {
+              UpdateBit1(prob);
+              distance = rep3;
+              rep3 = rep2;
+            }
+            rep2 = rep1;
+          }
+          rep1 = rep0;
+          rep0 = distance;
+        }
+        state = state < kNumLitStates ? 8 : 11;
+        prob = p + RepLenCoder;
+      }
+      {
+        int numBits, offset;
+        CProb *probLen = prob + LenChoice;
+        IfBit0(probLen)
+        {
+          UpdateBit0(probLen);
+          probLen = prob + LenLow + (posState << kLenNumLowBits);
+          offset = 0;
+          numBits = kLenNumLowBits;
+        }
+        else
+        {
+          UpdateBit1(probLen);
+          probLen = prob + LenChoice2;
+          IfBit0(probLen)
+          {
+            UpdateBit0(probLen);
+            probLen = prob + LenMid + (posState << kLenNumMidBits);
+            offset = kLenNumLowSymbols;
+            numBits = kLenNumMidBits;
+          }
+          else
+          {
+            UpdateBit1(probLen);
+            probLen = prob + LenHigh;
+            offset = kLenNumLowSymbols + kLenNumMidSymbols;
+            numBits = kLenNumHighBits;
+          }
+        }
+        RangeDecoderBitTreeDecode(probLen, numBits, len);
+        len += offset;
+      }
+
+      if (state < 4)
+      {
+        int posSlot;
+        state += kNumLitStates;
+        prob = p + PosSlot +
+            ((len < kNumLenToPosStates ? len : kNumLenToPosStates - 1) << 
+            kNumPosSlotBits);
+        RangeDecoderBitTreeDecode(prob, kNumPosSlotBits, posSlot);
+        if (posSlot >= kStartPosModelIndex)
+        {
+          int numDirectBits = ((posSlot >> 1) - 1);
+          rep0 = (2 | ((UInt32)posSlot & 1));
+          if (posSlot < kEndPosModelIndex)
+          {
+            rep0 <<= numDirectBits;
+            prob = p + SpecPos + rep0 - posSlot - 1;
+          }
+          else
+          {
+            numDirectBits -= kNumAlignBits;
+            do
+            {
+              RC_NORMALIZE
+              Range >>= 1;
+              rep0 <<= 1;
+              if (Code >= Range)
+              {
+                Code -= Range;
+                rep0 |= 1;
+              }
+            }
+            while (--numDirectBits != 0);
+            prob = p + Align;
+            rep0 <<= kNumAlignBits;
+            numDirectBits = kNumAlignBits;
+          }
+          {
+            int i = 1;
+            int mi = 1;
+            do
+            {
+              CProb *prob3 = prob + mi;
+              RC_GET_BIT2(prob3, mi, ; , rep0 |= i);
+              i <<= 1;
+            }
+            while(--numDirectBits != 0);
+          }
+        }
+        else
+          rep0 = posSlot;
+        if (++rep0 == (UInt32)(0))
+        {
+          /* it's for stream version */
+          len = kLzmaStreamWasFinishedId;
+          break;
+        }
+      }
+
+      len += kMatchMinLen;
+      #ifdef _LZMA_OUT_READ
+      if (rep0 > distanceLimit) 
+      #else
+      if (rep0 > nowPos)
+      #endif
+        return LZMA_RESULT_DATA_ERROR;
+
+      #ifdef _LZMA_OUT_READ
+      if (dictionarySize - distanceLimit > (UInt32)len)
+        distanceLimit += len;
+      else
+        distanceLimit = dictionarySize;
+      #endif
+
+      do
+      {
+        #ifdef _LZMA_OUT_READ
+        UInt32 pos = dictionaryPos - rep0;
+        if (pos >= dictionarySize)
+          pos += dictionarySize;
+        previousByte = dictionary[pos];
+        dictionary[dictionaryPos] = previousByte;
+        if (++dictionaryPos == dictionarySize)
+          dictionaryPos = 0;
+        #else
+        previousByte = outStream[nowPos - rep0];
+        #endif
+        len--;
+        outStream[nowPos++] = previousByte;
+      }
+      while(len != 0 && nowPos < outSize);
+    }
+  }
+  RC_NORMALIZE;
+
+  #ifdef _LZMA_OUT_READ
+  vs->Range = Range;
+  vs->Code = Code;
+  vs->DictionaryPos = dictionaryPos;
+  vs->GlobalPos = globalPos + (UInt32)nowPos;
+  vs->DistanceLimit = distanceLimit;
+  vs->Reps[0] = rep0;
+  vs->Reps[1] = rep1;
+  vs->Reps[2] = rep2;
+  vs->Reps[3] = rep3;
+  vs->State = state;
+  vs->RemainLen = len;
+  vs->TempDictionary[0] = tempDictionary[0];
+  #endif
+
+  #ifdef _LZMA_IN_CB
+  vs->Buffer = Buffer;
+  vs->BufferLim = BufferLim;
+  #else
+  *inSizeProcessed = (SizeT)(Buffer - inStream);
+  #endif
+  *outSizeProcessed = nowPos;
+  return LZMA_RESULT_OK;
+}

payloads/bayou/util/pbuilder/lzma/C/7zip/Decompress/LzmaDecode.h

@@ -0,0 +1,131 @@
+/* 
+  LzmaDecode.h
+  LZMA Decoder interface
+
+  LZMA SDK 4.21 Copyright (c) 1999-2005 Igor Pavlov (2005-06-08)
+  http://www.7-zip.org/
+
+  LZMA SDK is licensed under two licenses:
+  1) GNU Lesser General Public License (GNU LGPL)
+  2) Common Public License (CPL)
+  It means that you can select one of these two licenses and 
+  follow rules of that license.
+
+  SPECIAL EXCEPTION:
+  Igor Pavlov, as the author of this code, expressly permits you to 
+  statically or dynamically link your code (or bind by name) to the 
+  interfaces of this file without subjecting your linked code to the 
+  terms of the CPL or GNU LGPL. Any modifications or additions 
+  to this file, however, are subject to the LGPL or CPL terms.
+*/
+
+#ifndef __LZMADECODE_H
+#define __LZMADECODE_H
+
+/* #define _LZMA_IN_CB */
+/* Use callback for input data */
+
+/* #define _LZMA_OUT_READ */
+/* Use read function for output data */
+
+/* #define _LZMA_PROB32 */
+/* It can increase speed on some 32-bit CPUs, 
+   but memory usage will be doubled in that case */
+
+/* #define _LZMA_LOC_OPT */
+/* Enable local speed optimizations inside code */
+
+/* #define _LZMA_SYSTEM_SIZE_T */
+/* Use system's size_t. You can use it to enable 64-bit sizes supporting*/
+
+#ifndef UInt32
+#ifdef _LZMA_UINT32_IS_ULONG
+#define UInt32 unsigned long
+#else
+#define UInt32 unsigned int
+#endif
+#endif
+
+#ifndef SizeT
+#ifdef _LZMA_SYSTEM_SIZE_T
+#include <stddef.h>
+#define SizeT size_t
+#else
+#define SizeT UInt32
+#endif
+#endif
+
+#ifdef _LZMA_PROB32
+#define CProb UInt32
+#else
+#define CProb unsigned short
+#endif
+
+#define LZMA_RESULT_OK 0
+#define LZMA_RESULT_DATA_ERROR 1
+
+#ifdef _LZMA_IN_CB
+typedef struct _ILzmaInCallback
+{
+  int (*Read)(void *object, const unsigned char **buffer, SizeT *bufferSize);
+} ILzmaInCallback;
+#endif
+
+#define LZMA_BASE_SIZE 1846
+#define LZMA_LIT_SIZE 768
+
+#define LZMA_PROPERTIES_SIZE 5
+
+typedef struct _CLzmaProperties
+{
+  int lc;
+  int lp;
+  int pb;
+  #ifdef _LZMA_OUT_READ
+  UInt32 DictionarySize;
+  #endif
+}CLzmaProperties;
+
+int LzmaDecodeProperties(CLzmaProperties *propsRes, const unsigned char *propsData, int size);
+
+#define LzmaGetNumProbs(Properties) (LZMA_BASE_SIZE + (LZMA_LIT_SIZE << ((Properties)->lc + (Properties)->lp)))
+
+#define kLzmaNeedInitId (-2)
+
+typedef struct _CLzmaDecoderState
+{
+  CLzmaProperties Properties;
+  CProb *Probs;
+
+  #ifdef _LZMA_IN_CB
+  const unsigned char *Buffer;
+  const unsigned char *BufferLim;
+  #endif
+
+  #ifdef _LZMA_OUT_READ
+  unsigned char *Dictionary;
+  UInt32 Range;
+  UInt32 Code;
+  UInt32 DictionaryPos;
+  UInt32 GlobalPos;
+  UInt32 DistanceLimit;
+  UInt32 Reps[4];
+  int State;
+  int RemainLen;
+  unsigned char TempDictionary[4];
+  #endif
+} CLzmaDecoderState;
+
+#ifdef _LZMA_OUT_READ
+#define LzmaDecoderInit(vs) { (vs)->RemainLen = kLzmaNeedInitId; }
+#endif
+
+int LzmaDecode(CLzmaDecoderState *vs,
+    #ifdef _LZMA_IN_CB
+    ILzmaInCallback *inCallback,
+    #else
+    const unsigned char *inStream, SizeT inSize, SizeT *inSizeProcessed,
+    #endif
+    unsigned char *outStream, SizeT outSize, SizeT *outSizeProcessed);
+
+#endif

payloads/bayou/util/pbuilder/lzma/C/7zip/ICoder.h

@@ -0,0 +1,163 @@
+// ICoder.h
+
+#ifndef __ICODER_H
+#define __ICODER_H
+
+#include "IStream.h"
+
+// "23170F69-40C1-278A-0000-000400xx0000"
+#define CODER_INTERFACE(i, x) \
+DEFINE_GUID(IID_ ## i, \
+0x23170F69, 0x40C1, 0x278A, 0x00, 0x00, 0x00, 0x04, 0x00, x, 0x00, 0x00); \
+struct i: public IUnknown
+
+CODER_INTERFACE(ICompressProgressInfo, 0x04)
+{
+  STDMETHOD(SetRatioInfo)(const UInt64 *inSize, const UInt64 *outSize) PURE;
+};
+
+CODER_INTERFACE(ICompressCoder, 0x05)
+{
+  STDMETHOD(Code)(ISequentialInStream *inStream,
+      ISequentialOutStream *outStream, 
+      const UInt64 *inSize, 
+      const UInt64 *outSize,
+      ICompressProgressInfo *progress) PURE;
+};
+
+CODER_INTERFACE(ICompressCoder2, 0x18)
+{
+  STDMETHOD(Code)(ISequentialInStream **inStreams,
+      const UInt64 **inSizes, 
+      UInt32 numInStreams,
+      ISequentialOutStream **outStreams, 
+      const UInt64 **outSizes,
+      UInt32 numOutStreams,
+      ICompressProgressInfo *progress) PURE;
+};
+
+namespace NCoderPropID
+{
+  enum EEnum
+  {
+    kDictionarySize = 0x400,
+    kUsedMemorySize,
+    kOrder,
+    kPosStateBits = 0x440,
+    kLitContextBits,
+    kLitPosBits,
+    kNumFastBytes = 0x450,
+    kMatchFinder,
+    kMatchFinderCycles,
+    kNumPasses = 0x460, 
+    kAlgorithm = 0x470,
+    kMultiThread = 0x480,
+    kNumThreads,
+    kEndMarker = 0x490
+  };
+}
+
+CODER_INTERFACE(ICompressSetCoderProperties, 0x20)
+{
+  STDMETHOD(SetCoderProperties)(const PROPID *propIDs, 
+      const PROPVARIANT *properties, UInt32 numProperties) PURE;
+};
+
+/*
+CODER_INTERFACE(ICompressSetCoderProperties, 0x21)
+{
+  STDMETHOD(SetDecoderProperties)(ISequentialInStream *inStream) PURE;
+};
+*/
+
+CODER_INTERFACE(ICompressSetDecoderProperties2, 0x22)
+{
+  STDMETHOD(SetDecoderProperties2)(const Byte *data, UInt32 size) PURE;
+};
+
+CODER_INTERFACE(ICompressWriteCoderProperties, 0x23)
+{
+  STDMETHOD(WriteCoderProperties)(ISequentialOutStream *outStreams) PURE;
+};
+
+CODER_INTERFACE(ICompressGetInStreamProcessedSize, 0x24)
+{
+  STDMETHOD(GetInStreamProcessedSize)(UInt64 *value) PURE;
+};
+
+CODER_INTERFACE(ICompressSetCoderMt, 0x25)
+{
+  STDMETHOD(SetNumberOfThreads)(UInt32 numThreads) PURE;
+};
+
+CODER_INTERFACE(ICompressGetSubStreamSize, 0x30)
+{
+  STDMETHOD(GetSubStreamSize)(UInt64 subStream, UInt64 *value) PURE;
+};
+
+CODER_INTERFACE(ICompressSetInStream, 0x31)
+{
+  STDMETHOD(SetInStream)(ISequentialInStream *inStream) PURE;
+  STDMETHOD(ReleaseInStream)() PURE;
+};
+
+CODER_INTERFACE(ICompressSetOutStream, 0x32)
+{
+  STDMETHOD(SetOutStream)(ISequentialOutStream *outStream) PURE;
+  STDMETHOD(ReleaseOutStream)() PURE;
+};
+
+CODER_INTERFACE(ICompressSetInStreamSize, 0x33)
+{
+  STDMETHOD(SetInStreamSize)(const UInt64 *inSize) PURE;
+};
+
+CODER_INTERFACE(ICompressSetOutStreamSize, 0x34)
+{
+  STDMETHOD(SetOutStreamSize)(const UInt64 *outSize) PURE;
+};
+
+CODER_INTERFACE(ICompressFilter, 0x40)
+{
+  STDMETHOD(Init)() PURE;
+  STDMETHOD_(UInt32, Filter)(Byte *data, UInt32 size) PURE;
+  // Filter return outSize (UInt32)
+  // if (outSize <= size): Filter have converted outSize bytes
+  // if (outSize > size): Filter have not converted anything.
+  //      and it needs at least outSize bytes to convert one block 
+  //      (it's for crypto block algorithms).
+};
+
+CODER_INTERFACE(ICryptoProperties, 0x80)
+{
+  STDMETHOD(SetKey)(const Byte *data, UInt32 size) PURE;
+  STDMETHOD(SetInitVector)(const Byte *data, UInt32 size) PURE;
+};
+
+CODER_INTERFACE(ICryptoSetPassword, 0x90)
+{
+  STDMETHOD(CryptoSetPassword)(const Byte *data, UInt32 size) PURE;
+};
+
+CODER_INTERFACE(ICryptoSetCRC, 0xA0)
+{
+  STDMETHOD(CryptoSetCRC)(UInt32 crc) PURE;
+};
+
+//////////////////////
+// It's for DLL file
+namespace NMethodPropID
+{
+  enum EEnum
+  {
+    kID,
+    kName,
+    kDecoder,
+    kEncoder,
+    kInStreams,
+    kOutStreams,
+    kDescription
+  };
+}
+
+#endif

payloads/bayou/util/pbuilder/lzma/C/7zip/IStream.h

@@ -0,0 +1,62 @@
+// IStream.h
+
+#ifndef __ISTREAM_H
+#define __ISTREAM_H
+
+#include "../Common/MyUnknown.h"
+#include "../Common/Types.h"
+
+// "23170F69-40C1-278A-0000-000300xx0000"
+
+#define STREAM_INTERFACE_SUB(i, b, x) \
+DEFINE_GUID(IID_ ## i, \
+0x23170F69, 0x40C1, 0x278A, 0x00, 0x00, 0x00, 0x03, 0x00, x, 0x00, 0x00); \
+struct i: public b
+
+#define STREAM_INTERFACE(i, x) STREAM_INTERFACE_SUB(i, IUnknown, x)
+
+STREAM_INTERFACE(ISequentialInStream, 0x01)
+{
+  STDMETHOD(Read)(void *data, UInt32 size, UInt32 *processedSize) PURE;
+  /*
+  Out: if size != 0, return_value = S_OK and (*processedSize == 0),
+    then there are no more bytes in stream.
+  if (size > 0) && there are bytes in stream, 
+  this function must read at least 1 byte.
+  This function is allowed to read less than number of remaining bytes in stream.
+  You must call Read function in loop, if you need exact amount of data
+  */
+};
+
+STREAM_INTERFACE(ISequentialOutStream, 0x02)
+{
+  STDMETHOD(Write)(const void *data, UInt32 size, UInt32 *processedSize) PURE;
+  /*
+  if (size > 0) this function must write at least 1 byte.
+  This function is allowed to write less than "size".
+  You must call Write function in loop, if you need to write exact amount of data
+  */
+};
+
+STREAM_INTERFACE_SUB(IInStream, ISequentialInStream, 0x03)
+{
+  STDMETHOD(Seek)(Int64 offset, UInt32 seekOrigin, UInt64 *newPosition) PURE;
+};
+
+STREAM_INTERFACE_SUB(IOutStream, ISequentialOutStream, 0x04)
+{
+  STDMETHOD(Seek)(Int64 offset, UInt32 seekOrigin, UInt64 *newPosition) PURE;
+  STDMETHOD(SetSize)(Int64 newSize) PURE;
+};
+
+STREAM_INTERFACE(IStreamGetSize, 0x06)
+{
+  STDMETHOD(GetSize)(UInt64 *size) PURE;
+};
+
+STREAM_INTERFACE(IOutStreamFlush, 0x07)
+{
+  STDMETHOD(Flush)() PURE;
+};
+
+#endif

payloads/bayou/util/pbuilder/lzma/C/Common/Alloc.cpp

@@ -0,0 +1,118 @@
+// Common/Alloc.cpp
+
+#include "StdAfx.h"
+
+#ifdef _WIN32
+#include "MyWindows.h"
+#else
+#include <stdlib.h>
+#endif
+
+#include "Alloc.h"
+
+/* #define _SZ_ALLOC_DEBUG */
+/* use _SZ_ALLOC_DEBUG to debug alloc/free operations */
+#ifdef _SZ_ALLOC_DEBUG
+#include <stdio.h>
+int g_allocCount = 0;
+int g_allocCountMid = 0;
+int g_allocCountBig = 0;
+#endif
+
+void *MyAlloc(size_t size) throw()
+{
+  if (size == 0)
+    return 0;
+  #ifdef _SZ_ALLOC_DEBUG
+  fprintf(stderr, "\nAlloc %10d bytes; count = %10d", size, g_allocCount++);
+  #endif
+  return ::malloc(size);
+}
+
+void MyFree(void *address) throw()
+{
+  #ifdef _SZ_ALLOC_DEBUG
+  if (address != 0)
+    fprintf(stderr, "\nFree; count = %10d", --g_allocCount);
+  #endif
+  
+  ::free(address);
+}
+
+#ifdef _WIN32
+
+void *MidAlloc(size_t size) throw()
+{
+  if (size == 0)
+    return 0;
+  #ifdef _SZ_ALLOC_DEBUG
+  fprintf(stderr, "\nAlloc_Mid %10d bytes;  count = %10d", size, g_allocCountMid++);
+  #endif
+  return ::VirtualAlloc(0, size, MEM_COMMIT, PAGE_READWRITE);
+}
+
+void MidFree(void *address) throw()
+{
+  #ifdef _SZ_ALLOC_DEBUG
+  if (address != 0)
+    fprintf(stderr, "\nFree_Mid; count = %10d", --g_allocCountMid);
+  #endif
+  if (address == 0)
+    return;
+  ::VirtualFree(address, 0, MEM_RELEASE);
+}
+
+static SIZE_T g_LargePageSize = 
+    #ifdef _WIN64
+    (1 << 21);
+    #else
+    (1 << 22);
+    #endif
+
+typedef SIZE_T (WINAPI *GetLargePageMinimumP)();
+
+bool SetLargePageSize()
+{
+  GetLargePageMinimumP largePageMinimum = (GetLargePageMinimumP)
+        ::GetProcAddress(::GetModuleHandle(TEXT("kernel32.dll")), "GetLargePageMinimum");
+  if (largePageMinimum == 0)
+    return false;
+  SIZE_T size = largePageMinimum();
+  if (size == 0 || (size & (size - 1)) != 0)
+    return false;
+  g_LargePageSize = size;
+  return true;
+}
+
+
+void *BigAlloc(size_t size) throw()
+{
+  if (size == 0)
+    return 0;
+  #ifdef _SZ_ALLOC_DEBUG
+  fprintf(stderr, "\nAlloc_Big %10d bytes;  count = %10d", size, g_allocCountBig++);
+  #endif
+  
+  if (size >= (1 << 18))
+  {
+    void *res = ::VirtualAlloc(0, (size + g_LargePageSize - 1) & (~(g_LargePageSize - 1)), 
+        MEM_COMMIT | MEM_LARGE_PAGES, PAGE_READWRITE);
+    if (res != 0)
+      return res;
+  }
+  return ::VirtualAlloc(0, size, MEM_COMMIT, PAGE_READWRITE);
+}
+
+void BigFree(void *address) throw()
+{
+  #ifdef _SZ_ALLOC_DEBUG
+  if (address != 0)
+    fprintf(stderr, "\nFree_Big; count = %10d", --g_allocCountBig);
+  #endif
+  
+  if (address == 0)
+    return;
+  ::VirtualFree(address, 0, MEM_RELEASE);
+}
+
+#endif

payloads/bayou/util/pbuilder/lzma/C/Common/Alloc.h

@@ -0,0 +1,29 @@
+// Common/Alloc.h
+
+#ifndef __COMMON_ALLOC_H
+#define __COMMON_ALLOC_H
+
+#include <stddef.h>
+
+void *MyAlloc(size_t size) throw();
+void MyFree(void *address) throw();
+
+#ifdef _WIN32
+
+bool SetLargePageSize();
+
+void *MidAlloc(size_t size) throw();
+void MidFree(void *address) throw();
+void *BigAlloc(size_t size) throw();
+void BigFree(void *address) throw();
+
+#else
+
+#define MidAlloc(size) MyAlloc(size)
+#define MidFree(address) MyFree(address)
+#define BigAlloc(size) MyAlloc(size)
+#define BigFree(address) MyFree(address)
+
+#endif
+
+#endif

payloads/bayou/util/pbuilder/lzma/C/Common/CRC.cpp

@@ -0,0 +1,61 @@
+// Common/CRC.cpp
+
+#include "StdAfx.h"
+
+#include "CRC.h"
+
+static const UInt32 kCRCPoly = 0xEDB88320;
+
+UInt32 CCRC::Table[256];
+
+void CCRC::InitTable()
+{
+  for (UInt32 i = 0; i < 256; i++)
+  {
+    UInt32 r = i;
+    for (int j = 0; j < 8; j++)
+      if (r & 1) 
+        r = (r >> 1) ^ kCRCPoly;
+      else     
+        r >>= 1;
+    CCRC::Table[i] = r;
+  }
+}
+
+class CCRCTableInit
+{
+public:
+  CCRCTableInit() { CCRC::InitTable(); }
+} g_CRCTableInit;
+
+void CCRC::UpdateByte(Byte b)
+{
+  _value = Table[((Byte)(_value)) ^ b] ^ (_value >> 8);
+}
+
+void CCRC::UpdateUInt16(UInt16 v)
+{
+  UpdateByte(Byte(v));
+  UpdateByte(Byte(v >> 8));
+}
+
+void CCRC::UpdateUInt32(UInt32 v)
+{
+  for (int i = 0; i < 4; i++)
+    UpdateByte((Byte)(v >> (8 * i)));
+}
+
+void CCRC::UpdateUInt64(UInt64 v)
+{
+  for (int i = 0; i < 8; i++)
+    UpdateByte((Byte)(v >> (8 * i)));
+}
+
+void CCRC::Update(const void *data, size_t size)
+{
+  UInt32 v = _value;
+  const Byte *p = (const Byte *)data;
+  for (; size > 0 ; size--, p++)
+    v = Table[((Byte)(v)) ^ *p] ^ (v >> 8);
+  _value = v;
+}

payloads/bayou/util/pbuilder/lzma/C/Common/CRC.h

@@ -0,0 +1,36 @@
+// Common/CRC.h
+
+#ifndef __COMMON_CRC_H
+#define __COMMON_CRC_H
+
+#include <stddef.h>
+#include "Types.h"
+
+class CCRC
+{
+  UInt32 _value;
+public:
+	static UInt32 Table[256];
+	static void InitTable();
+
+  CCRC():  _value(0xFFFFFFFF){};
+  void Init() { _value = 0xFFFFFFFF; }
+  void UpdateByte(Byte v);
+  void UpdateUInt16(UInt16 v);
+  void UpdateUInt32(UInt32 v);
+  void UpdateUInt64(UInt64 v);
+  void Update(const void *data, size_t size);
+  UInt32 GetDigest() const { return _value ^ 0xFFFFFFFF; } 
+  static UInt32 CalculateDigest(const void *data, size_t size)
+  {
+    CCRC crc;
+    crc.Update(data, size);
+    return crc.GetDigest();
+  }
+  static bool VerifyDigest(UInt32 digest, const void *data, size_t size)
+  {
+    return (CalculateDigest(data, size) == digest);
+  }
+};
+
+#endif

payloads/bayou/util/pbuilder/lzma/C/Common/Defs.h

@@ -0,0 +1,20 @@
+// Common/Defs.h
+
+#ifndef __COMMON_DEFS_H
+#define __COMMON_DEFS_H
+
+template <class T> inline T MyMin(T a, T b)
+  {  return a < b ? a : b; }
+template <class T> inline T MyMax(T a, T b)
+  {  return a > b ? a : b; }
+
+template <class T> inline int MyCompare(T a, T b)
+  {  return a < b ? -1 : (a == b ? 0 : 1); }
+
+inline int BoolToInt(bool value)
+  { return (value ? 1: 0); }
+
+inline bool IntToBool(int value)
+  { return (value != 0); }
+
+#endif

payloads/bayou/util/pbuilder/lzma/C/Common/MyCom.h

@@ -0,0 +1,203 @@
+// MyCom.h
+
+#ifndef __MYCOM_H
+#define __MYCOM_H
+
+#include "MyWindows.h"
+
+#define RINOK(x) { HRESULT __result_ = (x); if(__result_ != S_OK) return __result_; }
+
+template <class T>
+class CMyComPtr
+{
+  T* _p;
+public:
+  // typedef T _PtrClass;
+  CMyComPtr() { _p = NULL;}
+  CMyComPtr(T* p) {if ((_p = p) != NULL) p->AddRef(); }
+  CMyComPtr(const CMyComPtr<T>& lp)
+  {
+    if ((_p = lp._p) != NULL)
+      _p->AddRef();
+  }
+  ~CMyComPtr() { if (_p) _p->Release(); }
+  void Release() { if (_p) { _p->Release(); _p = NULL; } }
+  operator T*() const {  return (T*)_p;  }
+  // T& operator*() const {  return *_p; }
+  T** operator&() { return &_p; }
+  T* operator->() const { return _p; }
+  T* operator=(T* p) 
+  { 
+    if (p != 0)
+      p->AddRef();
+    if (_p) 
+      _p->Release();
+    _p = p;
+    return p;
+  }
+  T* operator=(const CMyComPtr<T>& lp) { return (*this = lp._p); }
+  bool operator!() const { return (_p == NULL); }
+  // bool operator==(T* pT) const {  return _p == pT; }
+  // Compare two objects for equivalence
+  void Attach(T* p2)
+  {
+    Release();
+    _p = p2;
+  }
+  T* Detach()
+  {
+    T* pt = _p;
+    _p = NULL;
+    return pt;
+  }
+  #ifdef _WIN32
+  HRESULT CoCreateInstance(REFCLSID rclsid, REFIID iid, LPUNKNOWN pUnkOuter = NULL, DWORD dwClsContext = CLSCTX_ALL)
+  {
+    return ::CoCreateInstance(rclsid, pUnkOuter, dwClsContext, iid, (void**)&_p);
+  }
+  #endif
+  /*
+  HRESULT CoCreateInstance(LPCOLESTR szProgID, LPUNKNOWN pUnkOuter = NULL, DWORD dwClsContext = CLSCTX_ALL)
+  {
+    CLSID clsid;
+    HRESULT hr = CLSIDFromProgID(szProgID, &clsid);
+    ATLASSERT(_p == NULL);
+    if (SUCCEEDED(hr))
+      hr = ::CoCreateInstance(clsid, pUnkOuter, dwClsContext, __uuidof(T), (void**)&_p);
+    return hr;
+  }
+  */
+  template <class Q>
+  HRESULT QueryInterface(REFGUID iid, Q** pp) const
+  {
+    return _p->QueryInterface(iid, (void**)pp);
+  }
+};
+
+//////////////////////////////////////////////////////////
+
+class CMyComBSTR
+{
+public:
+  BSTR m_str;
+  CMyComBSTR() { m_str = NULL; }
+  CMyComBSTR(LPCOLESTR pSrc) {  m_str = ::SysAllocString(pSrc);  }
+  // CMyComBSTR(int nSize) { m_str = ::SysAllocStringLen(NULL, nSize); }
+  // CMyComBSTR(int nSize, LPCOLESTR sz) { m_str = ::SysAllocStringLen(sz, nSize);  }
+  CMyComBSTR(const CMyComBSTR& src) { m_str = src.MyCopy(); }
+  /*
+  CMyComBSTR(REFGUID src)
+  {
+    LPOLESTR szGuid;
+    StringFromCLSID(src, &szGuid);
+    m_str = ::SysAllocString(szGuid);
+    CoTaskMemFree(szGuid);
+  }
+  */
+  ~CMyComBSTR() { ::SysFreeString(m_str); }
+  CMyComBSTR& operator=(const CMyComBSTR& src)
+  {
+    if (m_str != src.m_str)
+    {
+      if (m_str)
+        ::SysFreeString(m_str);
+      m_str = src.MyCopy();
+    }
+    return *this;
+  }
+  CMyComBSTR& operator=(LPCOLESTR pSrc)
+  {
+    ::SysFreeString(m_str);
+    m_str = ::SysAllocString(pSrc);
+    return *this;
+  }
+  unsigned int Length() const { return ::SysStringLen(m_str); }
+  operator BSTR() const { return m_str; }
+  BSTR* operator&() { return &m_str; }
+  BSTR MyCopy() const 
+  { 
+    int byteLen = ::SysStringByteLen(m_str);
+    BSTR res = ::SysAllocStringByteLen(NULL, byteLen);
+    memmove(res, m_str, byteLen);
+    return res;
+  }
+  void Attach(BSTR src) {  m_str = src; }
+  BSTR Detach()
+  {
+    BSTR s = m_str;
+    m_str = NULL;
+    return s;
+  }
+  void Empty()
+  {
+    ::SysFreeString(m_str);
+    m_str = NULL;
+  }
+  bool operator!() const {  return (m_str == NULL); }
+};
+
+
+//////////////////////////////////////////////////////////
+
+class CMyUnknownImp
+{
+public:
+  ULONG __m_RefCount;
+  CMyUnknownImp(): __m_RefCount(0) {}
+};
+
+#define MY_QUERYINTERFACE_BEGIN STDMETHOD(QueryInterface) \
+    (REFGUID iid, void **outObject) { 
+
+#define MY_QUERYINTERFACE_ENTRY(i) if (iid == IID_ ## i) \
+    { *outObject = (void *)(i *)this; AddRef(); return S_OK; }
+
+#define MY_QUERYINTERFACE_END return E_NOINTERFACE; }
+
+#define MY_ADDREF_RELEASE \
+STDMETHOD_(ULONG, AddRef)() { return ++__m_RefCount; } \
+STDMETHOD_(ULONG, Release)() { if (--__m_RefCount != 0)  \
+  return __m_RefCount; delete this; return 0; }
+
+#define MY_UNKNOWN_IMP_SPEC(i) \
+  MY_QUERYINTERFACE_BEGIN \
+  i \
+  MY_QUERYINTERFACE_END \
+  MY_ADDREF_RELEASE
+
+
+#define MY_UNKNOWN_IMP STDMETHOD(QueryInterface)(REFGUID, void **) { \
+  MY_QUERYINTERFACE_END \
+  MY_ADDREF_RELEASE
+
+#define MY_UNKNOWN_IMP1(i) MY_UNKNOWN_IMP_SPEC( \
+  MY_QUERYINTERFACE_ENTRY(i) \
+  )
+
+#define MY_UNKNOWN_IMP2(i1, i2) MY_UNKNOWN_IMP_SPEC( \
+  MY_QUERYINTERFACE_ENTRY(i1) \
+  MY_QUERYINTERFACE_ENTRY(i2) \
+  )
+
+#define MY_UNKNOWN_IMP3(i1, i2, i3) MY_UNKNOWN_IMP_SPEC( \
+  MY_QUERYINTERFACE_ENTRY(i1) \
+  MY_QUERYINTERFACE_ENTRY(i2) \
+  MY_QUERYINTERFACE_ENTRY(i3) \
+  )
+
+#define MY_UNKNOWN_IMP4(i1, i2, i3, i4) MY_UNKNOWN_IMP_SPEC( \
+  MY_QUERYINTERFACE_ENTRY(i1) \
+  MY_QUERYINTERFACE_ENTRY(i2) \
+  MY_QUERYINTERFACE_ENTRY(i3) \
+  MY_QUERYINTERFACE_ENTRY(i4) \
+  )
+
+#define MY_UNKNOWN_IMP5(i1, i2, i3, i4, i5) MY_UNKNOWN_IMP_SPEC( \
+  MY_QUERYINTERFACE_ENTRY(i1) \
+  MY_QUERYINTERFACE_ENTRY(i2) \
+  MY_QUERYINTERFACE_ENTRY(i3) \
+  MY_QUERYINTERFACE_ENTRY(i4) \
+  MY_QUERYINTERFACE_ENTRY(i5) \
+  )
+
+#endif

payloads/bayou/util/pbuilder/lzma/C/Common/MyGuidDef.h

@@ -0,0 +1,54 @@
+// Common/MyGuidDef.h
+
+#ifndef GUID_DEFINED
+#define GUID_DEFINED
+
+#include "Types.h"
+
+typedef struct {
+  UInt32 Data1;
+  UInt16 Data2;
+  UInt16 Data3;
+  unsigned char Data4[8];
+} GUID;
+
+#ifdef __cplusplus
+#define REFGUID const GUID &
+#else
+#define REFGUID const GUID *
+#endif
+
+#define REFCLSID REFGUID
+#define REFIID REFGUID
+
+#ifdef __cplusplus
+inline bool operator==(REFGUID g1, REFGUID g2)
+{ 
+  for (int i = 0; i < (int)sizeof(g1); i++)
+    if (((const unsigned char *)&g1)[i] != ((const unsigned char *)&g2)[i])
+      return false;
+  return true;
+}
+inline bool operator!=(REFGUID g1, REFGUID g2) { return !(g1 == g2); }
+#endif
+
+#ifdef __cplusplus
+  #define MY_EXTERN_C extern "C"
+#else
+  #define MY_EXTERN_C extern
+#endif
+
+#endif // GUID_DEFINED
+
+
+#ifdef DEFINE_GUID
+#undef DEFINE_GUID
+#endif
+
+#ifdef INITGUID
+  #define DEFINE_GUID(name, l, w1, w2, b1, b2, b3, b4, b5, b6, b7, b8) \
+    MY_EXTERN_C const GUID name = { l, w1, w2, { b1, b2,  b3,  b4,  b5,  b6,  b7,  b8 } }
+#else
+  #define DEFINE_GUID(name, l, w1, w2, b1, b2, b3, b4, b5, b6, b7, b8) \
+    MY_EXTERN_C const GUID name
+#endif

payloads/bayou/util/pbuilder/lzma/C/Common/MyInitGuid.h

@@ -0,0 +1,13 @@
+// Common/MyInitGuid.h
+
+#ifndef __COMMON_MYINITGUID_H
+#define __COMMON_MYINITGUID_H
+
+#ifdef _WIN32
+#include <initguid.h>
+#else
+#define INITGUID
+#include "MyGuidDef.h"
+#endif
+
+#endif

payloads/bayou/util/pbuilder/lzma/C/Common/MyUnknown.h

@@ -0,0 +1,24 @@
+// MyUnknown.h
+
+#ifndef __MYUNKNOWN_H
+#define __MYUNKNOWN_H
+
+#ifdef _WIN32
+
+#ifdef _WIN32_WCE
+#if (_WIN32_WCE > 300)
+#include <basetyps.h>
+#else
+#define MIDL_INTERFACE(x) struct 
+#endif
+#else
+#include <basetyps.h>
+#endif
+
+#include <unknwn.h>
+
+#else 
+#include "MyWindows.h"
+#endif
+  
+#endif

payloads/bayou/util/pbuilder/lzma/C/Common/MyWindows.h

@@ -0,0 +1,201 @@
+// MyWindows.h
+
+#ifndef __MYWINDOWS_H
+#define __MYWINDOWS_H
+
+#ifdef _WIN32
+
+#include <windows.h>
+
+#define CHAR_PATH_SEPARATOR '\\'
+#define WCHAR_PATH_SEPARATOR L'\\'
+#define STRING_PATH_SEPARATOR "\\"
+#define WSTRING_PATH_SEPARATOR L"\\"
+
+#else
+
+#define CHAR_PATH_SEPARATOR '/'
+#define WCHAR_PATH_SEPARATOR L'/'
+#define STRING_PATH_SEPARATOR "/"
+#define WSTRING_PATH_SEPARATOR L"/"
+
+#include <stddef.h> // for wchar_t
+#include <string.h>
+
+#include "MyGuidDef.h"
+
+typedef char CHAR;
+typedef unsigned char UCHAR;
+
+#undef BYTE
+typedef unsigned char BYTE;
+
+typedef short SHORT;
+typedef unsigned short USHORT;
+
+#undef WORD
+typedef unsigned short WORD;
+typedef short VARIANT_BOOL;
+
+typedef int INT;
+typedef Int32 INT32;
+typedef unsigned int UINT;
+typedef UInt32 UINT32;
+typedef INT32 LONG;   // LONG, ULONG and DWORD must be 32-bit
+typedef UINT32 ULONG;
+
+#undef DWORD
+typedef UINT32 DWORD;
+
+typedef Int64 LONGLONG;
+typedef UInt64 ULONGLONG;
+
+typedef struct LARGE_INTEGER { LONGLONG QuadPart; }LARGE_INTEGER;
+typedef struct _ULARGE_INTEGER { ULONGLONG QuadPart;} ULARGE_INTEGER;
+
+typedef const CHAR *LPCSTR;
+typedef CHAR TCHAR;
+typedef const TCHAR *LPCTSTR;
+typedef wchar_t WCHAR;
+typedef WCHAR OLECHAR;
+typedef const WCHAR *LPCWSTR;
+typedef OLECHAR *BSTR;
+typedef const OLECHAR *LPCOLESTR;
+typedef OLECHAR *LPOLESTR;
+
+typedef struct _FILETIME
+{
+  DWORD dwLowDateTime;
+  DWORD dwHighDateTime;
+}FILETIME;
+
+#define HRESULT LONG
+#define FAILED(Status) ((HRESULT)(Status)<0)
+typedef ULONG PROPID;
+typedef LONG SCODE;
+
+#define S_OK    ((HRESULT)0x00000000L)
+#define S_FALSE ((HRESULT)0x00000001L)
+#define E_NOTIMPL ((HRESULT)0x80004001L)
+#define E_NOINTERFACE ((HRESULT)0x80004002L)
+#define E_ABORT ((HRESULT)0x80004004L)
+#define E_FAIL ((HRESULT)0x80004005L)
+#define STG_E_INVALIDFUNCTION ((HRESULT)0x80030001L)
+#define E_OUTOFMEMORY ((HRESULT)0x8007000EL)
+#define E_INVALIDARG ((HRESULT)0x80070057L)
+
+#ifdef _MSC_VER
+#define STDMETHODCALLTYPE __stdcall 
+#else
+#define STDMETHODCALLTYPE 
+#endif
+
+#define STDMETHOD_(t, f) virtual t STDMETHODCALLTYPE f
+#define STDMETHOD(f) STDMETHOD_(HRESULT, f)
+#define STDMETHODIMP_(type) type STDMETHODCALLTYPE
+#define STDMETHODIMP STDMETHODIMP_(HRESULT)
+
+#define PURE = 0
+
+#define MIDL_INTERFACE(x) struct 
+
+struct IUnknown
+{
+  //virtual ~IUnknown() {}
+  STDMETHOD(QueryInterface) (REFIID iid, void **outObject) PURE;
+  STDMETHOD_(ULONG, AddRef)() PURE;
+  STDMETHOD_(ULONG, Release)() PURE;
+};
+
+typedef IUnknown *LPUNKNOWN;
+
+#define VARIANT_TRUE ((VARIANT_BOOL)-1)
+#define VARIANT_FALSE ((VARIANT_BOOL)0)
+
+enum VARENUM
+{	
+  VT_EMPTY	= 0,
+	VT_NULL	= 1,
+	VT_I2	= 2,
+	VT_I4	= 3,
+	VT_R4	= 4,
+	VT_R8	= 5,
+	VT_CY	= 6,
+	VT_DATE	= 7,
+	VT_BSTR	= 8,
+	VT_DISPATCH	= 9,
+	VT_ERROR	= 10,
+	VT_BOOL	= 11,
+	VT_VARIANT	= 12,
+	VT_UNKNOWN	= 13,
+	VT_DECIMAL	= 14,
+	VT_I1	= 16,
+	VT_UI1	= 17,
+	VT_UI2	= 18,
+	VT_UI4	= 19,
+	VT_I8	= 20,
+	VT_UI8	= 21,
+	VT_INT	= 22,
+	VT_UINT	= 23,
+	VT_VOID	= 24,
+	VT_HRESULT	= 25,
+	VT_FILETIME	= 64
+};
+
+typedef unsigned short VARTYPE;
+typedef WORD PROPVAR_PAD1;
+typedef WORD PROPVAR_PAD2;
+typedef WORD PROPVAR_PAD3;
+
+typedef struct tagPROPVARIANT
+{
+  VARTYPE vt;
+  PROPVAR_PAD1 wReserved1;
+  PROPVAR_PAD2 wReserved2;
+  PROPVAR_PAD3 wReserved3;
+  union 
+  {
+    CHAR cVal;
+    UCHAR bVal;
+    SHORT iVal;
+    USHORT uiVal;
+    LONG lVal;
+    ULONG ulVal;
+    INT intVal;
+    UINT uintVal;
+    LARGE_INTEGER hVal;
+    ULARGE_INTEGER uhVal;
+    VARIANT_BOOL boolVal;
+    SCODE scode;
+    FILETIME filetime;
+    BSTR bstrVal;
+  };
+} PROPVARIANT;
+
+typedef PROPVARIANT tagVARIANT;
+typedef tagVARIANT VARIANT;
+typedef VARIANT VARIANTARG;
+
+MY_EXTERN_C BSTR SysAllocStringByteLen(LPCSTR psz, UINT len);
+MY_EXTERN_C BSTR SysAllocString(const OLECHAR *sz);
+MY_EXTERN_C void SysFreeString(BSTR bstr);
+MY_EXTERN_C UINT SysStringByteLen(BSTR bstr);
+MY_EXTERN_C UINT SysStringLen(BSTR bstr);
+
+MY_EXTERN_C DWORD GetLastError();
+MY_EXTERN_C HRESULT VariantClear(VARIANTARG *prop);
+MY_EXTERN_C HRESULT VariantCopy(VARIANTARG *dest, VARIANTARG *src);
+MY_EXTERN_C LONG CompareFileTime(const FILETIME* ft1, const FILETIME* ft2);
+
+#define CP_ACP    0
+#define CP_OEMCP  1
+
+typedef enum tagSTREAM_SEEK
+{	
+  STREAM_SEEK_SET	= 0,
+  STREAM_SEEK_CUR	= 1,
+  STREAM_SEEK_END	= 2
+} STREAM_SEEK;
+
+#endif
+#endif

payloads/bayou/util/pbuilder/lzma/C/Common/NewHandler.h

@@ -0,0 +1,16 @@
+// Common/NewHandler.h
+
+#ifndef __COMMON_NEWHANDLER_H
+#define __COMMON_NEWHANDLER_H
+
+class CNewException {};
+
+#ifdef _WIN32
+void 
+#ifdef _MSC_VER
+__cdecl 
+#endif
+operator delete(void *p) throw();
+#endif 
+
+#endif 

payloads/bayou/util/pbuilder/lzma/C/Common/StdAfx.h

@@ -0,0 +1,9 @@
+// StdAfx.h
+
+#ifndef __STDAFX_H
+#define __STDAFX_H
+
+// #include "MyWindows.h"
+#include "NewHandler.h"
+
+#endif 

payloads/bayou/util/pbuilder/lzma/C/Common/Types.h

@@ -0,0 +1,19 @@
+// Common/Types.h
+
+#ifndef __COMMON_TYPES_H
+#define __COMMON_TYPES_H
+
+typedef unsigned char Byte;
+typedef short Int16;
+typedef unsigned short UInt16;
+typedef int Int32;
+typedef unsigned int UInt32;
+#ifdef _MSC_VER
+typedef __int64 Int64;
+typedef unsigned __int64 UInt64;
+#else
+typedef long long int Int64;
+typedef unsigned long long int UInt64;
+#endif
+
+#endif

payloads/bayou/util/pbuilder/lzma/C/LGPL.txt

@@ -0,0 +1,504 @@
+      GNU LESSER GENERAL PUBLIC LICENSE
+           Version 2.1, February 1999
+
+ Copyright (C) 1991, 1999 Free Software Foundation, Inc.
+     59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+ Everyone is permitted to copy and distribute verbatim copies
+ of this license document, but changing it is not allowed.
+
+[This is the first released version of the Lesser GPL.  It also counts
+ as the successor of the GNU Library Public License, version 2, hence
+ the version number 2.1.]
+
+          Preamble
+
+  The licenses for most software are designed to take away your
+freedom to share and change it.  By contrast, the GNU General Public
+Licenses are intended to guarantee your freedom to share and change
+free software--to make sure the software is free for all its users.
+
+  This license, the Lesser General Public License, applies to some
+specially designated software packages--typically libraries--of the
+Free Software Foundation and other authors who decide to use it.  You
+can use it too, but we suggest you first think carefully about whether
+this license or the ordinary General Public License is the better
+strategy to use in any particular case, based on the explanations below.
+
+  When we speak of free software, we are referring to freedom of use,
+not price.  Our General Public Licenses are designed to make sure that
+you have the freedom to distribute copies of free software (and charge
+for this service if you wish); that you receive source code or can get
+it if you want it; that you can change the software and use pieces of
+it in new free programs; and that you are informed that you can do
+these things.
+
+  To protect your rights, we need to make restrictions that forbid
+distributors to deny you these rights or to ask you to surrender these
+rights.  These restrictions translate to certain responsibilities for
+you if you distribute copies of the library or if you modify it.
+
+  For example, if you distribute copies of the library, whether gratis
+or for a fee, you must give the recipients all the rights that we gave
+you.  You must make sure that they, too, receive or can get the source
+code.  If you link other code with the library, you must provide
+complete object files to the recipients, so that they can relink them
+with the library after making changes to the library and recompiling
+it.  And you must show them these terms so they know their rights.
+
+  We protect your rights with a two-step method: (1) we copyright the
+library, and (2) we offer you this license, which gives you legal
+permission to copy, distribute and/or modify the library.
+
+  To protect each distributor, we want to make it very clear that
+there is no warranty for the free library.  Also, if the library is
+modified by someone else and passed on, the recipients should know
+that what they have is not the original version, so that the original
+author's reputation will not be affected by problems that might be
+introduced by others.
+
+  Finally, software patents pose a constant threat to the existence of
+any free program.  We wish to make sure that a company cannot
+effectively restrict the users of a free program by obtaining a
+restrictive license from a patent holder.  Therefore, we insist that
+any patent license obtained for a version of the library must be
+consistent with the full freedom of use specified in this license.
+
+  Most GNU software, including some libraries, is covered by the
+ordinary GNU General Public License.  This license, the GNU Lesser
+General Public License, applies to certain designated libraries, and
+is quite different from the ordinary General Public License.  We use
+this license for certain libraries in order to permit linking those
+libraries into non-free programs.
+
+  When a program is linked with a library, whether statically or using
+a shared library, the combination of the two is legally speaking a
+combined work, a derivative of the original library.  The ordinary
+General Public License therefore permits such linking only if the
+entire combination fits its criteria of freedom.  The Lesser General
+Public License permits more lax criteria for linking other code with
+the library.
+
+  We call this license the "Lesser" General Public License because it
+does Less to protect the user's freedom than the ordinary General
+Public License.  It also provides other free software developers Less
+of an advantage over competing non-free programs.  These disadvantages
+are the reason we use the ordinary General Public License for many
+libraries.  However, the Lesser license provides advantages in certain
+special circumstances.
+
+  For example, on rare occasions, there may be a special need to
+encourage the widest possible use of a certain library, so that it becomes
+a de-facto standard.  To achieve this, non-free programs must be
+allowed to use the library.  A more frequent case is that a free
+library does the same job as widely used non-free libraries.  In this
+case, there is little to gain by limiting the free library to free
+software only, so we use the Lesser General Public License.
+
+  In other cases, permission to use a particular library in non-free
+programs enables a greater number of people to use a large body of
+free software.  For example, permission to use the GNU C Library in
+non-free programs enables many more people to use the whole GNU
+operating system, as well as its variant, the GNU/Linux operating
+system.
+
+  Although the Lesser General Public License is Less protective of the
+users' freedom, it does ensure that the user of a program that is
+linked with the Library has the freedom and the wherewithal to run
+that program using a modified version of the Library.
+
+  The precise terms and conditions for copying, distribution and
+modification follow.  Pay close attention to the difference between a
+"work based on the library" and a "work that uses the library".  The
+former contains code derived from the library, whereas the latter must
+be combined with the library in order to run.
+
+      GNU LESSER GENERAL PUBLIC LICENSE
+   TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION
+
+  0. This License Agreement applies to any software library or other
+program which contains a notice placed by the copyright holder or
+other authorized party saying it may be distributed under the terms of
+this Lesser General Public License (also called "this License").
+Each licensee is addressed as "you".
+
+  A "library" means a collection of software functions and/or data
+prepared so as to be conveniently linked with application programs
+(which use some of those functions and data) to form executables.
+
+  The "Library", below, refers to any such software library or work
+which has been distributed under these terms.  A "work based on the
+Library" means either the Library or any derivative work under
+copyright law: that is to say, a work containing the Library or a
+portion of it, either verbatim or with modifications and/or translated
+straightforwardly into another language.  (Hereinafter, translation is
+included without limitation in the term "modification".)
+
+  "Source code" for a work means the preferred form of the work for
+making modifications to it.  For a library, complete source code means
+all the source code for all modules it contains, plus any associated
+interface definition files, plus the scripts used to control compilation
+and installation of the library.
+
+  Activities other than copying, distribution and modification are not
+covered by this License; they are outside its scope.  The act of
+running a program using the Library is not restricted, and output from
+such a program is covered only if its contents constitute a work based
+on the Library (independent of the use of the Library in a tool for
+writing it).  Whether that is true depends on what the Library does
+and what the program that uses the Library does.
+  
+  1. You may copy and distribute verbatim copies of the Library's
+complete source code as you receive it, in any medium, provided that
+you conspicuously and appropriately publish on each copy an
+appropriate copyright notice and disclaimer of warranty; keep intact
+all the notices that refer to this License and to the absence of any
+warranty; and distribute a copy of this License along with the
+Library.
+
+  You may charge a fee for the physical act of transferring a copy,
+and you may at your option offer warranty protection in exchange for a
+fee.
+
+  2. You may modify your copy or copies of the Library or any portion
+of it, thus forming a work based on the Library, and copy and
+distribute such modifications or work under the terms of Section 1
+above, provided that you also meet all of these conditions:
+
+    a) The modified work must itself be a software library.
+
+    b) You must cause the files modified to carry prominent notices
+    stating that you changed the files and the date of any change.
+
+    c) You must cause the whole of the work to be licensed at no
+    charge to all third parties under the terms of this License.
+
+    d) If a facility in the modified Library refers to a function or a
+    table of data to be supplied by an application program that uses
+    the facility, other than as an argument passed when the facility
+    is invoked, then you must make a good faith effort to ensure that,
+    in the event an application does not supply such function or
+    table, the facility still operates, and performs whatever part of
+    its purpose remains meaningful.
+
+    (For example, a function in a library to compute square roots has
+    a purpose that is entirely well-defined independent of the
+    application.  Therefore, Subsection 2d requires that any
+    application-supplied function or table used by this function must
+    be optional: if the application does not supply it, the square
+    root function must still compute square roots.)
+
+These requirements apply to the modified work as a whole.  If
+identifiable sections of that work are not derived from the Library,
+and can be reasonably considered independent and separate works in
+themselves, then this License, and its terms, do not apply to those
+sections when you distribute them as separate works.  But when you
+distribute the same sections as part of a whole which is a work based
+on the Library, the distribution of the whole must be on the terms of
+this License, whose permissions for other licensees extend to the
+entire whole, and thus to each and every part regardless of who wrote
+it.
+
+Thus, it is not the intent of this section to claim rights or contest
+your rights to work written entirely by you; rather, the intent is to
+exercise the right to control the distribution of derivative or
+collective works based on the Library.
+
+In addition, mere aggregation of another work not based on the Library
+with the Library (or with a work based on the Library) on a volume of
+a storage or distribution medium does not bring the other work under
+the scope of this License.
+
+  3. You may opt to apply the terms of the ordinary GNU General Public
+License instead of this License to a given copy of the Library.  To do
+this, you must alter all the notices that refer to this License, so
+that they refer to the ordinary GNU General Public License, version 2,
+instead of to this License.  (If a newer version than version 2 of the
+ordinary GNU General Public License has appeared, then you can specify
+that version instead if you wish.)  Do not make any other change in
+these notices.
+
+  Once this change is made in a given copy, it is irreversible for
+that copy, so the ordinary GNU General Public License applies to all
+subsequent copies and derivative works made from that copy.
+
+  This option is useful when you wish to copy part of the code of
+the Library into a program that is not a library.
+
+  4. You may copy and distribute the Library (or a portion or
+derivative of it, under Section 2) in object code or executable form
+under the terms of Sections 1 and 2 above provided that you accompany
+it with the complete corresponding machine-readable source code, which
+must be distributed under the terms of Sections 1 and 2 above on a
+medium customarily used for software interchange.
+
+  If distribution of object code is made by offering access to copy
+from a designated place, then offering equivalent access to copy the
+source code from the same place satisfies the requirement to
+distribute the source code, even though third parties are not
+compelled to copy the source along with the object code.
+
+  5. A program that contains no derivative of any portion of the
+Library, but is designed to work with the Library by being compiled or
+linked with it, is called a "work that uses the Library".  Such a
+work, in isolation, is not a derivative work of the Library, and
+therefore falls outside the scope of this License.
+
+  However, linking a "work that uses the Library" with the Library
+creates an executable that is a derivative of the Library (because it
+contains portions of the Library), rather than a "work that uses the
+library".  The executable is therefore covered by this License.
+Section 6 states terms for distribution of such executables.
+
+  When a "work that uses the Library" uses material from a header file
+that is part of the Library, the object code for the work may be a
+derivative work of the Library even though the source code is not.
+Whether this is true is especially significant if the work can be
+linked without the Library, or if the work is itself a library.  The
+threshold for this to be true is not precisely defined by law.
+
+  If such an object file uses only numerical parameters, data
+structure layouts and accessors, and small macros and small inline
+functions (ten lines or less in length), then the use of the object
+file is unrestricted, regardless of whether it is legally a derivative
+work.  (Executables containing this object code plus portions of the
+Library will still fall under Section 6.)
+
+  Otherwise, if the work is a derivative of the Library, you may
+distribute the object code for the work under the terms of Section 6.
+Any executables containing that work also fall under Section 6,
+whether or not they are linked directly with the Library itself.
+
+  6. As an exception to the Sections above, you may also combine or
+link a "work that uses the Library" with the Library to produce a
+work containing portions of the Library, and distribute that work
+under terms of your choice, provided that the terms permit
+modification of the work for the customer's own use and reverse
+engineering for debugging such modifications.
+
+  You must give prominent notice with each copy of the work that the
+Library is used in it and that the Library and its use are covered by
+this License.  You must supply a copy of this License.  If the work
+during execution displays copyright notices, you must include the
+copyright notice for the Library among them, as well as a reference
+directing the user to the copy of this License.  Also, you must do one
+of these things:
+
+    a) Accompany the work with the complete corresponding
+    machine-readable source code for the Library including whatever
+    changes were used in the work (which must be distributed under
+    Sections 1 and 2 above); and, if the work is an executable linked
+    with the Library, with the complete machine-readable "work that
+    uses the Library", as object code and/or source code, so that the
+    user can modify the Library and then relink to produce a modified
+    executable containing the modified Library.  (It is understood
+    that the user who changes the contents of definitions files in the
+    Library will not necessarily be able to recompile the application
+    to use the modified definitions.)
+
+    b) Use a suitable shared library mechanism for linking with the
+    Library.  A suitable mechanism is one that (1) uses at run time a
+    copy of the library already present on the user's computer system,
+    rather than copying library functions into the executable, and (2)
+    will operate properly with a modified version of the library, if
+    the user installs one, as long as the modified version is
+    interface-compatible with the version that the work was made with.
+
+    c) Accompany the work with a written offer, valid for at
+    least three years, to give the same user the materials
+    specified in Subsection 6a, above, for a charge no more
+    than the cost of performing this distribution.
+
+    d) If distribution of the work is made by offering access to copy
+    from a designated place, offer equivalent access to copy the above
+    specified materials from the same place.
+
+    e) Verify that the user has already received a copy of these
+    materials or that you have already sent this user a copy.
+
+  For an executable, the required form of the "work that uses the
+Library" must include any data and utility programs needed for
+reproducing the executable from it.  However, as a special exception,
+the materials to be distributed need not include anything that is
+normally distributed (in either source or binary form) with the major
+components (compiler, kernel, and so on) of the operating system on
+which the executable runs, unless that component itself accompanies
+the executable.
+
+  It may happen that this requirement contradicts the license
+restrictions of other proprietary libraries that do not normally
+accompany the operating system.  Such a contradiction means you cannot
+use both them and the Library together in an executable that you
+distribute.
+
+  7. You may place library facilities that are a work based on the
+Library side-by-side in a single library together with other library
+facilities not covered by this License, and distribute such a combined
+library, provided that the separate distribution of the work based on
+the Library and of the other library facilities is otherwise
+permitted, and provided that you do these two things:
+
+    a) Accompany the combined library with a copy of the same work
+    based on the Library, uncombined with any other library
+    facilities.  This must be distributed under the terms of the
+    Sections above.
+
+    b) Give prominent notice with the combined library of the fact
+    that part of it is a work based on the Library, and explaining
+    where to find the accompanying uncombined form of the same work.
+
+  8. You may not copy, modify, sublicense, link with, or distribute
+the Library except as expressly provided under this License.  Any
+attempt otherwise to copy, modify, sublicense, link with, or
+distribute the Library is void, and will automatically terminate your
+rights under this License.  However, parties who have received copies,
+or rights, from you under this License will not have their licenses
+terminated so long as such parties remain in full compliance.
+
+  9. You are not required to accept this License, since you have not
+signed it.  However, nothing else grants you permission to modify or
+distribute the Library or its derivative works.  These actions are
+prohibited by law if you do not accept this License.  Therefore, by
+modifying or distributing the Library (or any work based on the
+Library), you indicate your acceptance of this License to do so, and
+all its terms and conditions for copying, distributing or modifying
+the Library or works based on it.
+
+  10. Each time you redistribute the Library (or any work based on the
+Library), the recipient automatically receives a license from the
+original licensor to copy, distribute, link with or modify the Library
+subject to these terms and conditions.  You may not impose any further
+restrictions on the recipients' exercise of the rights granted herein.
+You are not responsible for enforcing compliance by third parties with
+this License.
+
+  11. If, as a consequence of a court judgment or allegation of patent
+infringement or for any other reason (not limited to patent issues),
+conditions are imposed on you (whether by court order, agreement or
+otherwise) that contradict the conditions of this License, they do not
+excuse you from the conditions of this License.  If you cannot
+distribute so as to satisfy simultaneously your obligations under this
+License and any other pertinent obligations, then as a consequence you
+may not distribute the Library at all.  For example, if a patent
+license would not permit royalty-free redistribution of the Library by
+all those who receive copies directly or indirectly through you, then
+the only way you could satisfy both it and this License would be to
+refrain entirely from distribution of the Library.
+
+If any portion of this section is held invalid or unenforceable under any
+particular circumstance, the balance of the section is intended to apply,
+and the section as a whole is intended to apply in other circumstances.
+
+It is not the purpose of this section to induce you to infringe any
+patents or other property right claims or to contest validity of any
+such claims; this section has the sole purpose of protecting the
+integrity of the free software distribution system which is
+implemented by public license practices.  Many people have made
+generous contributions to the wide range of software distributed
+through that system in reliance on consistent application of that
+system; it is up to the author/donor to decide if he or she is willing
+to distribute software through any other system and a licensee cannot
+impose that choice.
+
+This section is intended to make thoroughly clear what is believed to
+be a consequence of the rest of this License.
+
+  12. If the distribution and/or use of the Library is restricted in
+certain countries either by patents or by copyrighted interfaces, the
+original copyright holder who places the Library under this License may add
+an explicit geographical distribution limitation excluding those countries,
+so that distribution is permitted only in or among countries not thus
+excluded.  In such case, this License incorporates the limitation as if
+written in the body of this License.
+
+  13. The Free Software Foundation may publish revised and/or new
+versions of the Lesser General Public License from time to time.
+Such new versions will be similar in spirit to the present version,
+but may differ in detail to address new problems or concerns.
+
+Each version is given a distinguishing version number.  If the Library
+specifies a version number of this License which applies to it and
+"any later version", you have the option of following the terms and
+conditions either of that version or of any later version published by
+the Free Software Foundation.  If the Library does not specify a
+license version number, you may choose any version ever published by
+the Free Software Foundation.
+
+  14. If you wish to incorporate parts of the Library into other free
+programs whose distribution conditions are incompatible with these,
+write to the author to ask for permission.  For software which is
+copyrighted by the Free Software Foundation, write to the Free
+Software Foundation; we sometimes make exceptions for this.  Our
+decision will be guided by the two goals of preserving the free status
+of all derivatives of our free software and of promoting the sharing
+and reuse of software generally.
+
+          NO WARRANTY
+
+  15. BECAUSE THE LIBRARY IS LICENSED FREE OF CHARGE, THERE IS NO
+WARRANTY FOR THE LIBRARY, TO THE EXTENT PERMITTED BY APPLICABLE LAW.
+EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT HOLDERS AND/OR
+OTHER PARTIES PROVIDE THE LIBRARY "AS IS" WITHOUT WARRANTY OF ANY
+KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, THE
+IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
+PURPOSE.  THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE
+LIBRARY IS WITH YOU.  SHOULD THE LIBRARY PROVE DEFECTIVE, YOU ASSUME
+THE COST OF ALL NECESSARY SERVICING, REPAIR OR CORRECTION.
+
+  16. IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN
+WRITING WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MAY MODIFY
+AND/OR REDISTRIBUTE THE LIBRARY AS PERMITTED ABOVE, BE LIABLE TO YOU
+FOR DAMAGES, INCLUDING ANY GENERAL, SPECIAL, INCIDENTAL OR
+CONSEQUENTIAL DAMAGES ARISING OUT OF THE USE OR INABILITY TO USE THE
+LIBRARY (INCLUDING BUT NOT LIMITED TO LOSS OF DATA OR DATA BEING
+RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD PARTIES OR A
+FAILURE OF THE LIBRARY TO OPERATE WITH ANY OTHER SOFTWARE), EVEN IF
+SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF SUCH
+DAMAGES.
+
+         END OF TERMS AND CONDITIONS
+
+           How to Apply These Terms to Your New Libraries
+
+  If you develop a new library, and you want it to be of the greatest
+possible use to the public, we recommend making it free software that
+everyone can redistribute and change.  You can do so by permitting
+redistribution under these terms (or, alternatively, under the terms of the
+ordinary General Public License).
+
+  To apply these terms, attach the following notices to the library.  It is
+safest to attach them to the start of each source file to most effectively
+convey the exclusion of warranty; and each file should have at least the
+"copyright" line and a pointer to where the full notice is found.
+
+    <one line to give the library's name and a brief idea of what it does.>
+    Copyright (C) <year>  <name of author>
+
+    This library is free software; you can redistribute it and/or
+    modify it under the terms of the GNU Lesser General Public
+    License as published by the Free Software Foundation; either
+    version 2.1 of the License, or (at your option) any later version.
+
+    This library 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
+    Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public
+    License along with this library; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+Also add information on how to contact you by electronic and paper mail.
+
+You should also get your employer (if you work as a programmer) or your
+school, if any, to sign a "copyright disclaimer" for the library, if
+necessary.  Here is a sample; alter the names:
+
+  Yoyodyne, Inc., hereby disclaims all copyright interest in the
+  library `Frob' (a library for tweaking knobs) written by James Random Hacker.
+
+  <signature of Ty Coon>, 1 April 1990
+  Ty Coon, President of Vice
+
+That's all there is to it!
+
+

payloads/bayou/util/pbuilder/lzma/C/ORIGIN

@@ -0,0 +1,3 @@
+The contents of this directory are extracted from
+the official LZMA SDK, version lzma442.tar.bz2 ,
+for the use in mkcromfs.

payloads/bayou/util/pbuilder/lzma/Makefile

@@ -0,0 +1,63 @@
+##
+## This file is part of the coreboot project.
+##
+## Copyright (C) 2007 coresystems GmbH
+##
+## 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., 51 Franklin St, Fifth Floor, Boston, MA  02110-1301 USA
+##
+
+LZMA_OBJ := $(obj)/util/lzma/LZMAEncoder.o $(obj)/util/lzma/LZInWindow.o
+LZMA_OBJ += $(obj)/util/lzma/RangeCoderBit.o $(obj)/util/lzma/StreamUtils.o
+LZMA_OBJ += $(obj)/util/lzma/OutBuffer.o $(obj)/util/lzma/Alloc.o
+LZMA_OBJ += $(obj)/util/lzma/CRC.o
+
+$(obj)/util/lzma/lzma: $(obj)/util/lzma/ $(LZMA_OBJ) $(obj)/util/lzma/minilzma.o
+	$(Q)$(HOSTCXX) $(HOSTCXXFLAGS) -o $@ $(LZMA_OBJ) $(obj)/util/lzma/minilzma.o
+
+$(obj)/util/lzma/lzma-compress.o: $(src)/util/lzma/minilzma.cc
+	$(Q)$(HOSTCXX) $(HOSTCXXFLAGS) -o $@ -c -DCOMPACT $<
+
+$(obj)/util/lzma/:
+	$(Q)printf "  BUILD   LZMA\n"
+	$(Q)mkdir -p $(obj)/util/lzma/
+
+$(obj)/util/lzma/%.o: $(src)/util/lzma/C/7zip/Compress/LZMA/%.cpp
+	$(Q)printf "  HOSTCXX $(subst $(shell pwd)/,,$(@))\n"
+	$(Q)$(HOSTCXX) $(HOSTCXXFLAGS) -o $@ -c $<
+
+$(obj)/util/lzma/%.o: $(src)/util/lzma/C/7zip/Compress/LZ/%.cpp
+	$(Q)printf "  HOSTCXX $(subst $(shell pwd)/,,$(@))\n"
+	$(Q)$(HOSTCXX) $(HOSTCXXFLAGS) -o $@ -c $<
+
+$(obj)/util/lzma/%.o: $(src)/util/lzma/C/7zip/Compress/RangeCoder/%.cpp
+	$(Q)printf "  HOSTCXX $(subst $(shell pwd)/,,$(@))\n"
+	$(Q)$(HOSTCXX) $(HOSTCXXFLAGS) -o $@ -c $<
+
+$(obj)/util/lzma/%.o: $(src)/util/lzma/C/7zip/Decompress/%.cpp
+	$(Q)printf "  HOSTCXX $(subst $(shell pwd)/,,$(@))\n"
+	$(Q)$(HOSTCXX) $(HOSTCXXFLAGS) -o $@ -c $<
+
+$(obj)/util/lzma/%.o: $(src)/util/lzma/C/7zip/Common/%.cpp
+	$(Q)printf "  HOSTCXX $(subst $(shell pwd)/,,$(@))\n"
+	$(Q)$(HOSTCXX) $(HOSTCXXFLAGS) -o $@ -c $<
+
+$(obj)/util/lzma/%.o: $(src)/util/lzma/C/Common/%.cpp
+	$(Q)printf "  HOSTCXX $(subst $(shell pwd)/,,$(@))\n"
+	$(Q)$(HOSTCXX) $(HOSTCXXFLAGS) -o $@ -c $<
+
+$(obj)/util/lzma/%.o: $(src)/util/lzma/%.cc
+	$(Q)printf "  HOSTCXX $(subst $(shell pwd)/,,$(@))\n"
+	$(Q)$(HOSTCXX) $(HOSTCXXFLAGS) -o $@ -c $<
+

payloads/bayou/util/pbuilder/lzma/minilzma.cc

@@ -0,0 +1,318 @@
+/*
+ * minimal lzma implementation
+ *
+ * Copyright (C) 2002 Eric Biederman
+ * Copyright (C) 2005 Joel Yliluoma
+ * Copyright (C) 2007 coresystems GmbH
+ * (Adapted by Stefan Reinauer <stepan@coresystems.de> for coresystems GmbH)
+ * Copyright (C) 2007 Patrick Georgi <patrick@georgi-clan.de>
+ *
+ * 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., 51 Franklin St, Fifth Floor, Boston, MA, 02110-1301 USA
+ */
+
+#include "C/Common/MyInitGuid.h"
+#include "C/7zip/Compress/LZMA/LZMAEncoder.h"
+
+#include <sys/types.h>
+#include <sys/stat.h>
+#include <unistd.h>
+#include <errno.h>
+#include <cstring>
+#include <cstdio>
+#include <cstdlib>
+#include <cctype>
+
+#include <vector>
+#include <algorithm>
+#include <stdint.h>
+
+const std::vector<unsigned char> LZMACompress
+    (const std::vector<unsigned char>& buf);
+
+const std::vector<unsigned char> LZMADeCompress
+    (const std::vector<unsigned char>& buf);
+
+static inline uint16_t R16(const void* p)
+{
+    const unsigned char* data = (const unsigned char*)p;
+    return (data[0] << 0)  | (data[1] << 8);
+}
+static inline uint32_t R32(const void* p)
+{
+    const unsigned char* data = (const unsigned char*)p;
+    return R16(data) | (R16(data+2) << 16);
+}
+
+#define L (uint64_t)
+
+static inline uint64_t R64(const void* p)
+{
+    const unsigned char* data = (const unsigned char*)p;
+    return (L R32(data)) | ((L R32(data+4)) << 32);
+}
+
+#undef L
+
+static UInt32 SelectDictionarySizeFor(unsigned datasize)
+{
+   #if 1
+    return datasize;
+   #else
+#ifdef __GNUC__
+    /* gnu c can optimize this switch statement into a fast binary
+     * search, but it cannot do so for the list of the if statements.
+     */
+    switch(datasize)
+    {
+        case 0 ... 512 : return 512;
+        case 513 ... 1024: return 2048;
+        case 1025 ... 4096: return 8192;
+        case 4097 ... 16384: return 32768;
+        case 16385 ... 65536: return 528288;
+        case 65537 ... 528288: return 1048576*4;
+        case 528289 ... 786432: return 1048576*16;
+        default: return 1048576*32;
+    }
+#else
+    if(datasize <= 512) return 512;
+    if(datasize <= 1024) return 1024;
+    if(datasize <= 4096) return 4096;
+    if(datasize <= 16384) return 32768; 
+    if(datasize <= 65536) return 528288;
+    if(datasize <= 528288) return 1048576*4;
+    if(datasize <= 786432) reutrn 1048576*16;
+    return 32*1048576;
+#endif
+   #endif
+}
+
+
+class CInStreamRam: public ISequentialInStream, public CMyUnknownImp
+{
+    const std::vector<unsigned char>& input;
+    size_t Pos;
+public:
+    MY_UNKNOWN_IMP
+  
+    CInStreamRam(const std::vector<unsigned char>& buf) : input(buf), Pos(0)
+    {
+    }
+    virtual ~CInStreamRam() {}
+  
+    STDMETHOD(Read)(void *data, UInt32 size, UInt32 *processedSize);
+};
+
+STDMETHODIMP CInStreamRam::Read(void *data, UInt32 size, UInt32 *processedSize)
+{
+    UInt32 remain = input.size() - Pos;
+    if (size > remain) size = remain;
+  
+    std::memcpy(data, &input[Pos], size);
+    Pos += size;
+    
+    if(processedSize != NULL) *processedSize = size;
+    
+    return S_OK;
+}
+
+class COutStreamRam: public ISequentialOutStream, public CMyUnknownImp
+{
+    std::vector<Byte> result;
+    size_t Pos;
+public:
+    MY_UNKNOWN_IMP
+    
+    COutStreamRam(): result(), Pos(0) { }
+    virtual ~COutStreamRam() { }
+    
+    void Reserve(unsigned n) { result.reserve(n); }
+    const std::vector<Byte>& Get() const { return result; }
+  
+    HRESULT WriteByte(Byte b)
+    {
+        if(Pos >= result.size()) result.resize(Pos+1);
+        result[Pos++] = b;
+        return S_OK;
+    }
+  
+    STDMETHOD(Write)(const void *data, UInt32 size, UInt32 *processedSize);
+};
+
+STDMETHODIMP COutStreamRam::Write(const void *data, UInt32 size, UInt32 *processedSize)
+{
+    if(Pos+size > result.size()) result.resize(Pos+size);
+    
+    std::memcpy(&result[Pos], data, size);
+    if(processedSize != NULL) *processedSize = size;
+    Pos += size;
+    return S_OK;
+}
+
+const std::vector<unsigned char> LZMACompress(const std::vector<unsigned char>& buf)
+{
+    if(buf.empty()) return buf;
+    
+    const UInt32 dictionarysize = SelectDictionarySizeFor(buf.size());
+    
+    NCompress::NLZMA::CEncoder *encoderSpec = new NCompress::NLZMA::CEncoder;
+    CMyComPtr<ICompressCoder> encoder = encoderSpec;
+    const PROPID propIDs[] = 
+    {
+        NCoderPropID::kAlgorithm,
+        NCoderPropID::kDictionarySize,  
+        NCoderPropID::kNumFastBytes,
+    };
+    const unsigned kNumProps = sizeof(propIDs) / sizeof(propIDs[0]);
+    PROPVARIANT properties[kNumProps];
+    properties[0].vt = VT_UI4; properties[0].ulVal = (UInt32)2;
+    properties[1].vt = VT_UI4; properties[1].ulVal = (UInt32)dictionarysize;
+    properties[2].vt = VT_UI4; properties[2].ulVal = (UInt32)64;
+
+    if (encoderSpec->SetCoderProperties(propIDs, properties, kNumProps) != S_OK)
+    {
+    Error:
+        return std::vector<unsigned char> ();
+    }
+    
+    COutStreamRam *const outStreamSpec = new COutStreamRam;
+    CMyComPtr<ISequentialOutStream> outStream = outStreamSpec;
+    CInStreamRam *const inStreamSpec = new CInStreamRam(buf);
+    CMyComPtr<ISequentialInStream> inStream = inStreamSpec;
+    
+    outStreamSpec->Reserve(buf.size());
+
+    if (encoderSpec->WriteCoderProperties(outStream) != S_OK) goto Error;
+    
+    for (unsigned i = 0; i < 8; i++)
+    {
+        UInt64 t = (UInt64)buf.size();
+        outStreamSpec->WriteByte((Byte)((t) >> (8 * i)));
+    }
+
+    HRESULT lzmaResult = encoder->Code(inStream, outStream, 0, 0, 0);
+    if (lzmaResult != S_OK) goto Error;
+    
+    return outStreamSpec->Get();
+}
+
+#undef RC_NORMALIZE
+
+#include "C/7zip/Decompress/LzmaDecode.h"
+#include "C/7zip/Decompress/LzmaDecode.c"
+
+const std::vector<unsigned char> LZMADeCompress
+    (const std::vector<unsigned char>& buf)
+{
+    if(buf.size() <= 5+8) return std::vector<unsigned char> ();
+    
+    uint_least64_t out_sizemax = R64(&buf[5]);
+    
+    std::vector<unsigned char> result(out_sizemax);
+    
+    CLzmaDecoderState state;
+    LzmaDecodeProperties(&state.Properties, &buf[0], LZMA_PROPERTIES_SIZE);
+    state.Probs = new CProb[LzmaGetNumProbs(&state.Properties)];
+    
+    SizeT in_done;
+    SizeT out_done;
+    LzmaDecode(&state, &buf[13], buf.size()-13, &in_done,
+               &result[0], result.size(), &out_done);
+    
+    delete[] state.Probs;
+    
+    result.resize(out_done);
+    return result;
+}
+
+#ifndef COMPACT
+int main(int argc, char *argv[])
+{
+	char  *s;
+	FILE  *f, *infile, *outfile;
+	int    c;
+	
+	if (argc != 4) {
+		std::fprintf(stderr, "'lzma e file1 file2' encodes file1 into file2.\n"
+			"'lzma d file2 file1' decodes file2 into file1.\n");
+
+		return EXIT_FAILURE;
+	}
+	if (argc == 4) {
+		if ((s = argv[1], s[1] || strpbrk(s, "DEde") == NULL)
+			|| (s = argv[2], (infile  = fopen(s, "rb")) == NULL)
+			|| (s = argv[3], (outfile = fopen(s, "wb")) == NULL)) {
+			std::fprintf(stderr, "??? %s\n", s);
+			return EXIT_FAILURE;
+		}
+	}
+
+	struct stat fs;
+	int si;
+	if (fstat(fileno(infile), &fs)) {
+		std::perror(strerror(errno));
+		return EXIT_FAILURE;
+	}
+	si=fs.st_size;
+
+	char *Buf=(char *)malloc(si);
+	fread(Buf,si, 1, infile);
+
+	std::vector<unsigned char> result;
+	if (toupper(*argv[1]) == 'E') 
+		result = LZMACompress(std::vector<unsigned char>(Buf,Buf+si));
+	else	
+		result = LZMADeCompress(std::vector<unsigned char>(Buf,Buf+si));
+
+	fwrite(&result[0], result.size(), 1, outfile);
+	fclose(infile);
+	fclose(outfile);
+	return EXIT_SUCCESS;
+}
+#else
+extern "C" {
+
+/**
+ * Compress a buffer with lzma
+ * Don't copy the result back if it is too large.
+ * @param in a pointer to the buffer
+ * @param in_len the length in bytes
+ * @param out a pointer to a buffer of at least size in_len
+ * @param out_len a pointer to the compressed length of in 
+ */
+
+void do_lzma_compress(char *in, int in_len, char *out, int *out_len) {
+	std::vector<unsigned char> result;
+	result = LZMACompress(std::vector<unsigned char>(in, in + in_len));
+	*out_len = result.size();
+	if (*out_len < in_len)
+		std::memcpy(out, &result[0], *out_len);
+}
+
+void do_lzma_uncompress(char *dst, int dst_len, char *src, int src_len) {
+	std::vector<unsigned char> result;
+	result = LZMADeCompress(std::vector<unsigned char>(src, src + src_len));
+	if (result.size() <= dst_len)
+		std::memcpy(dst, &result[0], result.size());
+	else
+	{
+		fprintf(stderr, "Not copying %d bytes to %d-byte buffer!\n",
+			result.size(), dst_len);
+		exit(1);
+	}
+}
+
+}
+#endif
+

payloads/bayou/util/pbuilder/main.c

@@ -0,0 +1,82 @@
+/*
+ * This file is part of the bayou project.
+ *
+ * Copyright (C) 2008 Advanced Micro Devices, Inc.
+ *
+ * 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.
+ *
+ * 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., 51 Franklin St, Fifth Floor, Boston, MA  02110-1301 USA
+ */
+
+#include <stdio.h>
+#include <string.h>
+#include <getopt.h>
+#include "pbuilder.h"
+
+static void usage(void)
+{
+	printf("./pbuilder [-c config] [create|show] [LAR]\n");
+}
+
+int main(int argc, char **argv)
+{
+	char *config = NULL;
+
+	while (1) {
+		signed ch = getopt(argc, argv, "c:");
+		if (ch == -1)
+			break;
+
+		switch (ch) {
+		case 'c':
+			config = optarg;
+			break;
+		default:
+			usage();
+			return -1;
+		}
+	}
+
+	if (optind >= argc) {
+		usage();
+		return 0;
+	}
+
+	if (!strcmp(argv[optind], "create")) {
+		if (config == NULL) {
+			warn("E: No config was provided\n");
+			usage();
+			return -1;
+		}
+
+		if (optind + 1 >= argc) {
+			warn("E: No LAR name was given\n");
+			usage();
+			return -1;
+		}
+
+		create_lar_from_config((const char *)config,
+				       (const char *)argv[optind + 1]);
+	} else if (!strcmp(argv[optind], "show")) {
+		if (optind + 1 >= argc) {
+			warn("E: No LAR name was given\n");
+			usage();
+			return -1;
+		}
+		pbuilder_show_lar((const char *)argv[optind + 1]);
+	} else {
+		usage();
+		return -1;
+	}
+
+	return 0;
+}

payloads/bayou/util/pbuilder/pbuilder.h

@@ -0,0 +1,77 @@
+/*
+ * This file is part of the bayou project.
+ *
+ * Copyright (C) 2008 Advanced Micro Devices, Inc.
+ *
+ * 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.
+ *
+ * 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., 51 Franklin St, Fifth Floor, Boston, MA  02110-1301 USA
+ */
+
+#include <stdio.h>
+
+#ifndef PBUILDER_H_
+#define PBUILDER_H_
+
+#include <stdint.h>
+#include <stdio.h>
+
+#define warn(fmt, args...) fprintf(stderr, fmt, ##args)
+#define die(fmt, args...) \
+  do { fprintf(stderr, fmt, ##args); exit(-1); } \
+  while(0)
+
+struct pentry {
+	uint8_t index;
+	uint8_t parent;
+	uint8_t type;
+	uint8_t flags;
+	uint8_t title[64];
+	char *file;
+	char *larname;
+};
+
+struct config {
+	int timeout;
+	int n_entries;
+	struct pentry **entries;
+};
+
+struct bpt_config {
+	uint32_t id;
+	uint8_t timeout;
+	uint8_t entries;
+	uint8_t padding[10];
+};
+
+struct bpt_pentry {
+	uint8_t index;
+	uint8_t parent;
+	uint8_t type;
+	uint8_t flags;
+	uint8_t title[64];
+	uint8_t nlen;
+};
+
+#define BPT_ID            0x30545042
+#define BPT_TYPE_CHOOSER  0x01
+#define BPT_TYPE_CHAIN    0x02
+#define BPT_TYPE_SUBCHAIN 0x03
+
+#define BPT_FLAG_DEFAULT  0x01
+#define BPT_FLAG_NOSHOW   0x02
+
+int pbuilder_show_lar(const char *input);
+int create_lar_from_config(const char *input, const char *output);
+void parseconfig(FILE * stream, struct config *config);
+
+#endif

payloads/bayou/util/pbuilder/show.c

@@ -0,0 +1,131 @@
+/*
+ * This file is part of the bayou project.
+ *
+ * Copyright (C) 2008 Advanced Micro Devices, Inc.
+ *
+ * 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.
+ *
+ * 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., 51 Franklin St, Fifth Floor, Boston, MA  02110-1301 USA
+ */
+
+#include <stdio.h>
+#include "liblar.h"
+#include "pbuilder.h"
+
+void show_subchain(struct bpt_config *cfg, char *fptr, int index)
+{
+	int i;
+	char *ptr = fptr + sizeof(struct bpt_config);
+
+	for (i = 0; i < cfg->entries; i++) {
+		struct bpt_pentry *entry = (struct bpt_pentry *)ptr;
+
+		if (entry->parent == index)
+			printf("      +  %.64s\n",
+			       ptr + sizeof(struct bpt_pentry));
+
+		ptr += (sizeof(struct bpt_pentry) + entry->nlen);
+	}
+}
+
+int show_payloads(struct bpt_config *cfg, char *fptr)
+{
+	int i;
+	char *ptr = fptr + sizeof(struct bpt_config);
+
+	for (i = 0; i < cfg->entries; i++) {
+		struct bpt_pentry *entry = (struct bpt_pentry *)ptr;
+
+		if (entry->parent != 0) {
+			ptr += (sizeof(struct bpt_pentry) + entry->nlen);
+			continue;
+		}
+
+		printf("  ");
+
+		if (entry->flags & BPT_FLAG_DEFAULT)
+			printf("D");
+		else
+			printf(" ");
+
+		if (entry->flags & BPT_FLAG_NOSHOW)
+			printf("N");
+		else
+			printf(" ");
+
+		switch (entry->type) {
+		case BPT_TYPE_CHOOSER:
+			printf("  MENU ");
+			break;
+		case BPT_TYPE_CHAIN:
+			printf("  CHAIN");
+			break;
+		}
+
+		if (entry->title[0] != 0)
+			printf("  %.64s\n", entry->title);
+		else
+			printf("  - no title -\n");
+
+		if (entry->type == BPT_TYPE_CHOOSER)
+			printf("            %.60s\n",
+			       ptr + sizeof(struct bpt_pentry));
+		else
+			show_subchain(cfg, fptr, entry->index);
+
+		ptr += (sizeof(struct bpt_pentry) + entry->nlen);
+	}
+
+	return 0;
+}
+
+int pbuilder_show_lar(const char *input)
+{
+	int ret = -1;
+	struct LAR *lar;
+	struct bpt_config *cfg;
+	struct LARFile *lfile;
+
+	lar = LAR_Open(input);
+
+	if (lar == NULL) {
+		warn("E: Couldn't open LAR %s\n", input);
+		return -1;
+	}
+
+	lfile = LAR_MapFile(lar, "bayou_payload_table");
+
+	if (lfile == NULL) {
+		warn("E: Couldn't find the bayou payload table. Nothing to do.\n");
+		goto err;
+	}
+
+	cfg = (struct bpt_config *)lfile->buffer;
+
+	if (cfg->id != BPT_ID) {
+		warn("E: BPT ID does not match\n");
+		goto err;
+	}
+
+	printf("Bayou Payload Configuration\n");
+	printf("Timeout = %d seconds\n", cfg->timeout);
+
+	printf("Payload List:\n");
+	show_payloads(cfg, lfile->buffer);
+	ret = 0;
+
+err:
+	LAR_CloseFile(lfile);
+	LAR_Close(lar);
+
+	return ret;
+}

payloads/coreinfo/COPYING

@@ -0,0 +1,339 @@
+		    GNU GENERAL PUBLIC LICENSE
+		       Version 2, June 1991
+
+ Copyright (C) 1989, 1991 Free Software Foundation, Inc.,
+ 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
+ Everyone is permitted to copy and distribute verbatim copies
+ of this license document, but changing it is not allowed.
+
+			    Preamble
+
+  The licenses for most software are designed to take away your
+freedom to share and change it.  By contrast, the GNU General Public
+License is intended to guarantee your freedom to share and change free
+software--to make sure the software is free for all its users.  This
+General Public License applies to most of the Free Software
+Foundation's software and to any other program whose authors commit to
+using it.  (Some other Free Software Foundation software is covered by
+the GNU Lesser General Public License instead.)  You can apply it to
+your programs, too.
+
+  When we speak of free software, we are referring to freedom, not
+price.  Our General Public Licenses are designed to make sure that you
+have the freedom to distribute copies of free software (and charge for
+this service if you wish), that you receive source code or can get it
+if you want it, that you can change the software or use pieces of it
+in new free programs; and that you know you can do these things.
+
+  To protect your rights, we need to make restrictions that forbid
+anyone to deny you these rights or to ask you to surrender the rights.
+These restrictions translate to certain responsibilities for you if you
+distribute copies of the software, or if you modify it.
+
+  For example, if you distribute copies of such a program, whether
+gratis or for a fee, you must give the recipients all the rights that
+you have.  You must make sure that they, too, receive or can get the
+source code.  And you must show them these terms so they know their
+rights.
+
+  We protect your rights with two steps: (1) copyright the software, and
+(2) offer you this license which gives you legal permission to copy,
+distribute and/or modify the software.
+
+  Also, for each author's protection and ours, we want to make certain
+that everyone understands that there is no warranty for this free
+software.  If the software is modified by someone else and passed on, we
+want its recipients to know that what they have is not the original, so
+that any problems introduced by others will not reflect on the original
+authors' reputations.
+
+  Finally, any free program is threatened constantly by software
+patents.  We wish to avoid the danger that redistributors of a free
+program will individually obtain patent licenses, in effect making the
+program proprietary.  To prevent this, we have made it clear that any
+patent must be licensed for everyone's free use or not licensed at all.
+
+  The precise terms and conditions for copying, distribution and
+modification follow.
+
+		    GNU GENERAL PUBLIC LICENSE
+   TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION
+
+  0. This License applies to any program or other work which contains
+a notice placed by the copyright holder saying it may be distributed
+under the terms of this General Public License.  The "Program", below,
+refers to any such program or work, and a "work based on the Program"
+means either the Program or any derivative work under copyright law:
+that is to say, a work containing the Program or a portion of it,
+either verbatim or with modifications and/or translated into another
+language.  (Hereinafter, translation is included without limitation in
+the term "modification".)  Each licensee is addressed as "you".
+
+Activities other than copying, distribution and modification are not
+covered by this License; they are outside its scope.  The act of
+running the Program is not restricted, and the output from the Program
+is covered only if its contents constitute a work based on the
+Program (independent of having been made by running the Program).
+Whether that is true depends on what the Program does.
+
+  1. You may copy and distribute verbatim copies of the Program's
+source code as you receive it, in any medium, provided that you
+conspicuously and appropriately publish on each copy an appropriate
+copyright notice and disclaimer of warranty; keep intact all the
+notices that refer to this License and to the absence of any warranty;
+and give any other recipients of the Program a copy of this License
+along with the Program.
+
+You may charge a fee for the physical act of transferring a copy, and
+you may at your option offer warranty protection in exchange for a fee.
+
+  2. You may modify your copy or copies of the Program or any portion
+of it, thus forming a work based on the Program, and copy and
+distribute such modifications or work under the terms of Section 1
+above, provided that you also meet all of these conditions:
+
+    a) You must cause the modified files to carry prominent notices
+    stating that you changed the files and the date of any change.
+
+    b) You must cause any work that you distribute or publish, that in
+    whole or in part contains or is derived from the Program or any
+    part thereof, to be licensed as a whole at no charge to all third
+    parties under the terms of this License.
+
+    c) If the modified program normally reads commands interactively
+    when run, you must cause it, when started running for such
+    interactive use in the most ordinary way, to print or display an
+    announcement including an appropriate copyright notice and a
+    notice that there is no warranty (or else, saying that you provide
+    a warranty) and that users may redistribute the program under
+    these conditions, and telling the user how to view a copy of this
+    License.  (Exception: if the Program itself is interactive but
+    does not normally print such an announcement, your work based on
+    the Program is not required to print an announcement.)
+
+These requirements apply to the modified work as a whole.  If
+identifiable sections of that work are not derived from the Program,
+and can be reasonably considered independent and separate works in
+themselves, then this License, and its terms, do not apply to those
+sections when you distribute them as separate works.  But when you
+distribute the same sections as part of a whole which is a work based
+on the Program, the distribution of the whole must be on the terms of
+this License, whose permissions for other licensees extend to the
+entire whole, and thus to each and every part regardless of who wrote it.
+
+Thus, it is not the intent of this section to claim rights or contest
+your rights to work written entirely by you; rather, the intent is to
+exercise the right to control the distribution of derivative or
+collective works based on the Program.
+
+In addition, mere aggregation of another work not based on the Program
+with the Program (or with a work based on the Program) on a volume of
+a storage or distribution medium does not bring the other work under
+the scope of this License.
+
+  3. You may copy and distribute the Program (or a work based on it,
+under Section 2) in object code or executable form under the terms of
+Sections 1 and 2 above provided that you also do one of the following:
+
+    a) Accompany it with the complete corresponding machine-readable
+    source code, which must be distributed under the terms of Sections
+    1 and 2 above on a medium customarily used for software interchange; or,
+
+    b) Accompany it with a written offer, valid for at least three
+    years, to give any third party, for a charge no more than your
+    cost of physically performing source distribution, a complete
+    machine-readable copy of the corresponding source code, to be
+    distributed under the terms of Sections 1 and 2 above on a medium
+    customarily used for software interchange; or,
+
+    c) Accompany it with the information you received as to the offer
+    to distribute corresponding source code.  (This alternative is
+    allowed only for noncommercial distribution and only if you
+    received the program in object code or executable form with such
+    an offer, in accord with Subsection b above.)
+
+The source code for a work means the preferred form of the work for
+making modifications to it.  For an executable work, complete source
+code means all the source code for all modules it contains, plus any
+associated interface definition files, plus the scripts used to
+control compilation and installation of the executable.  However, as a
+special exception, the source code distributed need not include
+anything that is normally distributed (in either source or binary
+form) with the major components (compiler, kernel, and so on) of the
+operating system on which the executable runs, unless that component
+itself accompanies the executable.
+
+If distribution of executable or object code is made by offering
+access to copy from a designated place, then offering equivalent
+access to copy the source code from the same place counts as
+distribution of the source code, even though third parties are not
+compelled to copy the source along with the object code.
+
+  4. You may not copy, modify, sublicense, or distribute the Program
+except as expressly provided under this License.  Any attempt
+otherwise to copy, modify, sublicense or distribute the Program is
+void, and will automatically terminate your rights under this License.
+However, parties who have received copies, or rights, from you under
+this License will not have their licenses terminated so long as such
+parties remain in full compliance.
+
+  5. You are not required to accept this License, since you have not
+signed it.  However, nothing else grants you permission to modify or
+distribute the Program or its derivative works.  These actions are
+prohibited by law if you do not accept this License.  Therefore, by
+modifying or distributing the Program (or any work based on the
+Program), you indicate your acceptance of this License to do so, and
+all its terms and conditions for copying, distributing or modifying
+the Program or works based on it.
+
+  6. Each time you redistribute the Program (or any work based on the
+Program), the recipient automatically receives a license from the
+original licensor to copy, distribute or modify the Program subject to
+these terms and conditions.  You may not impose any further
+restrictions on the recipients' exercise of the rights granted herein.
+You are not responsible for enforcing compliance by third parties to
+this License.
+
+  7. If, as a consequence of a court judgment or allegation of patent
+infringement or for any other reason (not limited to patent issues),
+conditions are imposed on you (whether by court order, agreement or
+otherwise) that contradict the conditions of this License, they do not
+excuse you from the conditions of this License.  If you cannot
+distribute so as to satisfy simultaneously your obligations under this
+License and any other pertinent obligations, then as a consequence you
+may not distribute the Program at all.  For example, if a patent
+license would not permit royalty-free redistribution of the Program by
+all those who receive copies directly or indirectly through you, then
+the only way you could satisfy both it and this License would be to
+refrain entirely from distribution of the Program.
+
+If any portion of this section is held invalid or unenforceable under
+any particular circumstance, the balance of the section is intended to
+apply and the section as a whole is intended to apply in other
+circumstances.
+
+It is not the purpose of this section to induce you to infringe any
+patents or other property right claims or to contest validity of any
+such claims; this section has the sole purpose of protecting the
+integrity of the free software distribution system, which is
+implemented by public license practices.  Many people have made
+generous contributions to the wide range of software distributed
+through that system in reliance on consistent application of that
+system; it is up to the author/donor to decide if he or she is willing
+to distribute software through any other system and a licensee cannot
+impose that choice.
+
+This section is intended to make thoroughly clear what is believed to
+be a consequence of the rest of this License.
+
+  8. If the distribution and/or use of the Program is restricted in
+certain countries either by patents or by copyrighted interfaces, the
+original copyright holder who places the Program under this License
+may add an explicit geographical distribution limitation excluding
+those countries, so that distribution is permitted only in or among
+countries not thus excluded.  In such case, this License incorporates
+the limitation as if written in the body of this License.
+
+  9. The Free Software Foundation may publish revised and/or new versions
+of the General Public License from time to time.  Such new versions will
+be similar in spirit to the present version, but may differ in detail to
+address new problems or concerns.
+
+Each version is given a distinguishing version number.  If the Program
+specifies a version number of this License which applies to it and "any
+later version", you have the option of following the terms and conditions
+either of that version or of any later version published by the Free
+Software Foundation.  If the Program does not specify a version number of
+this License, you may choose any version ever published by the Free Software
+Foundation.
+
+  10. If you wish to incorporate parts of the Program into other free
+programs whose distribution conditions are different, write to the author
+to ask for permission.  For software which is copyrighted by the Free
+Software Foundation, write to the Free Software Foundation; we sometimes
+make exceptions for this.  Our decision will be guided by the two goals
+of preserving the free status of all derivatives of our free software and
+of promoting the sharing and reuse of software generally.
+
+			    NO WARRANTY
+
+  11. BECAUSE THE PROGRAM IS LICENSED FREE OF CHARGE, THERE IS NO WARRANTY
+FOR THE PROGRAM, TO THE EXTENT PERMITTED BY APPLICABLE LAW.  EXCEPT WHEN
+OTHERWISE STATED IN WRITING THE COPYRIGHT HOLDERS AND/OR OTHER PARTIES
+PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED
+OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
+MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE.  THE ENTIRE RISK AS
+TO THE QUALITY AND PERFORMANCE OF THE PROGRAM IS WITH YOU.  SHOULD THE
+PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF ALL NECESSARY SERVICING,
+REPAIR OR CORRECTION.
+
+  12. IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING
+WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MAY MODIFY AND/OR
+REDISTRIBUTE THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES,
+INCLUDING ANY GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING
+OUT OF THE USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED
+TO LOSS OF DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY
+YOU OR THIRD PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER
+PROGRAMS), EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE
+POSSIBILITY OF SUCH DAMAGES.
+
+		     END OF TERMS AND CONDITIONS
+
+	    How to Apply These Terms to Your New Programs
+
+  If you develop a new program, and you want it to be of the greatest
+possible use to the public, the best way to achieve this is to make it
+free software which everyone can redistribute and change under these terms.
+
+  To do so, attach the following notices to the program.  It is safest
+to attach them to the start of each source file to most effectively
+convey the exclusion of warranty; and each file should have at least
+the "copyright" line and a pointer to where the full notice is found.
+
+    <one line to give the program's name and a brief idea of what it does.>
+    Copyright (C) <year>  <name of author>
+
+    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.,
+    51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
+
+Also add information on how to contact you by electronic and paper mail.
+
+If the program is interactive, make it output a short notice like this
+when it starts in an interactive mode:
+
+    Gnomovision version 69, Copyright (C) year name of author
+    Gnomovision comes with ABSOLUTELY NO WARRANTY; for details type `show w'.
+    This is free software, and you are welcome to redistribute it
+    under certain conditions; type `show c' for details.
+
+The hypothetical commands `show w' and `show c' should show the appropriate
+parts of the General Public License.  Of course, the commands you use may
+be called something other than `show w' and `show c'; they could even be
+mouse-clicks or menu items--whatever suits your program.
+
+You should also get your employer (if you work as a programmer) or your
+school, if any, to sign a "copyright disclaimer" for the program, if
+necessary.  Here is a sample; alter the names:
+
+  Yoyodyne, Inc., hereby disclaims all copyright interest in the program
+  `Gnomovision' (which makes passes at compilers) written by James Hacker.
+
+  <signature of Ty Coon>, 1 April 1989
+  Ty Coon, President of Vice
+
+This General Public License does not permit incorporating your program into
+proprietary programs.  If your program is a subroutine library, you may
+consider it more useful to permit linking proprietary applications with the
+library.  If this is what you want to do, use the GNU Lesser General
+Public License instead of this License.

payloads/coreinfo/Kconfig

@@ -0,0 +1,116 @@
+##
+## This file is part of the coreinfo project.
+##
+## Copyright (C) 2008 Uwe Hermann <uwe@hermann-uwe.de>
+##
+## 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; version 2 of the License.
+##
+## 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., 51 Franklin St, Fifth Floor, Boston, MA  02110-1301 USA
+##
+
+#
+# For a description of the syntax of this configuration file,
+# see http://lxr.linux.no/source/Documentation/kbuild/kconfig-language.txt.
+#
+
+mainmenu "coreinfo Configuration"
+
+menu "General settings"
+
+# TODO: Needs changes in coreinfo, won't update without keypress currently.
+config SHOW_DATE_TIME
+	bool "Show current date/time in the menu"
+	default y
+	help
+	  Show the current date and time in the lower-right corner of
+	  the coreinfo menu.
+
+	  This option will increase the ELF file size by ca. 250 bytes.
+
+config PAYLOAD_INFO_NAME
+	string "Payload name"
+	default "coreinfo"
+	help
+	  The name of this payload for use in (e.g.) Bayou.
+
+config PAYLOAD_INFO_LISTNAME
+	string "Payload menu entry name"
+	default "System Information"
+	help
+	  The name of this payload's menu entry for use in (e.g.) Bayou.
+
+config PAYLOAD_INFO_DESC
+	string "Payload description"
+	default "Display information about the system"
+	help
+	  The description of this payload for use in (e.g.) Bayou.
+
+config PAYLOAD_INFO_VERSION
+	string "Payload version"
+	default "0.1"
+	help
+	  The version number of this payload.
+
+endmenu
+
+menu "Modules"
+
+config MODULE_COREBOOT
+	bool "Enable the coreboot module"
+	default y
+	help
+	  This option will increase the ELF file size by ca. 2250 bytes.
+
+config MODULE_MULTIBOOT
+	bool "Enable the multiboot module"
+	default y
+	help
+	  This option will increase the ELF file size by ca. 1790 bytes.
+
+config MODULE_CPUINFO
+	bool "Enable the cpuinfo module"
+	default y
+	help
+	  This option will increase the ELF file size by ca. 2650 bytes.
+
+config MODULE_PCI
+	bool "Enable the PCI info module"
+	default y
+	help
+	  This option will increase the ELF file size by ca. 1750 bytes.
+
+config MODULE_NVRAM
+	bool "Enable the NVRAM dump module"
+	default y
+	help
+	  This option will increase the ELF file size by ca. 350 bytes.
+
+config MODULE_BOOTLOG
+	bool "Enable the coreboot bootlog module"
+	default y
+
+config MODULE_RAMDUMP
+	bool "Enable the RAM dump module"
+	default y
+
+config MODULE_LAR
+	bool "Enable the coreboot LAR module"
+	default y
+
+config MODULE_CBFS
+	bool "Enable the coreboot CBFS module"
+	default y
+	help
+	  This option will increase the ELF file size by ca. 1440 bytes.
+
+endmenu
+

payloads/coreinfo/Makefile

@@ -0,0 +1,99 @@
+##
+## This file is part of the coreinfo project.
+##
+## Copyright (C) 2008 Advanced Micro Devices, Inc.
+## Copyright (C) 2008 Uwe Hermann <uwe@hermann-uwe.de>
+##
+## 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; version 2 of the License.
+##
+## 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., 51 Franklin St, Fifth Floor, Boston, MA  02110-1301 USA
+##
+
+export src := $(shell pwd)
+export srctree := $(src)
+export srck := $(src)/util/kconfig
+export obj := $(src)/build
+export objk := $(src)/build/util/kconfig
+
+export KERNELVERSION      := 0.1.0
+export KCONFIG_AUTOHEADER := $(obj)/config.h
+export KCONFIG_AUTOCONFIG := $(obj)/auto.conf
+
+CONFIG_SHELL := sh
+KBUILD_DEFCONFIG := configs/defconfig
+UNAME_RELEASE := $(shell uname -r)
+HAVE_DOTCONFIG := $(wildcard .config)
+MAKEFLAGS += -rR --no-print-directory
+
+# Make is silent per default, but 'make V=1' will show all compiler calls.
+ifneq ($(V),1)
+Q := @
+endif
+
+HOSTCC = gcc
+HOSTCXX = g++
+HOSTCFLAGS := -I$(srck) -I$(objk)
+HOSTCXXFLAGS := -I$(srck) -I$(objk)
+
+LIBPAYLOAD_DIR := ../libpayload
+XCC := CC=$(CC) $(LIBPAYLOAD_DIR)/bin/lpgcc
+AS = $(LIBPAYLOAD_DIR)/bin/lpas
+STRIP ?= strip
+
+INCLUDES = -Ibuild
+CFLAGS := -Wall -Werror -Os $(INCLUDES)
+OBJECTS = cpuinfo_module.o cpuid.S.o pci_module.o coreboot_module.o \
+	  nvram_module.o bootlog_module.o ramdump_module.o lar_module.o \
+	  multiboot_module.o cbfs_module.o coreinfo.o
+OBJS    = $(patsubst %,$(obj)/%,$(OBJECTS))
+TARGET  = $(obj)/coreinfo.elf
+
+ifeq ($(strip $(HAVE_DOTCONFIG)),)
+
+all: config
+
+else
+
+include $(src)/.config
+
+all: $(TARGET)
+
+$(TARGET): $(src)/.config $(OBJS) prepare
+	$(Q)printf "  LD      $(subst $(shell pwd)/,,$(@))\n"
+	$(Q)$(XCC) -o $@ $(OBJS)
+	$(Q)printf "  STRIP   $(subst $(shell pwd)/,,$(@))\n"
+	$(Q)$(STRIP) -s $@
+
+$(obj)/%.S.o: $(src)/%.S
+	$(Q)printf "  AS      $(subst $(shell pwd)/,,$(@))\n"
+	$(Q)$(AS) -o $@ $<
+
+$(obj)/%.o: $(src)/%.c
+	$(Q)printf "  CC      $(subst $(shell pwd)/,,$(@))\n"
+	$(Q)$(XCC) $(CFLAGS) -c -o $@ $<
+
+endif
+
+prepare:
+	$(Q)mkdir -p $(obj)/util/kconfig/lxdialog
+
+clean:
+	$(Q)rm -rf build/*.elf build/*.o
+
+distclean: clean
+	$(Q)rm -rf build
+	$(Q)rm -f .config .config.old ..config.tmp .kconfig.d .tmpconfig*
+
+include util/kconfig/Makefile
+
+.PHONY: $(PHONY) prepare clean distclean
+

payloads/coreinfo/README

@@ -0,0 +1,3 @@
+This is a silly little program that demonstrates how cool libpayload is
+and also serves a purpose.  Its fun and educational!
+

payloads/coreinfo/bootlog_module.c

@@ -0,0 +1,143 @@
+/*
+ * This file is part of the coreinfo project.
+ *
+ * Copyright (C) 2008 Uwe Hermann <uwe@hermann-uwe.de>
+ *
+ * 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; version 2 of the License.
+ *
+ * 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., 51 Franklin St, Fifth Floor, Boston, MA  02110-1301 USA
+ */
+
+#include "coreinfo.h"
+
+#ifdef CONFIG_MODULE_BOOTLOG
+
+#define CONFIG_COREBOOT_PRINTK_BUFFER_ADDR 0x90000
+#define CONFIG_COREBOOT_PRINTK_BUFFER_SIZE 65536
+
+static char *buf;
+static s32 cursor = 0;
+static s32 cursor_max;
+
+static int bootlog_module_init(void)
+{
+	int i;
+	volatile unsigned long *ptr =
+		(void *)(CONFIG_COREBOOT_PRINTK_BUFFER_ADDR + 16); /* FIXME */
+
+	buf = malloc(CONFIG_COREBOOT_PRINTK_BUFFER_SIZE);
+	if (!buf) {
+		/* TODO */
+	}
+
+	memcpy(buf, (char *)ptr, CONFIG_COREBOOT_PRINTK_BUFFER_SIZE);
+
+	cursor_max = CONFIG_COREBOOT_PRINTK_BUFFER_SIZE;
+	for (i = 0; i < 20; i++) {
+		do {
+			cursor_max--;
+		} while (*(buf + cursor_max) != '\n');
+	}
+	cursor_max++;	/* Stay _behind_ the newline. */
+
+	/* TODO: Maybe a _cleanup hook where we call free()? */
+
+	return 0;
+}
+
+static int bootlog_module_redraw(WINDOW *win)
+{
+	int x = 0, y = 0;
+	char *tmp = buf + cursor;
+
+	print_module_title(win, "Coreboot Bootlog");
+
+	/* FIXME: Handle lines longer than 80 characters. */
+	while (y <= 18) {
+		mvwaddch(win, y + 2, x, isprint(*tmp) ? *tmp : ' ');
+		x++;
+		tmp++;
+		if (*tmp == '\n') {
+			y++;
+			x = 0;
+			tmp++;		/* Skip the newline. */
+		}
+	}
+
+	return 0;
+}
+
+/* TODO: Simplify code. */
+static int bootlog_module_handle(int key)
+{
+	int i;
+
+	switch (key) {
+	case KEY_DOWN:
+		if (cursor == cursor_max)
+			return 0;
+		while (*(buf + cursor) != '\n')
+			cursor++;
+		cursor++;	/* Skip the newline. */
+		break;
+	case KEY_UP:
+		if (cursor == 0)
+			return 0;
+		cursor--;	/* Skip the newline. */
+		do {
+			cursor--;
+		} while (*(buf + cursor) != '\n');
+		cursor++;	/* Stay _behind_ the newline. */
+		break;
+	case KEY_NPAGE:
+		if (cursor == cursor_max)
+			return 0;
+		for (i = 0; i < 20; i++) {
+			while (*(buf + cursor) != '\n')
+				cursor++;
+			cursor++;	/* Skip the newline. */
+		}
+		break;
+	case KEY_PPAGE:
+		if (cursor == 0)
+			return 0;
+		for (i = 0; i < 20; i++) {
+			do {
+				cursor--;
+			} while (*(buf + cursor) != '\n');
+		}
+		cursor++;	/* Stay _behind_ the newline. */
+		break;
+	}
+
+	if (cursor > cursor_max)
+		cursor = cursor_max;
+
+	if (cursor < 0)
+		cursor = 0;
+
+	return 1;
+}
+
+struct coreinfo_module bootlog_module = {
+	.name = "Bootlog",
+	.init = bootlog_module_init,
+	.redraw = bootlog_module_redraw,
+	.handle = bootlog_module_handle,
+};
+
+#else
+
+struct coreinfo_module bootlog_module = {
+};
+
+#endif

payloads/coreinfo/cbfs_module.c

@@ -0,0 +1,221 @@
+/*
+ * This file is part of the coreinfo project.
+ *
+ * Copyright (C) 2009 Uwe Hermann <uwe@hermann-uwe.de>
+ *
+ * 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; version 2 of the License.
+ *
+ * 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., 51 Franklin St, Fifth Floor, Boston, MA  02110-1301 USA
+ */
+
+#include "coreinfo.h"
+#include "arch/endian.h"
+
+#ifdef CONFIG_MODULE_CBFS
+
+#define ALIGN(_v, _a) (((_v) + ((_a) - 1)) & ~((_a) - 1))
+
+#define HEADER_MAGIC		0x4F524243
+#define HEADER_ADDR		0xfffffffc
+#define LARCHIVE_MAGIC		0x455649484352414cLL	/* "LARCHIVE" */
+
+#define COMPONENT_DELETED	0x00
+#define COMPONENT_STAGE		0x10
+#define COMPONENT_PAYLOAD	0x20
+#define COMPONENT_OPTIONROM	0x30
+#define COMPONENT_NULL		0xffffffff
+
+struct cbheader {
+	u32 magic;
+	u32 version;
+	u32 romsize;
+	u32 bootblocksize;
+	u32 align;
+	u32 offset;
+	u32 pad[2];
+} __attribute__ ((packed));
+
+struct cbfile {
+	u64 magic;
+	u32 len;
+	u32 type;
+	u32 checksum;
+	u32 offset;
+	char filename[0];
+} __attribute__ ((packed));
+
+static int filecount = 0, selected = 0;
+static char **filenames;
+static struct cbheader *header = NULL;
+
+static struct cbfile *getfile(struct cbfile *f)
+{
+	while (1) {
+		if (f < (struct cbfile *)(0xffffffff - ntohl(header->romsize)))
+			return NULL;
+		if (f->magic == 0)
+			return NULL;
+		if (f->magic == LARCHIVE_MAGIC)
+			return f;
+		f = (void *)f + ntohl(header->align);
+	}
+}
+
+static struct cbfile *firstfile(void)
+{
+	return getfile((void *)(0 - ntohl(header->romsize) +
+				ntohl(header->offset)));
+}
+
+static struct cbfile *nextfile(struct cbfile *f)
+{
+	f = (void *)f + ALIGN(ntohl(f->len) + ntohl(f->offset),
+			      ntohl(header->align));
+	return getfile(f);
+}
+
+static struct cbfile *findfile(const char *filename)
+{
+	struct cbfile *f;
+	for (f = firstfile(); f; f = nextfile(f)) {
+		if (strcmp(filename, f->filename) == 0)
+			return f;
+	}
+	return NULL;
+}
+
+static int cbfs_module_init(void)
+{
+	struct cbfile *f;
+	int index = 0;
+
+	header = *(void **)HEADER_ADDR;
+	if (header->magic != ntohl(HEADER_MAGIC)) {
+		header = NULL;
+		return 0;
+	}
+
+	for (f = firstfile(); f; f = nextfile(f))
+		filecount++;
+
+	filenames = malloc(filecount * sizeof(char *));
+	if (filenames == NULL)
+		return 0;
+
+	for (f = firstfile(); f; f = nextfile(f))
+		filenames[index++] = strdup((const char *)f->filename);
+
+	return 0;
+}
+
+static int cbfs_module_redraw(WINDOW * win)
+{
+	struct cbfile *f;
+	int i, row = 2;
+
+	print_module_title(win, "CBFS Listing");
+
+	if (!header) {
+		mvwprintw(win, 11, 61 / 2, "Bad or missing CBFS header");
+		return 0;
+	}
+
+	/* Draw a line down the middle. */
+	for (i = 2; i < 21; i++)
+		mvwaddch(win, i, 30, ACS_VLINE);
+
+	/* Draw the names down the left side. */
+	for (i = 0; i < filecount; i++) {
+		if (i == selected)
+			wattrset(win, COLOR_PAIR(3) | A_BOLD);
+		else
+			wattrset(win, COLOR_PAIR(2));
+		if (i == filecount - 1)
+			mvwprintw(win, 2 + i, 1, "<free space>");
+		else
+			mvwprintw(win, 2 + i, 1, "%.25s", filenames[i]);
+	}
+
+	f = findfile(filenames[selected]);
+	if (!f) {
+		mvwprintw(win, 11, 32, "ERROR: CBFS component not found");
+		return 0;
+	}
+
+	wattrset(win, COLOR_PAIR(2));
+
+	/* mvwprintw(win, row++, 32, "Offset: 0x%x", f->offset); *//* FIXME */
+	mvwprintw(win, row, 32, "Type: ");
+	switch (ntohl(f->type)) {
+	case COMPONENT_STAGE:
+		mvwprintw(win, row++, 38, "stage");
+		break;
+	case COMPONENT_PAYLOAD:
+		mvwprintw(win, row++, 38, "payload");
+		break;
+	case COMPONENT_OPTIONROM:
+		mvwprintw(win, row++, 38, "optionrom");
+		break;
+	case COMPONENT_NULL:
+		mvwprintw(win, row++, 38, "free");
+		break;
+	case COMPONENT_DELETED:
+		mvwprintw(win, row++, 38, "deleted");
+		break;
+	default:
+		mvwprintw(win, row++, 38, "Unknown (0x%x)", ntohl(f->type));
+		break;
+	}
+	mvwprintw(win, row++, 32, "Size: %d", ntohl(f->len));
+	mvwprintw(win, row++, 32, "Checksum: 0x%x", ntohl(f->checksum));
+
+	return 0;
+}
+
+static int cbfs_module_handle(int key)
+{
+	int ret = 0;
+
+	if (filecount == 0)
+		return 0;
+
+	switch (key) {
+	case KEY_DOWN:
+		if (selected + 1 < filecount) {
+			selected++;
+			ret = 1;
+		}
+		break;
+	case KEY_UP:
+		if (selected > 0) {
+			selected--;
+			ret = 1;
+		}
+		break;
+	}
+
+	return ret;
+}
+
+struct coreinfo_module cbfs_module = {
+	.name = "CBFS",
+	.init = cbfs_module_init,
+	.redraw = cbfs_module_redraw,
+	.handle = cbfs_module_handle
+};
+
+#else
+
+struct coreinfo_module cbfs_module = {
+};
+
+#endif

payloads/coreinfo/coreboot_module.c

@@ -0,0 +1,266 @@
+/*
+ * This file is part of the coreinfo project.
+ *
+ * Copyright (C) 2008 Advanced Micro Devices, Inc.
+ *
+ * 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; version 2 of the License.
+ *
+ * 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., 51 Franklin St, Fifth Floor, Boston, MA  02110-1301 USA
+ */
+
+#include <coreboot_tables.h>
+#include "coreinfo.h"
+
+#ifdef CONFIG_MODULE_COREBOOT
+
+#define MAX_MEMORY_COUNT 5
+
+static struct {
+	int mem_count;
+	int mem_actual;
+
+	struct cb_memory_range range[MAX_MEMORY_COUNT];
+
+	char vendor[32];
+	char part[32];
+
+	char strings[10][64];
+
+	struct cb_serial serial;
+	struct cb_console console;
+} cb_info;
+
+static int tables_good = 0;
+
+int coreboot_module_redraw(WINDOW *win)
+{
+	int row = 2;
+	int i;
+
+	print_module_title(win, "Coreboot Tables");
+
+	if (tables_good) {
+		mvwprintw(win, row++, 1, "No Coreboot tables were found");
+		return 0;
+	}
+
+	mvwprintw(win, row++, 1, "Vendor: %s", cb_info.vendor);
+	mvwprintw(win, row++, 1, "Part: %s", cb_info.part);
+
+	mvwprintw(win, row++, 1, "Version: %s%s",
+		  cb_info.strings[CB_TAG_VERSION - 0x4],
+		  cb_info.strings[CB_TAG_EXTRA_VERSION - 0x4]);
+
+	mvwprintw(win, row++, 1, "Built: %s (%s@%s.%s)",
+		  cb_info.strings[CB_TAG_BUILD - 0x4],
+		  cb_info.strings[CB_TAG_COMPILE_BY - 0x04],
+		  cb_info.strings[CB_TAG_COMPILE_HOST - 0x04],
+		  cb_info.strings[CB_TAG_COMPILE_DOMAIN - 0x04]);
+
+	if (cb_info.serial.tag != 0x0) {
+		mvwprintw(win, row++, 1, "Serial Port I/O base: 0x%x",
+			  cb_info.serial.ioport);
+	}
+
+	if (cb_info.console.tag != 0x0) {
+		mvwprintw(win, row++, 1, "Default Output Console: ");
+
+		switch (cb_info.console.type) {
+		case CB_TAG_CONSOLE_SERIAL8250:
+			wprintw(win, "Serial Port");
+			break;
+		case CB_TAG_CONSOLE_VGA:
+			wprintw(win, "VGA");
+			break;
+		case CB_TAG_CONSOLE_BTEXT:
+			wprintw(win, "BTEXT");
+			break;
+		case CB_TAG_CONSOLE_LOGBUF:
+			wprintw(win, "Log Buffer");
+			break;
+		case CB_TAG_CONSOLE_SROM:
+			wprintw(win, "Serial ROM");
+			break;
+		case CB_TAG_CONSOLE_EHCI:
+			wprintw(win, "USB Debug");
+			break;
+		}
+	}
+
+	row++;
+	mvwprintw(win, row++, 1, "-- Memory Map --");
+
+	for (i = 0; i < cb_info.mem_count; i++) {
+		switch (cb_info.range[i].type) {
+		case CB_MEM_RAM:
+			mvwprintw(win, row++, 3, "     RAM: ");
+			break;
+		case CB_MEM_RESERVED:
+			mvwprintw(win, row++, 3, "Reserved: ");
+			break;
+		case CB_MEM_TABLE:
+			mvwprintw(win, row++, 3, "   Table: ");
+		}
+
+		wprintw(win, "%16.16llx - %16.16llx",
+			UNPACK_CB64(cb_info.range[i].start),
+			UNPACK_CB64(cb_info.range[i].start) +
+			UNPACK_CB64(cb_info.range[i].size) - 1);
+	}
+
+	return 0;
+}
+
+static void parse_memory(unsigned char *ptr)
+{
+	struct cb_memory *mem = (struct cb_memory *)ptr;
+	int max = (MEM_RANGE_COUNT(mem) > MAX_MEMORY_COUNT)
+	    ? MAX_MEMORY_COUNT : MEM_RANGE_COUNT(mem);
+	int i;
+
+	for (i = 0; i < max; i++) {
+		struct cb_memory_range *range =
+		    (struct cb_memory_range *)MEM_RANGE_PTR(mem, i);
+
+		memcpy(&cb_info.range[i], range, sizeof(*range));
+	}
+
+	cb_info.mem_count = max;
+	cb_info.mem_actual = MEM_RANGE_COUNT(mem);
+}
+
+static void parse_mainboard(unsigned char *ptr)
+{
+	struct cb_mainboard *mb = (struct cb_mainboard *)ptr;
+
+	strncpy(cb_info.vendor, (const char *)MB_VENDOR_STRING(mb), 31);
+	strncpy(cb_info.part, (const char *)MB_PART_STRING(mb), 31);
+}
+
+static void parse_strings(unsigned char *ptr)
+{
+	struct cb_string *string = (struct cb_string *)ptr;
+	int index = string->tag - CB_TAG_VERSION;
+
+	strncpy(cb_info.strings[index], (const char *)string->string, 63);
+	cb_info.strings[index][63] = 0;
+}
+
+static void parse_serial(unsigned char *ptr)
+{
+	memcpy(&cb_info.serial, (struct cb_serial *)ptr,
+	       sizeof(struct cb_serial));
+}
+
+static void parse_console(unsigned char *ptr)
+{
+	memcpy(&cb_info.console, (struct cb_console *)ptr,
+	       sizeof(struct cb_console));
+}
+
+static int parse_header(void *addr, int len)
+{
+	struct cb_header *header;
+	unsigned char *ptr = (unsigned char *)addr;
+	int i;
+
+	for (i = 0; i < len; i += 16, ptr += 16) {
+		header = (struct cb_header *)ptr;
+
+		if (!strncmp((const char *)header->signature, "LBIO", 4))
+			break;
+	}
+
+	/* We walked the entire space and didn't find anything. */
+	if (i >= len)
+		return -1;
+
+	if (!header->table_bytes)
+		return 0;
+
+	/* FIXME: Check the checksum. */
+
+	if (ipchksum((uint16_t *) header, sizeof(*header)))
+		return -1;
+
+	if (ipchksum((uint16_t *) (ptr + sizeof(*header)), header->table_bytes)
+	    != header->table_checksum)
+		return -1;
+
+	/* Now, walk the tables. */
+	ptr += header->header_bytes;
+
+	for (i = 0; i < header->table_entries; i++) {
+		struct cb_record *rec = (struct cb_record *)ptr;
+
+		switch (rec->tag) {
+		case CB_TAG_FORWARD:
+			return parse_header((void *)(unsigned long)((struct cb_forward *)rec)->forward, 1);
+			break;
+		case CB_TAG_MEMORY:
+			parse_memory(ptr);
+			break;
+		case CB_TAG_MAINBOARD:
+			parse_mainboard(ptr);
+			break;
+		case CB_TAG_VERSION:
+		case CB_TAG_EXTRA_VERSION:
+		case CB_TAG_BUILD:
+		case CB_TAG_COMPILE_TIME:
+		case CB_TAG_COMPILE_BY:
+		case CB_TAG_COMPILE_HOST:
+		case CB_TAG_COMPILE_DOMAIN:
+		case CB_TAG_COMPILER:
+		case CB_TAG_LINKER:
+		case CB_TAG_ASSEMBLER:
+			parse_strings(ptr);
+			break;
+		case CB_TAG_SERIAL:
+			parse_serial(ptr);
+			break;
+		case CB_TAG_CONSOLE:
+			parse_console(ptr);
+			break;
+		default:
+			break;
+		}
+
+		ptr += rec->size;
+	}
+
+	return 1;
+}
+
+static int coreboot_module_init(void)
+{
+	int ret = parse_header((void *)0x00000, 0x1000);
+
+	if (ret != 1)
+		ret = parse_header((void *)0xf0000, 0x1000);
+
+	/* Return error if we couldn't find it at either address. */
+	tables_good = (ret == 1) ? 0 : -1;
+	return tables_good;
+}
+
+struct coreinfo_module coreboot_module = {
+	.name = "Coreboot",
+	.init = coreboot_module_init,
+	.redraw = coreboot_module_redraw,
+};
+
+#else
+
+struct coreinfo_module coreboot_module = {
+};
+
+#endif

payloads/coreinfo/coreinfo.c

@@ -0,0 +1,301 @@
+/*
+ * This file is part of the coreinfo project.
+ *
+ * Copyright (C) 2008 Advanced Micro Devices, Inc.
+ *
+ * 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; version 2 of the License.
+ *
+ * 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., 51 Franklin St, Fifth Floor, Boston, MA  02110-1301 USA
+ */
+
+#include "coreinfo.h"
+
+#define SCREEN_Y 25
+#define SCREEN_X 80
+
+#define KEY_ESC 27
+
+extern struct coreinfo_module cpuinfo_module;
+extern struct coreinfo_module pci_module;
+extern struct coreinfo_module coreboot_module;
+extern struct coreinfo_module multiboot_module;
+extern struct coreinfo_module nvram_module;
+extern struct coreinfo_module bootlog_module;
+extern struct coreinfo_module ramdump_module;
+extern struct coreinfo_module lar_module;
+extern struct coreinfo_module cbfs_module;
+
+struct coreinfo_module *system_modules[] = {
+#ifdef CONFIG_MODULE_CPUINFO
+	&cpuinfo_module,
+#endif
+#ifdef CONFIG_MODULE_PCI
+	&pci_module,
+#endif
+#ifdef CONFIG_MODULE_NVRAM
+	&nvram_module,
+#endif
+#ifdef CONFIG_MODULE_RAMDUMP
+	&ramdump_module,
+#endif
+};
+
+struct coreinfo_module *firmware_modules[] = {
+#ifdef CONFIG_MODULE_COREBOOT
+	&coreboot_module,
+#endif
+#ifdef CONFIG_MODULE_MULTIBOOT
+	&multiboot_module,
+#endif
+#ifdef CONFIG_MODULE_BOOTLOG
+	&bootlog_module,
+#endif
+#ifdef CONFIG_MODULE_LAR
+	&lar_module,
+#endif
+#ifdef CONFIG_MODULE_CBFS
+	&cbfs_module,
+#endif
+};
+
+struct coreinfo_cat {
+	char name[15];
+	int cur;
+	int count;
+	struct coreinfo_module **modules;
+} categories[] = {
+	{
+		.name = "System",
+		.modules = system_modules,
+		.count = ARRAY_SIZE(system_modules),
+	},
+	{
+		.name = "Firmware",
+		.modules = firmware_modules,
+		.count = ARRAY_SIZE(firmware_modules),
+	}
+};
+
+static WINDOW *modwin, *menuwin;
+static int curwin;
+
+void print_module_title(WINDOW *win, const char *title)
+{
+	int i;
+
+	wattrset(win, COLOR_PAIR(2));
+	mvwprintw(win, 0, 1, title);
+
+	wmove(win, 1, 1);
+	for (i = 0; i < 78; i++)
+		waddch(win, ACS_HLINE);
+}
+
+static void print_submenu(struct coreinfo_cat *cat)
+{
+	int i, j;
+	char menu[80];
+	char *ptr = menu;
+
+	wmove(menuwin, 0, 0);
+
+	for (j = 0; j < SCREEN_X; j++)
+		waddch(menuwin, ' ');
+
+	if (!cat->count)
+		return;
+
+	for (i = 0; i < cat->count; i++)
+		ptr += sprintf(ptr, "[%c: %s] ", 'A' + i,
+			       cat->modules[i]->name);
+
+	mvwprintw(menuwin, 0, 0, menu);
+}
+
+#ifdef CONFIG_SHOW_DATE_TIME
+static void print_time_and_date(void)
+{
+	struct tm tm;
+
+	while (nvram_updating())
+		mdelay(10);
+
+	rtc_read_clock(&tm);
+
+	mvwprintw(menuwin, 0, 57, "%02d/%02d/%04d - %02d:%02d:%02d",
+		  tm.tm_mon, tm.tm_mday, 1900 + tm.tm_year, tm.tm_hour,
+		  tm.tm_min, tm.tm_sec);
+}
+#endif
+
+static void print_menu(void)
+{
+	int i, j;
+	char menu[80];
+	char *ptr = menu;
+
+	wmove(menuwin, 1, 0);
+	for (j = 0; j < SCREEN_X; j++)
+		waddch(menuwin, ' ');
+
+	for (i = 0; i < ARRAY_SIZE(categories); i++) {
+		if (categories[i].count == 0)
+			continue;
+
+		ptr += sprintf(ptr, "F%d: %s ", i + 1, categories[i].name);
+	}
+
+	mvwprintw(menuwin, 1, 0, menu);
+
+#ifdef CONFIG_SHOW_DATE_TIME
+	print_time_and_date();
+#endif
+}
+
+static void center(int row, const char *str)
+{
+	int j, len = strlen(str);
+
+	wmove(stdscr, row, 0);
+	for (j = 0; j < SCREEN_X; j++)
+		waddch(stdscr, ' ');
+
+	mvprintw(row, (SCREEN_X - len) / 2, str);
+}
+
+/* FIXME: Currently unused. */
+#if 0
+static void header(int row, const char *str)
+{
+	char buf[SCREEN_X];
+	char *ptr = buf;
+	int i;
+	int len = strlen(str) + 4;
+
+	for (i = 0; i < (SCREEN_X - len) / 2; i++)
+		ptr += sprintf(ptr, "=");
+
+	ptr += sprintf(ptr, "[ %s ]", str);
+
+	for (i = ((SCREEN_X - len) / 2) + len; i < SCREEN_X; i++)
+		ptr += sprintf(ptr, "=");
+
+	mvprintw(row, 0, buf);
+}
+#endif
+
+static void redraw_module(struct coreinfo_cat *cat)
+{
+	if (cat->count == 0)
+		return;
+
+	wclear(modwin);
+	cat->modules[cat->cur]->redraw(modwin);
+	wrefresh(modwin);
+}
+
+static void handle_category_key(struct coreinfo_cat *cat, int key)
+{
+	if (key >= 'a' && key <= 'z') {
+		int index = key - 'a';
+		if (index < cat->count) {
+			cat->cur = index;
+			redraw_module(cat);
+			return;
+		}
+	}
+
+	if (cat->count && cat->modules[cat->cur]->handle) {
+		if (cat->modules[cat->cur]->handle(key))
+			redraw_module(cat);
+	}
+}
+
+static void loop(void)
+{
+	int key;
+
+	center(0, CONFIG_PAYLOAD_INFO_NAME " " CONFIG_PAYLOAD_INFO_VERSION);
+	refresh();
+
+	print_menu();
+	print_submenu(&categories[curwin]);
+	redraw_module(&categories[curwin]);
+
+	halfdelay(10);
+
+	while (1) {
+#ifdef CONFIG_SHOW_DATE_TIME
+		print_time_and_date();
+		wrefresh(menuwin);
+#endif
+
+		key = getch();
+
+		if (key == ERR)
+			continue;
+
+		if (key >= KEY_F(1) && key <= KEY_F(9)) {
+			unsigned char ch = key - KEY_F(1);
+
+			if (ch <= ARRAY_SIZE(categories)) {
+				if (ch == ARRAY_SIZE(categories))
+					continue;
+				if (categories[ch].count == 0)
+					continue;
+
+				curwin = ch;
+				print_submenu(&categories[curwin]);
+				redraw_module(&categories[curwin]);
+				continue;
+			}
+		}
+
+		if (key == KEY_ESC)
+			return;
+
+		handle_category_key(&categories[curwin], key);
+	}
+}
+
+int main(void)
+{
+	int i, j;
+
+	initscr();
+
+	init_pair(1, COLOR_WHITE, COLOR_GREEN);
+	init_pair(2, COLOR_BLACK, COLOR_WHITE);
+	init_pair(3, COLOR_WHITE, COLOR_WHITE);
+
+	modwin = newwin(SCREEN_Y - 3, SCREEN_X, 1, 0);
+	menuwin = newwin(2, SCREEN_X, SCREEN_Y - 2, 0);
+
+	wattrset(stdscr, COLOR_PAIR(1) | A_BOLD);
+	wattrset(modwin, COLOR_PAIR(2));
+	wattrset(menuwin, COLOR_PAIR(1) | A_BOLD);
+
+	werase(modwin);
+
+	for (i = 0; i < ARRAY_SIZE(categories); i++) {
+		for (j = 0; j < categories[i].count; j++)
+			categories[i].modules[j]->init();
+	}
+
+	loop();
+
+	return 0;
+}
+
+PAYLOAD_INFO(name, CONFIG_PAYLOAD_INFO_NAME);
+PAYLOAD_INFO(listname, CONFIG_PAYLOAD_INFO_LISTNAME);
+PAYLOAD_INFO(desc, CONFIG_PAYLOAD_INFO_DESC);